A Glossary for IWGS (Auto-Generated)
Michael Kohlhase Computer Science, FAU Erlangen-Nürnberg https://kwarc.info/kohlhase July 1, 2021
Preface
This document contains an English glossary for the course Informatische Werkzeuge in den Geistes- und Sozialwissenschaften at FAU Erlangen-Nürnberg (IWGS). It is automatically generated from the sources of the IWGS course notes and should be up-to-date with the course progress. The glossary contains definitions for all technical terms used in the course, both theones defined in the course, as well as the ones presupposed. The latter should be relatively few,since IWGS is intended as a beginner’s course.
1 1 Glossary for IWGS
Given a description logic D, a D-ontology consists of D-ontology–a terminology (or TBox): concepts and roles and a set of concept axioms that describe them, and – assertions (or ABox): a set of individuals and statements about concept membership and role relationships for them.
To make the role of arguments extremely clear, we write functions in λ-notation. For f = {(x, E) | x ∈ X}, where E is an expression, we write λx ∈ X.E.
n n-dim Cartesianλ-notation space n-dim Cartesian space: A := {⟨a1, . . . , an⟩ | 1≤i≤n ⇒ ai ∈ A}, call ⟨a1, . . . , an⟩ a vector n-dimensional Cartesian space An n-dimensional Cartesian product A1 × ... × An is called a n-dimensional Cartesian space n n over A (and denoted A ) iff Ai = A for some set A for all i. We call ⟨a1, . . . , an⟩ ∈ A a vector. n-fold Cartesian product Let A := {Ai | 1≤i≤n} be a collection of sets, then the n-fold Cartesian product A1 × ... × An is {⟨a1, . . . , an⟩ | ai ∈ Ai for all 1≤i≤n}, we call ⟨a1, . . . , an⟩ ∈ A1 × ... × An an n-tuple. n is called the dimension of A1 × ... × An. n-fold Cartesian product n-fold Cartesian product: A1 × ... × An := {⟨a1, . . . , an⟩ | ∀ i 1≤i≤n ⇒ ai ∈ Ai}, call ⟨a1, . . . , an⟩ an n-tuple
n-fold composition We write the n-fold composition of the relation R as Rn and define it by R1 := R and Ri + 1 := {S ◦ R | S ∈ Ri}
n-tuple Defined along with n-fold Cartesian product n-tuple Defined along with n-fold Cartesian product
p-closure Let p be a properties and R ⊆ A × B a relation, then we call the smallest (in terms of the ⊆) relation R′ ⊇ R that has property p the p-closure of R.
p-closure Let p be one of the properties above and R be a relation, then we call the smallest relation ⊇ R′R (in terms of the ⊆) that has property p the p-closure of R. ABox Defined along with terminology ABox Defined along with ontology ABox Defined along with D-ontology ADT See abstract data type AI See Artificial Intelligence AI Defined along with Artificial Intelligence AI See Artificial Intelligence
AJAX JSON is for JavaScript as (nested) dictionaries are for python. – The browser can directly read JSON and use it via JavaScript. – AJAX =b JavaScript can query the backend for JSON data to update parts of the DOM; .(lightweight interaction)
2 AJAX See Ajax
ALU Defined along with central processing unit API See application programming interface
Ajax Ajax, (also AJAX; short for “Asynchronous JavaScript and XML”) is a set of client-side techniques for creating asynchronous web applications.
American Standard Code for Information Interchange The American Standard Code for Information Interchange( ASCII) is a character code that assigns characters to numbers 0-127
Code ···0 ···1 ···2 ···3 ···4 ···5 ···6 ···7 ···8 ···9 ···A ···B ···C ···D ···E ···F 0··· NUL SOH STX ETX EOT ENQ ACK BEL BS HT LF VT FF CR SO SI 1··· DLE DC1 DC2 DC3 DC4 NAK SYN ETB CAN EM SUB ESC FS GS RS US 2··· !"#$%&’()*+,-./ 3··· 0123456789:;<=>? 4··· @ABCDEFGHIJKLMNO 5··· PQRSTUVWXYZ[\]^_ 6··· ‘abcdefghijklmno 7··· p q r s t u v w x y z { | } ~ DEL
Anti-Counterfeiting Trade Agreement The Anti-Counterfeiting Trade Agreement (ACTA) is a multinational treaty on interna- tional standards for intellectual property rights enforcement.
Artificial Intelligence Artificial Intelligence(AI) is intelligence exhibited by machines
Artificial Intelligence Artificial Intelligence(AI) is a sub-field of Computer Science that is concerned with the automation of intelligent behavior.
Artificial Intelligence Artificial Intelligence(AI) studies how we can make the computer do things that humans can still do better at the moment.
Berne convention The Berne convention process is a series of international treaties that try to harmonize internationalIP laws. It started with the original Berne convention 1886 and went through revision in 1896, 1908, 1914, 1928, 1948, 1967, 1971, and 1979. Boolean Defined along with integer
CC provision The CC licenses stipulate that (cf. http://www.creativecommons.org)
– Creators retain the copyright on their works. – Creators license their works to the world with under the CC provisions: +/- attribuition(must reference the author) +/- commercial use(can be restricted) +/- derivative works(can allow modification) +/- share alike(copyleft)(modifications must be donated back)
CIDOC CRM CIDOC CRM provides an extensible ontology for concepts and information in cultural heritage and museum documentation. It is the international standard (ISO 21127:2014) for the controlled exchange of cultural heritage information. The central classes include – space-time specified by title/identifier, place, era/period, time-span, and relationship to persistent items – events specified by title/identifier, beginning/ending of existence, participants (people, either individually or in groups), creation/modification of things (physical or concep- tional), and relationship to persistent items
3 – material things specified by title/identifier, place, the information object the material thing carries, part-of relationships, and relationship to persistent items – immaterial things specified by title/identifier, information objects (propositional or symbolic), conceptional things, and part-of relationships CLI See command-line interface CMS See content management system CPU See central processing unit CS See computer science CWA See closed world assumption
Cartesian product The Cartesian product of an arbitrary (possibly infinite) indexed family of sets is defined Q S as i∈I Xi := {f : I → i∈I Xi | f(i) ∈ Xi}.
Cartesian product Cartesian product: A × B := {(a, b) | a ∈ A ∧ b ∈ B}, call (a, b) pair.
Cascading Style Sheets The Cascading Style Sheets(CSS), is a style sheet language that allows authors and users to attach style (e.g., fonts, colors, and spacing) to HTML and XML documents. Content MathML Defined along with Mathematics Markup Language
Creative Commons license The Creative Commons licenses are – a common legal vocabulary for sharing content – to create a kind of “public domain” using licensing – presented in three layers (human/lawyer/machine)-readable
DAG We will sometimes use the abbreviation DAG for “directed acyclic graph”. DAG Defined along with cyclic DBMS See database management system DDL See data definition language DELETE Defined along with method DOM See document object model DTM Defined along with nondeterministic Turing machine DUPLICATE Defined along with issue number ERD See entity relationship diagram
EU directive A EU directive is a legal act of the European Union which requires member states to achieve a particular result without dictating the means of achieving that result.
EU regulation A EU regulation is a legal act of the European Union that becomes immediately enforceable as law in all member states simultaneously.
Erlangen CRM/OWL Erlangen CRM/OWL implements CIDOC CRM in OWL Extensible Markup Language See XML
FAIR Research data should be FAIR:
4 – Findable: easy to identify and find for both humans and computers, e.g. with metadata that facilitate searching for specific datasets, – Accessible: stored for long term so that they can easily be accessed and/or downloaded with well-defined access conditions, whether at the level of metadata, or at thelevelof the actual data, – Interoperable: ready to be combined with other datasets by humans or computers, without ambiguities in the meanings of terms and values, – Reusable: ready to be used for future research and to be further processed using com- putational methods. Consensus in the research data community; for details see [FAIR; WilDumAal:FAIR16].
FIXED Defined along with issue number FLOSS See Free/Libre/Open-Source Software
Free/Libre/Open-Source Software Free/Libre/Open-Source Software(FLOSS or just open source) is software that is and licensed via licenses that ensure that its source code is available. GDPR See General Data Protection Regulation
GET Defined along with method GFM See GitHub flavored markdown
GIT flow [gitflow:url] suggests GIT flow, which includes: – A main branch called main that all other branches merge into. – New functionality is developed “feature-by-feature” on feature branches. – A development branch (usually called devel) that integrates all feature branches and is merged into master once the integrated functionality is stable. – (possibly) release branches for every release; they collect bugfixes, but no new features.
GND But there are some sources that are useful – the GND(Gemeinsame Normdatei[ GND:on]), an authority file for personal/corporate names and keywords from literary catalogs, – geonames[ geonames:on], a geographical database with more than 25M names and locations – Wikipedia Gemeinsame Normdatei See GND
General Data Protection Regulation The General Data Protection Regulation(GDPR) is a EU regulation created in 2016 to harmonize information privacy regulations within Europe. The GDPR applies to data controllers, i.e organizations that process personal data of EU citizens (the data subjects). It sanctions violations to GDPR mandates with substantial punishments – up to 20Me or 4% of annual worldwide turnover.
General Public License The General Public License (GPL) is a copyleft license for FLOSS software originally writ- ten by Richard Stallman in 1989. It requires that the source code of GPL-licensed software be made available.
5 GitHub flavored markdown GitHub flavored markdown(GFM) is a markdown dialect extended for the use in GIT-based issue tracking systems; see [GFM:on] for the specification.
Gregorian calendar The Gregorian calendar is a solar calendar that takes the birth of Christ is taken as the year 1 and has a complicated rule for leap years: Every year that is exactly divisible by four is a leap year, except for years that are exactly divisible by 100; the centurial years that are exactly divisible by 400 are still leap years. HTML See HyperText Markup Labnguage
HTML5 See HyperText Markup Language HTTP See Hypertext Transfer Protocol
HTTP basic authentication HTTP basic authentication introduces a HTTP header Authorization for base64-encoded pairs ⟨⟨username⟩⟩:⟨⟨password⟩⟩ and a couple of challenge/response messages.
HTTP request Defined along with user agent HTTPS See Hypertext Transfer Protocol Secure
HyperText Markup Labnguage The HyperText Markup Labnguage(HTML), is a representation format for web pages[ W3C:html5].
HyperText Markup Language The HyperText Markup Language(HTML5), is believed to be the next generation of HTML. It is defined by the W3C and the WhatWG.
Hypertext Transfer Protocol The Hypertext Transfer Protocol(HTTP) is an application layer protocol for distributed, collaborative, hypermedia information systems.
Hypertext Transfer Protocol Secure Hypertext Transfer Protocol Secure(HTTPS) is an extension of the Hypertext Transfer Protocol(HTTP) for secure communication over a computer network. HTTPS achieves this by running HTTP over a TLS connection.
6 IANA See Internet Assigned Numbers Authority
ICH Defined along with cultural heritage IDE See integrated development environment INVALID Defined along with issue number
IP See Internet Protocol
IP address An IP address is a numerical label that is assigned to devices participating in a computer network, that uses the Internet Protocol for communication between its nodes. IPv4 See Internet Protocol Version 4 IPv4 address Defined along with Internet Protocol Version 4
IPv6 See Internet Protocol Version 6 IPv6 address Defined along with Internet Protocol Version 6 IRI See internationalized resource identifier
ISO-Latin 16 Extensions of ASCII to 8-bit (256 characters) ISO-Latin1 =b “Western European”, ISO-Latin 6 =b “Arabic”,ISO-Latin 7 =b “Greek”. . .
International System of Units The International System of Units(SI) is the modern form of the metric system and is gen- erally a system of units of measurement devised around seven base units and corresponding dimensions.
Internet The Internet is a worldwide computer network that connects hundreds of thousands of smaller networks. (The mother of all networks)
Internet Assigned Numbers Authority The global IP address space allocations are managed by the Internet Assigned Numbers Authority(IANA), delegating allocate IP address blocks to five Regional Internet Registries (RIRs) and further to Internet service providers (ISPs).
Internet Protocol The Internet Protocol(IP) is a protocol used for communicating data across a packet- switched internetwork. The Internet Protocol defines addressing methods and structures for datagram encapsulation. The Internet Protocol also routes data packets between networks
Internet Protocol Version 4 The Internet mainly uses Internet Protocol Version 4(IPv4)[ RFC760], which uses 32-bit numbers (IPv4 address es) for identification of network interfaces of Computers.
Internet Protocol Suite The Internet Protocol Suite (commonly known as TCP/IP) is the set of communications protocols used for the Internet and other similar networks. It structured into 4 layers.
Internet Protocol Version 6 Internet Protocol Version 6(IPv6)[ DeeHin:RFC2460], which uses 128-bit numbers (IPv6 address es) for identification. Isa-Hierarchy See terminology
JQuery JQuery is a feature-rich JavaScript library that simplifies tasks like HTML document traver- sal and manipulation, event handling, animation, and Ajax.
JSON JSON(JavaScript Object Notation is an open standard file format, for interchange of struc- tured data. JSON uses human-readable text to store and transmit data objects consisting of attribute–value pairs and sequences.
7 JavaScript JavaScript is an object-oriented scripting language mostly used to enable programmatic acce ss to the DOM in a web browser. JavaScript Object Notation See JSON
Kleene closure The operation of passing from an alphabet A to A∗ is called Kleene closure, Kleene opera- tion, or Kleene star. The operation ·+ is called Kleene plus. Kleene operation See Kleene closure Kleene plus See Kleene closure Kleene star See Kleene closure
Kronecker delta The Kronecker delta is a function of two integers. The function is 1 if the variables are equal, and 0 otherwise: 1 (i = j) δ := if i j 0 else
LOD See linked open data
Landau set The three Landau sets O(g), Ω(g), Θ(g) are defined as
– O(g) = {f | ∃ k>0 f ≤a k · g}
– Ω(g) = {f | ∃ k>0 f ≤a k · g} – Θ(g) = O(g) ∩ Ω(g)
Landau set Let g : N → N, then we define the three Landau sets O(g),Ω(g),Θ(g) as
– O(g) := {g : N → N | ∃ k>0 f ≤a k · g} – Ω(g) := {g : N → N | ∃ k>0 f ≥a k · g} – Θ(g) := O(g) ∩ Ω(g)
If G ∈ {O(g), Ω(g), Θ(g)}, we often say that f : N → N is (of complexity) G, iff f ∈ G, accordingly we often write f = G by a certain abuse of notation. Given a particular function, e.g. g : N → N; n 7→ n3, we often write O(g) as O(n3), and analogously for Ω(g) and Θ(g).
Let’s Encrypt Let’s Encrypt is a not-for-profit certificate authority that does this and issues free TLS certificates. (to encourage HTTPS adoption) MAC address See media access control address
MathTalk Abbreviations for Mathematical statements in MathTalk – ∧ and ∨ are common notations for and and or – not is in mathematical statements often denoted with ¬ – ∀ x P (∀ x ∈ S P ) stands for condition P holds for all x (in S) – ∃ x P (∃ x ∈ S P ) stands for there exists an x (in S) such that proposition P holds – ̸∃ x P (̸∃ x ∈ S P ) stands for there exists no x (in S) such that proposition P holds – ∃1 x P (∃1 x ∈ S P ) stands for there exists one and only one x (in S) such that proposition P holds – iff as abbreviation for if and only if, symbolized by ⇔ – the symbol ⇒ is used a as shortcut for implies
8 Mathematics Markup Language The Mathematics Markup Language (MathML) is an integrated framework for content and presentation in web-based mathematics. Presentation MathML covers the basic font, box, grouping primitives for presenting the two-dimensional layout of mathematical formulae Content MathML provides the an infrastructure for marking up the functional/logical struc- ture of formulae as applications, variables, constants, and binding expressions.
Matrix addition Matrix addition is defined pointwise: Given two n×m matrices A := [ai,j]1≤i≤n,1≤j≤m and B := [bi,j]1≤i≤n,1≤j≤m, the matrix sum A + B is defined as [ai,j + bi,j]1≤i≤n,1≤j≤m.
Model A first-order Model M = ⟨Dι, I⟩ consists of a universe Dι and an interpretation I. NIC See network interface controller NTM See nondeterministic Turing machine
NoSQL Defined along with mongoDB ODF Defined along with Office Open XML OOP See object-oriented programming OOXML See Office Open XML
OS See operating system OWA Defined along with closed world assumption
Office Open XML Popular word processors include – MS Word, an elaborated word processor for Windows, whose native format is Office Open XML(OOXML; file extension .docx). – OpenOffice and LibreOffice are similar word processors using the ODF format (Open Office Format; file extension .odf) natively, but can also import other formats.. – Pages, a word processors for Mac OS X it uses a proprietary format. – Office Online and GoogleDocs are browser-based real-time collaborative word pro- cessors.
Open Data Commons Defined along with open Open Office Format Defined along with Office Open XML PDF See Protable document format
PERL CGI perl is a scripting language with good string manipulation facilities. PERL CGI is an early server-side scripting framework based on this. PGS work Defined along with copyrightable work
PHP PHP (originally “Programmable Home Page Tools”, later “PHP: Hypertext Processor”) is a server-side scripting language with a C-like syntax. PHP code is embedded into HTML via special “tags”
PII See personally identifiable information POST Defined along with method PUT Defined along with method
9 Peano axioms The following set of axioms are called the Peano axioms(Giuseppe Peano ∗1858, †1932) Presentation MathML Defined along with Mathematics Markup Language
Proposition Propositions: A ∈ wff o(Σ) (denote truth values: type o)
p i 1 k – if p ∈ Σk and A ∈ wff ι(Σι) for i≤k, then p(A ,..., A ) ∈ wff o(Σ),
– if A, B ∈ wff o(Σ) and X ∈ Vι, then T , A ∧ B, ¬ A, ∀X A ∈ wff o(Σ).
Protable document format Protable document format(PDF) is a document format that mixes text and graphics with a variety of content including logical structuring elements, interactive elements such as anno- tations and form-fields, layers, rich media (including video content), and three-dimensional objects using U3D or PRC, and various other data formats. The PDF specification also provides for encryption and digital signatures, file attachments, and metadata to enable workflows requiring these features. RCS See revision control system RDBMS See relational database management system RDF graph Defined along with statement RDF store See triplestore REPL See read–eval–print loop
RGB Colors are usually represented in RGB format, i.e. as triples ⟨R, G, B⟩ with three channels (also called bands).
RTFM RTFM( =b “read those fine manuals”)
RTFM RTFM( =b “read the fine manuals”) RWD See responsive web design
Resource Description Framework The Resource Description Framework( RDF) is a framework for describing resources on the web. It is an XML vocabulary developed by the W3C. SI See International System of Units
SQL SQL, the structured query language is a domain-specific language for managing data held in a RDBMS. SQL instructions are directly executed by the RDBMS to change the database state or compute answers to SQL queries.
SQL injection attack We call this an SQL injection attack. SQL-sanitizes Defined along with parameter substitution
SQLite shell this opens a command line interpreter: the SQLite shell.(all DBs have one) test it with .help that tells you about more “dot commands”. SVG See Scalable Vector Graphics
Scalable Vector Graphics Scalable Vector Graphics(SVG) is an XML-based markup format for vector graphics.
Simple Mail Transfer Protocol The Simple Mail Transfer Protocol(SMTP) is a communication protocol for electronic mail transmission based on telnet. Skolem constant Defined along with first-order signature
10 Sobel filter Given a 3 × 3 matrix M, the Sobel filter computes a new pixel value by getting the pixel value of each neighbor in 3x3 window, multiply with the components in M and adding everything up. TBox See terminology TBox Defined along with ontology
TBox An TBox is a finite set of concept definitions and concept axioms. It iscalled acyclic, iff it does not contain recursive definitions. TBox Defined along with D-ontology TCP/IP See Internet Protocol Suite TLS See Transport Layer Security
Transmission Control Protocol The internet protocol mainly uses suite the Transmission Control Protocol( TCP) and User Datagram Protocol( UDP) protocols at the transport layer.
Transport Layer Security Transport Layer Security(TLS) is a cryptographic protocol designed to provide privacy – by symmetric cryptography – and authentication – by public key cryptography – over a computer network.
Turing complete An information processing system is said to be Turing complete or computationally uni- versal if it can be used to simulate any Turing machine.
Turing machine A Turing machine consists of
– An tape with infinitely many cells, each of which contains a symbol from a finite al- phabet A with #(A)≥2. – A head that can read/write symbols on the tape and move left/right. – A state register that stores the state of the Turing machine. The set of states is finite, the state register is initialized with a special start state. – An action table (or program ]) that – given the symbol it has just read from the tape and the state it is currently in – specifies the next action, i.e. what symbol to write, how to move the head and the next state. If no entry applicable the machine halts. Turing-acceptable See recursively enumerable
Turing-recognizable See recursively enumerable UCS See universal character set UI See user interface UNA Defined along with closed world assumption
URI See uniform resource identifier URI decoding Defined along with URI encoding
URI encoding URI encoding maps non-ASCII characters to a ASCII strings: 1. map character to its UTF-8 representation 2. represent each byte of the UTF-8 representation by three characters. 3. The first character is the percent sign (%),
11 4. and the other two characters are the hexadecimal representation of the byte.
URI decoding is the dual operation.
URL A uniform resource locator(URL) is a URI that that gives access to a web resource, by specifying an access method or location. All other URIs are called uniform resource names (URN). URL See uniform resource locator
URN Defined along with uniform resource locator
UTF-8 The UTF-8 encoding encodes each character in one to four octets (8-bit bytes): 1. One byte is needed to encode the 128 US-ASCII characters (Unicode range U+ 0000 to U+ 007F ). 2. Two bytes are needed for Latin letters with diacritics and for characters from Greek, Cyrillic, Armenian, Hebrew, Arabic, Syriac and Thaana alphabets (Unicode range U+ 0080 to U+ 07FF ). 3. Three bytes are needed for the rest of the Basic Multilingual Plane (which contains virtually all characters in common use). 4. Four bytes are needed for characters in the other planes of Unicode, which are rarely used in practice.
Universe We fix the Universe Do = {T, F} of truth values. User Datagram Protocol Defined along with Transmission Control Protocol WCMS Defined along with content management system WFH See work made for hire
WONTFIX Defined along with issue number WORKSFORME Defined along with issue number WWW See World Wide Web
WWWeb See World Wide Web
WissKI WissKI is a virtual research environment (VRE) for managing scholarly data and docu- menting cultural heritage.
WissKI commons We call the part of this resource that can be created by aggregating WissKI exports the WissKI commons.
World Wide Web The World Wide Web(WWW or WWWeb) is an open source information space where documents and other web resources are identified by URLs, interlinked by hypertext links, and can be accessed via the Internet.
XHTML XHTML is the XML version of HTML.(just make it valid XML)
XML XML (short for Extensible Markup Language) is a framework for markup formats for electronic documents and structured data.
XML document tree The XML document tree is made up of element nodes, attribute nodes, text nodes(and namespace declarations, comments,. . .)
12 XML literal We call any string that is well-formed XML an XML literal.
XML namespace An XML namespace is a string that identifies an XML vocabulary. Every element and attribute name in XML consists of a local name and a namespace.
XML path language The XML path language(XPath) is a language framework for specifying fragments of XML trees. XPath See XML path language
absolute URI To distinguish them from relative URIs, we call URIs absolute URIs. r if r≥0 absolute value The absolute value |r| of an integer r is defined as . − (r) else
a |a| absolute value The absolute value |r| of an rational number b is defined as |b| .
absolute value Real absolute value, addition, subtraction, multiplication, division, and exponentiation, square roots, r-th roots, and the ordering relations are extended to the real numbers, so that they respect limits. r if r≥0 absolute value The absolute value |r| of a number r is defined as . −(r) else
abstract data type An abstract data type(ADT) is a mathematical model for a data types, which specifies a container by its behavior from the point of view of a user of the data, specifically in terms of possible value, possible operations on data of this type, and the behavior of these operations. accept Defined along with report
accepted unit Some units that have important contemporary application worldwide, or are otherwise commonly encountered worldwide and can be expressed as scalar multiples of derived units. They have been given the status of accepted units in theSI system. accepting Defined along with current cell accepting state Defined along with nondeterministic Turing machine
accepts A Turing machine M acceptsa word w (in n steps), if it halts (after n steps) with an accepting configuration on a tape that encodes W , and it rejects w otherwise. M accepts a formal language L (in n steps), iff it accepts all words w ∈ L (in n steps). If M is total, then we say that decides L (in n steps).
access control Access control is the selective restriction of access to a resource, access management de- scribes the corresponding process. access management Defined along with access control
accessible Defined along with FAIR action Defined along with Turing machine action table Defined along with Turing machine
acyclic Defined along with TBox acyclic Defined along with cyclic
13 acyclic Defined along with cyclic
adapter WissKI provides special modules called adapters for GND and geonames. add Defined along with local added Defined along with hunk
addition Addition is extended to the integers by defining the sum as |a| + |b| if a, b ∈ N ( − (|a| + |b|) a, b ∈ − a + b := if Z |a| + ( − ( |b| )) if (a≥b) |b| + ( − ( |a| )) if (a
a c a·d + b·c addition We define addition on the rational numbers: the sum b + d is b·d . addition Defined along with absolute value
addition Addition + computes the sum of a + b of natural numbers a and b. It defined by the equations x + 0 = x and x + s(y) = s(x + y), where s is the successor function.
addition Addition + computes the sum of a + b of numbers a and b.
addition operation We “define” the addition operation ⊕ procedurally (by an algorithm) – adding zero to a number does not change it. written as an equation: n ⊕ o = n – adding m to the successor of n yields the successor of m ⊕ n. written as an equation: m ⊕ s(n) = s(m ⊕ n) admits weakening Defined along with derivation relation
algorithm An algorithm is a formal or informal specification for solving a problem by executing afinite sequence of instructions (concrete or imaginary/abstract) information processing systems.
alpha We introduce a fourth channel: A (for alpha). Alpha is the opacity (inverse of transparency). A pixel is now ⟨R, G, B, A⟩. alphabet Defined along with formal language
alphabet An alphabet A is a finite set; we call each element a ∈ A a character, and an n-tuple of n s ∈ A a word (or string) of over A. We will often write a string ⟨c1, . . . , cn⟩ as "c1 . . . cn" 0 or even as c1 . . . cn. We write the empty word(empty string) in A with ϵ. alphabet Defined along with nondeterministic Turing machine amount Defined along with length
ancestor The ancestor and descendant relations are the transitive closures of the parent and child relations respectively.
anonymized Error: The defi does not appear to be inside a definition environment. line23:18 anonymous function python also allows to make anonymous functions via the lambda constructor for function objects:
14 lambda (p1,...,pn): ⟨⟨expr⟩⟩
anti-aliasing On the edges of ?ex.rasterization?, we see pixels whose barycenter is outside the triangle but that are colored in a very light variant of the adjoining pixels. This technique is called anti-aliasing and is used to make the jagged lines created by rasterization less noticeable to the human eye. anti-reflexive Defined along with reflexive antisymmetric Defined along with symmetric antisymmetric Defined along with reflexive app Defined along with application software application Defined along with application software application Defined along with partial function application Defined along with expression language
application layer The application layer of the internet protocol suite contains all protocols and methods that fall into the realm of process-to-process communications via an Internet Protocol (IP) net- work using the Transport Layer protocols to establish underlying host-to-host connections.
application ontology A WissKI application ontology is one that extends CIDOC CRM, without changing it. application operator Defined along with applicative structure application programming interface An application programming interface(API) is an interface that defines interactions be- tween multiple software intermediaries. It defines the kinds of calls or requests that canbe made, how to make them, the data formats that should be used, the conventions to follow, etc.
application software Application software is a program or group of programs (individually called an application or app) designed for end users.
applicative structure Let U be a set, and let @: U × U ⇀ U and Λ: U → U ⇀ U partial functions, such that ((aΛb)@a) = b, then we call A := ⟨U, @, Λ⟩ an applicative structure. U is called the universe, @ the application operator, and Λ the binding operator of A. arbitrary Defined along with variable arc Defined along with graph archaic Defined along with periodization architectural work Defined along with copyrightable work area Defined along with image map argument Defined along with subroutine argument Defined along with partial function argument Defined along with expression language arithmetic/logic unit Defined along with central processing unit
arity A python function is defined by a code snippet of the form
15 def f (p1,...,pn): """docstring, what does this function do on parameters :param pi: document arguments} """ ⟨⟨body⟩⟩ # it can contain p1, . . . , pn, and even f return ⟨⟨value⟩⟩ # value of the function call (e.g text or number) ⟨⟨more code⟩⟩
– the indented part is called the body of f,( : whitespace matters in python)
– the pi are called parameters, and n the arity of f.
A function f can be called on arguments a1, . . . , an by writing the expression f(a1, ..., an). This executes the body of f where the (formal) parameters pi are replaced by the arguments ai. arity Defined along with subroutine
assertion We define the assertions for ALC – a: φ (a is a φ) – a R b (a stands in relation R to b) assertions make up the ABox in ALC. assertion Defined along with D-ontology assertions Defined along with terminology
assertions Defined along with ontology assign Defined along with variable assignment assign Defined along with report
assignee Defined along with issue number associative array See dictionary asymmetric Defined along with symmetric asymmetric Defined along with reflexive asymmetric-key cryptosystem In an asymmetric-key cryptosystem, the key needed to encrypt a message is different from the key for decryption. Such a method is called a public-key cryptosystem if the decryption key (the private key) is very difficult to reconstruct from encryption key (called the public key). We speak of a (cryptographic) key pair. asymptotically bounded Let f, g : N → N, we say that f is asymptotically bounded by g, written as f ≤a g, iff there is an n0 ∈ N, such that f(n)≤g(n) for all n>n0. asymptotically bounded Let f, g : N → N, we say that f is asymptotically bounded by g (write f ≤a g), iff there is an n0 ∈ N, such that f(n)≤g(n) for all n>n0.
asynchronous A process p is called asynchronous, iff the parent process (i.e. the one that spawned p) continues processing without waiting for p to terminate. atom See atomic
16 atomic Propositional formulae without connectives are called atomic (or an atoms) and complex otherwise.
atomic formula Call formulae without connectives or quantifiers atomic else complex. attachment Defined along with issue atto Defined along with prefixes
attribuition Defined along with CC provision attribute Defined along with opening tag attribute Defined along with relational database management system attribute Defined along with entity relationship diagram
attribute Defined along with object-oriented programming attribute node Defined along with XML document tree audiovisual work Defined along with copyrightable work aural markup Defined along with visual markup
authentication Authentication is the process of ascertaining that somebody really is who they claim to be.
authentication Authentication is the process of ascertaining that somebody really is who they claim to be. authentication factor Authentication can be performed by assertaining an authentication factor, i.e. testing for something the user – knows, e.g. a password or answer to a security question – kwowledge factor – has, e.g. an ID card, key, implanted device, software token, – ownership factor – is or does, e.g. a fingerprint, retinal pattern, DNA sequence, or voice – inheritance factor. authority Defined along with uniform resource identifier authorization Defined along with permission level
authorization Authorization refers to a set of rules that determine who is allowed to do what.
auxiliary storage See secondary storage
availability control Availability control: Personal data have to be protected against loss and accidental destruction. ( physical/building safety, backups) ; axiom Defined along with ontology
axiom An axiom (or postulate) is a statement about mathematical objects that we assume to be true.
back end Defined along with front end band Defined along with RGB bare See headless
base Defined along with positional number system
17 base Defined along with positional number system base Defined along with exponentiation base Defined along with exponentiation base Defined along with positional number system base Defined along with exponentiation base Defined along with exponentiation base Defined along with logarithm
base equation Error: The defi does not appear to be inside a definition environment. line75:3 base name Defined along with file system base set Defined along with vector space
base set We call a structure ⟨S, ≤⟩ of a set S (the base set) equipped with a preorder r an preordered set or proset. base unit Defined along with International System of Units
base64 base64 is a group of binary-to-text encoding schemes that represent binary data in an ASCII string format by translating it into a radix-64 representation. Each Base64 digit represents exactly 6 bits of data. basic multilingual plane Most (non-Chinese) characters have code points in [1, 65536] (the basic multilingual plane). begin tag Defined along with tag biimplication Defined along with formulae bijection Defined along with bijective bijective Defined along with injective
bijective A function f : S → T is called bijective (or a bijection or a one-to-one correspondence), iff f is injective and surjective. binary Defined along with source binary Defined along with unary
binary A code is a called binary iff B = {0, 1}. binary file Defined along with text file
binary unit prefix The following binary unit prefix es are used for units of information because they are similar to the SI unit prefixes.
prefix symbol 2n decimal ~SI prefix Symbol kibi Ki 210 1024 kilo k mebi Mi 220 1048576 mega M gibi Gi 230 1.074 × 109 giga G tebi Ti 240 1.1 × 1012 tera T pebi Pi 250 1.125 × 1015 peta P exbi Ei 260 1.153 × 1018 exa E zebi Zi 270 1.181 × 1021 zetta Z yobi Yi 280 1.209 × 1024 yotta Y
18 binding Defined along with expression language binding operator Defined along with applicative structure
bit A bit (a contraction of “binary digit”) is the basic unit of capacity of a data storage device or communication channel. The capacity of a system which can exist in only two states, is one bit (written as 1 b) blank symbol Defined along with nondeterministic Turing machine
blended learning Blended learning is an approach to education that combines online educational materials and opportunities for interaction online with traditional place-based classroom methods.
block Drupal allows to configure web pages modularly from content blocks, which can be – static content, i.e. supplied by a module, – user-supplied content, or – views, i.e. listings of content fragments from other blocks. These can be assembled into web pages via a visual interface: the config bar.
body Defined along with loop body Defined along with function definition body Defined along with subroutine border Defined along with width
bottle WSGI Bottle WSGI supplies the template engine stpl (Simple Template Engine).(documentation at [stpl:on]) bottom concept Defined along with top concept bound Defined along with bound variable occurrence
bound An occurrence of a variable v is called bound in an expression E, iff it is in a variable binding that binds v. Variables that are not bound in an expression E are called free in E.
We often write an expression E in which variables x1, . . . , xn occur freely, as E[x1, . . . , xn]. bound variable occurrence We call an occurrence of a variable X bound in a formula A, iff it occurs in a sub-formula ∀X B of A. We call a variable occurrence free otherwise. For a formula A, we will use BVar(A) (and free(A)) for the set of bound(free) variables of A, i.e. variables that have a free/bound occurrence in A. box Defined along with width
branch A branch is a copy of an object under revision control (such as a source code file or a directory tree) so that it can be developed in parallel. branch Defined along with graph
branch A path in a tree that starts with the root is called a branch. branches Defined along with conditional execution
19 branching factor Defined along with in-degree
browsing Defined along with hypertext bug report See issue bugtracker See issue tracker
bundle Drupal has a special data type called a bundle, which is essentially a dictionary: it contains key/value pairs called fields.
– bundles can be nested sub-bundles. – fields also have data type; information, etc. to support editing.
byte The byte is a derived unit for information capacity: 1 B = 8 b.
calendar A calendar is a system of organizing dates. This is done by giving names to periods of time, typically days, weeks, month and years.A date is the designation of a single, specific day within such a system.
called Defined along with subroutine canonical projection Defined along with equivalence class canonical surjection Defined along with equivalence class
cardinality Defined along with finite
cell Jupyter notebooks consist of cells which come in three forms – a raw cell shows text as is – a markdown cell interprets the contents as markdown text (later more) – a code cell interprets the contents as (e.g. python) code
cell Defined along with Turing machine centi Defined along with prefixes central processing unit A central processing unit(CPU), also called a central processor or main processor, is the electronic circuitry within a computer that carries out the instructions of a program by performing the basic arithmetic, logic, controlling, and input/output (I/O) operations specified by the instructions. A CPU that consists of a – control unit that interprets the program and controls the flow of machine instructions and – a arithmetic/logic unit(ALU) that does the actual computations internally.
central processor See central processing unit
centralized A centralized revision control system features – a single, central repository server(for current revision and reverse diffs) – local working copies(asynchronous checkouts, updates, commits)
20 They are kept synchronized by passing around diffs and patching the repository and working copies. Conflicts are resolved by (three-way) merge. The revision control actions are those of a local RCS plus
– clone: fetch the current revision from repository server and checkout a new working copy. – pull: fetch the pending differences between the revision of the working copy and the revision of the repository server and merges them into the working copy. – push: if the working copy and the repository are based on the same revision, then transmit the differences to the repository server and update the revision there. fetch and push are dual operations. Just as fetch is integrated into the pull, push is usually integrated into commit for centralized RCS. certificate authority Defined along with public key infrastructure
certificate authority In a typical public key infrastructure scheme, the signature will be of a certificate authority, an organization chartered to verify identity and issue public key certificates. channel Defined along with RGB character Defined along with universal character set character Defined along with alphabet
character code Let A and B be alphabets, then we call an injective function c: A → B+ a character code. A string c(w) ∈ {c(a) | a ∈ A} is called a codeword.
character encoding A character encoding is a mapping from bit strings to UCS code points. character name Defined along with code point character properties Defined along with code point
characteristic Defined along with floating point number checkout Defined along with local child Defined along with tree child Defined along with tree
child table Defined along with foreign key choreographic work Defined along with copyrightable work
civil law tradition Legal systems in the civil law tradition are usually based on explicitly codified laws (civil codes).
class A vocabulary often includes names for classes and relationships (also called concepts, and properties).
21 class In object-oriented programming, a class is a program construct for creating objects as well as providing the fields with initial values and the methods with implementations. classical antiquity Defined along with periodization
client A client is a piece of computer hardware or software that accesses a service made available by a server. client-server architecture In the client-server architecture a single overall computation is distributed across multiple processes or computers. A single server can serve multiple clients, and a single client can use multiple servers.A client may run on the same computer or may connect over a network to a server on a different computer. clone Defined along with centralized close Defined along with report
closed Defined along with opened
closed We call a formula A closed or ground, iff free(A) = ∅. We call a closed proposition a sentence, and denote the set of all ground terms with cwff ι(Σι) and the set of sentences with cwff o(Σι).
closed An expression is called closed or ground, iff it does not contain free variables. closed world assumption Database: Ontology: – Closed world assumption – Open world assumption (CWA) (OWA) ∗ Missing information ∗ Missing information treated as false treated as unknown – Unique name assumption – No UNA (UNA) ∗ Individuals may have ∗ Each individual has a sin- more than one name gle, unique name – Ontology axioms behave like – Schema behaves as constraints implications (inference rules) on structure of data ∗ Entail implicit informa- ∗ Define legal database tion states closing tag Defined along with opening tag
cloud IDE See web IDE code See computer code
code A code is a system of rules to convert information – such as a letter, word, sound, image, or gesture – into another form, sometimes shortened or secret, for communication via a communication medium or storage in a storage medium. The process of encoding applies a code for communication or storage, whereas the process of decoding applies it in reverse to restore the original information
22 code block Defined along with template file
code cell Defined along with cell code line Defined along with template file
code point Each UCS character is identified by an unambiguous name and an integer number called its code point.
code point For each character UniCode defines a code point (a number written in hexadecimal as U+ ABCD), a character name, and a set of character properties.
codeword Defined along with character code
coding The implementation of an algorithm in a chosen programming language is called coding. codomain Defined along with domain codomain Defined along with partial function
coefficient Defined along with floating point number coefficient Defined along with scientific notation collection See container column Defined along with relational database management system
column name Defined along with table name
column specification The SQL statement CREATE TABLE$\pmetavar{name}$ ($\pmetavar{coldefs}$) creates a table with name ⟨⟨name⟩⟩. ⟨⟨coldefs⟩⟩ are column specifications that specify the columns: it is a comma-separated list of column names and SQL data types. The totality of all column specifications of all tables in a database is called the database schema.
command Defined along with command-line interface command line Defined along with command-line interface command-line interface A command-line interface(CLI) is a means of interacting with a computer program where the user (or client) issues instructions (called commands in a CLI) to the program in the form of successive lines of text (command line). The program which handles this user interface is called a command-line interpreter or command-line processor. command-line interpreter Defined along with command-line interface command-line processor Defined along with command-line interface commercial use Defined along with CC provision
commit Defined along with local common law tradition Legal systems in the common law tradition are usually based on case law, they are often derived from the British system. common mathematical language Defined along with formulae
communication Communication is the act of conveying information from one group of subjects to another.
23 communication medium A communication medium is a channel or system of communication – the means by which information (the message) is transmitted between a speaker or writer (the sender) and an audience (the receiver). compile Defined along with compiler
compiler A compiler is a program that translates (compiles)code written in one programming lan- guage (the source language) into another language (the target language). complement Defined along with concept complement See set difference complex Defined along with atomic complex formula Defined along with atomic formula
complex numbers The set C of complex numbers contains expressions of the form c = (a + bi), where a, b ∈ R. Re(c) := a is called the real part and Im(c) := b the imaginary part of c; we call i the imaginary unit. complexes Defined along with integer component Defined along with uniform resource identifier component Defined along with mathematical structure
composable We call two relations R ⊆ A × B and S ⊆ C × D composable, iff B = C compose Defined along with composition principle
composition The composition of two relations R ⊆ A × B and S ⊆ B × C is defined as
S ◦ R := {(a, c) ∈ A × C | there is a b ∈ B with (a, b) ∈ R and (b, c) ∈ S}
composition The composition of R ⊆ A × B and S ⊆ B × C is defined as S ◦ R := {(a, c) ∈ A × C | ∃ b ∈ B (a, b) ∈ R ∧ (b, c) ∈ S}
composition principle All programming languages provide composition principles that allow to compose smaller program fragments into larger ones in such a way, that the semantics of the larger is deter- mined by the semantics of the smaller ones and that of the composition principle employed. computation See run computationally universal See Turing complete computer See computing device
computer code We call any well-formed fragments of a program computer code or program code, or just code.
computer monitor A computer monitor (or just monitor)is an output device for visual information. computer programming Computer programming (or just programming) is the process of designing and building a program for accomplishing a specific computing task. It involves sub-processes, such as: analysis, generating algorithms, profiling algorithms’ re- source consumption, proving algorithm properties, coding, and program verification.
computer science Computer science (or shortCS) is the study of algorithms and information processing system in theory and practice. ACS professional is called a computer scientist.
24 computer scientist Defined along with computer science computer-created Defined along with human-organized
computing device A computing device or simply a computer is an physical (usually electrical or electronic) information processing system that can automatically executea sequence of machine instruc- tions i.e. arithmetic or logical operations that change state of the system. A computer consists of physical parts (its hardware) and a set of programs and data, its software.
concatenation The concatenation conc(L1,L2) of two languages L1 and L2 over the same alphabet is defined as conc(L1,L2) := {s1s2 | s1 ∈ L1 ∧ s2 ∈ L2}.
n m concatenation The concatenation conc(s, t) of two strings s=⟨s1, . . . , sn⟩∈A and t=⟨t1, . . . , tm⟩∈A is (n + m) defined as ⟨s1, . . . , sn, t1, . . . , tm⟩ ∈ A . We will often write conc(s, t) as s + t or simply st. concept Defined along with semantic network concept Defined along with ontology concept See class concept Defined along with D-ontology
0 concept Let PLDL be given by the grammar
0 PLDL :== C | ⊤ | ⊥ | L | L ⊓ L | L ⊔ L | L ⊑ L | L ≡ L
0 i.e. PLDL formed from
– concepts( =b propositional variables) – concept intersection( ⊓)(=b conjunction ∧) – concept complement( ·)(=b negation ¬) – concept union( ⊔), subsumption( ⊑), and equality( ≡) defined from these. (=b ∨, ⇒, and ⇔) concept Defined along with ontology concept axiom Defined along with D-ontology
concept axiom A concept axiom is a formula A that is assumed to be true in the world.
concept definition A concept definition is a pair c = C, where c is a new concept name and C ∈ C is a D-formula.
concrete data Concrete data: digital representations of artefacts in terms of simple data, – e.g. images as pixel arrays in JPEG. (see above) – e.g. books identified by author/title/publisher/pubyear. (see above)
condition A condition is a Boolean expressionina control structure. conditional execution Conditional execution allows to execute (or not to execute) certain parts of a program (the branches) depending on a condition. We call a code block that enables conditional execution a conditional statement.
25 conditional statement Defined along with conditional execution
cone Defined along with lens config bar Defined along with block configuration Defined along with current cell configuration transition function Defined along with current cell conflict Defined along with three-way merge conflict marker Defined along with three-way merge
conjecture Error: The defi does not appear to be inside a definition environment. line43:51
conjunction Defined along with formulae connective Defined along with formulae connective Defined along with formulae connective Defined along with first-order signature
constant A constant is a memory location which contains a value that cannot be altered by the program during normal execution. It is referenced by an identifier – the constant name. constant Defined along with expression language constant name Defined along with constant
container A container or collection is a grouping of some variable number (possibly zero) of data items – the elements of the container – that need to be operated upon together in some controlled fashion. content Defined along with width content management system A content management system(CMS) is a software application that can be used to manage the creation and modification of digital content by users with little knowledge of program- ming languages or markup languages. A web content management system(WCMS) is a content management system for web con- tent. Web content management consists of website authoring, collaboration, and adminis- tration.
control flow The control flow of a program is the sequence of execution of the program instructions. It is specified via special program instructions called control structures. control structure Defined along with control flow
control unit Defined along with central processing unit control word Defined along with document markup conversation Defined along with issue
converse R−1 := {(y, x) | (x, y) ∈ R} is the converse relation of R.
converse relation R−1 := {(y, x) | (x, y) ∈ R} is the converse relation of R ⊆ A × B.
26 cookie A cookie is a text file stored on the client hard disk by the web browser. Web servers can request the browser to store and send cookies.
copyleft A copyleft license is a license which requires that allows derivative works, but requires that they be licensed with the same license. copyright Defined along with intellectual property
copyright holder The copyright holder is the legal entity that owns the copyright to a copyrighted work. copyright infringement The use of a copyrighted material, by anyone other than the owner of the copyright, amounts to copyright infringement only when the use is such that it conflicts with any one or more of the exclusive rights conferred to the owner of the copyright.
copyrightable work A copyrightable work is any artefact of human labor that fits into one of the following eight categories: – Literary works: Any work expressed in letters, numbers, or symbols, regardless of medium. (Computer source code is also considered to be a literary work.) – Musical works: Original musical compositions. – Sound recordings of musical works. (different licensing) – Dramatic works: literary works that direct a performance through written instructions. – Choreographic works must be “fixed,” either through notation or video recording. – Pictorial, graphic and sculptural work(PGS works): Any two-dimensional or three- dimensional art work – Audiovisual works: work that combines audio and visual components. (e.g. films, television programs) – Architectural works.(copyright only extends to aesthetics) copyrighted Defined along with public domain
corollary Error: The defi does not appear to be inside a definition environment. line49:3
countable We say that a set A is countable (otherwise uncountable), iff there isan bijective function f : A → N with N ⊆ N.
countably infinite We say that a set A is countably infinite, iff there is a bijective function f : A → N.
cryptography Cryptography is the practice of transmitting a plain text t by encoding it into a cypher text t′, to hide its content from anyone but the legitimate reciever who can decode t′ to t.
cultural artefact Defined along with cultural heritage
cultural heritage Cultural heritage is the legacy of physical artifacts – cultural artefacts – and practices, representations, expressions, knowledges, or skills – intangible cultural heritage(ICH) – of a group or society that is inherited from past generations. current Defined along with length
current cell Let M := ⟨A, S, b, Σ, s0, F, R⟩ be a nondeterministic Turing machine, then we call a triple ⟨w, n, s⟩, where – w ∈ A∗ is the word encoded by the current tape,
27 – n the number of the cell being scanned by the head (we call it the current cell), and – s the current state a configuration of M, we denote the set of configurations of M with C(M) (or just C). A configuration ⟨w, n, s⟩ is called final or accepting, iff s ∈ F. Obviously, the transition function R can be reformulated as a function R: C(M) → C(M), we call it the configuration transition function.
cursor A cursor is a named object that encapsulates a set of query results in a (virtual) database table. cycle Defined along with cyclic cycle Defined along with cyclic
cyclic Given a graph G = ⟨V,E⟩, then – a path p is called cyclic (or a cycle) iff start(p) = end(p).
– a cycle ⟨v0, . . . , vn⟩ is called simple, iff vi ̸= vj for 1 ≤ i, j ≤ n with i ̸= j. – graph G is called acyclic iff there is no cyclic path in G.
cyclic Given a directed graph G := ⟨V,E⟩, – a path p is called cyclic (or a cycle) iff start(p) = end(p).
– a cycle ⟨v0, . . . , vn⟩ is called simple, iff vi ̸= vj for 1≤i, j≤n with i ̸= j. – G is called acyclic (or a DAG: directed acyclic graph) iff there is no cycle in G. cypher text Defined along with cryptography
dashboard A dashboard is a user interface that organizes and presents system information give an overview over the state of a complex system and its services.
data Data is information that is used to represent objects by giving values to their relevant attributes and stating their relationships. data controller Defined along with General Data Protection Regulation data definition language The data definition language(DDL) is a subset of SQL instructions that address the creation and deletion of database objects.
data language A data language is a formal language for specifying data in an information processing system. data languages are not Turing complete.
data structure A data structure is a data organization, management, and storage format that enables efficient access and modification. data subject Defined along with General Data Protection Regulation
data transfer control Data transfer control: Personal data may not be copied during transmission between sys- tems. ( encryption) ;
data type A data type or simply type is an programming language attribute of data which tells the compiler or interpreter how the programmer intends to use the data. A type constrains the valuesa variable or function can might take and defines the operators that can be applied to it.
28 database A database is an organized collection of data, stored and accessed electronically from a computer system.
database browser A database browser is a graphical user interface for a RDBMS that (typically) bundles an SQL instruction editor with displays for results and the database schema. database management system A database management system(DBMS) is program that interacts with end users, appli- cations, and a database to capture and analyze the data and provides facilities to administer the database.
database record Defined along with relational database management system database schema Defined along with column specification
database transaction The general solution to the problem of accessing a database from multiple programs or processes in parallel is solved by a complex technology called database transactions, which allow users’ to define a sensible unit of work (via begin/end bracketing) called a transaction and makes sure that the process
– behaves as if the user’s process has sole access to the database system for the duration of the transaction(isolation) – any changes made during the transaction can be rolled back if an error occurs during processing (integrity).
Transactions are an essential, but complex technology that is beyond the scope of the IWGS course. For our understanding, db.commit is essentially just the end bracket of a transaction.
database view A database view (or simply view) is a virtual table based on the result-set of a query.A view contains rows and columns, just like a real table. The fields in a view are fields from one or more real tables in the database. date Defined along with calendar
day Defined along with minute deca Defined along with prefixes deci Defined along with prefixes
decidable See recursive decides Defined along with accepts decimal Defined along with unary decimal point Defined along with floating point number
declaration A CSS declaration block consists of a semicolon-separated list of declarations in curly braces. Each declaration itself consists of a property, a colon, and a value. declaration block Defined along with rule decode Defined along with cryptography decode key Defined along with public key cryptography
decoding Defined along with code default namespace declaration Defined along with namespace declaration
29 default value Defined along with keyword argument
defined at We call a partial function f : X ⇀ Y
– defined at x ∈ X, iff (x, y) ∈ f for some y ∈ Y and – undefined at x ∈ X (write f(x) = ⊥), iff (x, y) ̸∈ f for all y ∈ Y .
defined piecewise A function m is defined piecewise, we write a1 if A1 . . m(x) = . . an if An o else
where Ai are conditions involving x, if m(x) = ai for all x with Ai and o otherwise.
definiendum Error: The defi does not appear to be inside a definition environment. line22:26
definiendum Defined along with definitional equation
definiens Error: The defi does not appear to be inside a definition environment. line23:3
definiens Defined along with definitional equation R a definite integral Given a function f : R → R and an interval [a, b] ⊂ R, then the definite integral b f(x)dx is defined to be the signed area of the region in the plane bounded by thegraphof f, the x-axis, and the vertical lines x = a and x = b, such that area above the x-axis adds to the total, and that below the x-axis subtracts from the total. definition by description Error: The defi does not appear to be inside a definition environment. line58:16
definitional equation If a does not occur in A, we call a pair a := A a definitional equation and a :⇔ A a definitional equivalence with definiendum a and definiens A. definitional equivalence Defined along with definitional equation
delete The SQL delete statement allows to change existing records. DELETE FROM $\pmetavar{table}$ WHERE $\pmetavar{condition}$;
deleted Defined along with hunk denominator Defined along with rational number
dependencies Defined along with issue number
depth The depth of a node n in a tree t is the length of the path that links n with the root of t. dereferencing Defined along with reference derivation Defined along with inference
derivation relation ! Let S := ⟨L, K, |=⟩ be a logical system, then we call a relation ⊢ ⊆ P(L) × L a derivation relation for S, if it
30 – is proof-reflexive, i.e. H ⊢ A, if A ∈ H; – is proof-transitive, i.e. if H ⊢ A and H′ ∪ {A} ⊢ B, then H ∪ H′ ⊢ B; – monotonic (or admits weakening), i.e. H ⊢ A and H ⊆ H′ imply H′ ⊢ A. derivative works Defined along with CC provision derive Defined along with relation
derived Defined along with ontology
derived unit A derived unit is formed as a product of integer powers of base units. descendant Defined along with tree descendant Defined along with ancestor
description Defined along with issue description logic Defined along with ontology
description logic A description logic is a formal system for talking about sets and their relations that is at least as expressive as PL0 with set-theoretic semantics and offers individuals and relations. A description logic has the following four components – a formal language L with logical con- PL1 stants ⊓, ·, ⊔, ⊑, and ≡. undecideable ψ decideable – a set-theoretic semantics ⟨D, [[·]]⟩ DL C 7→ pα→o – a translation into first-order logic ψ := ⊓ 7→ ∩ · 7→ D\· that is compatible with ⟨D, [[·]]⟩. φ Xo 7→ C φ := ∧ 7→ ⊓ – a calculus for L that induces a deci- 0 PL ¬ 7→ · sion procedure for L-satisfiability. description logic reasoner A description logic reasoner implements of reaonsing services based on a satisfiabiltiy test for description logics. deterministic Turing machine Defined along with nondeterministic Turing machine developer Defined along with guest development Defined along with GIT flow
development history Defined along with revision control system diagonal See identity function
dictionary A dictionary (also called associative array, map, symbol table) is an abstract data type composed of a set of key/value pairs, such that each possible key appears at most once in the container.
diff Defined along with difference
difference diff is a file comparison utility that computes differences between two strings or text files: the source f1 and the target f2. Differences are output linewise in a diff δ(f1, f2). difference Defined along with subtraction difference Defined along with subtraction
31 difference Defined along with subtraction
difference Defined along with subtraction digit Defined along with positional number system digit Defined along with positional number system
digit Defined along with positional number system
digital signature A digital signature consists of a plaintext together with its ciphertext – encoded with the sender’s pri- vate key. A message signed with a sender’s private key can be verified by anyone who has access to the sender’s public key, thereby proving that the sender had access to the private key (and therefore is likely to be the person associated with the public key used), and the part of the message that has not been tam- pered with.
digital text An electronic document that contains a digital encoding of textual material that can be read by the end user by simply presenting the encoded characters is called digital text. digraph Defined along with graph digraph Defined along with directed graph
dimension Defined along with n-fold Cartesian product dimension Defined along with International System of Units direct identifier Defined along with personally identifiable information directed acyclic graph Defined along with cyclic directed edge Defined along with directed graph directed graph Defined along with graph
directed graph A directed graph (also called digraph) is a pair ⟨V,E⟩ such that – V is a set of vertices – E ⊆ V × V is the set of its directed edges
disambiguation point A disambiguation point in a path marks an entity that can be re-used in data acquisition.
discharge We can discharge a variable X from a substitution σ by σ−X := σ, [X/X]. disjunction Defined along with formulae
distributed We call a revision control system distributed, iff it allows multiple repositories that can exchanged patches.
division The division operator computes the quotient a / b of a ∈ Q and b ∈ Q. On Q we define a c a·c b / d := b·d . division Defined along with absolute value
32 division Division computes the modulus ndivm of two natural numbers n and m. ndivm is defined as that q ∈ N, such that n = m · q + r for some r≤0 division Division computes the quotient a / b of a and b. It is defined as is that c – if it exists, such that a c = b. division Defined along with field document format A document format is a file format for electronic documents. document markup Document markup (or just markup) is the process of adding control words (special character sequences also called markup codes) to a plain text to control the structure, formatting, or the relationship among its parts, making it a formatted text. All characters of a formatted text that are not control words constitute its textual content. document object model The document object model(DOM) is a data structure for storing marked-up electronic documents as trees together with a standardized set of access methods for manipulating them. document renderer Defined along with electronic document document root As a document is a tree, the XML specification mandates that there must be a unique document root. document type Defined along with markup format domain Defined along with model domain Let D be a given set (called the domain) and φ: Vo → P(D), then we define – [[P ]] := φ(P ), (remember φ(P ) ⊆ D). – [[A ⊓ B]] := [[A]] ∩ [[B]] and A := D\[[A]] ... domain call X the domain (write dom(f)), and Y the codomain( codom(f))(come with f) domain Defined along with partial function dot notation Defined along with object double star operator The double star operator unpacks a dictionary into a sequence of keyword arguments. downstream Defined along with remote repositories dramatic work Defined along with copyrightable work drupal Drupal is an open source web content management application. It combines CMS func- tionality with knowledge management via RDF. drupal core Drupal functionality is structured into – drupal core– the basic CMS functionality – modules– which contribute e.g. new block types (∼ 45.000) – themes– which contribute new UI layouts (∼ 2800) Drupal core is the vanilla system as downloaded, modules and themes must be installed and configured separately via the config bar. 33 222 CHAPTER 12. IMAGE PROCESSING 221 Edge Detection dynamic route A dynamic route is a route annotation that contains named wildcards, which can be picked 222 Goal:up in Find the interesting route function. parts of image (features).CHAPTER 12. IMAGE PROCESSING edge Find edges, i.e. image sections, where color changes rapidly. Example: Find edges, i.e. sections, where color changes rapidly. Example Image: Edge Detection Slide 319 Goal: Find interesting parts of image (features). In this (admittedly simple) example image, we can clearly see, that there is an edge present, where the color shiftsExample: fast Find from edges dark, i.e. to sections, light. We where will color now explore,changes rapidly how we. can detect such an edge automatically. Example Image: Edge Detection Goal: Find interesting parts of image (features). Clearly there is an edge in this image. How do we detect it automatically? Example: FindClearly edges there, i.e. is ansections, edge in where this image. color changes rapidly. How do we detect it automatically? Example Image: Slide 319 In this (admittedly simple) example image, we can clearly see, that there is an edgeSlide present, 318 where the color shifts fast from dark to light. We will now explore, how we can detect such an edge automatically. Decide for each pixel, whether it is on an edge. Here: Is marked pixel an edge pixel? Decide for each pixel, if it is an edge. Here: Is marked pixel an edge pixel? We will now look at more interesting image operations. A typical example especially important for object recognition in images is to find features. Features are areas in the image, which are recognizable. For example, let’s say we want to find so-called edges in our image, i.e. areas where the color changes rapidly. Edges often correspond to object outlines. We will see an example later. Inspect neighbor pixels. edge Defined along with graph 34 edge labelling Defined along with label edge-labeled Defined along with label electronic document An electronic document is any electronic media content that is intended to be used via a document renderer, i.e. a program or computing device that transforms it into a form that can be directy perceived by the end user. element Defined along with set element Defined along with set element Defined along with container element node Defined along with XML document tree elementhood Defined along with set embedded system An embedded system is a computing device with a dedicated function within a larger mechanical or electrical system. empty Defined along with empty set empty element tag Defined along with opening tag empty set the empty set: ∀ x x ̸∈ ∅ empty set The empty set ∅ (also written as {}) is the set without elements. A set is called empty, iff it is ∅, and non-empty or (inhabited) otherwise. empty string Defined along with alphabet empty tag Defined along with tag empty word Defined along with alphabet encode We say that a tape t encodesa word w ∈ A∗, if w can be obtained from t by dropping all leading and trailing b. encode key Defined along with public key cryptography encoding Defined along with cryptography encoding Defined along with code encoding scheme UniCode defines various encoding schemes for characters, the most important is UTF-8. end Defined along with path end Defined along with path end tag Defined along with tag end user An end user is a person who ultimately uses or is intended to ultimately use a computation device or program. end-user license agreement Software vendors usually license software under extensive end-user license agreement (EULA) entered into upon the installation of that software on a computer. The license authorizes the user to install the software on a limited number of computers. 35 entailment relation Let S := ⟨L, K, |=⟩ be a logical system, then we define the entailment relation |= ⊆ P(L) × L. We say that a set H ⊆ L of formulae entails B (written H |= B), iff we have M |= B for all A ∈ H and models M ∈ K with M |= A. entails Defined along with entailment relation entities Defined along with entity relationship diagram entity relationship diagram An entity relationship diagram(ERD) illustrates the logical structure of databases. It consists of entities that characterize (sets of) objects by their attributes and relations between them. entries Defined along with matrix equal Two sets A and B are equal (written A ≡ B), iff they have the same elements. equal We call two mathematical objects a and b equal, (written a = b), iff there are no properties that discern them. equality Defined along with concept equivalence Defined along with formulae equivalence class Let S be a set and R be an equivalence relation on S, then for any we call x ∈ S we call the set [x]R := {y ∈ S | R(x, y)} the equivalence class of x (under R), and the set S/R := {[x]R | x ∈ S} the quotient space or quotient set of S (under R), it is often read as S “modulo R”. The element x is called the representative of [x]R ∈ S/R. The mapping πR : S → S/R; x 7→ [x]R is called the canonical projection or canonical surjec- tion of S to S/R. equivalence class Let S be a set and R be an equivalence relation on S, then for any we call x ∈ S we call the set [x]R := {y ∈ S | R(x, y)} the equivalence class of x (under R), and the set S/R := {[x]R | x ∈ S} the quotient space of S (under R). equivalence relation A relation R ⊆ A × A is an equivalence relation on A, iff R is reflexive, symmetric, and transitive. equivalence relation Defined along with reflexive escape character Defined along with string literal escape sequence Defined along with string literal evaluation Defined along with expression event The first key concept we need to understand here is that the browser essentially actsas an user interface: it presents the HTML pages to the user, waits for actions by the user – usually mouse clicks, drags, or gestures; we call them events– and reacts to them. The second is that all events can be associated to an element node in the DOM: consider an HTML anchor node, as we have seen above, this corresponds to a rectangular area in the browser window. Conversely, for any point p in the browser window, there is a minimal DOM element e(p) that contains p – recall that the DOM is a tree. So, if the user clicks while the mouse is at point p, then the browser triggers a click event in e(p), determines how e(p) handles a click event, and if e(p) does not, bubbles the click event up to the parent of e(p) in the DOM tree. There are multiple ways a DOM element can handle an event: some elements have default event handlers, e.g. an HTML anchor will handle a click event by issuing 36 a HTTP GET request for ⟨⟨URI⟩⟩. Other HTML elements can carry event-handler attributes whose JavaScript content is executed when the corresponding event is triggered on this element. Actually there are more events than one might think at first, they include: 1. Mouse events; click when the mouse clicks on an element (touchscreen devices gener- ate it on a tap); contextmenu: when the mouse right-clicks on an element; mouseover / mouseout: when the mouse cursor comes over / leaves an element; mousedown / mouseup: when the mouse button is pressed / released over an element; mousemove: when the mouse is moved. 2. Form element events; submit: when the visitor submits a
exception An exception is a special python object. Raising an exception e terminates computation and passes e to the next higher level. execute Defined along with interpreter execute Defined along with computing device exploitation rights Defined along with personal rights exponent Defined along with floating point number exponent Defined along with exponentiation exponent Defined along with exponentiation exponent Defined along with exponentiation exponent Defined along with exponentiation
exponentiation The exponentiation operation raises a number a (the base) to the power n (the exponent). We define it as bn a ∈ − (n = 2 · k) an := if Z and ( − (bn) if a ∈ Z− and (n = 2 · k + 1)
exponentiation Exponentiation raises a number a ∈ Q (the base) to the power n ∈ Q (the exponent). We define √ n m n a m a := √ b m bn
37 exponentiation Defined along with absolute value
exponentiation Exponentiation raises a natural number a (the base) to the n-th power an (n ∈ N is called the exponent). We define a0 := 1 and as(n) := aan.
exponentiation Exponentiation raises a number a (the base) to the n-th power an (n is called the exponent). expression Defined along with template file
expression An expression in a programming language is a combination of one or more constants, variables, operators, and functions that the programming language computes to produce a value. This process is called evaluation.
expression An expression is a finite construction composed of variables and names of mathematical objects/concepts composed by operator application and variable binding according to rules that depend of the (mathematical) context.
expression language An expression language is a formal language whose words (called exressions, terms, well formed formulae, or just wffs or formulae) are composed from constants and variables by application and binding. The set wff (Σ, V) of formulae is determined by the signature Σ – i.e., the set of constants– and the set V of variables (usually assumed to be countably infinite). The application of an expression o – called the in an application– operator to a sequence n t1, . . . , tn of exressions – called operands or arguments– is written as o t1 . . . tn (or o t ). exression Defined along with expression language extended assignment Let φ be a variable assignment and a ∈ Dι, then we denote with φ, [a/X] the extended assignment {(Y, b) ∈ φ | Y ̸= X} ∪ {(X, a)}.(φ, [a/X] coincides with φ off X, and gives the result a there)
extension The extension of a code (on characters) c: A → B+ to a function c′ : A∗ → B∗ is defined ′ as c (⟨a1, . . . , an⟩ = ⟨c(a1), . . . , c(an)⟩). extension Defined along with file system
extension If σ is a substitution, then we call σ, [A/X] the extension of σ by [A/X].
external memory See secondary storage f-string See formatted string literal f-string See formatted string literal fact Defined along with ontology
fair use doctrine Case law in common law traditions has established a fair use doctrine, which allows e.g.
– making safety copies of software and audiovisual data, – lending of books in public libraries, – citing for scientific and educational purposes, or – excerpts in search engine.
Fair use is established in court on a case-by-case taking into account the purpose (com- mercial/educational), the nature of the work the amount of the excerpt, the effect on the marketability of the work.
38 false Defined along with truth value false Defined along with model falseDefined under alongφ with true under φ falseDefined under alongφ with true under φ falsehood Defined along with model falsifiable Defined along with true under φ falsifiable Defined along with true under φ falsifiable Defined along with satisfied falsified Defined along with satisfied falsum Defined along with truth value
feature We will now look at more interesting image operations. A typical example especially im- portant for object recognition in images is to find features– i.e. areas in the image, which are recognizable. For example, let’s say we want to find so-called edges in our image, i.e. areas where the color changes rapidly. Edges often correspond to object outlines. We will see an example later.
feature Find interesting parts of image (features). feature branch Defined along with GIT flow feature branch Defined along with master branch feature request A feature request is an issue that only specifies the expected behavior and proposes ways of implementing that. femto Defined along with prefixes fetch Defined along with centralized field Defined along with relational database management system field Defined along with bundle field Defined along with object-oriented programming
field A field is a ring where multiplication is commutative all elements x except zero have a multiplicative inverse x−1. We define division as a / b := ab−1.
file A file is a resource for recording data in a storage device.
file format A file format is a standard way that information is encoded for storage in a computer file. It specifies how bits are used to encode information ina storage device.
file object python uses file objects to encapsulate all file input/output functionality.
file system A file system is a program that organizes space on a storage device and makes it acessible as files.A file name usually consists of a base name and an extension separated by a dot. final Defined along with current cell final state Defined along with nondeterministic Turing machine
39 findable Defined along with FAIR
finite We say that a set A is finite and has cardinality (or size) #(A) ∈ N, iff there is a bijective function f : A → {n ∈ N | n<#(A)}. The cardinality of a set A is also written as |A|, card(A), n(A), or A. finite sequence Defined along with sequence
first component Let p := (a, b) be a pair, then we call p1 := a the first component and p2 := b the second component of p.
first-order logic First-order logic( PL1), is a formal logical system extensively used in mathematics, philos- ophy, linguistics, and computer science. It combines propositional logic with the ability to quantify over individuals.
first-order signature A first-order signature consists of (all disjoint; k ∈ N) – connectives: Σo = {T , F , ¬, ∨, ∧, ⇒, ⇔,...} (functions on truth values) f – function constants: Σk = {f, g, h, . . .} (functions on individuals) p – predicate constants: Σk = {p, q, r, . . .} (relations among inds.) sk k k – (Skolem constants: Σk = {f1 , f2 ,...})(witness constructors; countably ∞) f p sk ∗ S ∗ – We take Σι to be all of these together: Σι := Σ ∪ Σ ∪ Σ , where Σ := k∈ Σk and o N define Σ := Σι ∪ Σ .
flipped classroom A flipped classroom is an instructional strategy and a type of blended learning focused on student engagement and active learning. Usually, students prepare plenary sessions with online materials and use classroom time for discussions, applications and worked exercises. float Defined along with integer float See floating point number floating point number A floating point number (or short a float) is a quintuple n := ⟨σ, s1, s2, b, e⟩, where
1. the sign σ is unit sequence − or the empty sequence, and the si are sequence of digits of base b. Together, (i.e. concatenated with a decimal point between s1 and s2) σ, s1, and s2 make up the significand s (also called the mantissa or coefficient. 2. an exponent e ∈ Z (also referred to as the characteristic, or scale), which modifies the magnitude of the number n.
s e The number ⟨σ, s1, s2, b, e⟩ represents the rational number bp − 1 · b . The length p := len(s1) + len(s2) of the significand determines the precision to which numbers can be represented.
for loop A for loop iteratesa program fragment over a sequence; we call the process iteration. python uses the following general syntax for ⟨⟨var⟩⟩ in ⟨⟨range⟩⟩: ⟨⟨body⟩⟩ ⟨⟨other code⟩⟩
foreign key A foreign key is a column (or collection of columns) in one table (called the child table) that refers to the primary key in another table (called the reference table or parent table). fork Defined along with remote repositories
40 fork If you want to contribute to a repository R you have no push-rights on,
1. clone R to a new repository R′ you own (i.e. fork it; R′ is a fork of R) 2. develop your contribution on R′. 3. ask Rs owners to pull from R′ (pull request) GIT repository management systems like GitHub and GitLab support this.
fork A branch controlled by a different developer or not intended tobe merged back is called a fork. form action Defined along with input element
form data The HTML form element groups the layout and input elements: –