From aa9251cd8b97b2f7b7703738b96d200bd1a07c36 Mon Sep 17 00:00:00 2001
From: Dane Sabo <dane.sabo@pitt.edu>
Date: Wed, 4 Sep 2024 10:51:11 -0400
Subject: [PATCH] vault backup: 2024-09-04 10:51:11

---
 .../plugins/nl-syntax-highlighting/main.js    | 16755 ----------------
 .../nl-syntax-highlighting/manifest.json      |    11 -
 .../plugins/nl-syntax-highlighting/styles.css |    19 -
 .../plugins/obsidian-enhancing-export/main.js |    30 +
 .../obsidian-enhancing-export/manifest.json   |    10 +
 .../obsidian-enhancing-export/styles.css      |     1 +
 .obsidian/workspace.json                      |     2 +-
 200. Library Papers/My Library.bib            | 12633 ++++++++++++
 8 files changed, 12675 insertions(+), 16786 deletions(-)
 delete mode 100644 .obsidian/plugins/nl-syntax-highlighting/main.js
 delete mode 100644 .obsidian/plugins/nl-syntax-highlighting/manifest.json
 delete mode 100644 .obsidian/plugins/nl-syntax-highlighting/styles.css
 create mode 100644 .obsidian/plugins/obsidian-enhancing-export/main.js
 create mode 100644 .obsidian/plugins/obsidian-enhancing-export/manifest.json
 create mode 100644 .obsidian/plugins/obsidian-enhancing-export/styles.css
 create mode 100644 200. Library Papers/My Library.bib

diff --git a/.obsidian/plugins/nl-syntax-highlighting/main.js b/.obsidian/plugins/nl-syntax-highlighting/main.js
deleted file mode 100644
index 1f71aea4e..000000000
--- a/.obsidian/plugins/nl-syntax-highlighting/main.js
+++ /dev/null
@@ -1,16755 +0,0 @@
-/*
-THIS IS A GENERATED/BUNDLED FILE BY ESBUILD
-if you want to view the source, please visit the github repository of this plugin
-*/
-
-var __defProp = Object.defineProperty;
-var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
-var __getOwnPropNames = Object.getOwnPropertyNames;
-var __hasOwnProp = Object.prototype.hasOwnProperty;
-var __export = (target, all4) => {
-  for (var name in all4)
-    __defProp(target, name, { get: all4[name], enumerable: true });
-};
-var __copyProps = (to, from, except, desc) => {
-  if (from && typeof from === "object" || typeof from === "function") {
-    for (let key of __getOwnPropNames(from))
-      if (!__hasOwnProp.call(to, key) && key !== except)
-        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
-  }
-  return to;
-};
-var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
-
-// main.ts
-var main_exports = {};
-__export(main_exports, {
-  default: () => NLSyntaxHighlightPlugin
-});
-module.exports = __toCommonJS(main_exports);
-var import_obsidian2 = require("obsidian");
-
-// syntaxHighlight.ts
-var import_view = require("@codemirror/view");
-
-// node_modules/compromise/src/API/world.js
-var methods = {
-  one: {},
-  two: {},
-  three: {},
-  four: {}
-};
-var model = {
-  one: {},
-  two: {},
-  three: {}
-};
-var compute = {};
-var hooks = [];
-var world_default = { methods, model, compute, hooks };
-
-// node_modules/compromise/src/API/methods/compute.js
-var isArray = (input) => Object.prototype.toString.call(input) === "[object Array]";
-var fns = {
-  compute: function(input) {
-    const { world: world2 } = this;
-    const compute4 = world2.compute;
-    if (typeof input === "string" && compute4.hasOwnProperty(input)) {
-      compute4[input](this);
-    } else if (isArray(input)) {
-      input.forEach((name) => {
-        if (world2.compute.hasOwnProperty(name)) {
-          compute4[name](this);
-        } else {
-          console.warn("no compute:", input);
-        }
-      });
-    } else if (typeof input === "function") {
-      input(this);
-    } else {
-      console.warn("no compute:", input);
-    }
-    return this;
-  }
-};
-var compute_default = fns;
-
-// node_modules/compromise/src/API/methods/loops.js
-var forEach = function(cb) {
-  let ptrs = this.fullPointer;
-  ptrs.forEach((ptr, i3) => {
-    let view = this.update([ptr]);
-    cb(view, i3);
-  });
-  return this;
-};
-var map = function(cb, empty) {
-  let ptrs = this.fullPointer;
-  let res = ptrs.map((ptr, i3) => {
-    let view = this.update([ptr]);
-    let out2 = cb(view, i3);
-    if (out2 === void 0) {
-      return this.none();
-    }
-    return out2;
-  });
-  if (res.length === 0) {
-    return empty || this.update([]);
-  }
-  if (res[0] !== void 0) {
-    if (typeof res[0] === "string") {
-      return res;
-    }
-    if (typeof res[0] === "object" && (res[0] === null || !res[0].isView)) {
-      return res;
-    }
-  }
-  let all4 = [];
-  res.forEach((ptr) => {
-    all4 = all4.concat(ptr.fullPointer);
-  });
-  return this.toView(all4);
-};
-var filter = function(cb) {
-  let ptrs = this.fullPointer;
-  ptrs = ptrs.filter((ptr, i3) => {
-    let view = this.update([ptr]);
-    return cb(view, i3);
-  });
-  let res = this.update(ptrs);
-  return res;
-};
-var find = function(cb) {
-  let ptrs = this.fullPointer;
-  let found = ptrs.find((ptr, i3) => {
-    let view = this.update([ptr]);
-    return cb(view, i3);
-  });
-  return this.update([found]);
-};
-var some = function(cb) {
-  let ptrs = this.fullPointer;
-  return ptrs.some((ptr, i3) => {
-    let view = this.update([ptr]);
-    return cb(view, i3);
-  });
-};
-var random = function(n3 = 1) {
-  let ptrs = this.fullPointer;
-  let r2 = Math.floor(Math.random() * ptrs.length);
-  if (r2 + n3 > this.length) {
-    r2 = this.length - n3;
-    r2 = r2 < 0 ? 0 : r2;
-  }
-  ptrs = ptrs.slice(r2, r2 + n3);
-  return this.update(ptrs);
-};
-var loops_default = { forEach, map, filter, find, some, random };
-
-// node_modules/compromise/src/API/methods/utils.js
-var utils = {
-  termList: function() {
-    return this.methods.one.termList(this.docs);
-  },
-  terms: function(n3) {
-    let m3 = this.match(".");
-    return typeof n3 === "number" ? m3.eq(n3) : m3;
-  },
-  groups: function(group) {
-    if (group || group === 0) {
-      return this.update(this._groups[group] || []);
-    }
-    let res = {};
-    Object.keys(this._groups).forEach((k2) => {
-      res[k2] = this.update(this._groups[k2]);
-    });
-    return res;
-  },
-  eq: function(n3) {
-    let ptr = this.pointer;
-    if (!ptr) {
-      ptr = this.docs.map((_doc, i3) => [i3]);
-    }
-    if (ptr[n3]) {
-      return this.update([ptr[n3]]);
-    }
-    return this.none();
-  },
-  first: function() {
-    return this.eq(0);
-  },
-  last: function() {
-    let n3 = this.fullPointer.length - 1;
-    return this.eq(n3);
-  },
-  firstTerms: function() {
-    return this.match("^.");
-  },
-  lastTerms: function() {
-    return this.match(".$");
-  },
-  slice: function(min2, max3) {
-    let pntrs = this.pointer || this.docs.map((_o, n3) => [n3]);
-    pntrs = pntrs.slice(min2, max3);
-    return this.update(pntrs);
-  },
-  all: function() {
-    return this.update().toView();
-  },
-  fullSentences: function() {
-    let ptrs = this.fullPointer.map((a2) => [a2[0]]);
-    return this.update(ptrs).toView();
-  },
-  none: function() {
-    return this.update([]);
-  },
-  isDoc: function(b) {
-    if (!b || !b.isView) {
-      return false;
-    }
-    let aPtr = this.fullPointer;
-    let bPtr = b.fullPointer;
-    if (!aPtr.length === bPtr.length) {
-      return false;
-    }
-    return aPtr.every((ptr, i3) => {
-      if (!bPtr[i3]) {
-        return false;
-      }
-      return ptr[0] === bPtr[i3][0] && ptr[1] === bPtr[i3][1] && ptr[2] === bPtr[i3][2];
-    });
-  },
-  wordCount: function() {
-    return this.docs.reduce((count, terms) => {
-      count += terms.filter((t2) => t2.text !== "").length;
-      return count;
-    }, 0);
-  },
-  isFull: function() {
-    let ptrs = this.pointer;
-    if (!ptrs) {
-      return true;
-    }
-    let document2 = this.document;
-    for (let i3 = 0; i3 < ptrs.length; i3 += 1) {
-      let [n3, start2, end2] = ptrs[i3];
-      if (n3 !== i3 || start2 !== 0) {
-        return false;
-      }
-      if (document2[n3].length > end2) {
-        return false;
-      }
-    }
-    return true;
-  },
-  getNth: function(n3) {
-    if (typeof n3 === "number") {
-      return this.eq(n3);
-    } else if (typeof n3 === "string") {
-      return this.if(n3);
-    }
-    return this;
-  }
-};
-utils.group = utils.groups;
-utils.fullSentence = utils.fullSentences;
-utils.sentence = utils.fullSentences;
-utils.lastTerm = utils.lastTerms;
-utils.firstTerm = utils.firstTerms;
-var utils_default = utils;
-
-// node_modules/compromise/src/API/methods/index.js
-var methods2 = Object.assign({}, utils_default, compute_default, loops_default);
-methods2.get = methods2.eq;
-var methods_default = methods2;
-
-// node_modules/compromise/src/API/View.js
-var View = class {
-  constructor(document2, pointer, groups = {}) {
-    [
-      ["document", document2],
-      ["world", world_default],
-      ["_groups", groups],
-      ["_cache", null],
-      ["viewType", "View"]
-    ].forEach((a2) => {
-      Object.defineProperty(this, a2[0], {
-        value: a2[1],
-        writable: true
-      });
-    });
-    this.ptrs = pointer;
-  }
-  get docs() {
-    let docs = this.document;
-    if (this.ptrs) {
-      docs = world_default.methods.one.getDoc(this.ptrs, this.document);
-    }
-    return docs;
-  }
-  get pointer() {
-    return this.ptrs;
-  }
-  get methods() {
-    return this.world.methods;
-  }
-  get model() {
-    return this.world.model;
-  }
-  get hooks() {
-    return this.world.hooks;
-  }
-  get isView() {
-    return true;
-  }
-  get found() {
-    return this.docs.length > 0;
-  }
-  get length() {
-    return this.docs.length;
-  }
-  get fullPointer() {
-    let { docs, ptrs, document: document2 } = this;
-    let pointers = ptrs || docs.map((_d, n3) => [n3]);
-    return pointers.map((a2) => {
-      let [n3, start2, end2, id, endId] = a2;
-      start2 = start2 || 0;
-      end2 = end2 || (document2[n3] || []).length;
-      if (document2[n3] && document2[n3][start2]) {
-        id = id || document2[n3][start2].id;
-        if (document2[n3][end2 - 1]) {
-          endId = endId || document2[n3][end2 - 1].id;
-        }
-      }
-      return [n3, start2, end2, id, endId];
-    });
-  }
-  update(pointer) {
-    let m3 = new View(this.document, pointer);
-    if (this._cache && pointer && pointer.length > 0) {
-      let cache2 = [];
-      pointer.forEach((ptr, i3) => {
-        let [n3, start2, end2] = ptr;
-        if (ptr.length === 1) {
-          cache2[i3] = this._cache[n3];
-        } else if (start2 === 0 && this.document[n3].length === end2) {
-          cache2[i3] = this._cache[n3];
-        }
-      });
-      if (cache2.length > 0) {
-        m3._cache = cache2;
-      }
-    }
-    m3.world = this.world;
-    return m3;
-  }
-  toView(pointer) {
-    return new View(this.document, pointer || this.pointer);
-  }
-  fromText(input) {
-    const { methods: methods16 } = this;
-    let document2 = methods16.one.tokenize.fromString(input, this.world);
-    let doc = new View(document2);
-    doc.world = this.world;
-    doc.compute(["normal", "lexicon"]);
-    if (this.world.compute.preTagger) {
-      doc.compute("preTagger");
-    }
-    return doc;
-  }
-  clone() {
-    let document2 = this.document.slice(0);
-    document2 = document2.map((terms) => {
-      return terms.map((term) => {
-        term = Object.assign({}, term);
-        term.tags = new Set(term.tags);
-        return term;
-      });
-    });
-    let m3 = this.update(this.pointer);
-    m3.document = document2;
-    m3._cache = this._cache;
-    return m3;
-  }
-};
-Object.assign(View.prototype, methods_default);
-var View_default = View;
-
-// node_modules/compromise/src/_version.js
-var version_default = "14.8.1";
-
-// node_modules/compromise/src/API/extend.js
-var isObject = function(item) {
-  return item && typeof item === "object" && !Array.isArray(item);
-};
-function mergeDeep(model5, plugin5) {
-  if (isObject(plugin5)) {
-    for (const key in plugin5) {
-      if (isObject(plugin5[key])) {
-        if (!model5[key])
-          Object.assign(model5, { [key]: {} });
-        mergeDeep(model5[key], plugin5[key]);
-      } else {
-        Object.assign(model5, { [key]: plugin5[key] });
-      }
-    }
-  }
-  return model5;
-}
-function mergeQuick(model5, plugin5) {
-  for (const key in plugin5) {
-    model5[key] = model5[key] || {};
-    Object.assign(model5[key], plugin5[key]);
-  }
-  return model5;
-}
-var addIrregulars = function(model5, conj) {
-  let m3 = model5.two.models || {};
-  Object.keys(conj).forEach((k2) => {
-    if (conj[k2].pastTense) {
-      if (m3.toPast) {
-        m3.toPast.exceptions[k2] = conj[k2].pastTense;
-      }
-      if (m3.fromPast) {
-        m3.fromPast.exceptions[conj[k2].pastTense] = k2;
-      }
-    }
-    if (conj[k2].presentTense) {
-      if (m3.toPresent) {
-        m3.toPresent.exceptions[k2] = conj[k2].presentTense;
-      }
-      if (m3.fromPresent) {
-        m3.fromPresent.exceptions[conj[k2].presentTense] = k2;
-      }
-    }
-    if (conj[k2].gerund) {
-      if (m3.toGerund) {
-        m3.toGerund.exceptions[k2] = conj[k2].gerund;
-      }
-      if (m3.fromGerund) {
-        m3.fromGerund.exceptions[conj[k2].gerund] = k2;
-      }
-    }
-    if (conj[k2].comparative) {
-      if (m3.toComparative) {
-        m3.toComparative.exceptions[k2] = conj[k2].comparative;
-      }
-      if (m3.fromComparative) {
-        m3.fromComparative.exceptions[conj[k2].comparative] = k2;
-      }
-    }
-    if (conj[k2].superlative) {
-      if (m3.toSuperlative) {
-        m3.toSuperlative.exceptions[k2] = conj[k2].superlative;
-      }
-      if (m3.fromSuperlative) {
-        m3.fromSuperlative.exceptions[conj[k2].superlative] = k2;
-      }
-    }
-  });
-};
-var extend = function(plugin5, world2, View2, nlp2) {
-  const { methods: methods16, model: model5, compute: compute4, hooks: hooks2 } = world2;
-  if (plugin5.methods) {
-    mergeQuick(methods16, plugin5.methods);
-  }
-  if (plugin5.model) {
-    mergeDeep(model5, plugin5.model);
-  }
-  if (plugin5.irregulars) {
-    addIrregulars(model5, plugin5.irregulars);
-  }
-  if (plugin5.compute) {
-    Object.assign(compute4, plugin5.compute);
-  }
-  if (hooks2) {
-    world2.hooks = hooks2.concat(plugin5.hooks || []);
-  }
-  if (plugin5.api) {
-    plugin5.api(View2);
-  }
-  if (plugin5.lib) {
-    Object.keys(plugin5.lib).forEach((k2) => nlp2[k2] = plugin5.lib[k2]);
-  }
-  if (plugin5.tags) {
-    nlp2.addTags(plugin5.tags);
-  }
-  if (plugin5.words) {
-    nlp2.addWords(plugin5.words);
-  }
-  if (plugin5.mutate) {
-    plugin5.mutate(world2);
-  }
-};
-var extend_default = extend;
-
-// node_modules/compromise/src/API/_lib.js
-var verbose = function(set) {
-  const env2 = typeof process === "undefined" || !process.env ? self.env || {} : process.env;
-  env2.DEBUG_TAGS = set === "tagger" || set === true ? true : "";
-  env2.DEBUG_MATCH = set === "match" || set === true ? true : "";
-  env2.DEBUG_CHUNKS = set === "chunker" || set === true ? true : "";
-  return this;
-};
-
-// node_modules/compromise/src/API/inputs.js
-var isObject2 = (val) => {
-  return Object.prototype.toString.call(val) === "[object Object]";
-};
-var isArray2 = function(arr) {
-  return Object.prototype.toString.call(arr) === "[object Array]";
-};
-var fromJson = function(json) {
-  return json.map((o2) => {
-    return o2.terms.map((term) => {
-      if (isArray2(term.tags)) {
-        term.tags = new Set(term.tags);
-      }
-      return term;
-    });
-  });
-};
-var preTokenized = function(arr) {
-  return arr.map((a2) => {
-    return a2.map((str) => {
-      return {
-        text: str,
-        normal: str,
-        pre: "",
-        post: " ",
-        tags: /* @__PURE__ */ new Set()
-      };
-    });
-  });
-};
-var inputs = function(input, View2, world2) {
-  const { methods: methods16 } = world2;
-  let doc = new View2([]);
-  doc.world = world2;
-  if (typeof input === "number") {
-    input = String(input);
-  }
-  if (!input) {
-    return doc;
-  }
-  if (typeof input === "string") {
-    let document2 = methods16.one.tokenize.fromString(input, world2);
-    return new View2(document2);
-  }
-  if (isObject2(input) && input.isView) {
-    return new View2(input.document, input.ptrs);
-  }
-  if (isArray2(input)) {
-    if (isArray2(input[0])) {
-      let document3 = preTokenized(input);
-      return new View2(document3);
-    }
-    let document2 = fromJson(input);
-    return new View2(document2);
-  }
-  return doc;
-};
-var inputs_default = inputs;
-
-// node_modules/compromise/src/nlp.js
-var world = Object.assign({}, world_default);
-var nlp = function(input, lex) {
-  if (lex) {
-    nlp.addWords(lex);
-  }
-  let doc = inputs_default(input, View_default, world);
-  if (input) {
-    doc.compute(world.hooks);
-  }
-  return doc;
-};
-Object.defineProperty(nlp, "_world", {
-  value: world,
-  writable: true
-});
-nlp.tokenize = function(input, lex) {
-  const { compute: compute4 } = this._world;
-  if (lex) {
-    nlp.addWords(lex);
-  }
-  let doc = inputs_default(input, View_default, world);
-  if (compute4.contractions) {
-    doc.compute(["alias", "normal", "machine", "contractions"]);
-  }
-  return doc;
-};
-nlp.plugin = function(plugin5) {
-  extend_default(plugin5, this._world, View_default, this);
-  return this;
-};
-nlp.extend = nlp.plugin;
-nlp.world = function() {
-  return this._world;
-};
-nlp.model = function() {
-  return this._world.model;
-};
-nlp.methods = function() {
-  return this._world.methods;
-};
-nlp.hooks = function() {
-  return this._world.hooks;
-};
-nlp.verbose = verbose;
-nlp.version = version_default;
-var nlp_default = nlp;
-
-// node_modules/compromise/src/1-one/cache/methods/cacheDoc.js
-var createCache = function(document2) {
-  let cache2 = document2.map((terms) => {
-    let stuff = /* @__PURE__ */ new Set();
-    terms.forEach((term) => {
-      if (term.normal !== "") {
-        stuff.add(term.normal);
-      }
-      if (term.switch) {
-        stuff.add(`%${term.switch}%`);
-      }
-      if (term.implicit) {
-        stuff.add(term.implicit);
-      }
-      if (term.machine) {
-        stuff.add(term.machine);
-      }
-      if (term.root) {
-        stuff.add(term.root);
-      }
-      if (term.alias) {
-        term.alias.forEach((str) => stuff.add(str));
-      }
-      let tags = Array.from(term.tags);
-      for (let t2 = 0; t2 < tags.length; t2 += 1) {
-        stuff.add("#" + tags[t2]);
-      }
-    });
-    return stuff;
-  });
-  return cache2;
-};
-var cacheDoc_default = createCache;
-
-// node_modules/compromise/src/1-one/cache/methods/index.js
-var methods_default2 = {
-  one: {
-    cacheDoc: cacheDoc_default
-  }
-};
-
-// node_modules/compromise/src/1-one/cache/api.js
-var methods3 = {
-  cache: function() {
-    this._cache = this.methods.one.cacheDoc(this.document);
-    return this;
-  },
-  uncache: function() {
-    this._cache = null;
-    return this;
-  }
-};
-var addAPI = function(View2) {
-  Object.assign(View2.prototype, methods3);
-};
-var api_default = addAPI;
-
-// node_modules/compromise/src/1-one/cache/compute.js
-var compute_default2 = {
-  cache: function(view) {
-    view._cache = view.methods.one.cacheDoc(view.document);
-  }
-};
-
-// node_modules/compromise/src/1-one/cache/plugin.js
-var plugin_default = {
-  api: api_default,
-  compute: compute_default2,
-  methods: methods_default2
-};
-
-// node_modules/compromise/src/1-one/change/api/case.js
-var case_default = {
-  toLowerCase: function() {
-    this.termList().forEach((t2) => {
-      t2.text = t2.text.toLowerCase();
-    });
-    return this;
-  },
-  toUpperCase: function() {
-    this.termList().forEach((t2) => {
-      t2.text = t2.text.toUpperCase();
-    });
-    return this;
-  },
-  toTitleCase: function() {
-    this.termList().forEach((t2) => {
-      t2.text = t2.text.replace(/^ *[a-z\u00C0-\u00FF]/, (x) => x.toUpperCase());
-    });
-    return this;
-  },
-  toCamelCase: function() {
-    this.docs.forEach((terms) => {
-      terms.forEach((t2, i3) => {
-        if (i3 !== 0) {
-          t2.text = t2.text.replace(/^ *[a-z\u00C0-\u00FF]/, (x) => x.toUpperCase());
-        }
-        if (i3 !== terms.length - 1) {
-          t2.post = "";
-        }
-      });
-    });
-    return this;
-  }
-};
-
-// node_modules/compromise/src/1-one/change/api/lib/insert.js
-var isTitleCase = (str) => /^\p{Lu}[\p{Ll}'’]/u.test(str) || /^\p{Lu}$/u.test(str);
-var toTitleCase = (str) => str.replace(/^\p{Ll}/u, (x) => x.toUpperCase());
-var toLowerCase = (str) => str.replace(/^\p{Lu}/u, (x) => x.toLowerCase());
-var spliceArr = (parent, index3, child) => {
-  child.forEach((term) => term.dirty = true);
-  if (parent) {
-    let args = [index3, 0].concat(child);
-    Array.prototype.splice.apply(parent, args);
-  }
-  return parent;
-};
-var endSpace = function(terms) {
-  const hasSpace2 = / $/;
-  const hasDash4 = /[-–—]/;
-  let lastTerm = terms[terms.length - 1];
-  if (lastTerm && !hasSpace2.test(lastTerm.post) && !hasDash4.test(lastTerm.post)) {
-    lastTerm.post += " ";
-  }
-};
-var movePunct = (source, end2, needle) => {
-  const juicy = /[-.?!,;:)–—'"]/g;
-  let wasLast = source[end2 - 1];
-  if (!wasLast) {
-    return;
-  }
-  let post = wasLast.post;
-  if (juicy.test(post)) {
-    let punct = post.match(juicy).join("");
-    let last = needle[needle.length - 1];
-    last.post = punct + last.post;
-    wasLast.post = wasLast.post.replace(juicy, "");
-  }
-};
-var moveTitleCase = function(home, start2, needle) {
-  let from = home[start2];
-  if (start2 !== 0 || !isTitleCase(from.text)) {
-    return;
-  }
-  needle[0].text = toTitleCase(needle[0].text);
-  let old = home[start2];
-  if (old.tags.has("ProperNoun") || old.tags.has("Acronym")) {
-    return;
-  }
-  if (isTitleCase(old.text) && old.text.length > 1) {
-    old.text = toLowerCase(old.text);
-  }
-};
-var cleanPrepend = function(home, ptr, needle, document2) {
-  let [n3, start2, end2] = ptr;
-  if (start2 === 0) {
-    endSpace(needle);
-  } else if (end2 === document2[n3].length) {
-    endSpace(needle);
-  } else {
-    endSpace(needle);
-    endSpace([home[ptr[1]]]);
-  }
-  moveTitleCase(home, start2, needle);
-  spliceArr(home, start2, needle);
-};
-var cleanAppend = function(home, ptr, needle, document2) {
-  let [n3, , end2] = ptr;
-  let total = (document2[n3] || []).length;
-  if (end2 < total) {
-    movePunct(home, end2, needle);
-    endSpace(needle);
-  } else if (total === end2) {
-    endSpace(home);
-    movePunct(home, end2, needle);
-    if (document2[n3 + 1]) {
-      needle[needle.length - 1].post += " ";
-    }
-  }
-  spliceArr(home, ptr[2], needle);
-  ptr[4] = needle[needle.length - 1].id;
-};
-
-// node_modules/compromise/src/1-one/change/compute/uuid.js
-var index = 0;
-var pad3 = (str) => {
-  str = str.length < 3 ? "0" + str : str;
-  return str.length < 3 ? "0" + str : str;
-};
-var toId = function(term) {
-  let [n3, i3] = term.index || [0, 0];
-  index += 1;
-  index = index > 46655 ? 0 : index;
-  n3 = n3 > 46655 ? 0 : n3;
-  i3 = i3 > 1294 ? 0 : i3;
-  let id = pad3(index.toString(36));
-  id += pad3(n3.toString(36));
-  let tx = i3.toString(36);
-  tx = tx.length < 2 ? "0" + tx : tx;
-  id += tx;
-  let r2 = parseInt(Math.random() * 36, 10);
-  id += r2.toString(36);
-  return term.normal + "|" + id.toUpperCase();
-};
-var uuid_default = toId;
-
-// node_modules/compromise/src/1-one/change/api/insert.js
-var expand = function(m3) {
-  if (m3.has("@hasContraction") && typeof m3.contractions === "function") {
-    let more = m3.grow("@hasContraction");
-    more.contractions().expand();
-  }
-};
-var isArray3 = (arr) => Object.prototype.toString.call(arr) === "[object Array]";
-var addIds = function(terms) {
-  terms = terms.map((term) => {
-    term.id = uuid_default(term);
-    return term;
-  });
-  return terms;
-};
-var getTerms = function(input, world2) {
-  const { methods: methods16 } = world2;
-  if (typeof input === "string") {
-    return methods16.one.tokenize.fromString(input, world2)[0];
-  }
-  if (typeof input === "object" && input.isView) {
-    return input.clone().docs[0] || [];
-  }
-  if (isArray3(input)) {
-    return isArray3(input[0]) ? input[0] : input;
-  }
-  return [];
-};
-var insert = function(input, view, prepend) {
-  const { document: document2, world: world2 } = view;
-  view.uncache();
-  let ptrs = view.fullPointer;
-  let selfPtrs = view.fullPointer;
-  view.forEach((m3, i3) => {
-    let ptr = m3.fullPointer[0];
-    let [n3] = ptr;
-    let home = document2[n3];
-    let terms = getTerms(input, world2);
-    if (terms.length === 0) {
-      return;
-    }
-    terms = addIds(terms);
-    if (prepend) {
-      expand(view.update([ptr]).firstTerm());
-      cleanPrepend(home, ptr, terms, document2);
-    } else {
-      expand(view.update([ptr]).lastTerm());
-      cleanAppend(home, ptr, terms, document2);
-    }
-    if (document2[n3] && document2[n3][ptr[1]]) {
-      ptr[3] = document2[n3][ptr[1]].id;
-    }
-    selfPtrs[i3] = ptr;
-    ptr[2] += terms.length;
-    ptrs[i3] = ptr;
-  });
-  let doc = view.toView(ptrs);
-  view.ptrs = selfPtrs;
-  doc.compute(["id", "index", "lexicon"]);
-  if (doc.world.compute.preTagger) {
-    doc.compute("preTagger");
-  }
-  return doc;
-};
-var fns2 = {
-  insertAfter: function(input) {
-    return insert(input, this, false);
-  },
-  insertBefore: function(input) {
-    return insert(input, this, true);
-  }
-};
-fns2.append = fns2.insertAfter;
-fns2.prepend = fns2.insertBefore;
-fns2.insert = fns2.insertAfter;
-var insert_default = fns2;
-
-// node_modules/compromise/src/1-one/change/api/replace.js
-var dollarStub = /\$[0-9a-z]+/g;
-var fns3 = {};
-var titleCase = function(str) {
-  return str.replace(/\w\S*/g, (txt) => txt.charAt(0).toUpperCase() + txt.substring(1).toLowerCase());
-};
-var replaceByFn = function(main, fn) {
-  main.forEach((m3) => {
-    let out2 = fn(m3);
-    m3.replaceWith(out2);
-  });
-  return main;
-};
-var subDollarSign = function(input, main) {
-  if (typeof input !== "string") {
-    return input;
-  }
-  let groups = main.groups();
-  input = input.replace(dollarStub, (a2) => {
-    let num = a2.replace(/\$/, "");
-    if (groups.hasOwnProperty(num)) {
-      return groups[num].text();
-    }
-    return a2;
-  });
-  return input;
-};
-fns3.replaceWith = function(input, keep9 = {}) {
-  let ptrs = this.fullPointer;
-  let main = this;
-  this.uncache();
-  if (typeof input === "function") {
-    return replaceByFn(main, input);
-  }
-  input = subDollarSign(input, main);
-  let original = this.update(ptrs);
-  ptrs = ptrs.map((ptr) => ptr.slice(0, 3));
-  let oldTags = (original.docs[0] || []).map((term) => Array.from(term.tags));
-  if (typeof input === "string") {
-    input = this.fromText(input).compute("id");
-  }
-  main.insertAfter(input);
-  if (original.has("@hasContraction") && main.contractions) {
-    let more = main.grow("@hasContraction+");
-    more.contractions().expand();
-  }
-  main.delete(original);
-  let m3 = main.toView(ptrs).compute(["index", "lexicon"]);
-  if (m3.world.compute.preTagger) {
-    m3.compute("preTagger");
-  }
-  if (keep9.tags) {
-    m3.terms().forEach((term, i3) => {
-      term.tagSafe(oldTags[i3]);
-    });
-  }
-  if (keep9.case && m3.docs[0] && m3.docs[0][0] && m3.docs[0][0].index[1] === 0) {
-    m3.docs[0][0].text = titleCase(m3.docs[0][0].text);
-  }
-  return m3;
-};
-fns3.replace = function(match2, input, keep9) {
-  if (match2 && !input) {
-    return this.replaceWith(match2, keep9);
-  }
-  let m3 = this.match(match2);
-  if (!m3.found) {
-    return this;
-  }
-  this.soften();
-  return m3.replaceWith(input, keep9);
-};
-var replace_default = fns3;
-
-// node_modules/compromise/src/1-one/change/api/lib/remove.js
-var repairPunct = function(terms, len) {
-  let last = terms.length - 1;
-  let from = terms[last];
-  let to = terms[last - len];
-  if (to && from) {
-    to.post += from.post;
-    to.post = to.post.replace(/ +([.?!,;:])/, "$1");
-    to.post = to.post.replace(/[,;:]+([.?!])/, "$1");
-  }
-};
-var pluckOut = function(document2, nots) {
-  nots.forEach((ptr) => {
-    let [n3, start2, end2] = ptr;
-    let len = end2 - start2;
-    if (!document2[n3]) {
-      return;
-    }
-    if (end2 === document2[n3].length && end2 > 1) {
-      repairPunct(document2[n3], len);
-    }
-    document2[n3].splice(start2, len);
-  });
-  for (let i3 = document2.length - 1; i3 >= 0; i3 -= 1) {
-    if (document2[i3].length === 0) {
-      document2.splice(i3, 1);
-      if (i3 === document2.length && document2[i3 - 1]) {
-        let terms = document2[i3 - 1];
-        let lastTerm = terms[terms.length - 1];
-        if (lastTerm) {
-          lastTerm.post = lastTerm.post.trimEnd();
-        }
-      }
-    }
-  }
-  return document2;
-};
-var remove_default = pluckOut;
-
-// node_modules/compromise/src/1-one/change/api/remove.js
-var fixPointers = function(ptrs, gonePtrs) {
-  ptrs = ptrs.map((ptr) => {
-    let [n3] = ptr;
-    if (!gonePtrs[n3]) {
-      return ptr;
-    }
-    gonePtrs[n3].forEach((no) => {
-      let len = no[2] - no[1];
-      if (ptr[1] <= no[1] && ptr[2] >= no[2]) {
-        ptr[2] -= len;
-      }
-    });
-    return ptr;
-  });
-  ptrs.forEach((ptr, i3) => {
-    if (ptr[1] === 0 && ptr[2] == 0) {
-      for (let n3 = i3 + 1; n3 < ptrs.length; n3 += 1) {
-        ptrs[n3][0] -= 1;
-        if (ptrs[n3][0] < 0) {
-          ptrs[n3][0] = 0;
-        }
-      }
-    }
-  });
-  ptrs = ptrs.filter((ptr) => ptr[2] - ptr[1] > 0);
-  ptrs = ptrs.map((ptr) => {
-    ptr[3] = null;
-    ptr[4] = null;
-    return ptr;
-  });
-  return ptrs;
-};
-var methods4 = {
-  remove: function(reg) {
-    const { indexN: indexN2 } = this.methods.one.pointer;
-    this.uncache();
-    let self2 = this.all();
-    let not = this;
-    if (reg) {
-      self2 = this;
-      not = this.match(reg);
-    }
-    let isFull = !self2.ptrs;
-    if (not.has("@hasContraction") && not.contractions) {
-      let more = not.grow("@hasContraction");
-      more.contractions().expand();
-    }
-    let ptrs = self2.fullPointer;
-    let nots = not.fullPointer.reverse();
-    let document2 = remove_default(this.document, nots);
-    let gonePtrs = indexN2(nots);
-    ptrs = fixPointers(ptrs, gonePtrs);
-    self2.ptrs = ptrs;
-    self2.document = document2;
-    self2.compute("index");
-    if (isFull) {
-      self2.ptrs = void 0;
-    }
-    if (!reg) {
-      this.ptrs = [];
-      return self2.none();
-    }
-    let res = self2.toView(ptrs);
-    return res;
-  }
-};
-methods4.delete = methods4.remove;
-var remove_default2 = methods4;
-
-// node_modules/compromise/src/1-one/change/api/whitespace.js
-var methods5 = {
-  pre: function(str, concat) {
-    if (str === void 0 && this.found) {
-      return this.docs[0][0].pre;
-    }
-    this.docs.forEach((terms) => {
-      let term = terms[0];
-      if (concat === true) {
-        term.pre += str;
-      } else {
-        term.pre = str;
-      }
-    });
-    return this;
-  },
-  post: function(str, concat) {
-    if (str === void 0) {
-      let last = this.docs[this.docs.length - 1];
-      return last[last.length - 1].post;
-    }
-    this.docs.forEach((terms) => {
-      let term = terms[terms.length - 1];
-      if (concat === true) {
-        term.post += str;
-      } else {
-        term.post = str;
-      }
-    });
-    return this;
-  },
-  trim: function() {
-    if (!this.found) {
-      return this;
-    }
-    let docs = this.docs;
-    let start2 = docs[0][0];
-    start2.pre = start2.pre.trimStart();
-    let last = docs[docs.length - 1];
-    let end2 = last[last.length - 1];
-    end2.post = end2.post.trimEnd();
-    return this;
-  },
-  hyphenate: function() {
-    this.docs.forEach((terms) => {
-      terms.forEach((t2, i3) => {
-        if (i3 !== 0) {
-          t2.pre = "";
-        }
-        if (terms[i3 + 1]) {
-          t2.post = "-";
-        }
-      });
-    });
-    return this;
-  },
-  dehyphenate: function() {
-    const hasHyphen3 = /[-–—]/;
-    this.docs.forEach((terms) => {
-      terms.forEach((t2) => {
-        if (hasHyphen3.test(t2.post)) {
-          t2.post = " ";
-        }
-      });
-    });
-    return this;
-  },
-  toQuotations: function(start2, end2) {
-    start2 = start2 || `"`;
-    end2 = end2 || `"`;
-    this.docs.forEach((terms) => {
-      terms[0].pre = start2 + terms[0].pre;
-      let last = terms[terms.length - 1];
-      last.post = end2 + last.post;
-    });
-    return this;
-  },
-  toParentheses: function(start2, end2) {
-    start2 = start2 || `(`;
-    end2 = end2 || `)`;
-    this.docs.forEach((terms) => {
-      terms[0].pre = start2 + terms[0].pre;
-      let last = terms[terms.length - 1];
-      last.post = end2 + last.post;
-    });
-    return this;
-  }
-};
-methods5.deHyphenate = methods5.dehyphenate;
-methods5.toQuotation = methods5.toQuotations;
-var whitespace_default = methods5;
-
-// node_modules/compromise/src/1-one/change/api/lib/_sort.js
-var alpha = (a2, b) => {
-  if (a2.normal < b.normal) {
-    return -1;
-  }
-  if (a2.normal > b.normal) {
-    return 1;
-  }
-  return 0;
-};
-var length = (a2, b) => {
-  let left = a2.normal.trim().length;
-  let right = b.normal.trim().length;
-  if (left < right) {
-    return 1;
-  }
-  if (left > right) {
-    return -1;
-  }
-  return 0;
-};
-var wordCount = (a2, b) => {
-  if (a2.words < b.words) {
-    return 1;
-  }
-  if (a2.words > b.words) {
-    return -1;
-  }
-  return 0;
-};
-var sequential = (a2, b) => {
-  if (a2[0] < b[0]) {
-    return 1;
-  }
-  if (a2[0] > b[0]) {
-    return -1;
-  }
-  return a2[1] > b[1] ? 1 : -1;
-};
-var byFreq = function(arr) {
-  let counts = {};
-  arr.forEach((o2) => {
-    counts[o2.normal] = counts[o2.normal] || 0;
-    counts[o2.normal] += 1;
-  });
-  arr.sort((a2, b) => {
-    let left = counts[a2.normal];
-    let right = counts[b.normal];
-    if (left < right) {
-      return 1;
-    }
-    if (left > right) {
-      return -1;
-    }
-    return 0;
-  });
-  return arr;
-};
-var sort_default = { alpha, length, wordCount, sequential, byFreq };
-
-// node_modules/compromise/src/1-one/change/api/sort.js
-var seqNames = /* @__PURE__ */ new Set(["index", "sequence", "seq", "sequential", "chron", "chronological"]);
-var freqNames = /* @__PURE__ */ new Set(["freq", "frequency", "topk", "repeats"]);
-var alphaNames = /* @__PURE__ */ new Set(["alpha", "alphabetical"]);
-var customSort = function(view, fn) {
-  let ptrs = view.fullPointer;
-  ptrs = ptrs.sort((a2, b) => {
-    a2 = view.update([a2]);
-    b = view.update([b]);
-    return fn(a2, b);
-  });
-  view.ptrs = ptrs;
-  return view;
-};
-var sort = function(input) {
-  let { docs, pointer } = this;
-  this.uncache();
-  if (typeof input === "function") {
-    return customSort(this, input);
-  }
-  input = input || "alpha";
-  let ptrs = pointer || docs.map((_d, n3) => [n3]);
-  let arr = docs.map((terms, n3) => {
-    return {
-      index: n3,
-      words: terms.length,
-      normal: terms.map((t2) => t2.machine || t2.normal || "").join(" "),
-      pointer: ptrs[n3]
-    };
-  });
-  if (seqNames.has(input)) {
-    input = "sequential";
-  }
-  if (alphaNames.has(input)) {
-    input = "alpha";
-  }
-  if (freqNames.has(input)) {
-    arr = sort_default.byFreq(arr);
-    return this.update(arr.map((o2) => o2.pointer));
-  }
-  if (typeof sort_default[input] === "function") {
-    arr = arr.sort(sort_default[input]);
-    return this.update(arr.map((o2) => o2.pointer));
-  }
-  return this;
-};
-var reverse = function() {
-  let ptrs = this.pointer || this.docs.map((_d, n3) => [n3]);
-  ptrs = [].concat(ptrs);
-  ptrs = ptrs.reverse();
-  if (this._cache) {
-    this._cache = this._cache.reverse();
-  }
-  return this.update(ptrs);
-};
-var unique = function() {
-  let already = /* @__PURE__ */ new Set();
-  let res = this.filter((m3) => {
-    let txt = m3.text("machine");
-    if (already.has(txt)) {
-      return false;
-    }
-    already.add(txt);
-    return true;
-  });
-  return res;
-};
-var sort_default2 = { unique, reverse, sort };
-
-// node_modules/compromise/src/1-one/change/api/concat.js
-var isArray4 = (arr) => Object.prototype.toString.call(arr) === "[object Array]";
-var combineDocs = function(homeDocs, inputDocs) {
-  if (homeDocs.length > 0) {
-    let end2 = homeDocs[homeDocs.length - 1];
-    let last = end2[end2.length - 1];
-    if (/ /.test(last.post) === false) {
-      last.post += " ";
-    }
-  }
-  homeDocs = homeDocs.concat(inputDocs);
-  return homeDocs;
-};
-var combineViews = function(home, input) {
-  if (home.document === input.document) {
-    let ptrs2 = home.fullPointer.concat(input.fullPointer);
-    return home.toView(ptrs2).compute("index");
-  }
-  let ptrs = input.fullPointer;
-  ptrs.forEach((a2) => {
-    a2[0] += home.document.length;
-  });
-  home.document = combineDocs(home.document, input.docs);
-  return home.all();
-};
-var concat_default = {
-  concat: function(input) {
-    if (typeof input === "string") {
-      let more = this.fromText(input);
-      if (!this.found || !this.ptrs) {
-        this.document = this.document.concat(more.document);
-      } else {
-        let ptrs = this.fullPointer;
-        let at = ptrs[ptrs.length - 1][0];
-        this.document.splice(at, 0, ...more.document);
-      }
-      return this.all().compute("index");
-    }
-    if (typeof input === "object" && input.isView) {
-      return combineViews(this, input);
-    }
-    if (isArray4(input)) {
-      let docs = combineDocs(this.document, input);
-      this.document = docs;
-      return this.all();
-    }
-    return this;
-  }
-};
-
-// node_modules/compromise/src/1-one/change/api/harden.js
-var harden = function() {
-  this.ptrs = this.fullPointer;
-  return this;
-};
-var soften = function() {
-  let ptr = this.ptrs;
-  if (!ptr || ptr.length < 1) {
-    return this;
-  }
-  ptr = ptr.map((a2) => a2.slice(0, 3));
-  this.ptrs = ptr;
-  return this;
-};
-var harden_default = { harden, soften };
-
-// node_modules/compromise/src/1-one/change/api/index.js
-var methods6 = Object.assign({}, case_default, insert_default, replace_default, remove_default2, whitespace_default, sort_default2, concat_default, harden_default);
-var addAPI2 = function(View2) {
-  Object.assign(View2.prototype, methods6);
-};
-var api_default2 = addAPI2;
-
-// node_modules/compromise/src/1-one/change/compute/index.js
-var compute2 = {
-  id: function(view) {
-    let docs = view.docs;
-    for (let n3 = 0; n3 < docs.length; n3 += 1) {
-      for (let i3 = 0; i3 < docs[n3].length; i3 += 1) {
-        let term = docs[n3][i3];
-        term.id = term.id || uuid_default(term);
-      }
-    }
-  }
-};
-var compute_default3 = compute2;
-
-// node_modules/compromise/src/1-one/change/plugin.js
-var plugin_default2 = {
-  api: api_default2,
-  compute: compute_default3
-};
-
-// node_modules/compromise/src/1-one/contraction-one/model/contractions.js
-var contractions_default = [
-  { word: "@", out: ["at"] },
-  { word: "alot", out: ["a", "lot"] },
-  { word: "brb", out: ["be", "right", "back"] },
-  { word: "cannot", out: ["can", "not"] },
-  { word: "cant", out: ["can", "not"] },
-  { word: "dont", out: ["do", "not"] },
-  { word: "dun", out: ["do", "not"] },
-  { word: "wont", out: ["will", "not"] },
-  { word: "can't", out: ["can", "not"] },
-  { word: "shan't", out: ["should", "not"] },
-  { word: "won't", out: ["will", "not"] },
-  { word: "that's", out: ["that", "is"] },
-  { word: "what's", out: ["what", "is"] },
-  { word: "let's", out: ["let", "us"] },
-  { word: "there's", out: ["there", "is"] },
-  { word: "dunno", out: ["do", "not", "know"] },
-  { word: "gonna", out: ["going", "to"] },
-  { word: "gotta", out: ["have", "got", "to"] },
-  { word: "gimme", out: ["give", "me"] },
-  { word: "tryna", out: ["trying", "to"] },
-  { word: "gtg", out: ["got", "to", "go"] },
-  { word: "im", out: ["i", "am"] },
-  { word: "imma", out: ["I", "will"] },
-  { word: "imo", out: ["in", "my", "opinion"] },
-  { word: "irl", out: ["in", "real", "life"] },
-  { word: "ive", out: ["i", "have"] },
-  { word: "rn", out: ["right", "now"] },
-  { word: "tbh", out: ["to", "be", "honest"] },
-  { word: "wanna", out: ["want", "to"] },
-  { word: `c'mere`, out: ["come", "here"] },
-  { word: `c'mon`, out: ["come", "on"] },
-  { word: "howd", out: ["how", "did"] },
-  { word: "whatd", out: ["what", "did"] },
-  { word: "whend", out: ["when", "did"] },
-  { word: "whered", out: ["where", "did"] },
-  { word: "shoulda", out: ["should", "have"] },
-  { word: "coulda", out: ["coulda", "have"] },
-  { word: "woulda", out: ["woulda", "have"] },
-  { word: "musta", out: ["must", "have"] },
-  { word: "tis", out: ["it", "is"] },
-  { word: "twas", out: ["it", "was"] },
-  { word: `y'know`, out: ["you", "know"] },
-  { word: "ne'er", out: ["never"] },
-  { word: "o'er", out: ["over"] },
-  { after: "ll", out: ["will"] },
-  { after: "ve", out: ["have"] },
-  { after: "re", out: ["are"] },
-  { after: "m", out: ["am"] },
-  { before: "c", out: ["ce"] },
-  { before: "m", out: ["me"] },
-  { before: "n", out: ["ne"] },
-  { before: "qu", out: ["que"] },
-  { before: "s", out: ["se"] },
-  { before: "t", out: ["tu"] }
-];
-
-// node_modules/compromise/src/1-one/contraction-one/model/index.js
-var model_default = { one: { contractions: contractions_default } };
-
-// node_modules/compromise/src/1-one/contraction-one/compute/contractions/_splice.js
-var insertContraction = function(document2, point, words) {
-  let [n3, w] = point;
-  if (!words || words.length === 0) {
-    return;
-  }
-  words = words.map((word, i3) => {
-    word.implicit = word.text;
-    word.machine = word.text;
-    word.pre = "";
-    word.post = "";
-    word.text = "";
-    word.normal = "";
-    word.index = [n3, w + i3];
-    return word;
-  });
-  if (words[0]) {
-    words[0].pre = document2[n3][w].pre;
-    words[words.length - 1].post = document2[n3][w].post;
-    words[0].text = document2[n3][w].text;
-    words[0].normal = document2[n3][w].normal;
-  }
-  document2[n3].splice(w, 1, ...words);
-};
-var splice_default = insertContraction;
-
-// node_modules/compromise/src/1-one/contraction-one/compute/contractions/apostrophe-d.js
-var hasContraction = /'/;
-var alwaysDid = /* @__PURE__ */ new Set([
-  "what",
-  "how",
-  "when",
-  "where",
-  "why"
-]);
-var useWould = /* @__PURE__ */ new Set([
-  "be",
-  "go",
-  "start",
-  "think",
-  "need"
-]);
-var useHad = /* @__PURE__ */ new Set([
-  "been",
-  "gone"
-]);
-var _apostropheD = function(terms, i3) {
-  let before2 = terms[i3].normal.split(hasContraction)[0];
-  if (alwaysDid.has(before2)) {
-    return [before2, "did"];
-  }
-  if (terms[i3 + 1]) {
-    if (useHad.has(terms[i3 + 1].normal)) {
-      return [before2, "had"];
-    }
-    if (useWould.has(terms[i3 + 1].normal)) {
-      return [before2, "would"];
-    }
-  }
-  return null;
-};
-var apostrophe_d_default = _apostropheD;
-
-// node_modules/compromise/src/1-one/contraction-one/compute/contractions/apostrophe-t.js
-var apostropheT = function(terms, i3) {
-  if (terms[i3].normal === "ain't" || terms[i3].normal === "aint") {
-    return null;
-  }
-  let before2 = terms[i3].normal.replace(/n't/, "");
-  return [before2, "not"];
-};
-var apostrophe_t_default = apostropheT;
-
-// node_modules/compromise/src/1-one/contraction-one/compute/contractions/french.js
-var hasContraction2 = /'/;
-var preL = (terms, i3) => {
-  let after2 = terms[i3].normal.split(hasContraction2)[1];
-  if (after2 && after2.endsWith("e")) {
-    return ["la", after2];
-  }
-  return ["le", after2];
-};
-var preD = (terms, i3) => {
-  let after2 = terms[i3].normal.split(hasContraction2)[1];
-  if (after2 && after2.endsWith("e")) {
-    return ["du", after2];
-  } else if (after2 && after2.endsWith("s")) {
-    return ["des", after2];
-  }
-  return ["de", after2];
-};
-var preJ = (terms, i3) => {
-  let after2 = terms[i3].normal.split(hasContraction2)[1];
-  return ["je", after2];
-};
-var french_default = {
-  preJ,
-  preL,
-  preD
-};
-
-// node_modules/compromise/src/1-one/contraction-one/compute/contractions/number-range.js
-var isRange = /^([0-9.]{1,4}[a-z]{0,2}) ?[-–—] ?([0-9]{1,4}[a-z]{0,2})$/i;
-var timeRange = /^([0-9]{1,2}(:[0-9][0-9])?(am|pm)?) ?[-–—] ?([0-9]{1,2}(:[0-9][0-9])?(am|pm)?)$/i;
-var phoneNum = /^[0-9]{3}-[0-9]{4}$/;
-var numberRange = function(terms, i3) {
-  let term = terms[i3];
-  let parts = term.text.match(isRange);
-  if (parts !== null) {
-    if (term.tags.has("PhoneNumber") === true || phoneNum.test(term.text)) {
-      return null;
-    }
-    return [parts[1], "to", parts[2]];
-  } else {
-    parts = term.text.match(timeRange);
-    if (parts !== null) {
-      return [parts[1], "to", parts[4]];
-    }
-  }
-  return null;
-};
-var number_range_default = numberRange;
-
-// node_modules/compromise/src/1-one/contraction-one/compute/contractions/number-unit.js
-var numUnit = /^([+-]?[0-9][.,0-9]*)([a-z°²³µ/]+)$/;
-var notUnit = /* @__PURE__ */ new Set([
-  "st",
-  "nd",
-  "rd",
-  "th",
-  "am",
-  "pm",
-  "max",
-  "\xB0",
-  "s",
-  "e"
-]);
-var numberUnit = function(terms, i3) {
-  let term = terms[i3];
-  let parts = term.text.match(numUnit);
-  if (parts !== null) {
-    let unit = parts[2].toLowerCase().trim();
-    if (notUnit.has(unit)) {
-      return null;
-    }
-    return [parts[1], unit];
-  }
-  return null;
-};
-var number_unit_default = numberUnit;
-
-// node_modules/compromise/src/1-one/contraction-one/compute/contractions/index.js
-var byApostrophe = /'/;
-var numDash = /^[0-9][^-–—]*[-–—].*?[0-9]/;
-var reTag = function(terms, view, start2, len) {
-  let tmp = view.update();
-  tmp.document = [terms];
-  let end2 = start2 + len;
-  if (start2 > 0) {
-    start2 -= 1;
-  }
-  if (terms[end2]) {
-    end2 += 1;
-  }
-  tmp.ptrs = [[0, start2, end2]];
-};
-var byEnd = {
-  t: (terms, i3) => apostrophe_t_default(terms, i3),
-  d: (terms, i3) => apostrophe_d_default(terms, i3)
-};
-var byStart = {
-  j: (terms, i3) => french_default.preJ(terms, i3),
-  l: (terms, i3) => french_default.preL(terms, i3),
-  d: (terms, i3) => french_default.preD(terms, i3)
-};
-var knownOnes = function(list4, term, before2, after2) {
-  for (let i3 = 0; i3 < list4.length; i3 += 1) {
-    let o2 = list4[i3];
-    if (o2.word === term.normal) {
-      return o2.out;
-    } else if (after2 !== null && after2 === o2.after) {
-      return [before2].concat(o2.out);
-    } else if (before2 !== null && before2 === o2.before) {
-      return o2.out.concat(after2);
-    }
-  }
-  return null;
-};
-var toDocs = function(words, view) {
-  let doc = view.fromText(words.join(" "));
-  doc.compute(["id", "alias"]);
-  return doc.docs[0];
-};
-var contractions = (view) => {
-  let { world: world2, document: document2 } = view;
-  const { model: model5, methods: methods16 } = world2;
-  let list4 = model5.one.contractions || [];
-  let units = new Set(model5.one.units || []);
-  document2.forEach((terms, n3) => {
-    for (let i3 = terms.length - 1; i3 >= 0; i3 -= 1) {
-      let before2 = null;
-      let after2 = null;
-      if (byApostrophe.test(terms[i3].normal) === true) {
-        [before2, after2] = terms[i3].normal.split(byApostrophe);
-      }
-      let words = knownOnes(list4, terms[i3], before2, after2);
-      if (!words && byEnd.hasOwnProperty(after2)) {
-        words = byEnd[after2](terms, i3, world2);
-      }
-      if (!words && byStart.hasOwnProperty(before2)) {
-        words = byStart[before2](terms, i3);
-      }
-      if (words) {
-        words = toDocs(words, view);
-        splice_default(document2, [n3, i3], words);
-        reTag(document2[n3], view, i3, words.length);
-        continue;
-      }
-      if (numDash.test(terms[i3].normal)) {
-        words = number_range_default(terms, i3);
-        if (words) {
-          words = toDocs(words, view);
-          splice_default(document2, [n3, i3], words);
-          methods16.one.setTag(words, "NumberRange", world2);
-          if (words[2] && words[2].tags.has("Time")) {
-            methods16.one.setTag([words[0]], "Time", world2, null, "time-range");
-          }
-          reTag(document2[n3], view, i3, words.length);
-        }
-        continue;
-      }
-      words = number_unit_default(terms, i3, units);
-      if (words) {
-        words = toDocs(words, view);
-        splice_default(document2, [n3, i3], words);
-        methods16.one.setTag([words[1]], "Unit", world2, null, "contraction-unit");
-      }
-    }
-  });
-};
-var contractions_default2 = contractions;
-
-// node_modules/compromise/src/1-one/contraction-one/compute/index.js
-var compute_default4 = { contractions: contractions_default2 };
-
-// node_modules/compromise/src/1-one/contraction-one/plugin.js
-var plugin = {
-  model: model_default,
-  compute: compute_default4,
-  hooks: ["contractions"]
-};
-var plugin_default3 = plugin;
-
-// node_modules/compromise/src/1-one/lexicon/compute/multi-word.js
-var checkMulti = function(terms, i3, lexicon4, setTag3, world2) {
-  let max3 = i3 + 4 > terms.length ? terms.length - i3 : 4;
-  let str = terms[i3].machine || terms[i3].normal;
-  for (let skip = 1; skip < max3; skip += 1) {
-    let t2 = terms[i3 + skip];
-    let word = t2.machine || t2.normal;
-    str += " " + word;
-    if (lexicon4.hasOwnProperty(str) === true) {
-      let tag = lexicon4[str];
-      let ts = terms.slice(i3, i3 + skip + 1);
-      setTag3(ts, tag, world2, false, "1-multi-lexicon");
-      if (tag && tag.length === 2 && (tag[0] === "PhrasalVerb" || tag[1] === "PhrasalVerb")) {
-        setTag3([ts[1]], "Particle", world2, false, "1-phrasal-particle");
-      }
-      return true;
-    }
-  }
-  return false;
-};
-var multiWord = function(terms, i3, world2) {
-  const { model: model5, methods: methods16 } = world2;
-  const setTag3 = methods16.one.setTag;
-  const multi = model5.one._multiCache || {};
-  const lexicon4 = model5.one.lexicon || {};
-  let t2 = terms[i3];
-  let word = t2.machine || t2.normal;
-  if (terms[i3 + 1] !== void 0 && multi[word] === true) {
-    return checkMulti(terms, i3, lexicon4, setTag3, world2);
-  }
-  return null;
-};
-var multi_word_default = multiWord;
-
-// node_modules/compromise/src/1-one/lexicon/compute/single-word.js
-var prefix = /^(under|over|mis|re|un|dis|semi|pre|post)-?/;
-var allowPrefix = /* @__PURE__ */ new Set(["Verb", "Infinitive", "PastTense", "Gerund", "PresentTense", "Adjective", "Participle"]);
-var checkLexicon = function(terms, i3, world2) {
-  const { model: model5, methods: methods16 } = world2;
-  const setTag3 = methods16.one.setTag;
-  const lexicon4 = model5.one.lexicon;
-  let t2 = terms[i3];
-  let word = t2.machine || t2.normal;
-  if (lexicon4[word] !== void 0 && lexicon4.hasOwnProperty(word)) {
-    let tag = lexicon4[word];
-    setTag3([t2], tag, world2, false, "1-lexicon");
-    return true;
-  }
-  if (t2.alias) {
-    let found = t2.alias.find((str) => lexicon4.hasOwnProperty(str));
-    if (found) {
-      let tag = lexicon4[found];
-      setTag3([t2], tag, world2, false, "1-lexicon-alias");
-      return true;
-    }
-  }
-  if (prefix.test(word) === true) {
-    let stem = word.replace(prefix, "");
-    if (lexicon4.hasOwnProperty(stem) && stem.length > 3) {
-      if (allowPrefix.has(lexicon4[stem])) {
-        setTag3([t2], lexicon4[stem], world2, false, "1-lexicon-prefix");
-        return true;
-      }
-    }
-  }
-  return null;
-};
-var single_word_default = checkLexicon;
-
-// node_modules/compromise/src/1-one/lexicon/compute/index.js
-var lexicon = function(view) {
-  const world2 = view.world;
-  view.docs.forEach((terms) => {
-    for (let i3 = 0; i3 < terms.length; i3 += 1) {
-      if (terms[i3].tags.size === 0) {
-        let found = null;
-        found = found || multi_word_default(terms, i3, world2);
-        found = found || single_word_default(terms, i3, world2);
-      }
-    }
-  });
-};
-var compute_default5 = {
-  lexicon
-};
-
-// node_modules/compromise/src/1-one/lexicon/methods/expand.js
-var expand2 = function(words) {
-  let lex = {};
-  let _multi = {};
-  Object.keys(words).forEach((word) => {
-    let tag = words[word];
-    word = word.toLowerCase().trim();
-    word = word.replace(/'s\b/, "");
-    let split3 = word.split(/ /);
-    if (split3.length > 1) {
-      _multi[split3[0]] = true;
-    }
-    lex[word] = lex[word] || tag;
-  });
-  delete lex[""];
-  delete lex[null];
-  delete lex[" "];
-  return { lex, _multi };
-};
-var expand_default = expand2;
-
-// node_modules/compromise/src/1-one/lexicon/methods/index.js
-var methods_default3 = {
-  one: {
-    expandLexicon: expand_default
-  }
-};
-
-// node_modules/compromise/src/1-one/lexicon/lib.js
-var addWords = function(words) {
-  const world2 = this.world();
-  const { methods: methods16, model: model5 } = world2;
-  if (!words) {
-    return;
-  }
-  Object.keys(words).forEach((k2) => {
-    if (typeof words[k2] === "string" && words[k2].startsWith("#")) {
-      words[k2] = words[k2].replace(/^#/, "");
-    }
-  });
-  if (methods16.two.expandLexicon) {
-    let { lex, _multi } = methods16.two.expandLexicon(words, world2);
-    Object.assign(model5.one.lexicon, lex);
-    Object.assign(model5.one._multiCache, _multi);
-  } else if (methods16.one.expandLexicon) {
-    let { lex, _multi } = methods16.one.expandLexicon(words, world2);
-    Object.assign(model5.one.lexicon, lex);
-    Object.assign(model5.one._multiCache, _multi);
-  } else {
-    Object.assign(model5.one.lexicon, words);
-  }
-};
-var lib_default = { addWords };
-
-// node_modules/compromise/src/1-one/lexicon/plugin.js
-var model2 = {
-  one: {
-    lexicon: {},
-    _multiCache: {}
-  }
-};
-var plugin_default4 = {
-  model: model2,
-  methods: methods_default3,
-  compute: compute_default5,
-  lib: lib_default,
-  hooks: ["lexicon"]
-};
-
-// node_modules/compromise/src/1-one/lookup/api/buildTrie/index.js
-var tokenize = function(phrase, world2) {
-  const { methods: methods16, model: model5 } = world2;
-  let terms = methods16.one.tokenize.splitTerms(phrase, model5).map((t2) => methods16.one.tokenize.splitWhitespace(t2, model5));
-  return terms.map((term) => term.text.toLowerCase());
-};
-var buildTrie = function(phrases, world2) {
-  let goNext = [{}];
-  let endAs = [null];
-  let failTo = [0];
-  let xs = [];
-  let n3 = 0;
-  phrases.forEach(function(phrase) {
-    let curr = 0;
-    let words = tokenize(phrase, world2);
-    for (let i3 = 0; i3 < words.length; i3++) {
-      let word = words[i3];
-      if (goNext[curr] && goNext[curr].hasOwnProperty(word)) {
-        curr = goNext[curr][word];
-      } else {
-        n3++;
-        goNext[curr][word] = n3;
-        goNext[n3] = {};
-        curr = n3;
-        endAs[n3] = null;
-      }
-    }
-    endAs[curr] = [words.length];
-  });
-  for (let word in goNext[0]) {
-    n3 = goNext[0][word];
-    failTo[n3] = 0;
-    xs.push(n3);
-  }
-  while (xs.length) {
-    let r2 = xs.shift();
-    let keys = Object.keys(goNext[r2]);
-    for (let i3 = 0; i3 < keys.length; i3 += 1) {
-      let word = keys[i3];
-      let s3 = goNext[r2][word];
-      xs.push(s3);
-      n3 = failTo[r2];
-      while (n3 > 0 && !goNext[n3].hasOwnProperty(word)) {
-        n3 = failTo[n3];
-      }
-      if (goNext.hasOwnProperty(n3)) {
-        let fs = goNext[n3][word];
-        failTo[s3] = fs;
-        if (endAs[fs]) {
-          endAs[s3] = endAs[s3] || [];
-          endAs[s3] = endAs[s3].concat(endAs[fs]);
-        }
-      } else {
-        failTo[s3] = 0;
-      }
-    }
-  }
-  return { goNext, endAs, failTo };
-};
-var buildTrie_default = buildTrie;
-
-// node_modules/compromise/src/1-one/lookup/api/scan.js
-var scanWords = function(terms, trie, opts2) {
-  let n3 = 0;
-  let results = [];
-  for (let i3 = 0; i3 < terms.length; i3++) {
-    let word = terms[i3][opts2.form] || terms[i3].normal;
-    while (n3 > 0 && (trie.goNext[n3] === void 0 || !trie.goNext[n3].hasOwnProperty(word))) {
-      n3 = trie.failTo[n3] || 0;
-    }
-    if (!trie.goNext[n3].hasOwnProperty(word)) {
-      continue;
-    }
-    n3 = trie.goNext[n3][word];
-    if (trie.endAs[n3]) {
-      let arr = trie.endAs[n3];
-      for (let o2 = 0; o2 < arr.length; o2++) {
-        let len = arr[o2];
-        let term = terms[i3 - len + 1];
-        let [no, start2] = term.index;
-        results.push([no, start2, start2 + len, term.id]);
-      }
-    }
-  }
-  return results;
-};
-var cacheMiss = function(words, cache2) {
-  for (let i3 = 0; i3 < words.length; i3 += 1) {
-    if (cache2.has(words[i3]) === true) {
-      return false;
-    }
-  }
-  return true;
-};
-var scan = function(view, trie, opts2) {
-  let results = [];
-  opts2.form = opts2.form || "normal";
-  let docs = view.docs;
-  if (!trie.goNext || !trie.goNext[0]) {
-    console.error("Compromise invalid lookup trie");
-    return view.none();
-  }
-  let firstWords = Object.keys(trie.goNext[0]);
-  for (let i3 = 0; i3 < docs.length; i3++) {
-    if (view._cache && view._cache[i3] && cacheMiss(firstWords, view._cache[i3]) === true) {
-      continue;
-    }
-    let terms = docs[i3];
-    let found = scanWords(terms, trie, opts2);
-    if (found.length > 0) {
-      results = results.concat(found);
-    }
-  }
-  return view.update(results);
-};
-var scan_default = scan;
-
-// node_modules/compromise/src/1-one/lookup/api/index.js
-var isObject3 = (val) => {
-  return Object.prototype.toString.call(val) === "[object Object]";
-};
-function api_default3(View2) {
-  View2.prototype.lookup = function(input, opts2 = {}) {
-    if (!input) {
-      return this.none();
-    }
-    if (typeof input === "string") {
-      input = [input];
-    }
-    let trie = isObject3(input) ? input : buildTrie_default(input, this.world);
-    let res = scan_default(this, trie, opts2);
-    res = res.settle();
-    return res;
-  };
-}
-
-// node_modules/compromise/src/1-one/lookup/api/buildTrie/compress.js
-var truncate = (list4, val) => {
-  for (let i3 = list4.length - 1; i3 >= 0; i3 -= 1) {
-    if (list4[i3] !== val) {
-      list4 = list4.slice(0, i3 + 1);
-      return list4;
-    }
-  }
-  return list4;
-};
-var compress = function(trie) {
-  trie.goNext = trie.goNext.map((o2) => {
-    if (Object.keys(o2).length === 0) {
-      return void 0;
-    }
-    return o2;
-  });
-  trie.goNext = truncate(trie.goNext, void 0);
-  trie.failTo = truncate(trie.failTo, 0);
-  trie.endAs = truncate(trie.endAs, null);
-  return trie;
-};
-var compress_default = compress;
-
-// node_modules/compromise/src/1-one/lookup/plugin.js
-var lib = {
-  buildTrie: function(input) {
-    const trie = buildTrie_default(input, this.world());
-    return compress_default(trie);
-  }
-};
-lib.compile = lib.buildTrie;
-var plugin_default5 = {
-  api: api_default3,
-  lib
-};
-
-// node_modules/compromise/src/1-one/match/api/_lib.js
-var relPointer = function(ptrs, parent) {
-  if (!parent) {
-    return ptrs;
-  }
-  ptrs.forEach((ptr) => {
-    let n3 = ptr[0];
-    if (parent[n3]) {
-      ptr[0] = parent[n3][0];
-      ptr[1] += parent[n3][1];
-      ptr[2] += parent[n3][1];
-    }
-  });
-  return ptrs;
-};
-var fixPointers2 = function(res, parent) {
-  let { ptrs, byGroup } = res;
-  ptrs = relPointer(ptrs, parent);
-  Object.keys(byGroup).forEach((k2) => {
-    byGroup[k2] = relPointer(byGroup[k2], parent);
-  });
-  return { ptrs, byGroup };
-};
-var isObject4 = (val) => {
-  return Object.prototype.toString.call(val) === "[object Object]";
-};
-var isView = (val) => val && isObject4(val) && val.isView === true;
-var isNet = (val) => val && isObject4(val) && val.isNet === true;
-
-// node_modules/compromise/src/1-one/match/api/match.js
-var parseRegs = function(regs, opts2, world2) {
-  const one = world2.methods.one;
-  if (typeof regs === "number") {
-    regs = String(regs);
-  }
-  if (typeof regs === "string") {
-    regs = one.killUnicode(regs, world2);
-    regs = one.parseMatch(regs, opts2, world2);
-  }
-  return regs;
-};
-var match = function(regs, group, opts2) {
-  const one = this.methods.one;
-  if (isView(regs)) {
-    return this.intersection(regs);
-  }
-  if (isNet(regs)) {
-    return this.sweep(regs, { tagger: false }).view.settle();
-  }
-  regs = parseRegs(regs, opts2, this.world);
-  let todo = { regs, group };
-  let res = one.match(this.docs, todo, this._cache);
-  let { ptrs, byGroup } = fixPointers2(res, this.fullPointer);
-  let view = this.toView(ptrs);
-  view._groups = byGroup;
-  return view;
-};
-var matchOne = function(regs, group, opts2) {
-  const one = this.methods.one;
-  if (isView(regs)) {
-    return this.intersection(regs).eq(0);
-  }
-  if (isNet(regs)) {
-    return this.sweep(regs, { tagger: false, matchOne: true }).view;
-  }
-  regs = parseRegs(regs, opts2, this.world);
-  let todo = { regs, group, justOne: true };
-  let res = one.match(this.docs, todo, this._cache);
-  let { ptrs, byGroup } = fixPointers2(res, this.fullPointer);
-  let view = this.toView(ptrs);
-  view._groups = byGroup;
-  return view;
-};
-var has = function(regs, group, opts2) {
-  const one = this.methods.one;
-  if (isView(regs)) {
-    let ptrs2 = regs.fullPointer;
-    return ptrs2.length > 0;
-  }
-  if (isNet(regs)) {
-    return this.sweep(regs, { tagger: false }).view.found;
-  }
-  regs = parseRegs(regs, opts2, this.world);
-  let todo = { regs, group, justOne: true };
-  let ptrs = one.match(this.docs, todo, this._cache).ptrs;
-  return ptrs.length > 0;
-};
-var ifFn = function(regs, group, opts2) {
-  const one = this.methods.one;
-  if (isView(regs)) {
-    return this.filter((m3) => m3.intersection(regs).found);
-  }
-  if (isNet(regs)) {
-    let m3 = this.sweep(regs, { tagger: false }).view.settle();
-    return this.if(m3);
-  }
-  regs = parseRegs(regs, opts2, this.world);
-  let todo = { regs, group, justOne: true };
-  let ptrs = this.fullPointer;
-  let cache2 = this._cache || [];
-  ptrs = ptrs.filter((ptr, i3) => {
-    let m3 = this.update([ptr]);
-    let res = one.match(m3.docs, todo, cache2[i3]).ptrs;
-    return res.length > 0;
-  });
-  let view = this.update(ptrs);
-  if (this._cache) {
-    view._cache = ptrs.map((ptr) => cache2[ptr[0]]);
-  }
-  return view;
-};
-var ifNo = function(regs, group, opts2) {
-  const { methods: methods16 } = this;
-  const one = methods16.one;
-  if (isView(regs)) {
-    return this.filter((m3) => !m3.intersection(regs).found);
-  }
-  if (isNet(regs)) {
-    let m3 = this.sweep(regs, { tagger: false }).view.settle();
-    return this.ifNo(m3);
-  }
-  regs = parseRegs(regs, opts2, this.world);
-  let cache2 = this._cache || [];
-  let view = this.filter((m3, i3) => {
-    let todo = { regs, group, justOne: true };
-    let ptrs = one.match(m3.docs, todo, cache2[i3]).ptrs;
-    return ptrs.length === 0;
-  });
-  if (this._cache) {
-    view._cache = view.ptrs.map((ptr) => cache2[ptr[0]]);
-  }
-  return view;
-};
-var match_default = { matchOne, match, has, if: ifFn, ifNo };
-
-// node_modules/compromise/src/1-one/match/api/lookaround.js
-var before = function(regs, group, opts2) {
-  const { indexN: indexN2 } = this.methods.one.pointer;
-  let pre = [];
-  let byN = indexN2(this.fullPointer);
-  Object.keys(byN).forEach((k2) => {
-    let first = byN[k2].sort((a2, b) => a2[1] > b[1] ? 1 : -1)[0];
-    if (first[1] > 0) {
-      pre.push([first[0], 0, first[1]]);
-    }
-  });
-  let preWords = this.toView(pre);
-  if (!regs) {
-    return preWords;
-  }
-  return preWords.match(regs, group, opts2);
-};
-var after = function(regs, group, opts2) {
-  const { indexN: indexN2 } = this.methods.one.pointer;
-  let post = [];
-  let byN = indexN2(this.fullPointer);
-  let document2 = this.document;
-  Object.keys(byN).forEach((k2) => {
-    let last = byN[k2].sort((a2, b) => a2[1] > b[1] ? -1 : 1)[0];
-    let [n3, , end2] = last;
-    if (end2 < document2[n3].length) {
-      post.push([n3, end2, document2[n3].length]);
-    }
-  });
-  let postWords = this.toView(post);
-  if (!regs) {
-    return postWords;
-  }
-  return postWords.match(regs, group, opts2);
-};
-var growLeft = function(regs, group, opts2) {
-  if (typeof regs === "string") {
-    regs = this.world.methods.one.parseMatch(regs, opts2, this.world);
-  }
-  regs[regs.length - 1].end = true;
-  let ptrs = this.fullPointer;
-  this.forEach((m3, n3) => {
-    let more = m3.before(regs, group);
-    if (more.found) {
-      let terms = more.terms();
-      ptrs[n3][1] -= terms.length;
-      ptrs[n3][3] = terms.docs[0][0].id;
-    }
-  });
-  return this.update(ptrs);
-};
-var growRight = function(regs, group, opts2) {
-  if (typeof regs === "string") {
-    regs = this.world.methods.one.parseMatch(regs, opts2, this.world);
-  }
-  regs[0].start = true;
-  let ptrs = this.fullPointer;
-  this.forEach((m3, n3) => {
-    let more = m3.after(regs, group);
-    if (more.found) {
-      let terms = more.terms();
-      ptrs[n3][2] += terms.length;
-      ptrs[n3][4] = null;
-    }
-  });
-  return this.update(ptrs);
-};
-var grow = function(regs, group, opts2) {
-  return this.growRight(regs, group, opts2).growLeft(regs, group, opts2);
-};
-var lookaround_default = { before, after, growLeft, growRight, grow };
-
-// node_modules/compromise/src/1-one/match/api/split.js
-var combine = function(left, right) {
-  return [left[0], left[1], right[2]];
-};
-var isArray5 = function(arr) {
-  return Object.prototype.toString.call(arr) === "[object Array]";
-};
-var getDoc = (reg, view, group) => {
-  if (typeof reg === "string" || isArray5(reg)) {
-    return view.match(reg, group);
-  }
-  if (!reg) {
-    return view.none();
-  }
-  return reg;
-};
-var addIds2 = function(ptr, view) {
-  let [n3, start2, end2] = ptr;
-  if (view.document[n3] && view.document[n3][start2]) {
-    ptr[3] = ptr[3] || view.document[n3][start2].id;
-    if (view.document[n3][end2 - 1]) {
-      ptr[4] = ptr[4] || view.document[n3][end2 - 1].id;
-    }
-  }
-  return ptr;
-};
-var methods7 = {};
-methods7.splitOn = function(m3, group) {
-  const { splitAll: splitAll2 } = this.methods.one.pointer;
-  let splits = getDoc(m3, this, group).fullPointer;
-  let all4 = splitAll2(this.fullPointer, splits);
-  let res = [];
-  all4.forEach((o2) => {
-    res.push(o2.passthrough);
-    res.push(o2.before);
-    res.push(o2.match);
-    res.push(o2.after);
-  });
-  res = res.filter((p4) => p4);
-  res = res.map((p4) => addIds2(p4, this));
-  return this.update(res);
-};
-methods7.splitBefore = function(m3, group) {
-  const { splitAll: splitAll2 } = this.methods.one.pointer;
-  let splits = getDoc(m3, this, group).fullPointer;
-  let all4 = splitAll2(this.fullPointer, splits);
-  let res = [];
-  all4.forEach((o2) => {
-    res.push(o2.passthrough);
-    res.push(o2.before);
-    if (o2.match && o2.after) {
-      res.push(combine(o2.match, o2.after));
-    } else {
-      res.push(o2.match);
-      res.push(o2.after);
-    }
-  });
-  res = res.filter((p4) => p4);
-  res = res.map((p4) => addIds2(p4, this));
-  return this.update(res);
-};
-methods7.splitAfter = function(m3, group) {
-  const { splitAll: splitAll2 } = this.methods.one.pointer;
-  let splits = getDoc(m3, this, group).fullPointer;
-  let all4 = splitAll2(this.fullPointer, splits);
-  let res = [];
-  all4.forEach((o2) => {
-    res.push(o2.passthrough);
-    if (o2.before && o2.match) {
-      res.push(combine(o2.before, o2.match));
-    } else {
-      res.push(o2.before);
-      res.push(o2.match);
-    }
-    res.push(o2.after);
-  });
-  res = res.filter((p4) => p4);
-  res = res.map((p4) => addIds2(p4, this));
-  return this.update(res);
-};
-methods7.split = methods7.splitAfter;
-var split_default = methods7;
-
-// node_modules/compromise/src/1-one/match/api/index.js
-var methods8 = Object.assign({}, match_default, lookaround_default, split_default);
-methods8.lookBehind = methods8.before;
-methods8.lookBefore = methods8.before;
-methods8.lookAhead = methods8.after;
-methods8.lookAfter = methods8.after;
-methods8.notIf = methods8.ifNo;
-var matchAPI = function(View2) {
-  Object.assign(View2.prototype, methods8);
-};
-var api_default4 = matchAPI;
-
-// node_modules/compromise/src/1-one/match/methods/parseMatch/01-parseBlocks.js
-var bySlashes = /(?:^|\s)([![^]*(?:<[^<]*>)?\/.*?[^\\/]\/[?\]+*$~]*)(?:\s|$)/;
-var byParentheses = /([!~[^]*(?:<[^<]*>)?\([^)]+[^\\)]\)[?\]+*$~]*)(?:\s|$)/;
-var byWord = / /g;
-var isBlock = (str) => {
-  return /^[![^]*(<[^<]*>)?\(/.test(str) && /\)[?\]+*$~]*$/.test(str);
-};
-var isReg = (str) => {
-  return /^[![^]*(<[^<]*>)?\//.test(str) && /\/[?\]+*$~]*$/.test(str);
-};
-var cleanUp = function(arr) {
-  arr = arr.map((str) => str.trim());
-  arr = arr.filter((str) => str);
-  return arr;
-};
-var parseBlocks = function(txt) {
-  let arr = txt.split(bySlashes);
-  let res = [];
-  arr.forEach((str) => {
-    if (isReg(str)) {
-      res.push(str);
-      return;
-    }
-    res = res.concat(str.split(byParentheses));
-  });
-  res = cleanUp(res);
-  let final = [];
-  res.forEach((str) => {
-    if (isBlock(str)) {
-      final.push(str);
-    } else if (isReg(str)) {
-      final.push(str);
-    } else {
-      final = final.concat(str.split(byWord));
-    }
-  });
-  final = cleanUp(final);
-  return final;
-};
-var parseBlocks_default = parseBlocks;
-
-// node_modules/compromise/src/1-one/match/methods/parseMatch/02-parseToken.js
-var hasMinMax = /\{([0-9]+)?(, *[0-9]*)?\}/;
-var andSign = /&&/;
-var captureName = new RegExp(/^<\s*(\S+)\s*>/);
-var titleCase2 = (str) => str.charAt(0).toUpperCase() + str.substring(1);
-var end = (str) => str.charAt(str.length - 1);
-var start = (str) => str.charAt(0);
-var stripStart = (str) => str.substring(1);
-var stripEnd = (str) => str.substring(0, str.length - 1);
-var stripBoth = function(str) {
-  str = stripStart(str);
-  str = stripEnd(str);
-  return str;
-};
-var parseToken = function(w, opts2) {
-  let obj = {};
-  for (let i3 = 0; i3 < 2; i3 += 1) {
-    if (end(w) === "$") {
-      obj.end = true;
-      w = stripEnd(w);
-    }
-    if (start(w) === "^") {
-      obj.start = true;
-      w = stripStart(w);
-    }
-    if (start(w) === "[" || end(w) === "]") {
-      obj.group = null;
-      if (start(w) === "[") {
-        obj.groupStart = true;
-      }
-      if (end(w) === "]") {
-        obj.groupEnd = true;
-      }
-      w = w.replace(/^\[/, "");
-      w = w.replace(/\]$/, "");
-      if (start(w) === "<") {
-        const res = captureName.exec(w);
-        if (res.length >= 2) {
-          obj.group = res[1];
-          w = w.replace(res[0], "");
-        }
-      }
-    }
-    if (end(w) === "+") {
-      obj.greedy = true;
-      w = stripEnd(w);
-    }
-    if (w !== "*" && end(w) === "*" && w !== "\\*") {
-      obj.greedy = true;
-      w = stripEnd(w);
-    }
-    if (end(w) === "?") {
-      obj.optional = true;
-      w = stripEnd(w);
-    }
-    if (start(w) === "!") {
-      obj.negative = true;
-      w = stripStart(w);
-    }
-    if (start(w) === "~" && end(w) === "~" && w.length > 2) {
-      w = stripBoth(w);
-      obj.fuzzy = true;
-      obj.min = opts2.fuzzy || 0.85;
-      if (/\(/.test(w) === false) {
-        obj.word = w;
-        return obj;
-      }
-    }
-    if (start(w) === "(" && end(w) === ")") {
-      if (andSign.test(w)) {
-        obj.choices = w.split(andSign);
-        obj.operator = "and";
-      } else {
-        obj.choices = w.split("|");
-        obj.operator = "or";
-      }
-      obj.choices[0] = stripStart(obj.choices[0]);
-      let last = obj.choices.length - 1;
-      obj.choices[last] = stripEnd(obj.choices[last]);
-      obj.choices = obj.choices.map((s3) => s3.trim());
-      obj.choices = obj.choices.filter((s3) => s3);
-      obj.choices = obj.choices.map((str) => {
-        return str.split(/ /g).map((s3) => parseToken(s3, opts2));
-      });
-      w = "";
-    }
-    if (start(w) === "/" && end(w) === "/") {
-      w = stripBoth(w);
-      if (opts2.caseSensitive) {
-        obj.use = "text";
-      }
-      obj.regex = new RegExp(w);
-      return obj;
-    }
-    if (start(w) === "{" && end(w) === "}") {
-      w = stripBoth(w);
-      obj.root = w;
-      if (/\//.test(w)) {
-        let split3 = obj.root.split(/\//);
-        obj.root = split3[0];
-        obj.pos = split3[1];
-        if (obj.pos === "adj") {
-          obj.pos = "Adjective";
-        }
-        obj.pos = obj.pos.charAt(0).toUpperCase() + obj.pos.substr(1).toLowerCase();
-        if (split3[2] !== void 0) {
-          obj.sense = split3[2];
-        }
-      }
-      return obj;
-    }
-    if (start(w) === "<" && end(w) === ">") {
-      w = stripBoth(w);
-      obj.chunk = titleCase2(w);
-      obj.greedy = true;
-      return obj;
-    }
-    if (start(w) === "%" && end(w) === "%") {
-      w = stripBoth(w);
-      obj.switch = w;
-      return obj;
-    }
-  }
-  if (hasMinMax.test(w) === true) {
-    w = w.replace(hasMinMax, (_a, b, c2) => {
-      if (c2 === void 0) {
-        obj.min = Number(b);
-        obj.max = Number(b);
-      } else {
-        c2 = c2.replace(/, */, "");
-        if (b === void 0) {
-          obj.min = 0;
-          obj.max = Number(c2);
-        } else {
-          obj.min = Number(b);
-          obj.max = Number(c2 || 999);
-        }
-      }
-      obj.greedy = true;
-      if (!obj.min) {
-        obj.optional = true;
-      }
-      return "";
-    });
-  }
-  if (start(w) === "#") {
-    obj.tag = stripStart(w);
-    obj.tag = titleCase2(obj.tag);
-    return obj;
-  }
-  if (start(w) === "@") {
-    obj.method = stripStart(w);
-    return obj;
-  }
-  if (w === ".") {
-    obj.anything = true;
-    return obj;
-  }
-  if (w === "*") {
-    obj.anything = true;
-    obj.greedy = true;
-    obj.optional = true;
-    return obj;
-  }
-  if (w) {
-    w = w.replace("\\*", "*");
-    w = w.replace("\\.", ".");
-    if (opts2.caseSensitive) {
-      obj.use = "text";
-    } else {
-      w = w.toLowerCase();
-    }
-    obj.word = w;
-  }
-  return obj;
-};
-var parseToken_default = parseToken;
-
-// node_modules/compromise/src/1-one/match/methods/parseMatch/03-splitHyphens.js
-var hasDash = /[a-z0-9][-–—][a-z]/i;
-var splitHyphens = function(regs, world2) {
-  let prefixes2 = world2.model.one.prefixes;
-  for (let i3 = regs.length - 1; i3 >= 0; i3 -= 1) {
-    let reg = regs[i3];
-    if (reg.word && hasDash.test(reg.word)) {
-      let words = reg.word.split(/[-–—]/g);
-      if (prefixes2.hasOwnProperty(words[0])) {
-        continue;
-      }
-      words = words.filter((w) => w).reverse();
-      regs.splice(i3, 1);
-      words.forEach((w) => {
-        let obj = Object.assign({}, reg);
-        obj.word = w;
-        regs.splice(i3, 0, obj);
-      });
-    }
-  }
-  return regs;
-};
-var splitHyphens_default = splitHyphens;
-
-// node_modules/compromise/src/1-one/match/methods/parseMatch/04-inflect-root.js
-var addVerbs = function(token, world2) {
-  let { all: all4 } = world2.methods.two.transform.verb || {};
-  let str = token.root;
-  if (!all4) {
-    return [];
-  }
-  return all4(str, world2.model);
-};
-var addNoun = function(token, world2) {
-  let { all: all4 } = world2.methods.two.transform.noun || {};
-  if (!all4) {
-    return [token.root];
-  }
-  return all4(token.root, world2.model);
-};
-var addAdjective = function(token, world2) {
-  let { all: all4 } = world2.methods.two.transform.adjective || {};
-  if (!all4) {
-    return [token.root];
-  }
-  return all4(token.root, world2.model);
-};
-var inflectRoot = function(regs, world2) {
-  regs = regs.map((token) => {
-    if (token.root) {
-      if (world2.methods.two && world2.methods.two.transform) {
-        let choices = [];
-        if (token.pos) {
-          if (token.pos === "Verb") {
-            choices = choices.concat(addVerbs(token, world2));
-          } else if (token.pos === "Noun") {
-            choices = choices.concat(addNoun(token, world2));
-          } else if (token.pos === "Adjective") {
-            choices = choices.concat(addAdjective(token, world2));
-          }
-        } else {
-          choices = choices.concat(addVerbs(token, world2));
-          choices = choices.concat(addNoun(token, world2));
-          choices = choices.concat(addAdjective(token, world2));
-        }
-        choices = choices.filter((str) => str);
-        if (choices.length > 0) {
-          token.operator = "or";
-          token.fastOr = new Set(choices);
-        }
-      } else {
-        token.machine = token.root;
-        delete token.id;
-        delete token.root;
-      }
-    }
-    return token;
-  });
-  return regs;
-};
-var inflect_root_default = inflectRoot;
-
-// node_modules/compromise/src/1-one/match/methods/parseMatch/05-postProcess.js
-var nameGroups = function(regs) {
-  let index3 = 0;
-  let inGroup = null;
-  for (let i3 = 0; i3 < regs.length; i3++) {
-    const token = regs[i3];
-    if (token.groupStart === true) {
-      inGroup = token.group;
-      if (inGroup === null) {
-        inGroup = String(index3);
-        index3 += 1;
-      }
-    }
-    if (inGroup !== null) {
-      token.group = inGroup;
-    }
-    if (token.groupEnd === true) {
-      inGroup = null;
-    }
-  }
-  return regs;
-};
-var doFastOrMode = function(tokens) {
-  return tokens.map((token) => {
-    if (token.choices !== void 0) {
-      if (token.operator !== "or") {
-        return token;
-      }
-      if (token.fuzzy === true) {
-        return token;
-      }
-      let shouldPack = token.choices.every((block) => {
-        if (block.length !== 1) {
-          return false;
-        }
-        let reg = block[0];
-        if (reg.fuzzy === true) {
-          return false;
-        }
-        if (reg.start || reg.end) {
-          return false;
-        }
-        if (reg.word !== void 0 && reg.negative !== true && reg.optional !== true && reg.method !== true) {
-          return true;
-        }
-        return false;
-      });
-      if (shouldPack === true) {
-        token.fastOr = /* @__PURE__ */ new Set();
-        token.choices.forEach((block) => {
-          token.fastOr.add(block[0].word);
-        });
-        delete token.choices;
-      }
-    }
-    return token;
-  });
-};
-var fuzzyOr = function(regs) {
-  return regs.map((reg) => {
-    if (reg.fuzzy && reg.choices) {
-      reg.choices.forEach((r2) => {
-        if (r2.length === 1 && r2[0].word) {
-          r2[0].fuzzy = true;
-          r2[0].min = reg.min;
-        }
-      });
-    }
-    return reg;
-  });
-};
-var postProcess = function(regs) {
-  regs = nameGroups(regs);
-  regs = doFastOrMode(regs);
-  regs = fuzzyOr(regs);
-  return regs;
-};
-var postProcess_default = postProcess;
-
-// node_modules/compromise/src/1-one/match/methods/parseMatch/index.js
-var syntax = function(input, opts2, world2) {
-  if (input === null || input === void 0 || input === "") {
-    return [];
-  }
-  opts2 = opts2 || {};
-  if (typeof input === "number") {
-    input = String(input);
-  }
-  let tokens = parseBlocks_default(input);
-  tokens = tokens.map((str) => parseToken_default(str, opts2));
-  tokens = splitHyphens_default(tokens, world2);
-  tokens = inflect_root_default(tokens, world2);
-  tokens = postProcess_default(tokens, opts2);
-  return tokens;
-};
-var parseMatch_default = syntax;
-
-// node_modules/compromise/src/1-one/match/methods/match/01-failFast.js
-var anyIntersection = function(setA, setB) {
-  for (let elem of setB) {
-    if (setA.has(elem)) {
-      return true;
-    }
-  }
-  return false;
-};
-var failFast = function(regs, cache2) {
-  for (let i3 = 0; i3 < regs.length; i3 += 1) {
-    let reg = regs[i3];
-    if (reg.optional === true || reg.negative === true || reg.fuzzy === true) {
-      continue;
-    }
-    if (reg.word !== void 0 && cache2.has(reg.word) === false) {
-      return true;
-    }
-    if (reg.tag !== void 0 && cache2.has("#" + reg.tag) === false) {
-      return true;
-    }
-    if (reg.fastOr && anyIntersection(reg.fastOr, cache2) === false) {
-      return false;
-    }
-  }
-  return false;
-};
-var failFast_default = failFast;
-
-// node_modules/compromise/src/1-one/match/methods/match/term/_fuzzy.js
-var editDistance = function(strA, strB) {
-  let aLength = strA.length, bLength = strB.length;
-  if (aLength === 0) {
-    return bLength;
-  }
-  if (bLength === 0) {
-    return aLength;
-  }
-  let limit = (bLength > aLength ? bLength : aLength) + 1;
-  if (Math.abs(aLength - bLength) > (limit || 100)) {
-    return limit || 100;
-  }
-  let matrix = [];
-  for (let i3 = 0; i3 < limit; i3++) {
-    matrix[i3] = [i3];
-    matrix[i3].length = limit;
-  }
-  for (let i3 = 0; i3 < limit; i3++) {
-    matrix[0][i3] = i3;
-  }
-  let j2, a_index, b_index, cost, min2, t2;
-  for (let i3 = 1; i3 <= aLength; ++i3) {
-    a_index = strA[i3 - 1];
-    for (j2 = 1; j2 <= bLength; ++j2) {
-      if (i3 === j2 && matrix[i3][j2] > 4) {
-        return aLength;
-      }
-      b_index = strB[j2 - 1];
-      cost = a_index === b_index ? 0 : 1;
-      min2 = matrix[i3 - 1][j2] + 1;
-      if ((t2 = matrix[i3][j2 - 1] + 1) < min2)
-        min2 = t2;
-      if ((t2 = matrix[i3 - 1][j2 - 1] + cost) < min2)
-        min2 = t2;
-      let shouldUpdate = i3 > 1 && j2 > 1 && a_index === strB[j2 - 2] && strA[i3 - 2] === b_index && (t2 = matrix[i3 - 2][j2 - 2] + cost) < min2;
-      if (shouldUpdate) {
-        matrix[i3][j2] = t2;
-      } else {
-        matrix[i3][j2] = min2;
-      }
-    }
-  }
-  return matrix[aLength][bLength];
-};
-var fuzzyMatch = function(strA, strB, minLength = 3) {
-  if (strA === strB) {
-    return 1;
-  }
-  if (strA.length < minLength || strB.length < minLength) {
-    return 0;
-  }
-  const steps = editDistance(strA, strB);
-  let length2 = Math.max(strA.length, strB.length);
-  let relative2 = length2 === 0 ? 0 : steps / length2;
-  let similarity = 1 - relative2;
-  return similarity;
-};
-var fuzzy_default = fuzzyMatch;
-
-// node_modules/compromise/src/1-one/match/methods/termMethods.js
-var startQuote = /([\u0022\uFF02\u0027\u201C\u2018\u201F\u201B\u201E\u2E42\u201A\u00AB\u2039\u2035\u2036\u2037\u301D\u0060\u301F])/;
-var endQuote = /([\u0022\uFF02\u0027\u201D\u2019\u00BB\u203A\u2032\u2033\u2034\u301E\u00B4])/;
-var hasHyphen = /^[-–—]$/;
-var hasDash2 = / [-–—]{1,3} /;
-var hasPost = (term, punct) => term.post.indexOf(punct) !== -1;
-var hasPre = (term, punct) => term.pre.indexOf(punct) !== -1;
-var methods9 = {
-  hasQuote: (term) => startQuote.test(term.pre) || endQuote.test(term.post),
-  hasComma: (term) => hasPost(term, ","),
-  hasPeriod: (term) => hasPost(term, ".") === true && hasPost(term, "...") === false,
-  hasExclamation: (term) => hasPost(term, "!"),
-  hasQuestionMark: (term) => hasPost(term, "?") || hasPost(term, "\xBF"),
-  hasEllipses: (term) => hasPost(term, "..") || hasPost(term, "\u2026") || hasPre(term, "..") || hasPre(term, "\u2026"),
-  hasSemicolon: (term) => hasPost(term, ";"),
-  hasColon: (term) => hasPost(term, ":"),
-  hasSlash: (term) => /\//.test(term.text),
-  hasHyphen: (term) => hasHyphen.test(term.post) || hasHyphen.test(term.pre),
-  hasDash: (term) => hasDash2.test(term.post) || hasDash2.test(term.pre),
-  hasContraction: (term) => Boolean(term.implicit),
-  isAcronym: (term) => term.tags.has("Acronym"),
-  isKnown: (term) => term.tags.size > 0,
-  isTitleCase: (term) => /^\p{Lu}[a-z'\u00C0-\u00FF]/u.test(term.text),
-  isUpperCase: (term) => /^\p{Lu}+$/u.test(term.text)
-};
-methods9.hasQuotation = methods9.hasQuote;
-var termMethods_default = methods9;
-
-// node_modules/compromise/src/1-one/match/methods/match/term/doesMatch.js
-var wrapMatch = function() {
-};
-var doesMatch = function(term, reg, index3, length2) {
-  if (reg.anything === true) {
-    return true;
-  }
-  if (reg.start === true && index3 !== 0) {
-    return false;
-  }
-  if (reg.end === true && index3 !== length2 - 1) {
-    return false;
-  }
-  if (reg.id !== void 0 && reg.id === term.id) {
-    return true;
-  }
-  if (reg.word !== void 0) {
-    if (reg.use) {
-      return reg.word === term[reg.use];
-    }
-    if (term.machine !== null && term.machine === reg.word) {
-      return true;
-    }
-    if (term.alias !== void 0 && term.alias.hasOwnProperty(reg.word)) {
-      return true;
-    }
-    if (reg.fuzzy === true) {
-      if (reg.word === term.root) {
-        return true;
-      }
-      let score = fuzzy_default(reg.word, term.normal);
-      if (score >= reg.min) {
-        return true;
-      }
-    }
-    if (term.alias && term.alias.some((str) => str === reg.word)) {
-      return true;
-    }
-    return reg.word === term.text || reg.word === term.normal;
-  }
-  if (reg.tag !== void 0) {
-    return term.tags.has(reg.tag) === true;
-  }
-  if (reg.method !== void 0) {
-    if (typeof termMethods_default[reg.method] === "function" && termMethods_default[reg.method](term) === true) {
-      return true;
-    }
-    return false;
-  }
-  if (reg.pre !== void 0) {
-    return term.pre && term.pre.includes(reg.pre);
-  }
-  if (reg.post !== void 0) {
-    return term.post && term.post.includes(reg.post);
-  }
-  if (reg.regex !== void 0) {
-    let str = term.normal;
-    if (reg.use) {
-      str = term[reg.use];
-    }
-    return reg.regex.test(str);
-  }
-  if (reg.chunk !== void 0) {
-    return term.chunk === reg.chunk;
-  }
-  if (reg.switch !== void 0) {
-    return term.switch === reg.switch;
-  }
-  if (reg.machine !== void 0) {
-    return term.normal === reg.machine || term.machine === reg.machine || term.root === reg.machine;
-  }
-  if (reg.sense !== void 0) {
-    return term.sense === reg.sense;
-  }
-  if (reg.fastOr !== void 0) {
-    if (reg.pos && !term.tags.has(reg.pos)) {
-      return null;
-    }
-    let str = term.root || term.implicit || term.machine || term.normal;
-    return reg.fastOr.has(str) || reg.fastOr.has(term.text);
-  }
-  if (reg.choices !== void 0) {
-    if (reg.operator === "and") {
-      return reg.choices.every((r2) => wrapMatch(term, r2, index3, length2));
-    }
-    return reg.choices.some((r2) => wrapMatch(term, r2, index3, length2));
-  }
-  return false;
-};
-wrapMatch = function(t2, reg, index3, length2) {
-  let result = doesMatch(t2, reg, index3, length2);
-  if (reg.negative === true) {
-    return !result;
-  }
-  return result;
-};
-var doesMatch_default = wrapMatch;
-
-// node_modules/compromise/src/1-one/match/methods/match/steps/logic/greedy.js
-var getGreedy = function(state, endReg) {
-  let reg = Object.assign({}, state.regs[state.r], { start: false, end: false });
-  let start2 = state.t;
-  for (; state.t < state.terms.length; state.t += 1) {
-    if (endReg && doesMatch_default(state.terms[state.t], endReg, state.start_i + state.t, state.phrase_length)) {
-      return state.t;
-    }
-    let count = state.t - start2 + 1;
-    if (reg.max !== void 0 && count === reg.max) {
-      return state.t;
-    }
-    if (doesMatch_default(state.terms[state.t], reg, state.start_i + state.t, state.phrase_length) === false) {
-      if (reg.min !== void 0 && count < reg.min) {
-        return null;
-      }
-      return state.t;
-    }
-  }
-  return state.t;
-};
-var greedyTo = function(state, nextReg) {
-  let t2 = state.t;
-  if (!nextReg) {
-    return state.terms.length;
-  }
-  for (; t2 < state.terms.length; t2 += 1) {
-    if (doesMatch_default(state.terms[t2], nextReg, state.start_i + t2, state.phrase_length) === true) {
-      return t2;
-    }
-  }
-  return null;
-};
-var isEndGreedy = function(reg, state) {
-  if (reg.end === true && reg.greedy === true) {
-    if (state.start_i + state.t < state.phrase_length - 1) {
-      let tmpReg = Object.assign({}, reg, { end: false });
-      if (doesMatch_default(state.terms[state.t], tmpReg, state.start_i + state.t, state.phrase_length) === true) {
-        return true;
-      }
-    }
-  }
-  return false;
-};
-
-// node_modules/compromise/src/1-one/match/methods/match/_lib.js
-var getGroup = function(state, term_index) {
-  if (state.groups[state.inGroup]) {
-    return state.groups[state.inGroup];
-  }
-  state.groups[state.inGroup] = {
-    start: term_index,
-    length: 0
-  };
-  return state.groups[state.inGroup];
-};
-
-// node_modules/compromise/src/1-one/match/methods/match/steps/astrix.js
-var doAstrix = function(state) {
-  let { regs } = state;
-  let reg = regs[state.r];
-  let skipto = greedyTo(state, regs[state.r + 1]);
-  if (skipto === null || skipto === 0) {
-    return null;
-  }
-  if (reg.min !== void 0 && skipto - state.t < reg.min) {
-    return null;
-  }
-  if (reg.max !== void 0 && skipto - state.t > reg.max) {
-    state.t = state.t + reg.max;
-    return true;
-  }
-  if (state.hasGroup === true) {
-    const g3 = getGroup(state, state.t);
-    g3.length = skipto - state.t;
-  }
-  state.t = skipto;
-  return true;
-};
-var astrix_default = doAstrix;
-
-// node_modules/compromise/src/1-one/match/methods/match/steps/logic/and-or.js
-var isArray6 = function(arr) {
-  return Object.prototype.toString.call(arr) === "[object Array]";
-};
-var doOrBlock = function(state, skipN = 0) {
-  let block = state.regs[state.r];
-  let wasFound = false;
-  for (let c2 = 0; c2 < block.choices.length; c2 += 1) {
-    let regs = block.choices[c2];
-    if (!isArray6(regs)) {
-      return false;
-    }
-    wasFound = regs.every((cr, w_index) => {
-      let extra = 0;
-      let t2 = state.t + w_index + skipN + extra;
-      if (state.terms[t2] === void 0) {
-        return false;
-      }
-      let foundBlock = doesMatch_default(state.terms[t2], cr, t2 + state.start_i, state.phrase_length);
-      if (foundBlock === true && cr.greedy === true) {
-        for (let i3 = 1; i3 < state.terms.length; i3 += 1) {
-          let term = state.terms[t2 + i3];
-          if (term) {
-            let keepGoing = doesMatch_default(term, cr, state.start_i + i3, state.phrase_length);
-            if (keepGoing === true) {
-              extra += 1;
-            } else {
-              break;
-            }
-          }
-        }
-      }
-      skipN += extra;
-      return foundBlock;
-    });
-    if (wasFound) {
-      skipN += regs.length;
-      break;
-    }
-  }
-  if (wasFound && block.greedy === true) {
-    return doOrBlock(state, skipN);
-  }
-  return skipN;
-};
-var doAndBlock = function(state) {
-  let longest = 0;
-  let reg = state.regs[state.r];
-  let allDidMatch = reg.choices.every((block) => {
-    let allWords = block.every((cr, w_index) => {
-      let tryTerm = state.t + w_index;
-      if (state.terms[tryTerm] === void 0) {
-        return false;
-      }
-      return doesMatch_default(state.terms[tryTerm], cr, tryTerm, state.phrase_length);
-    });
-    if (allWords === true && block.length > longest) {
-      longest = block.length;
-    }
-    return allWords;
-  });
-  if (allDidMatch === true) {
-    return longest;
-  }
-  return false;
-};
-
-// node_modules/compromise/src/1-one/match/methods/match/steps/or-block.js
-var orBlock = function(state) {
-  const { regs } = state;
-  let reg = regs[state.r];
-  let skipNum = doOrBlock(state);
-  if (skipNum) {
-    if (reg.negative === true) {
-      return null;
-    }
-    if (state.hasGroup === true) {
-      const g3 = getGroup(state, state.t);
-      g3.length += skipNum;
-    }
-    if (reg.end === true) {
-      let end2 = state.phrase_length;
-      if (state.t + state.start_i + skipNum !== end2) {
-        return null;
-      }
-    }
-    state.t += skipNum;
-    return true;
-  } else if (!reg.optional) {
-    return null;
-  }
-  return true;
-};
-var or_block_default = orBlock;
-
-// node_modules/compromise/src/1-one/match/methods/match/steps/and-block.js
-var andBlock = function(state) {
-  const { regs } = state;
-  let reg = regs[state.r];
-  let skipNum = doAndBlock(state);
-  if (skipNum) {
-    if (reg.negative === true) {
-      return null;
-    }
-    if (state.hasGroup === true) {
-      const g3 = getGroup(state, state.t);
-      g3.length += skipNum;
-    }
-    if (reg.end === true) {
-      let end2 = state.phrase_length - 1;
-      if (state.t + state.start_i !== end2) {
-        return null;
-      }
-    }
-    state.t += skipNum;
-    return true;
-  } else if (!reg.optional) {
-    return null;
-  }
-  return true;
-};
-var and_block_default = andBlock;
-
-// node_modules/compromise/src/1-one/match/methods/match/steps/logic/negative-greedy.js
-var negGreedy = function(state, reg, nextReg) {
-  let skip = 0;
-  for (let t2 = state.t; t2 < state.terms.length; t2 += 1) {
-    let found = doesMatch_default(state.terms[t2], reg, state.start_i + state.t, state.phrase_length);
-    if (found) {
-      break;
-    }
-    if (nextReg) {
-      found = doesMatch_default(state.terms[t2], nextReg, state.start_i + state.t, state.phrase_length);
-      if (found) {
-        break;
-      }
-    }
-    skip += 1;
-    if (reg.max !== void 0 && skip === reg.max) {
-      break;
-    }
-  }
-  if (skip === 0) {
-    return false;
-  }
-  if (reg.min && reg.min > skip) {
-    return false;
-  }
-  state.t += skip;
-  return true;
-};
-var negative_greedy_default = negGreedy;
-
-// node_modules/compromise/src/1-one/match/methods/match/steps/negative.js
-var doNegative = function(state) {
-  const { regs } = state;
-  let reg = regs[state.r];
-  let tmpReg = Object.assign({}, reg);
-  tmpReg.negative = false;
-  let found = doesMatch_default(state.terms[state.t], tmpReg, state.start_i + state.t, state.phrase_length);
-  if (found) {
-    return false;
-  }
-  if (reg.optional) {
-    let nextReg = regs[state.r + 1];
-    if (nextReg) {
-      let fNext = doesMatch_default(state.terms[state.t], nextReg, state.start_i + state.t, state.phrase_length);
-      if (fNext) {
-        state.r += 1;
-      } else if (nextReg.optional && regs[state.r + 2]) {
-        let fNext2 = doesMatch_default(state.terms[state.t], regs[state.r + 2], state.start_i + state.t, state.phrase_length);
-        if (fNext2) {
-          state.r += 2;
-        }
-      }
-    }
-  }
-  if (reg.greedy) {
-    return negative_greedy_default(state, tmpReg, regs[state.r + 1]);
-  }
-  state.t += 1;
-  return true;
-};
-var negative_default = doNegative;
-
-// node_modules/compromise/src/1-one/match/methods/match/steps/optional-match.js
-var foundOptional = function(state) {
-  const { regs } = state;
-  let reg = regs[state.r];
-  let term = state.terms[state.t];
-  let nextRegMatched = doesMatch_default(term, regs[state.r + 1], state.start_i + state.t, state.phrase_length);
-  if (reg.negative || nextRegMatched) {
-    let nextTerm = state.terms[state.t + 1];
-    if (!nextTerm || !doesMatch_default(nextTerm, regs[state.r + 1], state.start_i + state.t, state.phrase_length)) {
-      state.r += 1;
-    }
-  }
-};
-var optional_match_default = foundOptional;
-
-// node_modules/compromise/src/1-one/match/methods/match/steps/greedy-match.js
-var greedyMatch = function(state) {
-  const { regs, phrase_length } = state;
-  let reg = regs[state.r];
-  state.t = getGreedy(state, regs[state.r + 1]);
-  if (state.t === null) {
-    return null;
-  }
-  if (reg.min && reg.min > state.t) {
-    return null;
-  }
-  if (reg.end === true && state.start_i + state.t !== phrase_length) {
-    return null;
-  }
-  return true;
-};
-var greedy_match_default = greedyMatch;
-
-// node_modules/compromise/src/1-one/match/methods/match/steps/contraction-skip.js
-var contractionSkip = function(state) {
-  let term = state.terms[state.t];
-  let reg = state.regs[state.r];
-  if (term.implicit && state.terms[state.t + 1]) {
-    let nextTerm = state.terms[state.t + 1];
-    if (!nextTerm.implicit) {
-      return;
-    }
-    if (reg.word === term.normal) {
-      state.t += 1;
-    }
-    if (reg.method === "hasContraction") {
-      state.t += 1;
-    }
-  }
-};
-var contraction_skip_default = contractionSkip;
-
-// node_modules/compromise/src/1-one/match/methods/match/steps/simple-match.js
-var setGroup = function(state, startAt) {
-  let reg = state.regs[state.r];
-  const g3 = getGroup(state, startAt);
-  if (state.t > 1 && reg.greedy) {
-    g3.length += state.t - startAt;
-  } else {
-    g3.length++;
-  }
-};
-var simpleMatch = function(state) {
-  const { regs } = state;
-  let reg = regs[state.r];
-  let term = state.terms[state.t];
-  let startAt = state.t;
-  if (reg.optional && regs[state.r + 1] && reg.negative) {
-    return true;
-  }
-  if (reg.optional && regs[state.r + 1]) {
-    optional_match_default(state);
-  }
-  if (term.implicit && state.terms[state.t + 1]) {
-    contraction_skip_default(state);
-  }
-  state.t += 1;
-  if (reg.end === true && state.t !== state.terms.length && reg.greedy !== true) {
-    return null;
-  }
-  if (reg.greedy === true) {
-    let alive = greedy_match_default(state);
-    if (!alive) {
-      return null;
-    }
-  }
-  if (state.hasGroup === true) {
-    setGroup(state, startAt);
-  }
-  return true;
-};
-var simple_match_default = simpleMatch;
-
-// node_modules/compromise/src/1-one/match/methods/match/02-from-here.js
-var tryHere = function(terms, regs, start_i, phrase_length) {
-  if (terms.length === 0 || regs.length === 0) {
-    return null;
-  }
-  let state = {
-    t: 0,
-    terms,
-    r: 0,
-    regs,
-    groups: {},
-    start_i,
-    phrase_length,
-    inGroup: null
-  };
-  for (; state.r < regs.length; state.r += 1) {
-    let reg = regs[state.r];
-    state.hasGroup = Boolean(reg.group);
-    if (state.hasGroup === true) {
-      state.inGroup = reg.group;
-    } else {
-      state.inGroup = null;
-    }
-    if (!state.terms[state.t]) {
-      const alive = regs.slice(state.r).some((remain) => !remain.optional);
-      if (alive === false) {
-        break;
-      }
-      return null;
-    }
-    if (reg.anything === true && reg.greedy === true) {
-      let alive = astrix_default(state);
-      if (!alive) {
-        return null;
-      }
-      continue;
-    }
-    if (reg.choices !== void 0 && reg.operator === "or") {
-      let alive = or_block_default(state);
-      if (!alive) {
-        return null;
-      }
-      continue;
-    }
-    if (reg.choices !== void 0 && reg.operator === "and") {
-      let alive = and_block_default(state);
-      if (!alive) {
-        return null;
-      }
-      continue;
-    }
-    if (reg.anything === true) {
-      if (reg.negative && reg.anything) {
-        return null;
-      }
-      let alive = simple_match_default(state);
-      if (!alive) {
-        return null;
-      }
-      continue;
-    }
-    if (isEndGreedy(reg, state) === true) {
-      let alive = simple_match_default(state);
-      if (!alive) {
-        return null;
-      }
-      continue;
-    }
-    if (reg.negative) {
-      let alive = negative_default(state);
-      if (!alive) {
-        return null;
-      }
-      continue;
-    }
-    let hasMatch = doesMatch_default(state.terms[state.t], reg, state.start_i + state.t, state.phrase_length);
-    if (hasMatch === true) {
-      let alive = simple_match_default(state);
-      if (!alive) {
-        return null;
-      }
-      continue;
-    }
-    if (reg.optional === true) {
-      continue;
-    }
-    return null;
-  }
-  let pntr = [null, start_i, state.t + start_i];
-  if (pntr[1] === pntr[2]) {
-    return null;
-  }
-  let groups = {};
-  Object.keys(state.groups).forEach((k2) => {
-    let o2 = state.groups[k2];
-    let start2 = start_i + o2.start;
-    groups[k2] = [null, start2, start2 + o2.length];
-  });
-  return { pointer: pntr, groups };
-};
-var from_here_default = tryHere;
-
-// node_modules/compromise/src/1-one/match/methods/match/03-getGroup.js
-var getGroup2 = function(res, group) {
-  let ptrs = [];
-  let byGroup = {};
-  if (res.length === 0) {
-    return { ptrs, byGroup };
-  }
-  if (typeof group === "number") {
-    group = String(group);
-  }
-  if (group) {
-    res.forEach((r2) => {
-      if (r2.groups[group]) {
-        ptrs.push(r2.groups[group]);
-      }
-    });
-  } else {
-    res.forEach((r2) => {
-      ptrs.push(r2.pointer);
-      Object.keys(r2.groups).forEach((k2) => {
-        byGroup[k2] = byGroup[k2] || [];
-        byGroup[k2].push(r2.groups[k2]);
-      });
-    });
-  }
-  return { ptrs, byGroup };
-};
-var getGroup_default = getGroup2;
-
-// node_modules/compromise/src/1-one/match/methods/match/03-notIf.js
-var notIf = function(results, not, docs) {
-  results = results.filter((res) => {
-    let [n3, start2, end2] = res.pointer;
-    let terms = docs[n3].slice(start2, end2);
-    for (let i3 = 0; i3 < terms.length; i3 += 1) {
-      let slice = terms.slice(i3);
-      let found = from_here_default(slice, not, i3, terms.length);
-      if (found !== null) {
-        return false;
-      }
-    }
-    return true;
-  });
-  return results;
-};
-var notIf_default = notIf;
-
-// node_modules/compromise/src/1-one/match/methods/match/index.js
-var addSentence = function(res, n3) {
-  res.pointer[0] = n3;
-  Object.keys(res.groups).forEach((k2) => {
-    res.groups[k2][0] = n3;
-  });
-  return res;
-};
-var handleStart = function(terms, regs, n3) {
-  let res = from_here_default(terms, regs, 0, terms.length);
-  if (res) {
-    res = addSentence(res, n3);
-    return res;
-  }
-  return null;
-};
-var runMatch = function(docs, todo, cache2) {
-  cache2 = cache2 || [];
-  let { regs, group, justOne } = todo;
-  let results = [];
-  if (!regs || regs.length === 0) {
-    return { ptrs: [], byGroup: {} };
-  }
-  const minLength = regs.filter((r2) => r2.optional !== true && r2.negative !== true).length;
-  docs:
-    for (let n3 = 0; n3 < docs.length; n3 += 1) {
-      let terms = docs[n3];
-      if (cache2[n3] && failFast_default(regs, cache2[n3])) {
-        continue;
-      }
-      if (regs[0].start === true) {
-        let foundStart = handleStart(terms, regs, n3, group);
-        if (foundStart) {
-          results.push(foundStart);
-        }
-        continue;
-      }
-      for (let i3 = 0; i3 < terms.length; i3 += 1) {
-        let slice = terms.slice(i3);
-        if (slice.length < minLength) {
-          break;
-        }
-        let res = from_here_default(slice, regs, i3, terms.length);
-        if (res) {
-          res = addSentence(res, n3);
-          results.push(res);
-          if (justOne === true) {
-            break docs;
-          }
-          let end2 = res.pointer[2];
-          if (Math.abs(end2 - 1) > i3) {
-            i3 = Math.abs(end2 - 1);
-          }
-        }
-      }
-    }
-  if (regs[regs.length - 1].end === true) {
-    results = results.filter((res) => {
-      let n3 = res.pointer[0];
-      return docs[n3].length === res.pointer[2];
-    });
-  }
-  if (todo.notIf) {
-    results = notIf_default(results, todo.notIf, docs);
-  }
-  results = getGroup_default(results, group);
-  results.ptrs.forEach((ptr) => {
-    let [n3, start2, end2] = ptr;
-    ptr[3] = docs[n3][start2].id;
-    ptr[4] = docs[n3][end2 - 1].id;
-  });
-  return results;
-};
-var match_default2 = runMatch;
-
-// node_modules/compromise/src/1-one/match/methods/index.js
-var methods10 = {
-  one: {
-    termMethods: termMethods_default,
-    parseMatch: parseMatch_default,
-    match: match_default2
-  }
-};
-var methods_default4 = methods10;
-
-// node_modules/compromise/src/1-one/match/lib.js
-var lib_default2 = {
-  parseMatch: function(str, opts2) {
-    const world2 = this.world();
-    let killUnicode2 = world2.methods.one.killUnicode;
-    if (killUnicode2) {
-      str = killUnicode2(str, world2);
-    }
-    return world2.methods.one.parseMatch(str, opts2, world2);
-  }
-};
-
-// node_modules/compromise/src/1-one/match/plugin.js
-var plugin_default6 = {
-  api: api_default4,
-  methods: methods_default4,
-  lib: lib_default2
-};
-
-// node_modules/compromise/src/1-one/output/api/html.js
-var isClass = /^\../;
-var isId = /^#./;
-var escapeXml = (str) => {
-  str = str.replace(/&/g, "&amp;");
-  str = str.replace(/</g, "&lt;");
-  str = str.replace(/>/g, "&gt;");
-  str = str.replace(/"/g, "&quot;");
-  str = str.replace(/'/g, "&apos;");
-  return str;
-};
-var toTag = function(k2) {
-  let start2 = "";
-  let end2 = "</span>";
-  k2 = escapeXml(k2);
-  if (isClass.test(k2)) {
-    start2 = `<span class="${k2.replace(/^\./, "")}"`;
-  } else if (isId.test(k2)) {
-    start2 = `<span id="${k2.replace(/^#/, "")}"`;
-  } else {
-    start2 = `<${k2}`;
-    end2 = `</${k2}>`;
-  }
-  start2 += ">";
-  return { start: start2, end: end2 };
-};
-var getIndex = function(doc, obj) {
-  let starts = {};
-  let ends = {};
-  Object.keys(obj).forEach((k2) => {
-    let res = obj[k2];
-    let tag = toTag(k2);
-    if (typeof res === "string") {
-      res = doc.match(res);
-    }
-    res.docs.forEach((terms) => {
-      if (terms.every((t2) => t2.implicit)) {
-        return;
-      }
-      let a2 = terms[0].id;
-      starts[a2] = starts[a2] || [];
-      starts[a2].push(tag.start);
-      let b = terms[terms.length - 1].id;
-      ends[b] = ends[b] || [];
-      ends[b].push(tag.end);
-    });
-  });
-  return { starts, ends };
-};
-var html = function(obj) {
-  let { starts, ends } = getIndex(this, obj);
-  let out2 = "";
-  this.docs.forEach((terms) => {
-    for (let i3 = 0; i3 < terms.length; i3 += 1) {
-      let t2 = terms[i3];
-      if (starts.hasOwnProperty(t2.id)) {
-        out2 += starts[t2.id].join("");
-      }
-      out2 += t2.pre || "" + t2.text || "";
-      if (ends.hasOwnProperty(t2.id)) {
-        out2 += ends[t2.id].join("");
-      }
-      out2 += t2.post || "";
-    }
-  });
-  return out2;
-};
-var html_default = { html };
-
-// node_modules/compromise/src/1-one/output/api/lib/_text.js
-var trimEnd = /[,:;)\]*.?~!\u0022\uFF02\u201D\u2019\u00BB\u203A\u2032\u2033\u2034\u301E\u00B4—-]+$/;
-var trimStart = /^[(['"*~\uFF02\u201C\u2018\u201F\u201B\u201E\u2E42\u201A\u00AB\u2039\u2035\u2036\u2037\u301D\u0060\u301F]+/;
-var punctToKill = /[,:;)('"\u201D\]]/;
-var isHyphen = /^[-–—]$/;
-var hasSpace = / /;
-var textFromTerms = function(terms, opts2, keepSpace = true) {
-  let txt = "";
-  terms.forEach((t2) => {
-    let pre = t2.pre || "";
-    let post = t2.post || "";
-    if (opts2.punctuation === "some") {
-      pre = pre.replace(trimStart, "");
-      if (isHyphen.test(post)) {
-        post = " ";
-      }
-      post = post.replace(punctToKill, "");
-      post = post.replace(/\?!+/, "?");
-      post = post.replace(/!+/, "!");
-      post = post.replace(/\?+/, "?");
-      post = post.replace(/\.{2,}/, "");
-      if (t2.tags.has("Abbreviation")) {
-        post = post.replace(/\./, "");
-      }
-    }
-    if (opts2.whitespace === "some") {
-      pre = pre.replace(/\s/, "");
-      post = post.replace(/\s+/, " ");
-    }
-    if (!opts2.keepPunct) {
-      pre = pre.replace(trimStart, "");
-      if (post === "-") {
-        post = " ";
-      } else {
-        post = post.replace(trimEnd, "");
-      }
-    }
-    let word = t2[opts2.form || "text"] || t2.normal || "";
-    if (opts2.form === "implicit") {
-      word = t2.implicit || t2.text;
-    }
-    if (opts2.form === "root" && t2.implicit) {
-      word = t2.root || t2.implicit || t2.normal;
-    }
-    if ((opts2.form === "machine" || opts2.form === "implicit" || opts2.form === "root") && t2.implicit) {
-      if (!post || !hasSpace.test(post)) {
-        post += " ";
-      }
-    }
-    txt += pre + word + post;
-  });
-  if (keepSpace === false) {
-    txt = txt.trim();
-  }
-  if (opts2.lowerCase === true) {
-    txt = txt.toLowerCase();
-  }
-  return txt;
-};
-var textFromDoc = function(docs, opts2) {
-  let text = "";
-  if (!docs || !docs[0] || !docs[0][0]) {
-    return text;
-  }
-  for (let i3 = 0; i3 < docs.length; i3 += 1) {
-    text += textFromTerms(docs[i3], opts2, true);
-  }
-  if (!opts2.keepSpace) {
-    text = text.trim();
-  }
-  if (opts2.keepPunct === false) {
-    if (!docs[0][0].tags.has("Emoticon")) {
-      text = text.replace(trimStart, "");
-    }
-    let last = docs[docs.length - 1];
-    if (!last[last.length - 1].tags.has("Emoticon")) {
-      text = text.replace(trimEnd, "");
-    }
-  }
-  if (opts2.cleanWhitespace === true) {
-    text = text.trim();
-  }
-  return text;
-};
-
-// node_modules/compromise/src/1-one/output/api/_fmts.js
-var fmts = {
-  text: {
-    form: "text"
-  },
-  normal: {
-    whitespace: "some",
-    punctuation: "some",
-    case: "some",
-    unicode: "some",
-    form: "normal"
-  },
-  machine: {
-    keepSpace: false,
-    whitespace: "some",
-    punctuation: "some",
-    case: "none",
-    unicode: "some",
-    form: "machine"
-  },
-  root: {
-    keepSpace: false,
-    whitespace: "some",
-    punctuation: "some",
-    case: "some",
-    unicode: "some",
-    form: "root"
-  },
-  implicit: {
-    form: "implicit"
-  }
-};
-fmts.clean = fmts.normal;
-fmts.reduced = fmts.root;
-var fmts_default = fmts;
-
-// node_modules/compromise/src/1-one/output/api/lib/hash.js
-var k = [];
-var i = 0;
-for (; i < 64; ) {
-  k[i] = 0 | Math.sin(++i % Math.PI) * 4294967296;
-}
-function md5(s3) {
-  let b, c2, d2, h2 = [b = 1732584193, c2 = 4023233417, ~b, ~c2], words = [], j2 = decodeURI(encodeURI(s3)) + "\x80", a2 = j2.length;
-  s3 = --a2 / 4 + 2 | 15;
-  words[--s3] = a2 * 8;
-  for (; ~a2; ) {
-    words[a2 >> 2] |= j2.charCodeAt(a2) << 8 * a2--;
-  }
-  for (i = j2 = 0; i < s3; i += 16) {
-    a2 = h2;
-    for (; j2 < 64; a2 = [
-      d2 = a2[3],
-      b + ((d2 = a2[0] + [
-        b & c2 | ~b & d2,
-        d2 & b | ~d2 & c2,
-        b ^ c2 ^ d2,
-        c2 ^ (b | ~d2)
-      ][a2 = j2 >> 4] + k[j2] + ~~words[i | [
-        j2,
-        5 * j2 + 1,
-        3 * j2 + 5,
-        7 * j2
-      ][a2] & 15]) << (a2 = [
-        7,
-        12,
-        17,
-        22,
-        5,
-        9,
-        14,
-        20,
-        4,
-        11,
-        16,
-        23,
-        6,
-        10,
-        15,
-        21
-      ][4 * a2 + j2++ % 4]) | d2 >>> -a2),
-      b,
-      c2
-    ]) {
-      b = a2[1] | 0;
-      c2 = a2[2];
-    }
-    for (j2 = 4; j2; )
-      h2[--j2] += a2[j2];
-  }
-  for (s3 = ""; j2 < 32; ) {
-    s3 += (h2[j2 >> 3] >> (1 ^ j2++) * 4 & 15).toString(16);
-  }
-  return s3;
-}
-
-// node_modules/compromise/src/1-one/output/api/json.js
-var defaults = {
-  text: true,
-  terms: true
-};
-var opts = { case: "none", unicode: "some", form: "machine", punctuation: "some" };
-var merge = function(a2, b) {
-  return Object.assign({}, a2, b);
-};
-var fns4 = {
-  text: (terms) => textFromTerms(terms, { keepPunct: true }, false),
-  normal: (terms) => textFromTerms(terms, merge(fmts_default.normal, { keepPunct: true }), false),
-  implicit: (terms) => textFromTerms(terms, merge(fmts_default.implicit, { keepPunct: true }), false),
-  machine: (terms) => textFromTerms(terms, opts, false),
-  root: (terms) => textFromTerms(terms, merge(opts, { form: "root" }), false),
-  hash: (terms) => md5(textFromTerms(terms, { keepPunct: true }, false)),
-  offset: (terms) => {
-    let len = fns4.text(terms).length;
-    return {
-      index: terms[0].offset.index,
-      start: terms[0].offset.start,
-      length: len
-    };
-  },
-  terms: (terms) => {
-    return terms.map((t2) => {
-      let term = Object.assign({}, t2);
-      term.tags = Array.from(t2.tags);
-      return term;
-    });
-  },
-  confidence: (_terms, view, i3) => view.eq(i3).confidence(),
-  syllables: (_terms, view, i3) => view.eq(i3).syllables(),
-  sentence: (_terms, view, i3) => view.eq(i3).fullSentence().text(),
-  dirty: (terms) => terms.some((t2) => t2.dirty === true)
-};
-fns4.sentences = fns4.sentence;
-fns4.clean = fns4.normal;
-fns4.reduced = fns4.root;
-var toJSON = function(view, option) {
-  option = option || {};
-  if (typeof option === "string") {
-    option = {};
-  }
-  option = Object.assign({}, defaults, option);
-  if (option.offset) {
-    view.compute("offset");
-  }
-  return view.docs.map((terms, i3) => {
-    let res = {};
-    Object.keys(option).forEach((k2) => {
-      if (option[k2] && fns4[k2]) {
-        res[k2] = fns4[k2](terms, view, i3);
-      }
-    });
-    return res;
-  });
-};
-var methods11 = {
-  json: function(n3) {
-    let res = toJSON(this, n3);
-    if (typeof n3 === "number") {
-      return res[n3];
-    }
-    return res;
-  }
-};
-methods11.data = methods11.json;
-var json_default = methods11;
-
-// node_modules/compromise/src/1-one/output/api/debug/client-side.js
-var logClientSide = function(view) {
-  console.log("%c -=-=- ", "background-color:#6699cc;");
-  view.forEach((m3) => {
-    console.groupCollapsed(m3.text());
-    let terms = m3.docs[0];
-    let out2 = terms.map((t2) => {
-      let text = t2.text || "-";
-      if (t2.implicit) {
-        text = "[" + t2.implicit + "]";
-      }
-      let tags = "[" + Array.from(t2.tags).join(", ") + "]";
-      return { text, tags };
-    });
-    console.table(out2, ["text", "tags"]);
-    console.groupEnd();
-  });
-};
-var client_side_default = logClientSide;
-
-// node_modules/compromise/src/1-one/output/api/debug/_color.js
-var reset = "\x1B[0m";
-var cli = {
-  green: (str) => "\x1B[32m" + str + reset,
-  red: (str) => "\x1B[31m" + str + reset,
-  blue: (str) => "\x1B[34m" + str + reset,
-  magenta: (str) => "\x1B[35m" + str + reset,
-  cyan: (str) => "\x1B[36m" + str + reset,
-  yellow: (str) => "\x1B[33m" + str + reset,
-  black: (str) => "\x1B[30m" + str + reset,
-  dim: (str) => "\x1B[2m" + str + reset,
-  i: (str) => "\x1B[3m" + str + reset
-};
-var color_default = cli;
-
-// node_modules/compromise/src/1-one/output/api/debug/tags.js
-var tagString = function(tags, model5) {
-  if (model5.one.tagSet) {
-    tags = tags.map((tag) => {
-      if (!model5.one.tagSet.hasOwnProperty(tag)) {
-        return tag;
-      }
-      const c2 = model5.one.tagSet[tag].color || "blue";
-      return color_default[c2](tag);
-    });
-  }
-  return tags.join(", ");
-};
-var showTags = function(view) {
-  let { docs, model: model5 } = view;
-  if (docs.length === 0) {
-    console.log(color_default.blue("\n     \u2500\u2500\u2500\u2500\u2500\u2500"));
-  }
-  docs.forEach((terms) => {
-    console.log(color_default.blue("\n  \u250C\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500\u2500"));
-    terms.forEach((t2) => {
-      let tags = [...t2.tags || []];
-      let text = t2.text || "-";
-      if (t2.sense) {
-        text = `{${t2.normal}/${t2.sense}}`;
-      }
-      if (t2.implicit) {
-        text = "[" + t2.implicit + "]";
-      }
-      text = color_default.yellow(text);
-      let word = "'" + text + "'";
-      if (t2.reference) {
-        let str2 = view.update([t2.reference]).text("normal");
-        word += ` - ${color_default.dim(color_default.i("[" + str2 + "]"))}`;
-      }
-      word = word.padEnd(18);
-      let str = color_default.blue("  \u2502 ") + color_default.i(word) + "  - " + tagString(tags, model5);
-      console.log(str);
-    });
-  });
-};
-var tags_default = showTags;
-
-// node_modules/compromise/src/1-one/output/api/debug/chunks.js
-var showChunks = function(view) {
-  let { docs } = view;
-  console.log("");
-  docs.forEach((terms) => {
-    let out2 = [];
-    terms.forEach((term) => {
-      if (term.chunk === "Noun") {
-        out2.push(color_default.blue(term.implicit || term.normal));
-      } else if (term.chunk === "Verb") {
-        out2.push(color_default.green(term.implicit || term.normal));
-      } else if (term.chunk === "Adjective") {
-        out2.push(color_default.yellow(term.implicit || term.normal));
-      } else if (term.chunk === "Pivot") {
-        out2.push(color_default.red(term.implicit || term.normal));
-      } else {
-        out2.push(term.implicit || term.normal);
-      }
-    });
-    console.log(out2.join(" "), "\n");
-  });
-};
-var chunks_default = showChunks;
-
-// node_modules/compromise/src/1-one/output/api/debug/highlight.js
-var split = (txt, offset2, index3) => {
-  let buff = index3 * 9;
-  let start2 = offset2.start + buff;
-  let end2 = start2 + offset2.length;
-  let pre = txt.substring(0, start2);
-  let mid = txt.substring(start2, end2);
-  let post = txt.substring(end2, txt.length);
-  return [pre, mid, post];
-};
-var spliceIn = function(txt, offset2, index3) {
-  let parts = split(txt, offset2, index3);
-  return `${parts[0]}${color_default.blue(parts[1])}${parts[2]}`;
-};
-var showHighlight = function(doc) {
-  if (!doc.found) {
-    return;
-  }
-  let bySentence = {};
-  doc.fullPointer.forEach((ptr) => {
-    bySentence[ptr[0]] = bySentence[ptr[0]] || [];
-    bySentence[ptr[0]].push(ptr);
-  });
-  Object.keys(bySentence).forEach((k2) => {
-    let full = doc.update([[Number(k2)]]);
-    let txt = full.text();
-    let matches3 = doc.update(bySentence[k2]);
-    let json = matches3.json({ offset: true });
-    json.forEach((obj, i3) => {
-      txt = spliceIn(txt, obj.offset, i3);
-    });
-    console.log(txt);
-  });
-};
-var highlight_default = showHighlight;
-
-// node_modules/compromise/src/1-one/output/api/debug/index.js
-function isClientSide() {
-  return typeof window !== "undefined" && window.document;
-}
-var debug = function(opts2 = {}) {
-  let view = this;
-  if (typeof opts2 === "string") {
-    let tmp = {};
-    tmp[opts2] = true;
-    opts2 = tmp;
-  }
-  if (isClientSide()) {
-    client_side_default(view);
-    return view;
-  }
-  if (opts2.tags !== false) {
-    tags_default(view);
-    console.log("\n");
-  }
-  if (opts2.chunks === true) {
-    chunks_default(view);
-    console.log("\n");
-  }
-  if (opts2.highlight === true) {
-    highlight_default(view);
-    console.log("\n");
-  }
-  return view;
-};
-var debug_default = debug;
-
-// node_modules/compromise/src/1-one/output/api/wrap.js
-var toText = function(term) {
-  let pre = term.pre || "";
-  let post = term.post || "";
-  return pre + term.text + post;
-};
-var findStarts = function(doc, obj) {
-  let starts = {};
-  Object.keys(obj).forEach((reg) => {
-    let m3 = doc.match(reg);
-    m3.fullPointer.forEach((a2) => {
-      starts[a2[3]] = { fn: obj[reg], end: a2[2] };
-    });
-  });
-  return starts;
-};
-var wrap = function(doc, obj) {
-  let starts = findStarts(doc, obj);
-  let text = "";
-  doc.docs.forEach((terms, n3) => {
-    for (let i3 = 0; i3 < terms.length; i3 += 1) {
-      let t2 = terms[i3];
-      if (starts.hasOwnProperty(t2.id)) {
-        let { fn, end: end2 } = starts[t2.id];
-        let m3 = doc.update([[n3, i3, end2]]);
-        text += terms[i3].pre || "";
-        text += fn(m3);
-        i3 = end2 - 1;
-        text += terms[i3].post || "";
-      } else {
-        text += toText(t2);
-      }
-    }
-  });
-  return text;
-};
-var wrap_default = wrap;
-
-// node_modules/compromise/src/1-one/output/api/out.js
-var isObject5 = (val) => {
-  return Object.prototype.toString.call(val) === "[object Object]";
-};
-var topk = function(arr) {
-  let obj = {};
-  arr.forEach((a2) => {
-    obj[a2] = obj[a2] || 0;
-    obj[a2] += 1;
-  });
-  let res = Object.keys(obj).map((k2) => {
-    return { normal: k2, count: obj[k2] };
-  });
-  return res.sort((a2, b) => a2.count > b.count ? -1 : 0);
-};
-var out = function(method) {
-  if (isObject5(method)) {
-    return wrap_default(this, method);
-  }
-  if (method === "text") {
-    return this.text();
-  }
-  if (method === "normal") {
-    return this.text("normal");
-  }
-  if (method === "root") {
-    return this.text("root");
-  }
-  if (method === "machine" || method === "reduced") {
-    return this.text("machine");
-  }
-  if (method === "hash" || method === "md5") {
-    return md5(this.text());
-  }
-  if (method === "json") {
-    return this.json();
-  }
-  if (method === "offset" || method === "offsets") {
-    this.compute("offset");
-    return this.json({ offset: true });
-  }
-  if (method === "array") {
-    let arr = this.docs.map((terms) => {
-      return terms.reduce((str, t2) => {
-        return str + t2.pre + t2.text + t2.post;
-      }, "").trim();
-    });
-    return arr.filter((str) => str);
-  }
-  if (method === "freq" || method === "frequency" || method === "topk") {
-    return topk(this.json({ normal: true }).map((o2) => o2.normal));
-  }
-  if (method === "terms") {
-    let list4 = [];
-    this.docs.forEach((s3) => {
-      let terms = s3.terms.map((t2) => t2.text);
-      terms = terms.filter((t2) => t2);
-      list4 = list4.concat(terms);
-    });
-    return list4;
-  }
-  if (method === "tags") {
-    return this.docs.map((terms) => {
-      return terms.reduce((h2, t2) => {
-        h2[t2.implicit || t2.normal] = Array.from(t2.tags);
-        return h2;
-      }, {});
-    });
-  }
-  if (method === "debug") {
-    return this.debug();
-  }
-  return this.text();
-};
-var methods12 = {
-  debug: debug_default,
-  out,
-  wrap: function(obj) {
-    return wrap_default(this, obj);
-  }
-};
-var out_default = methods12;
-
-// node_modules/compromise/src/1-one/output/api/text.js
-var isObject6 = (val) => {
-  return Object.prototype.toString.call(val) === "[object Object]";
-};
-var text_default = {
-  text: function(fmt2) {
-    let opts2 = {};
-    if (fmt2 && typeof fmt2 === "string" && fmts_default.hasOwnProperty(fmt2)) {
-      opts2 = Object.assign({}, fmts_default[fmt2]);
-    } else if (fmt2 && isObject6(fmt2)) {
-      opts2 = Object.assign({}, fmt2);
-    }
-    if (opts2.keepSpace === void 0 && this.pointer) {
-      opts2.keepSpace = false;
-    }
-    if (opts2.keepPunct === void 0 && this.pointer) {
-      let ptr = this.pointer[0];
-      if (ptr && ptr[1]) {
-        opts2.keepPunct = false;
-      } else {
-        opts2.keepPunct = true;
-      }
-    }
-    if (opts2.keepPunct === void 0) {
-      opts2.keepPunct = true;
-    }
-    if (opts2.keepSpace === void 0) {
-      opts2.keepSpace = true;
-    }
-    return textFromDoc(this.docs, opts2);
-  }
-};
-
-// node_modules/compromise/src/1-one/output/api/index.js
-var methods13 = Object.assign({}, out_default, text_default, json_default, html_default);
-var addAPI3 = function(View2) {
-  Object.assign(View2.prototype, methods13);
-};
-var api_default5 = addAPI3;
-
-// node_modules/compromise/src/1-one/output/plugin.js
-var plugin_default7 = {
-  api: api_default5,
-  methods: {
-    one: {
-      hash: md5
-    }
-  }
-};
-
-// node_modules/compromise/src/1-one/pointers/api/lib/_lib.js
-var doesOverlap = function(a2, b) {
-  if (a2[0] !== b[0]) {
-    return false;
-  }
-  let [, startA, endA] = a2;
-  let [, startB, endB] = b;
-  if (startA <= startB && endA > startB) {
-    return true;
-  }
-  if (startB <= startA && endB > startA) {
-    return true;
-  }
-  return false;
-};
-var getExtent = function(ptrs) {
-  let min2 = ptrs[0][1];
-  let max3 = ptrs[0][2];
-  ptrs.forEach((ptr) => {
-    if (ptr[1] < min2) {
-      min2 = ptr[1];
-    }
-    if (ptr[2] > max3) {
-      max3 = ptr[2];
-    }
-  });
-  return [ptrs[0][0], min2, max3];
-};
-var indexN = function(ptrs) {
-  let byN = {};
-  ptrs.forEach((ref) => {
-    byN[ref[0]] = byN[ref[0]] || [];
-    byN[ref[0]].push(ref);
-  });
-  return byN;
-};
-var uniquePtrs = function(arr) {
-  let obj = {};
-  for (let i3 = 0; i3 < arr.length; i3 += 1) {
-    obj[arr[i3].join(",")] = arr[i3];
-  }
-  return Object.values(obj);
-};
-
-// node_modules/compromise/src/1-one/pointers/api/lib/split.js
-var pivotBy = function(full, m3) {
-  let [n3, start2] = full;
-  let mStart = m3[1];
-  let mEnd = m3[2];
-  let res = {};
-  if (start2 < mStart) {
-    let end2 = mStart < full[2] ? mStart : full[2];
-    res.before = [n3, start2, end2];
-  }
-  res.match = m3;
-  if (full[2] > mEnd) {
-    res.after = [n3, mEnd, full[2]];
-  }
-  return res;
-};
-var doesMatch2 = function(full, m3) {
-  return full[1] <= m3[1] && m3[2] <= full[2];
-};
-var splitAll = function(full, m3) {
-  let byN = indexN(m3);
-  let res = [];
-  full.forEach((ptr) => {
-    let [n3] = ptr;
-    let matches3 = byN[n3] || [];
-    matches3 = matches3.filter((p4) => doesMatch2(ptr, p4));
-    if (matches3.length === 0) {
-      res.push({ passthrough: ptr });
-      return;
-    }
-    matches3 = matches3.sort((a2, b) => a2[1] - b[1]);
-    let carry = ptr;
-    matches3.forEach((p4, i3) => {
-      let found = pivotBy(carry, p4);
-      if (!matches3[i3 + 1]) {
-        res.push(found);
-      } else {
-        res.push({ before: found.before, match: found.match });
-        if (found.after) {
-          carry = found.after;
-        }
-      }
-    });
-  });
-  return res;
-};
-var split_default2 = splitAll;
-
-// node_modules/compromise/src/1-one/pointers/methods/getDoc.js
-var max = 20;
-var blindSweep = function(id, doc, n3) {
-  for (let i3 = 0; i3 < max; i3 += 1) {
-    if (doc[n3 - i3]) {
-      let index3 = doc[n3 - i3].findIndex((term) => term.id === id);
-      if (index3 !== -1) {
-        return [n3 - i3, index3];
-      }
-    }
-    if (doc[n3 + i3]) {
-      let index3 = doc[n3 + i3].findIndex((term) => term.id === id);
-      if (index3 !== -1) {
-        return [n3 + i3, index3];
-      }
-    }
-  }
-  return null;
-};
-var repairEnding = function(ptr, document2) {
-  let [n3, start2, , , endId] = ptr;
-  let terms = document2[n3];
-  let newEnd = terms.findIndex((t2) => t2.id === endId);
-  if (newEnd === -1) {
-    ptr[2] = document2[n3].length;
-    ptr[4] = terms.length ? terms[terms.length - 1].id : null;
-  } else {
-    ptr[2] = newEnd;
-  }
-  return document2[n3].slice(start2, ptr[2] + 1);
-};
-var getDoc2 = function(ptrs, document2) {
-  let doc = [];
-  ptrs.forEach((ptr, i3) => {
-    if (!ptr) {
-      return;
-    }
-    let [n3, start2, end2, id, endId] = ptr;
-    let terms = document2[n3] || [];
-    if (start2 === void 0) {
-      start2 = 0;
-    }
-    if (end2 === void 0) {
-      end2 = terms.length;
-    }
-    if (id && (!terms[start2] || terms[start2].id !== id)) {
-      let wild = blindSweep(id, document2, n3);
-      if (wild !== null) {
-        let len = end2 - start2;
-        terms = document2[wild[0]].slice(wild[1], wild[1] + len);
-        let startId = terms[0] ? terms[0].id : null;
-        ptrs[i3] = [wild[0], wild[1], wild[1] + len, startId];
-      }
-    } else {
-      terms = terms.slice(start2, end2);
-    }
-    if (terms.length === 0) {
-      return;
-    }
-    if (start2 === end2) {
-      return;
-    }
-    if (endId && terms[terms.length - 1].id !== endId) {
-      terms = repairEnding(ptr, document2);
-    }
-    doc.push(terms);
-  });
-  doc = doc.filter((a2) => a2.length > 0);
-  return doc;
-};
-var getDoc_default = getDoc2;
-
-// node_modules/compromise/src/1-one/pointers/methods/index.js
-var termList = function(docs) {
-  let arr = [];
-  for (let i3 = 0; i3 < docs.length; i3 += 1) {
-    for (let t2 = 0; t2 < docs[i3].length; t2 += 1) {
-      arr.push(docs[i3][t2]);
-    }
-  }
-  return arr;
-};
-var methods_default5 = {
-  one: {
-    termList,
-    getDoc: getDoc_default,
-    pointer: {
-      indexN,
-      splitAll: split_default2
-    }
-  }
-};
-
-// node_modules/compromise/src/1-one/pointers/api/lib/union.js
-var getUnion = function(a2, b) {
-  let both = a2.concat(b);
-  let byN = indexN(both);
-  let res = [];
-  both.forEach((ptr) => {
-    let [n3] = ptr;
-    if (byN[n3].length === 1) {
-      res.push(ptr);
-      return;
-    }
-    let hmm = byN[n3].filter((m3) => doesOverlap(ptr, m3));
-    hmm.push(ptr);
-    let range = getExtent(hmm);
-    res.push(range);
-  });
-  res = uniquePtrs(res);
-  return res;
-};
-var union_default = getUnion;
-
-// node_modules/compromise/src/1-one/pointers/api/lib/difference.js
-var subtract = function(refs, not) {
-  let res = [];
-  let found = split_default2(refs, not);
-  found.forEach((o2) => {
-    if (o2.passthrough) {
-      res.push(o2.passthrough);
-    }
-    if (o2.before) {
-      res.push(o2.before);
-    }
-    if (o2.after) {
-      res.push(o2.after);
-    }
-  });
-  return res;
-};
-var difference_default = subtract;
-
-// node_modules/compromise/src/1-one/pointers/api/lib/intersection.js
-var intersection = function(a2, b) {
-  let start2 = a2[1] < b[1] ? b[1] : a2[1];
-  let end2 = a2[2] > b[2] ? b[2] : a2[2];
-  if (start2 < end2) {
-    return [a2[0], start2, end2];
-  }
-  return null;
-};
-var getIntersection = function(a2, b) {
-  let byN = indexN(b);
-  let res = [];
-  a2.forEach((ptr) => {
-    let hmm = byN[ptr[0]] || [];
-    hmm = hmm.filter((p4) => doesOverlap(ptr, p4));
-    if (hmm.length === 0) {
-      return;
-    }
-    hmm.forEach((h2) => {
-      let overlap = intersection(ptr, h2);
-      if (overlap) {
-        res.push(overlap);
-      }
-    });
-  });
-  return res;
-};
-var intersection_default = getIntersection;
-
-// node_modules/compromise/src/1-one/pointers/api/index.js
-var isArray7 = function(arr) {
-  return Object.prototype.toString.call(arr) === "[object Array]";
-};
-var getDoc3 = (m3, view) => {
-  if (typeof m3 === "string" || isArray7(m3)) {
-    return view.match(m3);
-  }
-  if (!m3) {
-    return view.none();
-  }
-  return m3;
-};
-var addIds3 = function(ptrs, docs) {
-  return ptrs.map((ptr) => {
-    let [n3, start2] = ptr;
-    if (docs[n3] && docs[n3][start2]) {
-      ptr[3] = docs[n3][start2].id;
-    }
-    return ptr;
-  });
-};
-var methods14 = {};
-methods14.union = function(m3) {
-  m3 = getDoc3(m3, this);
-  let ptrs = union_default(this.fullPointer, m3.fullPointer);
-  ptrs = addIds3(ptrs, this.document);
-  return this.toView(ptrs);
-};
-methods14.and = methods14.union;
-methods14.intersection = function(m3) {
-  m3 = getDoc3(m3, this);
-  let ptrs = intersection_default(this.fullPointer, m3.fullPointer);
-  ptrs = addIds3(ptrs, this.document);
-  return this.toView(ptrs);
-};
-methods14.not = function(m3) {
-  m3 = getDoc3(m3, this);
-  let ptrs = difference_default(this.fullPointer, m3.fullPointer);
-  ptrs = addIds3(ptrs, this.document);
-  return this.toView(ptrs);
-};
-methods14.difference = methods14.not;
-methods14.complement = function() {
-  let doc = this.all();
-  let ptrs = difference_default(doc.fullPointer, this.fullPointer);
-  ptrs = addIds3(ptrs, this.document);
-  return this.toView(ptrs);
-};
-methods14.settle = function() {
-  let ptrs = this.fullPointer;
-  ptrs.forEach((ptr) => {
-    ptrs = union_default(ptrs, [ptr]);
-  });
-  ptrs = addIds3(ptrs, this.document);
-  return this.update(ptrs);
-};
-var addAPI4 = function(View2) {
-  Object.assign(View2.prototype, methods14);
-};
-var api_default6 = addAPI4;
-
-// node_modules/compromise/src/1-one/pointers/plugin.js
-var plugin_default8 = {
-  methods: methods_default5,
-  api: api_default6
-};
-
-// node_modules/compromise/src/1-one/sweep/lib.js
-var lib_default3 = {
-  buildNet: function(matches3) {
-    const methods16 = this.methods();
-    let net3 = methods16.one.buildNet(matches3, this.world());
-    net3.isNet = true;
-    return net3;
-  }
-};
-
-// node_modules/compromise/src/1-one/sweep/api.js
-var api = function(View2) {
-  View2.prototype.sweep = function(net3, opts2 = {}) {
-    const { world: world2, docs } = this;
-    const { methods: methods16 } = world2;
-    let found = methods16.one.bulkMatch(docs, net3, this.methods, opts2);
-    if (opts2.tagger !== false) {
-      methods16.one.bulkTagger(found, docs, this.world);
-    }
-    found = found.map((o2) => {
-      let ptr = o2.pointer;
-      let term = docs[ptr[0]][ptr[1]];
-      let len = ptr[2] - ptr[1];
-      if (term.index) {
-        o2.pointer = [
-          term.index[0],
-          term.index[1],
-          ptr[1] + len
-        ];
-      }
-      return o2;
-    });
-    let ptrs = found.map((o2) => o2.pointer);
-    found = found.map((obj) => {
-      obj.view = this.update([obj.pointer]);
-      delete obj.regs;
-      delete obj.needs;
-      delete obj.pointer;
-      delete obj._expanded;
-      return obj;
-    });
-    return {
-      view: this.update(ptrs),
-      found
-    };
-  };
-};
-var api_default7 = api;
-
-// node_modules/compromise/src/1-one/sweep/methods/buildNet/01-parse.js
-var getTokenNeeds = function(reg) {
-  if (reg.optional === true || reg.negative === true) {
-    return null;
-  }
-  if (reg.tag) {
-    return "#" + reg.tag;
-  }
-  if (reg.word) {
-    return reg.word;
-  }
-  if (reg.switch) {
-    return `%${reg.switch}%`;
-  }
-  return null;
-};
-var getNeeds = function(regs) {
-  let needs = [];
-  regs.forEach((reg) => {
-    needs.push(getTokenNeeds(reg));
-    if (reg.operator === "and" && reg.choices) {
-      reg.choices.forEach((oneSide) => {
-        oneSide.forEach((r2) => {
-          needs.push(getTokenNeeds(r2));
-        });
-      });
-    }
-  });
-  return needs.filter((str) => str);
-};
-var getWants = function(regs) {
-  let wants = [];
-  let count = 0;
-  regs.forEach((reg) => {
-    if (reg.operator === "or" && !reg.optional && !reg.negative) {
-      if (reg.fastOr) {
-        Array.from(reg.fastOr).forEach((w) => {
-          wants.push(w);
-        });
-      }
-      if (reg.choices) {
-        reg.choices.forEach((rs) => {
-          rs.forEach((r2) => {
-            let n3 = getTokenNeeds(r2);
-            if (n3) {
-              wants.push(n3);
-            }
-          });
-        });
-      }
-      count += 1;
-    }
-  });
-  return { wants, count };
-};
-var parse = function(matches3, world2) {
-  const parseMatch = world2.methods.one.parseMatch;
-  matches3.forEach((obj) => {
-    obj.regs = parseMatch(obj.match, {}, world2);
-    if (typeof obj.ifNo === "string") {
-      obj.ifNo = [obj.ifNo];
-    }
-    if (obj.notIf) {
-      obj.notIf = parseMatch(obj.notIf, {}, world2);
-    }
-    obj.needs = getNeeds(obj.regs);
-    let { wants, count } = getWants(obj.regs);
-    obj.wants = wants;
-    obj.minWant = count;
-    obj.minWords = obj.regs.filter((o2) => !o2.optional).length;
-  });
-  return matches3;
-};
-var parse_default = parse;
-
-// node_modules/compromise/src/1-one/sweep/methods/buildNet/index.js
-var buildNet = function(matches3, world2) {
-  matches3 = parse_default(matches3, world2);
-  let hooks2 = {};
-  matches3.forEach((obj) => {
-    obj.needs.forEach((str) => {
-      hooks2[str] = hooks2[str] || [];
-      hooks2[str].push(obj);
-    });
-    obj.wants.forEach((str) => {
-      hooks2[str] = hooks2[str] || [];
-      hooks2[str].push(obj);
-    });
-  });
-  Object.keys(hooks2).forEach((k2) => {
-    let already = {};
-    hooks2[k2] = hooks2[k2].filter((obj) => {
-      if (already[obj.match]) {
-        return false;
-      }
-      already[obj.match] = true;
-      return true;
-    });
-  });
-  let always = matches3.filter((o2) => o2.needs.length === 0 && o2.wants.length === 0);
-  return {
-    hooks: hooks2,
-    always
-  };
-};
-var buildNet_default = buildNet;
-
-// node_modules/compromise/src/1-one/sweep/methods/sweep/01-getHooks.js
-var getHooks = function(docCaches, hooks2) {
-  return docCaches.map((set, i3) => {
-    let maybe = [];
-    Object.keys(hooks2).forEach((k2) => {
-      if (docCaches[i3].has(k2)) {
-        maybe = maybe.concat(hooks2[k2]);
-      }
-    });
-    let already = {};
-    maybe = maybe.filter((m3) => {
-      if (already[m3.match]) {
-        return false;
-      }
-      already[m3.match] = true;
-      return true;
-    });
-    return maybe;
-  });
-};
-var getHooks_default = getHooks;
-
-// node_modules/compromise/src/1-one/sweep/methods/sweep/02-trim-down.js
-var localTrim = function(maybeList, docCache) {
-  return maybeList.map((list4, n3) => {
-    let haves = docCache[n3];
-    list4 = list4.filter((obj) => {
-      return obj.needs.every((need) => haves.has(need));
-    });
-    list4 = list4.filter((obj) => {
-      if (obj.ifNo !== void 0 && obj.ifNo.some((no) => haves.has(no)) === true) {
-        return false;
-      }
-      return true;
-    });
-    list4 = list4.filter((obj) => {
-      if (obj.wants.length === 0) {
-        return true;
-      }
-      let found = obj.wants.filter((str) => haves.has(str)).length;
-      return found >= obj.minWant;
-    });
-    return list4;
-  });
-};
-var trim_down_default = localTrim;
-
-// node_modules/compromise/src/1-one/sweep/methods/sweep/04-runMatch.js
-var runMatch2 = function(maybeList, document2, docCache, methods16, opts2) {
-  let results = [];
-  for (let n3 = 0; n3 < maybeList.length; n3 += 1) {
-    for (let i3 = 0; i3 < maybeList[n3].length; i3 += 1) {
-      let m3 = maybeList[n3][i3];
-      let res = methods16.one.match([document2[n3]], m3);
-      if (res.ptrs.length > 0) {
-        res.ptrs.forEach((ptr) => {
-          ptr[0] = n3;
-          let todo = Object.assign({}, m3, { pointer: ptr });
-          if (m3.unTag !== void 0) {
-            todo.unTag = m3.unTag;
-          }
-          results.push(todo);
-        });
-        if (opts2.matchOne === true) {
-          return [results[0]];
-        }
-      }
-    }
-  }
-  return results;
-};
-var runMatch_default = runMatch2;
-
-// node_modules/compromise/src/1-one/sweep/methods/sweep/index.js
-var tooSmall = function(maybeList, document2) {
-  return maybeList.map((arr, i3) => {
-    let termCount = document2[i3].length;
-    arr = arr.filter((o2) => {
-      return termCount >= o2.minWords;
-    });
-    return arr;
-  });
-};
-var sweep = function(document2, net3, methods16, opts2 = {}) {
-  let docCache = methods16.one.cacheDoc(document2);
-  let maybeList = getHooks_default(docCache, net3.hooks);
-  maybeList = trim_down_default(maybeList, docCache, document2);
-  if (net3.always.length > 0) {
-    maybeList = maybeList.map((arr) => arr.concat(net3.always));
-  }
-  maybeList = tooSmall(maybeList, document2);
-  let results = runMatch_default(maybeList, document2, docCache, methods16, opts2);
-  return results;
-};
-var sweep_default = sweep;
-
-// node_modules/compromise/src/1-one/sweep/methods/tagger/canBe.js
-var canBe = function(terms, tag, model5) {
-  let tagSet = model5.one.tagSet;
-  if (!tagSet.hasOwnProperty(tag)) {
-    return true;
-  }
-  let not = tagSet[tag].not || [];
-  for (let i3 = 0; i3 < terms.length; i3 += 1) {
-    let term = terms[i3];
-    for (let k2 = 0; k2 < not.length; k2 += 1) {
-      if (term.tags.has(not[k2]) === true) {
-        return false;
-      }
-    }
-  }
-  return true;
-};
-var canBe_default = canBe;
-
-// node_modules/compromise/src/1-one/sweep/methods/tagger/index.js
-var tagger = function(list4, document2, world2) {
-  const { model: model5, methods: methods16 } = world2;
-  const { getDoc: getDoc4, setTag: setTag3, unTag: unTag2 } = methods16.one;
-  const looksPlural2 = methods16.two.looksPlural;
-  if (list4.length === 0) {
-    return list4;
-  }
-  const env2 = typeof process === "undefined" || !process.env ? self.env || {} : process.env;
-  if (env2.DEBUG_TAGS) {
-    console.log(`
-
-  \x1B[32m\u2192 ${list4.length} post-tagger:\x1B[0m`);
-  }
-  return list4.map((todo) => {
-    if (!todo.tag && !todo.chunk && !todo.unTag) {
-      return;
-    }
-    let reason = todo.reason || todo.match;
-    let terms = getDoc4([todo.pointer], document2)[0];
-    if (todo.safe === true) {
-      if (canBe_default(terms, todo.tag, model5) === false) {
-        return;
-      }
-      if (terms[terms.length - 1].post === "-") {
-        return;
-      }
-    }
-    if (todo.tag !== void 0) {
-      setTag3(terms, todo.tag, world2, todo.safe, `[post] '${reason}'`);
-      if (todo.tag === "Noun" && looksPlural2) {
-        let term = terms[terms.length - 1];
-        if (looksPlural2(term.text)) {
-          setTag3([term], "Plural", world2, todo.safe, "quick-plural");
-        } else {
-          setTag3([term], "Singular", world2, todo.safe, "quick-singular");
-        }
-      }
-    }
-    if (todo.unTag !== void 0) {
-      unTag2(terms, todo.unTag, world2, todo.safe, reason);
-    }
-    if (todo.chunk) {
-      terms.forEach((t2) => t2.chunk = todo.chunk);
-    }
-  });
-};
-var tagger_default = tagger;
-
-// node_modules/compromise/src/1-one/sweep/methods/index.js
-var methods_default6 = {
-  buildNet: buildNet_default,
-  bulkMatch: sweep_default,
-  bulkTagger: tagger_default
-};
-
-// node_modules/compromise/src/1-one/sweep/plugin.js
-var plugin_default9 = {
-  lib: lib_default3,
-  api: api_default7,
-  methods: {
-    one: methods_default6
-  }
-};
-
-// node_modules/compromise/src/1-one/tag/methods/setTag.js
-var isMulti = / /;
-var addChunk = function(term, tag) {
-  if (tag === "Noun") {
-    term.chunk = tag;
-  }
-  if (tag === "Verb") {
-    term.chunk = tag;
-  }
-};
-var tagTerm = function(term, tag, tagSet, isSafe) {
-  if (term.tags.has(tag) === true) {
-    return null;
-  }
-  if (tag === ".") {
-    return null;
-  }
-  let known = tagSet[tag];
-  if (known) {
-    if (known.not && known.not.length > 0) {
-      for (let o2 = 0; o2 < known.not.length; o2 += 1) {
-        if (isSafe === true && term.tags.has(known.not[o2])) {
-          return null;
-        }
-        term.tags.delete(known.not[o2]);
-      }
-    }
-    if (known.parents && known.parents.length > 0) {
-      for (let o2 = 0; o2 < known.parents.length; o2 += 1) {
-        term.tags.add(known.parents[o2]);
-        addChunk(term, known.parents[o2]);
-      }
-    }
-  }
-  term.tags.add(tag);
-  term.dirty = true;
-  addChunk(term, tag);
-  return true;
-};
-var multiTag = function(terms, tagString2, tagSet, isSafe) {
-  let tags = tagString2.split(isMulti);
-  terms.forEach((term, i3) => {
-    let tag = tags[i3];
-    if (tag) {
-      tag = tag.replace(/^#/, "");
-      tagTerm(term, tag, tagSet, isSafe);
-    }
-  });
-};
-var isArray8 = function(arr) {
-  return Object.prototype.toString.call(arr) === "[object Array]";
-};
-var log = (terms, tag, reason = "") => {
-  const yellow = (str) => "\x1B[33m\x1B[3m" + str + "\x1B[0m";
-  const i3 = (str) => "\x1B[3m" + str + "\x1B[0m";
-  let word = terms.map((t2) => {
-    return t2.text || "[" + t2.implicit + "]";
-  }).join(" ");
-  if (typeof tag !== "string" && tag.length > 2) {
-    tag = tag.slice(0, 2).join(", #") + " +";
-  }
-  tag = typeof tag !== "string" ? tag.join(", #") : tag;
-  console.log(` ${yellow(word).padEnd(24)} \x1B[32m\u2192\x1B[0m #${tag.padEnd(22)}  ${i3(reason)}`);
-};
-var setTag = function(terms, tag, world2 = {}, isSafe, reason) {
-  const tagSet = world2.model.one.tagSet || {};
-  if (!tag) {
-    return;
-  }
-  const env2 = typeof process === "undefined" || !process.env ? self.env || {} : process.env;
-  if (env2 && env2.DEBUG_TAGS) {
-    log(terms, tag, reason);
-  }
-  if (isArray8(tag) === true) {
-    tag.forEach((tg) => setTag(terms, tg, world2, isSafe));
-    return;
-  }
-  if (typeof tag !== "string") {
-    console.warn(`compromise: Invalid tag '${tag}'`);
-    return;
-  }
-  tag = tag.trim();
-  if (isMulti.test(tag)) {
-    multiTag(terms, tag, tagSet, isSafe);
-    return;
-  }
-  tag = tag.replace(/^#/, "");
-  for (let i3 = 0; i3 < terms.length; i3 += 1) {
-    tagTerm(terms[i3], tag, tagSet, isSafe);
-  }
-};
-var setTag_default = setTag;
-
-// node_modules/compromise/src/1-one/tag/methods/unTag.js
-var unTag = function(terms, tag, tagSet) {
-  tag = tag.trim().replace(/^#/, "");
-  for (let i3 = 0; i3 < terms.length; i3 += 1) {
-    let term = terms[i3];
-    if (tag === "*") {
-      term.tags.clear();
-      continue;
-    }
-    let known = tagSet[tag];
-    if (known && known.children.length > 0) {
-      for (let o2 = 0; o2 < known.children.length; o2 += 1) {
-        term.tags.delete(known.children[o2]);
-      }
-    }
-    term.tags.delete(tag);
-  }
-};
-var unTag_default = unTag;
-
-// node_modules/grad-school/builds/grad-school.mjs
-var e = function(e2) {
-  return e2.children = e2.children || [], e2._cache = e2._cache || {}, e2.props = e2.props || {}, e2._cache.parents = e2._cache.parents || [], e2._cache.children = e2._cache.children || [], e2;
-};
-var t = /^ *(#|\/\/)/;
-var n = function(t2) {
-  let n3 = t2.trim().split(/->/), r2 = [];
-  n3.forEach((t3) => {
-    r2 = r2.concat(function(t4) {
-      if (!(t4 = t4.trim()))
-        return null;
-      if (/^\[/.test(t4) && /\]$/.test(t4)) {
-        let n4 = (t4 = (t4 = t4.replace(/^\[/, "")).replace(/\]$/, "")).split(/,/);
-        return n4 = n4.map((e2) => e2.trim()).filter((e2) => e2), n4 = n4.map((t5) => e({ id: t5 })), n4;
-      }
-      return [e({ id: t4 })];
-    }(t3));
-  }), r2 = r2.filter((e2) => e2);
-  let i3 = r2[0];
-  for (let e2 = 1; e2 < r2.length; e2 += 1)
-    i3.children.push(r2[e2]), i3 = r2[e2];
-  return r2[0];
-};
-var r = (e2, t2) => {
-  let n3 = [], r2 = [e2];
-  for (; r2.length > 0; ) {
-    let e3 = r2.pop();
-    n3.push(e3), e3.children && e3.children.forEach((n4) => {
-      t2 && t2(e3, n4), r2.push(n4);
-    });
-  }
-  return n3;
-};
-var i2 = (e2) => Object.prototype.toString.call(e2) === "[object Array]";
-var c = (e2) => (e2 = e2 || "").trim();
-var s = function(c2 = []) {
-  return typeof c2 == "string" ? function(r2) {
-    let i3 = r2.split(/\r?\n/), c3 = [];
-    i3.forEach((e2) => {
-      if (!e2.trim() || t.test(e2))
-        return;
-      let r3 = ((e3) => {
-        const t2 = /^( {2}|\t)/;
-        let n3 = 0;
-        for (; t2.test(e3); )
-          e3 = e3.replace(t2, ""), n3 += 1;
-        return n3;
-      })(e2);
-      c3.push({ indent: r3, node: n(e2) });
-    });
-    let s4 = function(e2) {
-      let t2 = { children: [] };
-      return e2.forEach((n3, r3) => {
-        n3.indent === 0 ? t2.children = t2.children.concat(n3.node) : e2[r3 - 1] && function(e3, t3) {
-          let n4 = e3[t3].indent;
-          for (; t3 >= 0; t3 -= 1)
-            if (e3[t3].indent < n4)
-              return e3[t3];
-          return e3[0];
-        }(e2, r3).node.children.push(n3.node);
-      }), t2;
-    }(c3);
-    return s4 = e(s4), s4;
-  }(c2) : i2(c2) ? function(t2) {
-    let n3 = {};
-    t2.forEach((e2) => {
-      n3[e2.id] = e2;
-    });
-    let r2 = e({});
-    return t2.forEach((t3) => {
-      if ((t3 = e(t3)).parent)
-        if (n3.hasOwnProperty(t3.parent)) {
-          let e2 = n3[t3.parent];
-          delete t3.parent, e2.children.push(t3);
-        } else
-          console.warn(`[Grad] - missing node '${t3.parent}'`);
-      else
-        r2.children.push(t3);
-    }), r2;
-  }(c2) : (r(s3 = c2).forEach(e), s3);
-  var s3;
-};
-var h = (e2) => "\x1B[31m" + e2 + "\x1B[0m";
-var o = (e2) => "\x1B[2m" + e2 + "\x1B[0m";
-var l = function(e2, t2) {
-  let n3 = "-> ";
-  t2 && (n3 = o("\u2192 "));
-  let i3 = "";
-  return r(e2).forEach((e3, r2) => {
-    let c2 = e3.id || "";
-    if (t2 && (c2 = h(c2)), r2 === 0 && !e3.id)
-      return;
-    let s3 = e3._cache.parents.length;
-    i3 += "    ".repeat(s3) + n3 + c2 + "\n";
-  }), i3;
-};
-var a = function(e2) {
-  let t2 = r(e2);
-  t2.forEach((e3) => {
-    delete (e3 = Object.assign({}, e3)).children;
-  });
-  let n3 = t2[0];
-  return n3 && !n3.id && Object.keys(n3.props).length === 0 && t2.shift(), t2;
-};
-var p = { text: l, txt: l, array: a, flat: a };
-var d = function(e2, t2) {
-  return t2 === "nested" || t2 === "json" ? e2 : t2 === "debug" ? (console.log(l(e2, true)), null) : p.hasOwnProperty(t2) ? p[t2](e2) : e2;
-};
-var u = (e2) => {
-  r(e2, (e3, t2) => {
-    e3.id && (e3._cache.parents = e3._cache.parents || [], t2._cache.parents = e3._cache.parents.concat([e3.id]));
-  });
-};
-var f = (e2, t2) => (Object.keys(t2).forEach((n3) => {
-  if (t2[n3] instanceof Set) {
-    let r2 = e2[n3] || /* @__PURE__ */ new Set();
-    e2[n3] = /* @__PURE__ */ new Set([...r2, ...t2[n3]]);
-  } else {
-    if (((e3) => e3 && typeof e3 == "object" && !Array.isArray(e3))(t2[n3])) {
-      let r2 = e2[n3] || {};
-      e2[n3] = Object.assign({}, t2[n3], r2);
-    } else
-      i2(t2[n3]) ? e2[n3] = t2[n3].concat(e2[n3] || []) : e2[n3] === void 0 && (e2[n3] = t2[n3]);
-  }
-}), e2);
-var j = /\//;
-var g = class {
-  constructor(e2 = {}) {
-    Object.defineProperty(this, "json", { enumerable: false, value: e2, writable: true });
-  }
-  get children() {
-    return this.json.children;
-  }
-  get id() {
-    return this.json.id;
-  }
-  get found() {
-    return this.json.id || this.json.children.length > 0;
-  }
-  props(e2 = {}) {
-    let t2 = this.json.props || {};
-    return typeof e2 == "string" && (t2[e2] = true), this.json.props = Object.assign(t2, e2), this;
-  }
-  get(t2) {
-    if (t2 = c(t2), !j.test(t2)) {
-      let e2 = this.json.children.find((e3) => e3.id === t2);
-      return new g(e2);
-    }
-    let n3 = ((e2, t3) => {
-      let n4 = ((e3) => typeof e3 != "string" ? e3 : (e3 = e3.replace(/^\//, "")).split(/\//))(t3 = t3 || "");
-      for (let t4 = 0; t4 < n4.length; t4 += 1) {
-        let r2 = e2.children.find((e3) => e3.id === n4[t4]);
-        if (!r2)
-          return null;
-        e2 = r2;
-      }
-      return e2;
-    })(this.json, t2) || e({});
-    return new g(n3);
-  }
-  add(t2, n3 = {}) {
-    if (i2(t2))
-      return t2.forEach((e2) => this.add(c(e2), n3)), this;
-    t2 = c(t2);
-    let r2 = e({ id: t2, props: n3 });
-    return this.json.children.push(r2), new g(r2);
-  }
-  remove(e2) {
-    return e2 = c(e2), this.json.children = this.json.children.filter((t2) => t2.id !== e2), this;
-  }
-  nodes() {
-    return r(this.json).map((e2) => (delete (e2 = Object.assign({}, e2)).children, e2));
-  }
-  cache() {
-    return ((e2) => {
-      let t2 = r(e2, (e3, t3) => {
-        e3.id && (e3._cache.parents = e3._cache.parents || [], e3._cache.children = e3._cache.children || [], t3._cache.parents = e3._cache.parents.concat([e3.id]));
-      }), n3 = {};
-      t2.forEach((e3) => {
-        e3.id && (n3[e3.id] = e3);
-      }), t2.forEach((e3) => {
-        e3._cache.parents.forEach((t3) => {
-          n3.hasOwnProperty(t3) && n3[t3]._cache.children.push(e3.id);
-        });
-      }), e2._cache.children = Object.keys(n3);
-    })(this.json), this;
-  }
-  list() {
-    return r(this.json);
-  }
-  fillDown() {
-    var e2;
-    return e2 = this.json, r(e2, (e3, t2) => {
-      t2.props = f(t2.props, e3.props);
-    }), this;
-  }
-  depth() {
-    u(this.json);
-    let e2 = r(this.json), t2 = e2.length > 1 ? 1 : 0;
-    return e2.forEach((e3) => {
-      if (e3._cache.parents.length === 0)
-        return;
-      let n3 = e3._cache.parents.length + 1;
-      n3 > t2 && (t2 = n3);
-    }), t2;
-  }
-  out(e2) {
-    return u(this.json), d(this.json, e2);
-  }
-  debug() {
-    return u(this.json), d(this.json, "debug"), this;
-  }
-};
-var _ = function(e2) {
-  let t2 = s(e2);
-  return new g(t2);
-};
-_.prototype.plugin = function(e2) {
-  e2(this);
-};
-
-// node_modules/compromise/src/1-one/tag/methods/addTags/_colors.js
-var colors = {
-  Noun: "blue",
-  Verb: "green",
-  Negative: "green",
-  Date: "red",
-  Value: "red",
-  Adjective: "magenta",
-  Preposition: "cyan",
-  Conjunction: "cyan",
-  Determiner: "cyan",
-  Hyphenated: "cyan",
-  Adverb: "cyan"
-};
-var colors_default = colors;
-
-// node_modules/compromise/src/1-one/tag/methods/addTags/02-fmt.js
-var getColor = function(node) {
-  if (colors_default.hasOwnProperty(node.id)) {
-    return colors_default[node.id];
-  }
-  if (colors_default.hasOwnProperty(node.is)) {
-    return colors_default[node.is];
-  }
-  let found = node._cache.parents.find((c2) => colors_default[c2]);
-  return colors_default[found];
-};
-var fmt = function(nodes) {
-  const res = {};
-  nodes.forEach((node) => {
-    let { not, also, is, novel } = node.props;
-    let parents = node._cache.parents;
-    if (also) {
-      parents = parents.concat(also);
-    }
-    res[node.id] = {
-      is,
-      not,
-      novel,
-      also,
-      parents,
-      children: node._cache.children,
-      color: getColor(node)
-    };
-  });
-  Object.keys(res).forEach((k2) => {
-    let nots = new Set(res[k2].not);
-    res[k2].not.forEach((not) => {
-      if (res[not]) {
-        res[not].children.forEach((tag) => nots.add(tag));
-      }
-    });
-    res[k2].not = Array.from(nots);
-  });
-  return res;
-};
-var fmt_default = fmt;
-
-// node_modules/compromise/src/1-one/tag/methods/addTags/01-validate.js
-var toArr = function(input) {
-  if (!input) {
-    return [];
-  }
-  if (typeof input === "string") {
-    return [input];
-  }
-  return input;
-};
-var addImplied = function(tags, already) {
-  Object.keys(tags).forEach((k2) => {
-    if (tags[k2].isA) {
-      tags[k2].is = tags[k2].isA;
-    }
-    if (tags[k2].notA) {
-      tags[k2].not = tags[k2].notA;
-    }
-    if (tags[k2].is && typeof tags[k2].is === "string") {
-      if (!already.hasOwnProperty(tags[k2].is) && !tags.hasOwnProperty(tags[k2].is)) {
-        tags[tags[k2].is] = {};
-      }
-    }
-    if (tags[k2].not && typeof tags[k2].not === "string" && !tags.hasOwnProperty(tags[k2].not)) {
-      if (!already.hasOwnProperty(tags[k2].not) && !tags.hasOwnProperty(tags[k2].not)) {
-        tags[tags[k2].not] = {};
-      }
-    }
-  });
-  return tags;
-};
-var validate = function(tags, already) {
-  tags = addImplied(tags, already);
-  Object.keys(tags).forEach((k2) => {
-    tags[k2].children = toArr(tags[k2].children);
-    tags[k2].not = toArr(tags[k2].not);
-  });
-  Object.keys(tags).forEach((k2) => {
-    let nots = tags[k2].not || [];
-    nots.forEach((no) => {
-      if (tags[no] && tags[no].not) {
-        tags[no].not.push(k2);
-      }
-    });
-  });
-  return tags;
-};
-var validate_default = validate;
-
-// node_modules/compromise/src/1-one/tag/methods/addTags/index.js
-var compute3 = function(allTags2) {
-  const flatList = Object.keys(allTags2).map((k2) => {
-    let o2 = allTags2[k2];
-    const props = { not: new Set(o2.not), also: o2.also, is: o2.is, novel: o2.novel };
-    return { id: k2, parent: o2.is, props, children: [] };
-  });
-  const graph = _(flatList).cache().fillDown();
-  return graph.out("array");
-};
-var fromUser = function(tags) {
-  Object.keys(tags).forEach((k2) => {
-    tags[k2] = Object.assign({}, tags[k2]);
-    tags[k2].novel = true;
-  });
-  return tags;
-};
-var addTags = function(tags, already) {
-  if (Object.keys(already).length > 0) {
-    tags = fromUser(tags);
-  }
-  tags = validate_default(tags, already);
-  let allTags2 = Object.assign({}, already, tags);
-  const nodes = compute3(allTags2);
-  const res = fmt_default(nodes);
-  return res;
-};
-var addTags_default = addTags;
-
-// node_modules/compromise/src/1-one/tag/methods/index.js
-var methods_default7 = {
-  one: {
-    setTag: setTag_default,
-    unTag: unTag_default,
-    addTags: addTags_default
-  }
-};
-
-// node_modules/compromise/src/1-one/tag/api/tag.js
-var isArray9 = function(arr) {
-  return Object.prototype.toString.call(arr) === "[object Array]";
-};
-var fns5 = {
-  tag: function(input, reason = "", isSafe) {
-    if (!this.found || !input) {
-      return this;
-    }
-    let terms = this.termList();
-    if (terms.length === 0) {
-      return this;
-    }
-    const { methods: methods16, verbose: verbose2, world: world2 } = this;
-    if (verbose2 === true) {
-      console.log(" +  ", input, reason || "");
-    }
-    if (isArray9(input)) {
-      input.forEach((tag) => methods16.one.setTag(terms, tag, world2, isSafe, reason));
-    } else {
-      methods16.one.setTag(terms, input, world2, isSafe, reason);
-    }
-    this.uncache();
-    return this;
-  },
-  tagSafe: function(input, reason = "") {
-    return this.tag(input, reason, true);
-  },
-  unTag: function(input, reason) {
-    if (!this.found || !input) {
-      return this;
-    }
-    let terms = this.termList();
-    if (terms.length === 0) {
-      return this;
-    }
-    const { methods: methods16, verbose: verbose2, model: model5 } = this;
-    if (verbose2 === true) {
-      console.log(" -  ", input, reason || "");
-    }
-    let tagSet = model5.one.tagSet;
-    if (isArray9(input)) {
-      input.forEach((tag) => methods16.one.unTag(terms, tag, tagSet));
-    } else {
-      methods16.one.unTag(terms, input, tagSet);
-    }
-    this.uncache();
-    return this;
-  },
-  canBe: function(tag) {
-    tag = tag.replace(/^#/, "");
-    let tagSet = this.model.one.tagSet;
-    if (!tagSet.hasOwnProperty(tag)) {
-      return this;
-    }
-    let not = tagSet[tag].not || [];
-    let nope2 = [];
-    this.document.forEach((terms, n3) => {
-      terms.forEach((term, i3) => {
-        let found = not.find((no) => term.tags.has(no));
-        if (found) {
-          nope2.push([n3, i3, i3 + 1]);
-        }
-      });
-    });
-    let noDoc = this.update(nope2);
-    return this.difference(noDoc);
-  }
-};
-var tag_default = fns5;
-
-// node_modules/compromise/src/1-one/tag/api/index.js
-var tagAPI = function(View2) {
-  Object.assign(View2.prototype, tag_default);
-};
-var api_default8 = tagAPI;
-
-// node_modules/compromise/src/1-one/tag/lib.js
-var addTags2 = function(tags) {
-  const { model: model5, methods: methods16 } = this.world();
-  const tagSet = model5.one.tagSet;
-  const fn = methods16.one.addTags;
-  let res = fn(tags, tagSet);
-  model5.one.tagSet = res;
-  return this;
-};
-var lib_default4 = { addTags: addTags2 };
-
-// node_modules/compromise/src/1-one/tag/compute/tagRank.js
-var boringTags = /* @__PURE__ */ new Set(["Auxiliary", "Possessive"]);
-var sortByKids = function(tags, tagSet) {
-  tags = tags.sort((a2, b) => {
-    if (boringTags.has(a2) || !tagSet.hasOwnProperty(b)) {
-      return 1;
-    }
-    if (boringTags.has(b) || !tagSet.hasOwnProperty(a2)) {
-      return -1;
-    }
-    let kids = tagSet[a2].children || [];
-    let aKids = kids.length;
-    kids = tagSet[b].children || [];
-    let bKids = kids.length;
-    return aKids - bKids;
-  });
-  return tags;
-};
-var tagRank = function(view) {
-  const { document: document2, world: world2 } = view;
-  const tagSet = world2.model.one.tagSet;
-  document2.forEach((terms) => {
-    terms.forEach((term) => {
-      let tags = Array.from(term.tags);
-      term.tagRank = sortByKids(tags, tagSet);
-    });
-  });
-};
-var tagRank_default = tagRank;
-
-// node_modules/compromise/src/1-one/tag/plugin.js
-var plugin_default10 = {
-  model: {
-    one: { tagSet: {} }
-  },
-  compute: {
-    tagRank: tagRank_default
-  },
-  methods: methods_default7,
-  api: api_default8,
-  lib: lib_default4
-};
-
-// node_modules/compromise/src/1-one/tokenize/methods/01-sentences/01-simple-split.js
-var initSplit = /([.!?\u203D\u2E18\u203C\u2047-\u2049]+\s)/g;
-var splitsOnly = /^[.!?\u203D\u2E18\u203C\u2047-\u2049]+\s$/;
-var newLine = /((?:\r?\n|\r)+)/;
-var basicSplit = function(text) {
-  let all4 = [];
-  let lines = text.split(newLine);
-  for (let i3 = 0; i3 < lines.length; i3++) {
-    let arr = lines[i3].split(initSplit);
-    for (let o2 = 0; o2 < arr.length; o2++) {
-      if (arr[o2 + 1] && splitsOnly.test(arr[o2 + 1]) === true) {
-        arr[o2] += arr[o2 + 1];
-        arr[o2 + 1] = "";
-      }
-      if (arr[o2] !== "") {
-        all4.push(arr[o2]);
-      }
-    }
-  }
-  return all4;
-};
-var simple_split_default = basicSplit;
-
-// node_modules/compromise/src/1-one/tokenize/methods/01-sentences/02-simple-merge.js
-var hasLetter = /[a-z0-9\u00C0-\u00FF\u00a9\u00ae\u2000-\u3300\ud000-\udfff]/i;
-var hasSomething = /\S/;
-var notEmpty = function(splits) {
-  let chunks2 = [];
-  for (let i3 = 0; i3 < splits.length; i3++) {
-    let s3 = splits[i3];
-    if (s3 === void 0 || s3 === "") {
-      continue;
-    }
-    if (hasSomething.test(s3) === false || hasLetter.test(s3) === false) {
-      if (chunks2[chunks2.length - 1]) {
-        chunks2[chunks2.length - 1] += s3;
-        continue;
-      } else if (splits[i3 + 1]) {
-        splits[i3 + 1] = s3 + splits[i3 + 1];
-        continue;
-      }
-    }
-    chunks2.push(s3);
-  }
-  return chunks2;
-};
-var simple_merge_default = notEmpty;
-
-// node_modules/compromise/src/1-one/tokenize/methods/01-sentences/03-smart-merge.js
-var smartMerge = function(chunks2, world2) {
-  const isSentence2 = world2.methods.one.tokenize.isSentence;
-  const abbrevs = world2.model.one.abbreviations || /* @__PURE__ */ new Set();
-  let sentences = [];
-  for (let i3 = 0; i3 < chunks2.length; i3++) {
-    let c2 = chunks2[i3];
-    if (chunks2[i3 + 1] && isSentence2(c2, abbrevs) === false) {
-      chunks2[i3 + 1] = c2 + (chunks2[i3 + 1] || "");
-    } else if (c2 && c2.length > 0) {
-      sentences.push(c2);
-      chunks2[i3] = "";
-    }
-  }
-  return sentences;
-};
-var smart_merge_default = smartMerge;
-
-// node_modules/compromise/src/1-one/tokenize/methods/01-sentences/04-quote-merge.js
-var MAX_QUOTE = 280;
-var pairs = {
-  '"': '"',
-  "\uFF02": "\uFF02",
-  "\u201C": "\u201D",
-  "\u201F": "\u201D",
-  "\u201E": "\u201D",
-  "\u2E42": "\u201D",
-  "\u201A": "\u2019",
-  "\xAB": "\xBB",
-  "\u2039": "\u203A",
-  "\u2035": "\u2032",
-  "\u2036": "\u2033",
-  "\u2037": "\u2034",
-  "\u301D": "\u301E",
-  "\u301F": "\u301E"
-};
-var openQuote = RegExp("(" + Object.keys(pairs).join("|") + ")", "g");
-var closeQuote = RegExp("(" + Object.values(pairs).join("|") + ")", "g");
-var closesQuote = function(str) {
-  if (!str) {
-    return false;
-  }
-  let m3 = str.match(closeQuote);
-  if (m3 !== null && m3.length === 1) {
-    return true;
-  }
-  return false;
-};
-var quoteMerge = function(splits) {
-  let arr = [];
-  for (let i3 = 0; i3 < splits.length; i3 += 1) {
-    let split3 = splits[i3];
-    let m3 = split3.match(openQuote);
-    if (m3 !== null && m3.length === 1) {
-      if (closesQuote(splits[i3 + 1]) && splits[i3 + 1].length < MAX_QUOTE) {
-        splits[i3] += splits[i3 + 1];
-        arr.push(splits[i3]);
-        splits[i3 + 1] = "";
-        i3 += 1;
-        continue;
-      }
-      if (closesQuote(splits[i3 + 2])) {
-        let toAdd = splits[i3 + 1] + splits[i3 + 2];
-        if (toAdd.length < MAX_QUOTE) {
-          splits[i3] += toAdd;
-          arr.push(splits[i3]);
-          splits[i3 + 1] = "";
-          splits[i3 + 2] = "";
-          i3 += 2;
-          continue;
-        }
-      }
-    }
-    arr.push(splits[i3]);
-  }
-  return arr;
-};
-var quote_merge_default = quoteMerge;
-
-// node_modules/compromise/src/1-one/tokenize/methods/01-sentences/05-parens-merge.js
-var MAX_LEN = 250;
-var hasOpen = /\(/g;
-var hasClosed = /\)/g;
-var mergeParens = function(splits) {
-  let arr = [];
-  for (let i3 = 0; i3 < splits.length; i3 += 1) {
-    let split3 = splits[i3];
-    let m3 = split3.match(hasOpen);
-    if (m3 !== null && m3.length === 1) {
-      if (splits[i3 + 1] && splits[i3 + 1].length < MAX_LEN) {
-        let m22 = splits[i3 + 1].match(hasClosed);
-        if (m22 !== null && m3.length === 1 && !hasOpen.test(splits[i3 + 1])) {
-          splits[i3] += splits[i3 + 1];
-          arr.push(splits[i3]);
-          splits[i3 + 1] = "";
-          i3 += 1;
-          continue;
-        }
-      }
-    }
-    arr.push(splits[i3]);
-  }
-  return arr;
-};
-var parens_merge_default = mergeParens;
-
-// node_modules/compromise/src/1-one/tokenize/methods/01-sentences/index.js
-var hasSomething2 = /\S/;
-var startWhitespace = /^\s+/;
-var splitSentences = function(text, world2) {
-  text = text || "";
-  text = String(text);
-  if (!text || typeof text !== "string" || hasSomething2.test(text) === false) {
-    return [];
-  }
-  text = text.replace("\xA0", " ");
-  let splits = simple_split_default(text);
-  let sentences = simple_merge_default(splits);
-  sentences = smart_merge_default(sentences, world2);
-  sentences = quote_merge_default(sentences);
-  sentences = parens_merge_default(sentences);
-  if (sentences.length === 0) {
-    return [text];
-  }
-  for (let i3 = 1; i3 < sentences.length; i3 += 1) {
-    let ws = sentences[i3].match(startWhitespace);
-    if (ws !== null) {
-      sentences[i3 - 1] += ws[0];
-      sentences[i3] = sentences[i3].replace(startWhitespace, "");
-    }
-  }
-  return sentences;
-};
-var sentences_default = splitSentences;
-
-// node_modules/compromise/src/1-one/tokenize/methods/02-terms/01-hyphens.js
-var hasHyphen2 = function(str, model5) {
-  let parts = str.split(/[-–—]/);
-  if (parts.length <= 1) {
-    return false;
-  }
-  const { prefixes: prefixes2, suffixes: suffixes6 } = model5.one;
-  if (parts[0].length === 1 && /[a-z]/i.test(parts[0])) {
-    return false;
-  }
-  if (prefixes2.hasOwnProperty(parts[0])) {
-    return false;
-  }
-  parts[1] = parts[1].trim().replace(/[.?!]$/, "");
-  if (suffixes6.hasOwnProperty(parts[1])) {
-    return false;
-  }
-  let reg = /^([a-z\u00C0-\u00FF`"'/]+)[-–—]([a-z0-9\u00C0-\u00FF].*)/i;
-  if (reg.test(str) === true) {
-    return true;
-  }
-  let reg2 = /^([0-9]{1,4})[-–—]([a-z\u00C0-\u00FF`"'/-]+$)/i;
-  if (reg2.test(str) === true) {
-    return true;
-  }
-  return false;
-};
-var splitHyphens2 = function(word) {
-  let arr = [];
-  const hyphens = word.split(/[-–—]/);
-  let whichDash = "-";
-  let found = word.match(/[-–—]/);
-  if (found && found[0]) {
-    whichDash = found;
-  }
-  for (let o2 = 0; o2 < hyphens.length; o2++) {
-    if (o2 === hyphens.length - 1) {
-      arr.push(hyphens[o2]);
-    } else {
-      arr.push(hyphens[o2] + whichDash);
-    }
-  }
-  return arr;
-};
-
-// node_modules/compromise/src/1-one/tokenize/methods/02-terms/03-ranges.js
-var combineRanges = function(arr) {
-  const startRange = /^[0-9]{1,4}(:[0-9][0-9])?([a-z]{1,2})? ?[-–—] ?$/;
-  const endRange = /^[0-9]{1,4}([a-z]{1,2})? ?$/;
-  for (let i3 = 0; i3 < arr.length - 1; i3 += 1) {
-    if (arr[i3 + 1] && startRange.test(arr[i3]) && endRange.test(arr[i3 + 1])) {
-      arr[i3] = arr[i3] + arr[i3 + 1];
-      arr[i3 + 1] = null;
-    }
-  }
-  return arr;
-};
-var ranges_default = combineRanges;
-
-// node_modules/compromise/src/1-one/tokenize/methods/02-terms/02-slashes.js
-var isSlash = /\p{L} ?\/ ?\p{L}+$/u;
-var combineSlashes = function(arr) {
-  for (let i3 = 1; i3 < arr.length - 1; i3++) {
-    if (isSlash.test(arr[i3])) {
-      arr[i3 - 1] += arr[i3] + arr[i3 + 1];
-      arr[i3] = null;
-      arr[i3 + 1] = null;
-    }
-  }
-  return arr;
-};
-var slashes_default = combineSlashes;
-
-// node_modules/compromise/src/1-one/tokenize/methods/02-terms/index.js
-var wordlike = /\S/;
-var isBoundary = /^[!?.]+$/;
-var naiiveSplit = /(\S+)/;
-var notWord = [".", "?", "!", ":", ";", "-", "\u2013", "\u2014", "--", "...", "(", ")", "[", "]", '"', "'", "`", "\xAB", "\xBB", "*"];
-notWord = notWord.reduce((h2, c2) => {
-  h2[c2] = true;
-  return h2;
-}, {});
-var isArray10 = function(arr) {
-  return Object.prototype.toString.call(arr) === "[object Array]";
-};
-var splitWords = function(str, model5) {
-  let result = [];
-  let arr = [];
-  str = str || "";
-  if (typeof str === "number") {
-    str = String(str);
-  }
-  if (isArray10(str)) {
-    return str;
-  }
-  const words = str.split(naiiveSplit);
-  for (let i3 = 0; i3 < words.length; i3++) {
-    if (hasHyphen2(words[i3], model5) === true) {
-      arr = arr.concat(splitHyphens2(words[i3]));
-      continue;
-    }
-    arr.push(words[i3]);
-  }
-  let carry = "";
-  for (let i3 = 0; i3 < arr.length; i3++) {
-    let word = arr[i3];
-    if (wordlike.test(word) === true && notWord.hasOwnProperty(word) === false && isBoundary.test(word) === false) {
-      if (result.length > 0) {
-        result[result.length - 1] += carry;
-        result.push(word);
-      } else {
-        result.push(carry + word);
-      }
-      carry = "";
-    } else {
-      carry += word;
-    }
-  }
-  if (carry) {
-    if (result.length === 0) {
-      result[0] = "";
-    }
-    result[result.length - 1] += carry;
-  }
-  result = slashes_default(result);
-  result = ranges_default(result);
-  result = result.filter((s3) => s3);
-  return result;
-};
-var terms_default = splitWords;
-
-// node_modules/compromise/src/1-one/tokenize/methods/03-whitespace/tokenize.js
-var isLetter = /\p{Letter}/u;
-var isNumber = /[\p{Number}\p{Currency_Symbol}]/u;
-var hasAcronym = /^[a-z]\.([a-z]\.)+/i;
-var chillin = /[sn]['’]$/;
-var normalizePunctuation = function(str, model5) {
-  let { prePunctuation: prePunctuation2, postPunctuation: postPunctuation2, emoticons: emoticons2 } = model5.one;
-  let original = str;
-  let pre = "";
-  let post = "";
-  let chars = Array.from(str);
-  if (emoticons2.hasOwnProperty(str.trim())) {
-    return { str: str.trim(), pre, post: " " };
-  }
-  let len = chars.length;
-  for (let i3 = 0; i3 < len; i3 += 1) {
-    let c2 = chars[0];
-    if (prePunctuation2[c2] === true) {
-      continue;
-    }
-    if ((c2 === "+" || c2 === "-") && isNumber.test(chars[1])) {
-      break;
-    }
-    if (c2 === "'" && c2.length === 3 && isNumber.test(chars[1])) {
-      break;
-    }
-    if (isLetter.test(c2) || isNumber.test(c2)) {
-      break;
-    }
-    pre += chars.shift();
-  }
-  len = chars.length;
-  for (let i3 = 0; i3 < len; i3 += 1) {
-    let c2 = chars[chars.length - 1];
-    if (postPunctuation2[c2] === true) {
-      continue;
-    }
-    if (isLetter.test(c2) || isNumber.test(c2)) {
-      break;
-    }
-    if (c2 === "." && hasAcronym.test(original) === true) {
-      continue;
-    }
-    if (c2 === "'" && chillin.test(original) === true) {
-      continue;
-    }
-    post = chars.pop() + post;
-  }
-  str = chars.join("");
-  if (str === "") {
-    original = original.replace(/ *$/, (after2) => {
-      post = after2 || "";
-      return "";
-    });
-    str = original;
-    pre = "";
-  }
-  return { str, pre, post };
-};
-var tokenize_default = normalizePunctuation;
-
-// node_modules/compromise/src/1-one/tokenize/methods/03-whitespace/index.js
-var parseTerm = (txt, model5) => {
-  let { str, pre, post } = tokenize_default(txt, model5);
-  const parsed = {
-    text: str,
-    pre,
-    post,
-    tags: /* @__PURE__ */ new Set()
-  };
-  return parsed;
-};
-var whitespace_default2 = parseTerm;
-
-// node_modules/compromise/src/1-one/tokenize/methods/unicode.js
-var killUnicode = function(str, world2) {
-  const unicode2 = world2.model.one.unicode || {};
-  str = str || "";
-  let chars = str.split("");
-  chars.forEach((s3, i3) => {
-    if (unicode2[s3]) {
-      chars[i3] = unicode2[s3];
-    }
-  });
-  return chars.join("");
-};
-var unicode_default = killUnicode;
-
-// node_modules/compromise/src/1-one/tokenize/compute/normal/01-cleanup.js
-var clean = function(str) {
-  str = str || "";
-  str = str.toLowerCase();
-  str = str.trim();
-  let original = str;
-  str = str.replace(/[,;.!?]+$/, "");
-  str = str.replace(/\u2026/g, "...");
-  str = str.replace(/\u2013/g, "-");
-  if (/^[:;]/.test(str) === false) {
-    str = str.replace(/\.{3,}$/g, "");
-    str = str.replace(/[",.!:;?)]+$/g, "");
-    str = str.replace(/^['"(]+/g, "");
-  }
-  str = str.replace(/[\u200B-\u200D\uFEFF]/g, "");
-  str = str.trim();
-  if (str === "") {
-    str = original;
-  }
-  str = str.replace(/([0-9]),([0-9])/g, "$1$2");
-  return str;
-};
-var cleanup_default = clean;
-
-// node_modules/compromise/src/1-one/tokenize/compute/normal/02-acronyms.js
-var periodAcronym = /([A-Z]\.)+[A-Z]?,?$/;
-var oneLetterAcronym = /^[A-Z]\.,?$/;
-var noPeriodAcronym = /[A-Z]{2,}('s|,)?$/;
-var lowerCaseAcronym = /([a-z]\.)+[a-z]\.?$/;
-var isAcronym = function(str) {
-  if (periodAcronym.test(str) === true) {
-    return true;
-  }
-  if (lowerCaseAcronym.test(str) === true) {
-    return true;
-  }
-  if (oneLetterAcronym.test(str) === true) {
-    return true;
-  }
-  if (noPeriodAcronym.test(str) === true) {
-    return true;
-  }
-  return false;
-};
-var doAcronym = function(str) {
-  if (isAcronym(str)) {
-    str = str.replace(/\./g, "");
-  }
-  return str;
-};
-var acronyms_default = doAcronym;
-
-// node_modules/compromise/src/1-one/tokenize/compute/normal/index.js
-var normalize = function(term, world2) {
-  const killUnicode2 = world2.methods.one.killUnicode;
-  let str = term.text || "";
-  str = cleanup_default(str);
-  str = killUnicode2(str, world2);
-  str = acronyms_default(str);
-  term.normal = str;
-};
-var normal_default = normalize;
-
-// node_modules/compromise/src/1-one/tokenize/methods/parse.js
-var parse2 = function(input, world2) {
-  const { methods: methods16, model: model5 } = world2;
-  const { splitSentences: splitSentences2, splitTerms, splitWhitespace } = methods16.one.tokenize;
-  input = input || "";
-  let sentences = splitSentences2(input, world2);
-  input = sentences.map((txt) => {
-    let terms = splitTerms(txt, model5);
-    terms = terms.map((t2) => splitWhitespace(t2, model5));
-    terms.forEach((t2) => {
-      normal_default(t2, world2);
-    });
-    return terms;
-  });
-  return input;
-};
-var parse_default2 = parse2;
-
-// node_modules/compromise/src/1-one/tokenize/methods/01-sentences/is-sentence.js
-var isAcronym2 = /[ .][A-Z]\.? *$/i;
-var hasEllipse = /(?:\u2026|\.{2,}) *$/;
-var hasLetter2 = /\p{L}/u;
-var leadInit = /^[A-Z]\. $/;
-var isSentence = function(str, abbrevs) {
-  if (hasLetter2.test(str) === false) {
-    return false;
-  }
-  if (isAcronym2.test(str) === true) {
-    return false;
-  }
-  if (str.length === 3 && leadInit.test(str)) {
-    return false;
-  }
-  if (hasEllipse.test(str) === true) {
-    return false;
-  }
-  let txt = str.replace(/[.!?\u203D\u2E18\u203C\u2047-\u2049] *$/, "");
-  let words = txt.split(" ");
-  let lastWord = words[words.length - 1].toLowerCase();
-  if (abbrevs.hasOwnProperty(lastWord) === true) {
-    return false;
-  }
-  return true;
-};
-var is_sentence_default = isSentence;
-
-// node_modules/compromise/src/1-one/tokenize/methods/index.js
-var methods_default8 = {
-  one: {
-    killUnicode: unicode_default,
-    tokenize: {
-      splitSentences: sentences_default,
-      isSentence: is_sentence_default,
-      splitTerms: terms_default,
-      splitWhitespace: whitespace_default2,
-      fromString: parse_default2
-    }
-  }
-};
-
-// node_modules/compromise/src/1-one/tokenize/model/aliases.js
-var aliases = {
-  "&": "and",
-  "@": "at",
-  "%": "percent",
-  "plz": "please",
-  "bein": "being"
-};
-var aliases_default = aliases;
-
-// node_modules/compromise/src/1-one/tokenize/model/abbreviations/misc.js
-var misc_default = [
-  "approx",
-  "apt",
-  "bc",
-  "cyn",
-  "eg",
-  "esp",
-  "est",
-  "etc",
-  "ex",
-  "exp",
-  "prob",
-  "pron",
-  "gal",
-  "min",
-  "pseud",
-  "fig",
-  "jd",
-  "lat",
-  "lng",
-  "vol",
-  "fm",
-  "def",
-  "misc",
-  "plz",
-  "ea",
-  "ps",
-  "sec",
-  "pt",
-  "pref",
-  "pl",
-  "pp",
-  "qt",
-  "fr",
-  "sq",
-  "nee",
-  "ss",
-  "tel",
-  "temp",
-  "vet",
-  "ver",
-  "fem",
-  "masc",
-  "eng",
-  "adj",
-  "vb",
-  "rb",
-  "inf",
-  "situ",
-  "vivo",
-  "vitro",
-  "wr"
-];
-
-// node_modules/compromise/src/1-one/tokenize/model/abbreviations/honorifics.js
-var honorifics_default = [
-  "adj",
-  "adm",
-  "adv",
-  "asst",
-  "atty",
-  "bldg",
-  "brig",
-  "capt",
-  "cmdr",
-  "comdr",
-  "cpl",
-  "det",
-  "dr",
-  "esq",
-  "gen",
-  "gov",
-  "hon",
-  "jr",
-  "llb",
-  "lt",
-  "maj",
-  "messrs",
-  "mlle",
-  "mme",
-  "mr",
-  "mrs",
-  "ms",
-  "mstr",
-  "phd",
-  "prof",
-  "pvt",
-  "rep",
-  "reps",
-  "res",
-  "rev",
-  "sen",
-  "sens",
-  "sfc",
-  "sgt",
-  "sir",
-  "sr",
-  "supt",
-  "surg"
-];
-
-// node_modules/compromise/src/1-one/tokenize/model/abbreviations/months.js
-var months_default = ["jan", "feb", "mar", "apr", "jun", "jul", "aug", "sep", "sept", "oct", "nov", "dec"];
-
-// node_modules/compromise/src/1-one/tokenize/model/abbreviations/nouns.js
-var nouns_default = [
-  "ad",
-  "al",
-  "arc",
-  "ba",
-  "bl",
-  "ca",
-  "cca",
-  "col",
-  "corp",
-  "ft",
-  "fy",
-  "ie",
-  "lit",
-  "ma",
-  "md",
-  "pd",
-  "tce"
-];
-
-// node_modules/compromise/src/1-one/tokenize/model/abbreviations/organizations.js
-var organizations_default = ["dept", "univ", "assn", "bros", "inc", "ltd", "co"];
-
-// node_modules/compromise/src/1-one/tokenize/model/abbreviations/places.js
-var places_default = [
-  "rd",
-  "st",
-  "dist",
-  "mt",
-  "ave",
-  "blvd",
-  "cl",
-  "cres",
-  "hwy",
-  "ariz",
-  "cal",
-  "calif",
-  "colo",
-  "conn",
-  "fla",
-  "fl",
-  "ga",
-  "ida",
-  "ia",
-  "kan",
-  "kans",
-  "minn",
-  "neb",
-  "nebr",
-  "okla",
-  "penna",
-  "penn",
-  "pa",
-  "dak",
-  "tenn",
-  "tex",
-  "ut",
-  "vt",
-  "va",
-  "wis",
-  "wisc",
-  "wy",
-  "wyo",
-  "usafa",
-  "alta",
-  "ont",
-  "que",
-  "sask"
-];
-
-// node_modules/compromise/src/1-one/tokenize/model/abbreviations/units.js
-var units_default = [
-  "dl",
-  "ml",
-  "gal",
-  "qt",
-  "pt",
-  "tbl",
-  "tsp",
-  "tbsp",
-  "km",
-  "dm",
-  "cm",
-  "mm",
-  "mi",
-  "td",
-  "hr",
-  "hrs",
-  "kg",
-  "hg",
-  "dg",
-  "cg",
-  "mg",
-  "\xB5g",
-  "lb",
-  "oz",
-  "sq ft",
-  "hz",
-  "mps",
-  "mph",
-  "kmph",
-  "kb",
-  "mb",
-  "tb",
-  "lx",
-  "lm",
-  "fl oz",
-  "yb"
-];
-
-// node_modules/compromise/src/1-one/tokenize/model/lexicon.js
-var list = [
-  [misc_default],
-  [units_default, "Unit"],
-  [nouns_default, "Noun"],
-  [honorifics_default, "Honorific"],
-  [months_default, "Month"],
-  [organizations_default, "Organization"],
-  [places_default, "Place"]
-];
-var abbreviations = {};
-var lexicon2 = {};
-list.forEach((a2) => {
-  a2[0].forEach((w) => {
-    abbreviations[w] = true;
-    lexicon2[w] = "Abbreviation";
-    if (a2[1] !== void 0) {
-      lexicon2[w] = [lexicon2[w], a2[1]];
-    }
-  });
-});
-
-// node_modules/compromise/src/1-one/tokenize/model/prefixes.js
-var prefixes_default = [
-  "anti",
-  "bi",
-  "co",
-  "contra",
-  "de",
-  "extra",
-  "infra",
-  "inter",
-  "intra",
-  "macro",
-  "micro",
-  "mis",
-  "mono",
-  "multi",
-  "peri",
-  "pre",
-  "pro",
-  "proto",
-  "pseudo",
-  "re",
-  "sub",
-  "supra",
-  "trans",
-  "tri",
-  "un",
-  "out",
-  "ex"
-].reduce((h2, str) => {
-  h2[str] = true;
-  return h2;
-}, {});
-
-// node_modules/compromise/src/1-one/tokenize/model/suffixes.js
-var suffixes_default = {
-  "like": true,
-  "ish": true,
-  "less": true,
-  "able": true,
-  "elect": true,
-  "type": true,
-  "designate": true
-};
-
-// node_modules/compromise/src/1-one/tokenize/model/unicode.js
-var compact = {
-  "!": "\xA1",
-  "?": "\xBF\u0241",
-  '"': '\u201C\u201D"\u275D\u275E',
-  "'": "\u2018\u201B\u275B\u275C\u2019",
-  "-": "\u2014\u2013",
-  a: "\xAA\xC0\xC1\xC2\xC3\xC4\xC5\xE0\xE1\xE2\xE3\xE4\xE5\u0100\u0101\u0102\u0103\u0104\u0105\u01CD\u01CE\u01DE\u01DF\u01E0\u01E1\u01FA\u01FB\u0200\u0201\u0202\u0203\u0226\u0227\u023A\u0386\u0391\u0394\u039B\u03AC\u03B1\u03BB\u0410\u0430\u0466\u0467\u04D0\u04D1\u04D2\u04D3\u019B\xE6",
-  b: "\xDF\xFE\u0180\u0181\u0182\u0183\u0184\u0185\u0243\u0392\u03B2\u03D0\u03E6\u0411\u0412\u042A\u042C\u0432\u044A\u044C\u0462\u0463\u048C\u048D",
-  c: "\xA2\xA9\xC7\xE7\u0106\u0107\u0108\u0109\u010A\u010B\u010C\u010D\u0186\u0187\u0188\u023B\u023C\u037B\u037C\u03F2\u03F9\u03FD\u03FE\u0421\u0441\u0454\u0480\u0481\u04AA\u04AB",
-  d: "\xD0\u010E\u010F\u0110\u0111\u0189\u018A\u0221\u018B\u018C",
-  e: "\xC8\xC9\xCA\xCB\xE8\xE9\xEA\xEB\u0112\u0113\u0114\u0115\u0116\u0117\u0118\u0119\u011A\u011B\u0190\u0204\u0205\u0206\u0207\u0228\u0229\u0246\u0247\u0388\u0395\u039E\u03A3\u03AD\u03B5\u03BE\u03F5\u0400\u0401\u0415\u0435\u0450\u0451\u04BC\u04BD\u04BE\u04BF\u04D6\u04D7",
-  f: "\u0191\u0192\u03DC\u03DD\u04FA\u04FB\u0492\u0493\u017F",
-  g: "\u011C\u011D\u011E\u011F\u0120\u0121\u0122\u0123\u0193\u01E4\u01E5\u01E6\u01E7\u01F4\u01F5",
-  h: "\u0124\u0125\u0126\u0127\u0195\u01F6\u021E\u021F\u0389\u0397\u0402\u040A\u040B\u041D\u043D\u0452\u045B\u04A2\u04A3\u04A4\u04A5\u04BA\u04BB\u04C9\u04CA",
-  I: "\xCC\xCD\xCE\xCF",
-  i: "\xEC\xED\xEE\xEF\u0128\u0129\u012A\u012B\u012C\u012D\u012E\u012F\u0130\u0131\u0196\u0197\u0208\u0209\u020A\u020B\u038A\u0390\u03AA\u03AF\u03B9\u03CA\u0406\u0407\u0456\u0457",
-  j: "\u0134\u0135\u01F0\u0237\u0248\u0249\u03F3\u0408\u0458",
-  k: "\u0136\u0137\u0138\u0198\u0199\u01E8\u01E9\u039A\u03BA\u040C\u0416\u041A\u0436\u043A\u045C\u049A\u049B\u049C\u049D\u049E\u049F\u04A0\u04A1",
-  l: "\u0139\u013A\u013B\u013C\u013D\u013E\u013F\u0140\u0141\u0142\u019A\u01AA\u01C0\u01CF\u01D0\u0234\u023D\u0399\u04C0\u04CF",
-  m: "\u039C\u03FA\u03FB\u041C\u043C\u04CD\u04CE",
-  n: "\xD1\xF1\u0143\u0144\u0145\u0146\u0147\u0148\u0149\u014A\u014B\u019D\u019E\u01F8\u01F9\u0220\u0235\u039D\u03A0\u03AE\u03B7\u03DE\u040D\u0418\u0419\u041B\u041F\u0438\u0439\u043B\u043F\u045D\u048A\u048B\u04C5\u04C6\u04E2\u04E3\u04E4\u04E5\u03C0",
-  o: "\xD2\xD3\xD4\xD5\xD6\xD8\xF0\xF2\xF3\xF4\xF5\xF6\xF8\u014C\u014D\u014E\u014F\u0150\u0151\u019F\u01A0\u01A1\u01D1\u01D2\u01EA\u01EB\u01EC\u01ED\u01FE\u01FF\u020C\u020D\u020E\u020F\u022A\u022B\u022C\u022D\u022E\u022F\u0230\u0231\u038C\u0398\u039F\u03B8\u03BF\u03C3\u03CC\u03D5\u03D8\u03D9\u03EC\u03F4\u041E\u0424\u043E\u0472\u0473\u04E6\u04E7\u04E8\u04E9\u04EA\u04EB",
-  p: "\u01A4\u03A1\u03C1\u03F7\u03F8\u03FC\u0420\u0440\u048E\u048F\xDE",
-  q: "\u024A\u024B",
-  r: "\u0154\u0155\u0156\u0157\u0158\u0159\u01A6\u0210\u0211\u0212\u0213\u024C\u024D\u0403\u0413\u042F\u0433\u044F\u0453\u0490\u0491",
-  s: "\u015A\u015B\u015C\u015D\u015E\u015F\u0160\u0161\u01A7\u01A8\u0218\u0219\u023F\u0405\u0455",
-  t: "\u0162\u0163\u0164\u0165\u0166\u0167\u01AB\u01AC\u01AD\u01AE\u021A\u021B\u0236\u023E\u0393\u03A4\u03C4\u03EE\u0422\u0442",
-  u: "\xD9\xDA\xDB\xDC\xF9\xFA\xFB\xFC\u0168\u0169\u016A\u016B\u016C\u016D\u016E\u016F\u0170\u0171\u0172\u0173\u01AF\u01B0\u01B1\u01B2\u01D3\u01D4\u01D5\u01D6\u01D7\u01D8\u01D9\u01DA\u01DB\u01DC\u0214\u0215\u0216\u0217\u0244\u03B0\u03C5\u03CB\u03CD",
-  v: "\u03BD\u0474\u0475\u0476\u0477",
-  w: "\u0174\u0175\u019C\u03C9\u03CE\u03D6\u03E2\u03E3\u0428\u0429\u0448\u0449\u0461\u047F",
-  x: "\xD7\u03A7\u03C7\u03D7\u03F0\u0425\u0445\u04B2\u04B3\u04FC\u04FD\u04FE\u04FF",
-  y: "\xDD\xFD\xFF\u0176\u0177\u0178\u01B3\u01B4\u0232\u0233\u024E\u024F\u038E\u03A5\u03AB\u03B3\u03C8\u03D2\u03D3\u03D4\u040E\u0423\u0443\u0447\u045E\u0470\u0471\u04AE\u04AF\u04B0\u04B1\u04EE\u04EF\u04F0\u04F1\u04F2\u04F3",
-  z: "\u0179\u017A\u017B\u017C\u017D\u017E\u01B5\u01B6\u0224\u0225\u0240\u0396"
-};
-var unicode = {};
-Object.keys(compact).forEach(function(k2) {
-  compact[k2].split("").forEach(function(s3) {
-    unicode[s3] = k2;
-  });
-});
-var unicode_default2 = unicode;
-
-// node_modules/compromise/src/1-one/tokenize/model/punctuation.js
-var prePunctuation = {
-  "#": true,
-  "@": true,
-  "_": true,
-  "\xB0": true,
-  "\u200B": true,
-  "\u200C": true,
-  "\u200D": true,
-  "\uFEFF": true
-};
-var postPunctuation = {
-  "%": true,
-  "_": true,
-  "\xB0": true,
-  "\u200B": true,
-  "\u200C": true,
-  "\u200D": true,
-  "\uFEFF": true
-};
-var emoticons = {
-  "<3": true,
-  "</3": true,
-  "<\\3": true,
-  ":^P": true,
-  ":^p": true,
-  ":^O": true,
-  ":^3": true
-};
-
-// node_modules/compromise/src/1-one/tokenize/model/index.js
-var model_default2 = {
-  one: {
-    aliases: aliases_default,
-    abbreviations,
-    prefixes: prefixes_default,
-    suffixes: suffixes_default,
-    prePunctuation,
-    postPunctuation,
-    lexicon: lexicon2,
-    unicode: unicode_default2,
-    emoticons
-  }
-};
-
-// node_modules/compromise/src/1-one/tokenize/compute/alias.js
-var hasSlash = /\//;
-var hasDomain = /[a-z]\.[a-z]/i;
-var isMath = /[0-9]/;
-var addAliases = function(term, world2) {
-  let str = term.normal || term.text || term.machine;
-  const aliases3 = world2.model.one.aliases;
-  if (aliases3.hasOwnProperty(str)) {
-    term.alias = term.alias || [];
-    term.alias.push(aliases3[str]);
-  }
-  if (hasSlash.test(str) && !hasDomain.test(str) && !isMath.test(str)) {
-    let arr = str.split(hasSlash);
-    if (arr.length <= 2) {
-      arr.forEach((word) => {
-        word = word.trim();
-        if (word !== "") {
-          term.alias = term.alias || [];
-          term.alias.push(word);
-        }
-      });
-    }
-  }
-  return term;
-};
-var alias_default = addAliases;
-
-// node_modules/compromise/src/1-one/tokenize/compute/machine.js
-var hasDash3 = /^\p{Letter}+-\p{Letter}+$/u;
-var doMachine = function(term) {
-  let str = term.implicit || term.normal || term.text;
-  str = str.replace(/['’]s$/, "");
-  str = str.replace(/s['’]$/, "s");
-  str = str.replace(/([aeiou][ktrp])in'$/, "$1ing");
-  if (hasDash3.test(str)) {
-    str = str.replace(/-/g, "");
-  }
-  str = str.replace(/^[#@]/, "");
-  if (str !== term.normal) {
-    term.machine = str;
-  }
-};
-var machine_default = doMachine;
-
-// node_modules/compromise/src/1-one/tokenize/compute/freq.js
-var freq = function(view) {
-  let docs = view.docs;
-  let counts = {};
-  for (let i3 = 0; i3 < docs.length; i3 += 1) {
-    for (let t2 = 0; t2 < docs[i3].length; t2 += 1) {
-      let term = docs[i3][t2];
-      let word = term.machine || term.normal;
-      counts[word] = counts[word] || 0;
-      counts[word] += 1;
-    }
-  }
-  for (let i3 = 0; i3 < docs.length; i3 += 1) {
-    for (let t2 = 0; t2 < docs[i3].length; t2 += 1) {
-      let term = docs[i3][t2];
-      let word = term.machine || term.normal;
-      term.freq = counts[word];
-    }
-  }
-};
-var freq_default = freq;
-
-// node_modules/compromise/src/1-one/tokenize/compute/offset.js
-var offset = function(view) {
-  let elapsed = 0;
-  let index3 = 0;
-  let docs = view.document;
-  for (let i3 = 0; i3 < docs.length; i3 += 1) {
-    for (let t2 = 0; t2 < docs[i3].length; t2 += 1) {
-      let term = docs[i3][t2];
-      term.offset = {
-        index: index3,
-        start: elapsed + term.pre.length,
-        length: term.text.length
-      };
-      elapsed += term.pre.length + term.text.length + term.post.length;
-      index3 += 1;
-    }
-  }
-};
-var offset_default = offset;
-
-// node_modules/compromise/src/1-one/tokenize/compute/reindex.js
-var index2 = function(view) {
-  let document2 = view.document;
-  for (let n3 = 0; n3 < document2.length; n3 += 1) {
-    for (let i3 = 0; i3 < document2[n3].length; i3 += 1) {
-      document2[n3][i3].index = [n3, i3];
-    }
-  }
-};
-var reindex_default = index2;
-
-// node_modules/compromise/src/1-one/tokenize/compute/wordCount.js
-var wordCount2 = function(view) {
-  let n3 = 0;
-  let docs = view.docs;
-  for (let i3 = 0; i3 < docs.length; i3 += 1) {
-    for (let t2 = 0; t2 < docs[i3].length; t2 += 1) {
-      if (docs[i3][t2].normal === "") {
-        continue;
-      }
-      n3 += 1;
-      docs[i3][t2].wordCount = n3;
-    }
-  }
-};
-var wordCount_default = wordCount2;
-
-// node_modules/compromise/src/1-one/tokenize/compute/index.js
-var termLoop = function(view, fn) {
-  let docs = view.docs;
-  for (let i3 = 0; i3 < docs.length; i3 += 1) {
-    for (let t2 = 0; t2 < docs[i3].length; t2 += 1) {
-      fn(docs[i3][t2], view.world);
-    }
-  }
-};
-var methods15 = {
-  alias: (view) => termLoop(view, alias_default),
-  machine: (view) => termLoop(view, machine_default),
-  normal: (view) => termLoop(view, normal_default),
-  freq: freq_default,
-  offset: offset_default,
-  index: reindex_default,
-  wordCount: wordCount_default
-};
-var compute_default6 = methods15;
-
-// node_modules/compromise/src/1-one/tokenize/plugin.js
-var plugin_default11 = {
-  compute: compute_default6,
-  methods: methods_default8,
-  model: model_default2,
-  hooks: ["alias", "machine", "index", "id"]
-};
-
-// node_modules/compromise/src/1-one/typeahead/compute.js
-var typeahead = function(view) {
-  const prefixes2 = view.model.one.typeahead;
-  const docs = view.docs;
-  if (docs.length === 0 || Object.keys(prefixes2).length === 0) {
-    return;
-  }
-  let lastPhrase = docs[docs.length - 1] || [];
-  let lastTerm = lastPhrase[lastPhrase.length - 1];
-  if (lastTerm.post) {
-    return;
-  }
-  if (prefixes2.hasOwnProperty(lastTerm.normal)) {
-    let found = prefixes2[lastTerm.normal];
-    lastTerm.implicit = found;
-    lastTerm.machine = found;
-    lastTerm.typeahead = true;
-    if (view.compute.preTagger) {
-      view.last().unTag("*").compute(["lexicon", "preTagger"]);
-    }
-  }
-};
-var compute_default7 = { typeahead };
-
-// node_modules/compromise/src/1-one/typeahead/api.js
-var autoFill = function() {
-  const docs = this.docs;
-  if (docs.length === 0) {
-    return this;
-  }
-  let lastPhrase = docs[docs.length - 1] || [];
-  let term = lastPhrase[lastPhrase.length - 1];
-  if (term.typeahead === true && term.machine) {
-    term.text = term.machine;
-    term.normal = term.machine;
-  }
-  return this;
-};
-var api2 = function(View2) {
-  View2.prototype.autoFill = autoFill;
-};
-var api_default9 = api2;
-
-// node_modules/compromise/src/1-one/typeahead/lib/allPrefixes.js
-var getPrefixes = function(arr, opts2, world2) {
-  let index3 = {};
-  let collisions = [];
-  let existing = world2.prefixes || {};
-  arr.forEach((str) => {
-    str = str.toLowerCase().trim();
-    let max3 = str.length;
-    if (opts2.max && max3 > opts2.max) {
-      max3 = opts2.max;
-    }
-    for (let size = opts2.min; size < max3; size += 1) {
-      let prefix6 = str.substring(0, size);
-      if (opts2.safe && world2.model.one.lexicon.hasOwnProperty(prefix6)) {
-        continue;
-      }
-      if (existing.hasOwnProperty(prefix6) === true) {
-        collisions.push(prefix6);
-        continue;
-      }
-      if (index3.hasOwnProperty(prefix6) === true) {
-        collisions.push(prefix6);
-        continue;
-      }
-      index3[prefix6] = str;
-    }
-  });
-  index3 = Object.assign({}, existing, index3);
-  collisions.forEach((str) => {
-    delete index3[str];
-  });
-  return index3;
-};
-var allPrefixes_default = getPrefixes;
-
-// node_modules/compromise/src/1-one/typeahead/lib/index.js
-var isObject7 = (val) => {
-  return Object.prototype.toString.call(val) === "[object Object]";
-};
-var defaults2 = {
-  safe: true,
-  min: 3
-};
-var prepare = function(words = [], opts2 = {}) {
-  let model5 = this.model();
-  opts2 = Object.assign({}, defaults2, opts2);
-  if (isObject7(words)) {
-    Object.assign(model5.one.lexicon, words);
-    words = Object.keys(words);
-  }
-  let prefixes2 = allPrefixes_default(words, opts2, this.world());
-  Object.keys(prefixes2).forEach((str) => {
-    if (model5.one.typeahead.hasOwnProperty(str)) {
-      delete model5.one.typeahead[str];
-      return;
-    }
-    model5.one.typeahead[str] = prefixes2[str];
-  });
-  return this;
-};
-var lib_default5 = {
-  typeahead: prepare
-};
-
-// node_modules/compromise/src/1-one/typeahead/plugin.js
-var model3 = {
-  one: {
-    typeahead: {}
-  }
-};
-var plugin_default12 = {
-  model: model3,
-  api: api_default9,
-  lib: lib_default5,
-  compute: compute_default7,
-  hooks: ["typeahead"]
-};
-
-// node_modules/compromise/src/one.js
-nlp_default.extend(plugin_default2);
-nlp_default.extend(plugin_default7);
-nlp_default.extend(plugin_default6);
-nlp_default.extend(plugin_default8);
-nlp_default.extend(plugin_default10);
-nlp_default.plugin(plugin_default3);
-nlp_default.extend(plugin_default11);
-nlp_default.plugin(plugin_default);
-nlp_default.extend(plugin_default5);
-nlp_default.extend(plugin_default12);
-nlp_default.extend(plugin_default4);
-nlp_default.extend(plugin_default9);
-var one_default = nlp_default;
-
-// node_modules/compromise/src/2-two/preTagger/model/irregulars/plurals.js
-var plurals_default = {
-  addendum: "addenda",
-  corpus: "corpora",
-  criterion: "criteria",
-  curriculum: "curricula",
-  genus: "genera",
-  memorandum: "memoranda",
-  opus: "opera",
-  ovum: "ova",
-  phenomenon: "phenomena",
-  referendum: "referenda",
-  alga: "algae",
-  alumna: "alumnae",
-  antenna: "antennae",
-  formula: "formulae",
-  larva: "larvae",
-  nebula: "nebulae",
-  vertebra: "vertebrae",
-  analysis: "analyses",
-  axis: "axes",
-  diagnosis: "diagnoses",
-  parenthesis: "parentheses",
-  prognosis: "prognoses",
-  synopsis: "synopses",
-  thesis: "theses",
-  neurosis: "neuroses",
-  appendix: "appendices",
-  index: "indices",
-  matrix: "matrices",
-  ox: "oxen",
-  sex: "sexes",
-  alumnus: "alumni",
-  bacillus: "bacilli",
-  cactus: "cacti",
-  fungus: "fungi",
-  hippopotamus: "hippopotami",
-  libretto: "libretti",
-  modulus: "moduli",
-  nucleus: "nuclei",
-  octopus: "octopi",
-  radius: "radii",
-  stimulus: "stimuli",
-  syllabus: "syllabi",
-  cookie: "cookies",
-  calorie: "calories",
-  auntie: "aunties",
-  movie: "movies",
-  pie: "pies",
-  rookie: "rookies",
-  tie: "ties",
-  zombie: "zombies",
-  leaf: "leaves",
-  loaf: "loaves",
-  thief: "thieves",
-  foot: "feet",
-  goose: "geese",
-  tooth: "teeth",
-  beau: "beaux",
-  chateau: "chateaux",
-  tableau: "tableaux",
-  bus: "buses",
-  gas: "gases",
-  circus: "circuses",
-  crisis: "crises",
-  virus: "viruses",
-  database: "databases",
-  excuse: "excuses",
-  abuse: "abuses",
-  avocado: "avocados",
-  barracks: "barracks",
-  child: "children",
-  clothes: "clothes",
-  echo: "echoes",
-  embargo: "embargoes",
-  epoch: "epochs",
-  deer: "deer",
-  halo: "halos",
-  man: "men",
-  woman: "women",
-  mosquito: "mosquitoes",
-  mouse: "mice",
-  person: "people",
-  quiz: "quizzes",
-  rodeo: "rodeos",
-  shoe: "shoes",
-  sombrero: "sombreros",
-  stomach: "stomachs",
-  tornado: "tornados",
-  tuxedo: "tuxedos"
-};
-
-// node_modules/compromise/src/2-two/preTagger/model/lexicon/_data.js
-var data_default = {
-  "Comparative": "true\xA6better",
-  "Superlative": "true\xA6earlier",
-  "PresentTense": "true\xA6sounds",
-  "Condition": "true\xA6lest,unless",
-  "PastTense": "true\xA6be2came,d1had,lied,mea0sa1taken,we0;nt;id;en,gan",
-  "Gerund": "true\xA6accord0be0go0result0stain0;ing",
-  "Expression": "true\xA6a0Sb0Oc0Md0Ie0Gg0AhVjeez,lSmRnPoKpHshGtFuCvoi0Uw6y0;a4e3i1u0;ck,p;kZp0;ee,pee;ah,p,s;!a,y;ahoo,h2o1t0;af,f;rd up,w;e1o0;a,ops;e,w;gh,h0;! 0h,m;huh,oh;here nNsk,ut tut;eesh,hh,it,oo;ff,h1l0ow,sst;ease,z;ew,ooey;h1i,o0uch,w,y;h,o,ps;! 0h;h0w0;ell;ah,o0;!pe;eh,mm;ah,m1ol0;!s;ao,fao;aBeAi8o2u0;h,mph,rra0zzB;h,y;ly1o0;r5y8;! 0;c1moCsmok0;es;ow;!p hip hoor0;ay;ck,e,llo,y;ha1i,lleluj0;ah;!ha;ah,ee4o1r0;eat scott,r;l1od0sh; grief,bye;ly;! whiz;e0h,t cetera,ww,xcuse me;k,p;'oh,a0rat,uh;m0ng;mit,n0;!it;mon,o0;ngratulations,wabunga;a2oo1r0ye;avo,r;!ya;h,m; 1h0las,men,rgh,ye;!a,em,oy;la",
-  "Negative": "true\xA6n0;ever,o0;n,t",
-  "QuestionWord": "true\xA6how3wh0;at,e1ich,o0y;!m,se;n,re; come,'s",
-  "Reflexive": "true\xA6h4it5my5o1the0your2;ir1m1;ne3ur0;sel0;f,ves;er0im0;self",
-  "Plural": "true\xA6dick0gre0ones,records;ens",
-  "Unit|Noun": "true\xA6cEfDgChBinchAk9lb,m6newt5oz,p4qt,t1y0;ardEd;able1b0ea1sp;!l,sp;spo1;a,oundAt,x;on9;!b,g,i1l,m,p0;h,s;!les;!b,elvin,g,m;!es;g,z;al,b;eet,oot,t;m,up0;!s",
-  "Value": "true\xA6a few",
-  "Imperative": "true\xA6come here",
-  "Demonym": "true\xA60:15;1:12;a0Vb0Oc0Dd0Ce08f07g04h02iYjVkTlPmLnIomHpEqatari,rCs7t5u4v3welAz2;am0Gimbabwe0;enezuel0ietnam0I;gAkrai1;aiwTex0hai,rinida0Ju2;ni0Prkmen;a5cotti4e3ingapoOlovak,oma0Spaniard,udRw2y0W;ede,iss;negal0Cr09;sh;mo0uT;o5us0Jw2;and0;a2eru0Fhilippi0Nortugu07uerto r0S;kist3lesti1na2raguay0;ma1;ani;ami00i2orweP;caragu0geri2;an,en;a3ex0Lo2;ngo0Drocc0;cedo1la2;gasy,y07;a4eb9i2;b2thua1;e0Cy0;o,t01;azakh,eny0o2uwaiI;re0;a2orda1;ma0Ap2;anO;celandic,nd4r2sraeli,ta01vo05;a2iB;ni0qi;i0oneU;aiAin2ondur0unO;di;amEe2hanai0reek,uatemal0;or2rm0;gi0;ilipino,ren8;cuadoVgyp4mira3ngli2sto1thiopi0urope0;shm0;ti;ti0;aPominUut3;a9h6o4roat3ub0ze2;ch;!i0;lom2ngol5;bi0;a6i2;le0n2;ese;lifor1m2na3;bo2eroo1;di0;angladeshi,el6o4r3ul2;gaE;azi9it;li2s1;vi0;aru2gi0;si0;fAl7merBngol0r5si0us2;sie,tr2;a2i0;li0;genti2me1;ne;ba1ge2;ri0;ni0;gh0r2;ic0;an",
-  "Organization": "true\xA60:4D;a3Gb2Yc2Ed26e22f1Xg1Ph1Ki1Hj1Fk1Dl18m0Wn0Jo0Gp09qu08r01sTtGuBv8w3xiaomi,y1;amaha,m13ou1w13;gov,tu2Z;a3e1orld trade organizati2S;lls fargo,st1;fie28inghou2I;l1rner br3I;gree37l street journ29m17;an halOeriz2Nisa,o1;dafo2Ol1;kswagMvo;b4kip,n2ps,s1;a tod2Yps;es3Ai1;lev33ted natio30;er,s; mobi2Qaco beQd bNeAgi frida9h3im horto2Ymz,o1witt31;shi3Xy1;ota,s r 00;e 1in lizzy;b3carpen37daily ma31guess w2holli0rolling st1Rs1w2;mashing pumpki2Tuprem0;ho;ea1lack eyed pe3Lyrds;ch bo1tl0;ys;l2n3Ds1xas instrumen1J;co,la m15;efoni0Cus;a7e4ieme2Lnp,o2pice gir5quare04ta1ubaru;rbucks,to2R;ny,undgard1;en;a2x pisto1;ls;g1Nrs;few2Ainsbury2QlesforYmsu22;.e.m.,adiohead,b6e3oyal 1yana30;b1dutch she4;ank;aders dige1Gd 1max,vl1R;bu1c1Zhot chili peppe2Nlobst2C;ll;c,s;ant30izno2I;a5bs,e3fiz28hilip morrCi2r1;emier2Audenti16;nk floyd,zza hut;psi2Btro1uge0A;br2Vchina,n2V;lant2Nn1yp12; 2ason20da2I;ld navy,pec,range juli2xf1;am;us;aAb9e6fl,h5i4o1sa,vid3wa;k2tre dame,vart1;is;ia;ke,ntendo,ss0L;l,s;c,st1Htflix,w1; 1sweek;kids on the block,york09;a,c;nd1Vs2t1;ional aca2Io,we0Q;a,cYd0O;aBcdonaldAe7i5lb,o3tv,y1;spa1;ce;b1Mnsanto,ody blu0t1;ley crue,or0O;crosoft,t1;as,subisM;dica2rcedes benz,talli1;ca;id,re;'s,s;c's milk,tt14z1Z;'ore08a3e1g,ittle caesa1K;novo,x1;is,mark; 1bour party;pres0Bz boy;atv,fc,kk,m1od1J;art;iffy lu0Moy divisi0Gpmorgan1sa;! cha07;bm,hop,n1tv;g,te1;l,rpol;asbro,ewlett pack1Ri3o1sbc,yundai;me dep1n1L;ot;tac1zbollah;hi;eneral 6hq,ithub,l5mb,o2reen d0Lu1;cci,ns n ros0;ldman sachs,o1;dye1g0E;ar;axo smith kli03encoV;electr0Km1;oto0W;a4bi,da,edex,i2leetwood mac,o1rito l0D;rd,xcX;at,nancial1restoY; tim0;cebook,nnie mae;b08sa,u3xxon1; m1m1;ob0H;!rosceptics;aiml0Be6isney,o4u1;nkin donu2po0Xran dur1;an;ts;j,w j1;on0;a,f lepp0Zll,peche mode,r spiegZstiny's chi1;ld;aIbc,hEiCloudflaBnn,o3r1;aigsli5eedence clearwater reviv1ossra06;al;ca c7inba6l4m1o0Bst06;ca2p1;aq;st;dplPg1;ate;se;ola;re;a,sco1tigroup;! systems;ev2i1;ck fil-a,na daily;r1y;on;dbury,pital o1rl's jr;ne;aEbc,eBf9l5mw,ni,o1p,rexiteeU;ei3mbardiIston 1;glo1pizza;be;ng;o2ue c1;roV;ckbuster video,omingda1;le; g1g1;oodriL;cht2e ge0rkshire hathaw1;ay;el;idu,nana republ3s1xt5y5;f,kin robbi1;ns;ic;bYcTdidSerosmith,iRlKmEnheuser-busDol,pple9r6s3utodesk,v2y1;er;is,on;hland1sociated F; o1;il;by4g2m1;co;os; compu2bee1;'s;te1;rs;ch;c,d,erican3t1;!r1;ak; ex1;pre1;ss; 5catel2ta1;ir;!-lu1;ce1;nt;jazeera,qae1;da;g,rbnb;as;/dc,a3er,tivision1;! blizz1;ard;demy of scienc0;es;ba",
-  "Possessive": "true\xA6its,my,none,our0;!s",
-  "Noun|Verb": "true\xA60:9C;1:8O;2:7T;3:97;4:9K;5:9N;6:9J;7:86;8:8L;9:9R;a92b86c70d6Be61f5Eg52h4Ti4Lj4Ik4Fl43m3Rn3No3Jp2Hques94r1Ss0EtYuWvRwDyCzA;ip,oA;ne,om;awn,e60ie5T;aKeIhFiDoBrA;ap,e92;nd0rA;k,ry,sh54th;ck,mp,nApe,re,sh,tne9N;!d,g;e7OiA;p,sA;k,t1;aAed;r,th0;it,lk,rBsAt3ve,x;h,te;!ehou2ra9;aDiCoA;iAlunte0m8te,w;ce,d;be,ew,s8;cuum,l40;pAr7sh0;da6gra5Zlo5V;aNeMhrLiKoIrDuBwiAy5K;n,st;nArn;e,n76;aCeBiAot,u8H;bu6ck47gg0m,p;at,k,nd;ck,de,in,nsAp,v72;f0i87;ll,ne,p,r4Mss,t8JuA;ch,r;ck,de,e,le,me,p,re;e5Iow,u89;ar,e,ll,mp0st,xt;g,lAng1rg77s6x;k,ly;a0Lc0Fe0Ch07i05k03l01m00nZou7JpSqua70tGuCwA;ea7PiA;ng,pe,t3;b2Eit,m,ppBrAspe5;ge,pri2v2M;lAo6A;e67y;aJeIiHoErBuAy1;dy,ff,mb1;a7MeBiAo5Cugg1;ke,ng;am,ss,t3;ckBop,p,rA;e,m;ing,pi1;ck,nk,t3;m,p;ck,ge,in,ke,ll,mp,nd,p1rAte,y;!e,t;aFeed,iElDoCrAur,y;ay,e4UinAu4;g,k1;ns7St;a6Kit;ll,n,r7Ote;n,rk;ap,ee1Qow;a6Ge47i1o4U;eep,iAou3;ce,p,t;ateboa74iA;!p;de,gnAp,ze;!al;aDeCiBoAuff1;ck,p,re,t,w;ft,p,v0;d,i3Q;ck,de,pe,re,ve;aBed,nArv1Ht;se,t2I;l,r3t;aEhedu1oDrA;aBeAo3R;en,w;pe,t3;re,ut;le,n,r0N;cAil;k,rifi4;aWeEiDoBuA;b,in,le,n,s5J;a6Pck,ll,oApe,u6;f,t;de,ng,p,s1Q;aQcPdo,el,fNgMje5lLmJnIo14pGque6MsCturn,vAwa6F;eAi21;al,r2;er6NoCpe5tBuA;lt,me;!a4R;l6Krt;air,eaAly,o4P;l,t;dezvo2Rt;aAedy;ke,rk;ea2i5C;a62ist0r59;act6Her1Po6KuA;nd,se;a2Zo5Zru8;ch,s60;c17ge,i2ke,l53nApXtX;ge,k;a03eZhXiUlQoKrBsy3uA;mp,n3rcha2sh;aHeFiEoAu4C;be,ceCdu4fi1grAje5mi2p,te5Z;amAe6J;!me;ed,ss;ce,de,nt;sAy;er5Xs;cti4i2;iElCoBp,re,sAw0;e,i5Kt;l,p;iAl;ce,sh;nt,s5H;aBce,e2UuA;g,mp,n7;ce,nAy;!t;ck,lBnApe,t,vot;!e;e,ot;a2oA;ne,tograph;ak,eCnBrAt;fu4Qm8;!c2S;!l,r;ckGiFnErCsBtAu2;ch,e9;s,te;e9tA;!y;!ic;nt,r;!a7;bCff0il,oBrAutli3C;b8d0ie9;ze;je5;a4BeCoA;d,tA;e,i4;ed,gle5rd,t;aHeFiEoBuA;rd0;ck,d3Eld,nAp,uth,ve;it4YkA;ey;lk,n3Yrr4Wss,x;asu3Hn4GrAss;ge,it;il,nCp,rk3KsBtA;ch,t0;h,k;da6n0oeuv3C;aIeGiEoBuA;mp,st;aBbby,ck,g,oAve;k,t;d,n;cAft,m8nEst;en2k;aAc0Je3vG;ch,d,k,p,se;bBcAnd,p,t3un3;e,k;el,o2J;eBiAno41;ck,ll,ss;el,y;aBo1HuA;d7i4mp;m,zz;mpGnBr3TssA;ue;cr1Jdex,fluDha1k,se26teAvoi4;nt,rA;e3Ufa4viA;ew;en4;a5le1Z;aFeDiCoBuA;g,nt;l2Zno22ok,p,r2st,u2;ghlight,ke,re,t;aAd7lp;d,t;ck,m,ndBrAsh,te;bo3Lm,ne44ve3J;!le;aKeek,loJoHrCuA;arAe41i0Tn;antee,d;aCiBoAumb1;om,u2R;nd,p;dAsp;e,ua6;of,ssA;ip;ss,w;in,me,ng,s,te,ze;aVeSiNlKoGrCuA;ck,el,nAss,zz;c2Xd;aBoAy;st,wn;cAgme,me;tu1U;cCg,il,ld,ol,rA;ce,e20mA;!at;us;aBe1Wip,oAy;at,ck,od,w;g,ke,me,re,sh,vo16;eDgClBnAre,sh,t,x;an4i1S;e,m,t0;ht,u1J;ld;aBeAn4;d,l;r,tu1F;ce,il,ll,rm,vo2L;cho,d7ffe5nIsGxCyeA;!baA;ll;cCerci2hib8pAtra5;eriAo0O;en4me9;el,han7u2;caAtima6;pe;count0d,gine0vy;aWePiJoGrBuAye;b,el,mp,pli2O;aDeCiBoA;ne,p;ft,nk,p,ve;am,ss;ft,g,in;cBd7ubt,wnloA;ad;k,u07;p,sCt3vA;e,iAor4;de;char7h,liBpA;at3lay,u6;ke;al,ba6cEfeDlCma16pos8siBtaA;il;gn,re;ay,ega6;at,ct;liZrA;ea2;b,ma7n4rAte;e,t;a0Aent09h02irc1lZoGrCuA;be,e,rAt;e,l,ve;aCeBoAu0Iy;p,ss,wd;d8ep;ck,ft,sh;aRde,in,lPmInCok,py,re,st,uAv0;gh,nAp1;sYt;ceDdu5fli5glomeEsCtAveJ;a5rA;a17ol;e9tru5;ntArn;ra6;bEfoDmCpA;leAou0Gromi2;me9;a0Ee9it,u6;rt;at,iA;ne;lap2oA;r,ur;ch,t;aBiA;ck,p;im,w;aBeAip;at,ck,er;iDllen7mpi0JnBrAuffe0Q;ge,m,t;ge,nA;el;n,r;er,re;ke,ll,mp,noe,pCrTsBt3u2ve;se;h,t;!tuA;re;aZeViTlQoMrEuAypa0Y;bb1ck1dgCff0lBmp,rAst,zz;den,n;ly;et;anGeEiCoadBuA;sh;ca06;be,d7;ge;aAed;ch,k;ch,d;aCg,mb,nBoAss,tt1x,ycott;k,st,t;d,e;rd,st;aBeAitz,oTur;nd;me;as,d,ke,nd,opsy,tA;ch,e;aCef,lt,nAt;d,ef8;it;r,t;ck,il,lan4nErgCsBtt1;le;e,h;aAe;in;!d,g,k;c04dWffilVge,iUlRnPppMrIsFttDucBwaA;rd;tiA;on;aAempt;ck;k,sA;iAocO;st;chBmoA;ur;!iA;ve;eBroa3;ch;al;chAg0sw0;or;aBt0;er;rm;d,m,r;ia6;dEvA;an4oA;ca6;te;ce;i5reA;ss;ct;cAe,he,t;eCoA;rd,u9;nt;nt,ss",
-  "Actor": "true\xA60:1O;a1Lb1Dc0Zd0Rex0Qf0Kg0Dh0Ci08journ07l04mXnurse,oVpMquKrEs4t3underwrHv2w1;ork0rG;eterinari12iceH;aoiseach,echn0Rherapi1MranscriF;ail1Scienti1Le8i7ki0ol1Ep5t3u1;lt0Zperv1Mr1;f0ge4;aff0ep1rang0;fa08mo08;eciYokespers1;on;ng0st0;cretary,rgeant1;! maj1J;abbi,e1oof0unning 7;ar4c1port0sear0Zverend;e2ru1;it0;ptioni17; admir1A;arter1een;back;ast1Ah8l6oli5r1sychologi13;actition0eside1Bi2o1;duc0fess18gramm0spe05;me minCnce1;!ss;c06t03;a1umb0;nn0y0;otograph0ys00;ffic0p1rganiz0;er0Ztometri0T;a6e5i2o1usX;m,th0;n2s1;sus,t0;ist0;chanic,rcha0W;gistrate,k0nag0y0T;a2e05ieutenant1ord;! gener0O;bor0dy,wy0;ali0I;llu0Mn1;s1vestig0M;peJt1;all0ruI;airdress0ousek7;arden0o4rand1;fa2m1pa;a,o1;th0;al1lf0;ie,k1teO;eep0;a5i1;eld marsh08g3nanci0r1tt0;e1st lady;fig1mH;ht0;rm0th0;amin0cellency;a7e4i1o2riv0utcheT;et2re1;ct03;iciA;al0fenc2put1sign0tective,velop0;ee,y;em7;d,nc0;aCeo,fo,h9le8o1;lonel,m5n2ordinVrporTu1wboy;nci9ri0;gress1stable;m1wom1;an;ma1pos0;nd0;an0rk;ance2eerle1;ad0;llM;ptain,r1shi0;etak0pent0;aron6r2ut1;ch0;i2o1;k0th0;cklay0ga1;di0;!e1;ss;ccounCd5geDn2r1ssisCttendaDyatullah;chitect,ti3;aly2im8nounc0;er;st;mi2v1;is5;ni2r1;al;str1;at1;or;ta1;nt",
-  "Person|Noun": "true\xA6a07b01cYdRePfOgMhJjFkiElDmBolive,p7r4s3trini00v1wa0;ng,rd;an,enus,iol0;a,et;ky,on5umm02;ay,e1o0uby;bin,d,se;ed,x;a2e0ol;aHn0;ny;ge,tM;a0eloR;x,ya;a9eo,iE;ng,tL;a2e1o0;lDy;an,w3;de,smi4y;a0iKol8;ll,z0;el;ail,e0;ne;aith,ern,lo;a0dDmir,ula,ve;rl;a4e3i1ol0;ly;ck,x0;ie;an,ja;i0wn;sy;h0liff,rystal;ari0in,ristian;ty;ak4e3i2r0;an0ook;dy;ll;nedict,rg;er;l0rt;fredo,ma",
-  "Person|Verb": "true\xA6b8ch7dr6foster,gra5hope,ja9lan4ma2ni9ollie,p1rob,s0tra4wade;pike,t5ue;at,eg,ier2;ck,r0;k,shal;ce;ce,nt;ew;ase,u1;iff,l1ob,u0;ck;aze,ossom",
-  "Adj|Noun": "true\xA60:13;1:1A;a13b0Xc0Mde0Le0Gf0Ag09h08i06ju05l03mXnVoTpOrKsDt9u6v3w2;atershed,elcome;a2ision0P;gabo5nilla,ria2;b0Mnt;ndergr2pstairs;adua0Tou2;nd;a4e2oken,ri0;en,r2;min0rori0S;boo,n;e6ilv08o4quat,ta3u2well;bordina0Mper6;b0Cndard;ciali0Nl2vereign;e,ve1;cret,n2ri0;ior;a4e2outiSubbiL;ar,bCla0Mnt0p2side1;resenta0Lublican;ci0Gsh;a5eriodic0otenti0r2;emi3incip0o2;!fession0;er,um;rall5st,tie1;ff2pposi07v0;ensi0Ei03;aggTov2;el;aUe5in4o2;biTderYr2;al,t0;iature,or;di2tr0C;an,um;attIiber0u2;sh;stice,veniM;de0mpressioQn2;cumbe1dividu0no04sta1;alf,omelBumdrum;enious,old,raZ;a5e3i2luid;ne;llow,m2;aEiJ;ir,t,vo2;riLuriL;l4pXx2;c2ecuQpeS;ess;d2iH;er;mographSrivaM;hiFlassRo3rude,unn2;ing;m5n2operaJ;creBstitue1tempor3vertab2;le;ary;m3p2;anion,lex;er3u2;ni8;ci0;e6lank,o5r2;i3u2;te;ef;ttom,urgeois;st;cademAd7l3nim0rab;al;e4terna2;ti2;ve;rt;oles2ult;ce1;nt;ic",
-  "Pronoun": "true\xA6'em,elle,h3i2me,she4th0us,we,you;e0ou;m,y;!l,t;e0im;!'s",
-  "Singular": "true\xA60:5B;1:59;2:4H;3:4N;4:4U;5:5D;6:4Z;a4Pb46c38d2Se2Mf2Eg26h1Uin1Rj1Qk1Pl1Jm1Bn18o14p0Jqu0Ir08sTtIuFvAw7x 4Y;a7ha3Aom2A;f2i4Tt09y7;! arou4D;arAe8o7;cabula3Cl52;gKr7;di4Qt1L;iety,n4A;nc32p2Or8s 7;do3Qs54;bani1in0; rex,aGeFhing3XiDoCr9u8v7;! show;m2Dn3rntHto13;age2Sib7o42;e,u7;n0ta30;p3rq3A;c,er,m7;etB;am,mp36;ct3le5x return;aKcIeHhor4KiGkEoDpin off,tBu9weethe1Hy7;ll7n22st4N;ab2M;b7nri1Aper bowl,rroga1;st3Ctot0;at32ipe3Oo1Brate4Cudent7;! lo1I;ft ser4Gloi41meo19;elet6i7;ll,rm3M;s3Ute;ab0Ycurity gu2Emin33;e5ho7;l31ol;la2Gndwi0Kpi6;av6eBhetor3i8o7;de5om,w;t8v7;erb0R;e,u0;bAc9f7publ3r0Rspi1;er7orm2;e5r0;it0ord label;a1u42;estion mark,ot28;aOeLhKiHlFoDr8u7yram1A;ddi3ApDrpo0Ms3D;eAie3Go7;bl3Vs7;pe3Gt7;a1itu1;diction,mi0Hroga3Qss relea0H;p7rt0;py;a7ebisci1;q25te;cn3e8g7;!gy;!r;armaci34otocoG;anut,d8r7t0;cen3Esp3F;al,est0;n8r2Nt7;e,hog6;el2Mop4;bj3Ac8pia1rde0thers,ve7wn2;n,rview;cu7e0B;pi2;a8it21ot7umb2;a1Ehi2L;n26rra35;aBeAi9o8u7\xE90C;m0Lr0;m0Knopo4pPrni2Hsq1Lti33;li0Tn07tt6;d3nu,t0;mm0n8te7yf4;ri0;!d0Y;aAegBi9os2u7;ddi1n7;ch;ght bulb,p07ving room;bor0Zurea1y7; up;eyno1itt6;el4ourn0;c8dices,itia2Oni23se2Ctel0Hvert7;eb1H;en2Mi2V;aHeaDighBo7uman right,ygie0V;me8sp1Ftb7;ed;! r7;un; scho0Xri7;se;d7v6; st8pho7;ne;art;ndful,sh brown,v6ze;aCeAirl1Flaci2od,r8u7;l4y;an7enadi2id;a0Ed slam;lat0Antlem7;an;df4r7;l3n1B;aDeCiref4lBol4r8un7;er0;ee market,i8on7;ti2;e14ga1;ow2u1;lla,t14;br3mi4n0V;conoBffi1Ogg,lecto0Nmbas1BnApidem3s1Yth3ven9x8yel7;id;ampTempl0Jte5;i15t;er1K;my;aKeHiDoAr8u7;de,mp truck;agonf4i7;er,ve thru;c8g1Ei4or,ssi2wn7;si0L;to0Bumen9;a9gni8nn2s7vide0N;conte5incen1Ftri13;taM;le11;ath,c8f7ni0terre5;ault 05err0;al,im0;d7rX;dy;aWeThMiLlJoBr7;edit c9it3uc7;ib7;le;ard;efficDke,lBmmuniqLns8pi2rr0t10us7yo1;in;erv7uI;ato7;ry;ic,lPum7;ni0I;ie5;er7ie5;gy,ic;ty,vil wK;aBeqAick6oco9r7;istmas car7ysanthemum;ol;la1;ue;ndeli2racter7;ist3;i8llCr7;e0tifica1;liX;hi2naDpCrAt7ucus;erpi7hedr0;ll7;ar;!bohyd7ri2;ra1;it0;l,ry;aLeKicycJlemIoErBu7;ddhiUn9r7tterf4;glar7i0;!y;ny;eak8i7o;de;faOthroA;dy,ro9wl,y7;!frie7;nd;ugh;ish;liI;an,l4;nki9r7;!ri2;er;ng;cTdNlJnGppeti1rFsDt9u7;nt,top7;sy;h8t3;ic;ie7le1;st;ce5pe7;ct;ray;ec8oma4ti8;ly;do1;i6l7;er7y;gy;en; hominBj8van7;tage;ec7;ti7;ve;em;cAe8qui7;tt0;ta1;te;i8ru0;al;de5;nt",
-  "Preposition": "true\xA6-,aPbMcLdKexcept,fIinGmid,notwithstandiWoDpXqua,sCt7u4v2w0;/o,hereSith0;! whHin,oW;ersus,i0;a,s-a-vis;n1p0;!on;like,til;h1ill,oward0;!s;an,r0;ough0u;!oM;ans,ince,o that,uch G;f1n0ut;!to;!f;! 0to;effect,part;or,r0;om;espite,own,u3;hez,irca;ar1e0oBy;sides,tween;ri7;bo8cross,ft7lo6m4propos,round,s1t0;!op;! 0;a whole,long 0;as;id0ong0;!st;ng;er;ut",
-  "SportsTeam": "true\xA60:1A;1:1H;2:1G;a1Eb16c0Td0Kfc dallas,g0Ihouston 0Hindiana0Gjacksonville jagua0k0El0Bm01newToQpJqueens parkIreal salt lake,sAt5utah jazz,vancouver whitecaps,w3yW;ashington 3est ham0Rh10;natio1Oredski2wizar0W;ampa bay 6e5o3;ronto 3ttenham hotspur;blue ja0Mrapto0;nnessee tita2xasC;buccanee0ra0K;a7eattle 5heffield0Kporting kansas0Wt3;. louis 3oke0V;c1Frams;marine0s3;eah15ounG;cramento Rn 3;antonio spu0diego 3francisco gJjose earthquak1;char08paA; ran07;a8h5ittsburgh 4ortland t3;imbe0rail blaze0;pirat1steele0;il3oenix su2;adelphia 3li1;eagl1philNunE;dr1;akland 3klahoma city thunder,rlando magic;athle0Mrai3;de0; 3castle01;england 7orleans 6york 3;city fc,g4je0FknXme0Fred bul0Yy3;anke1;ian0D;pelica2sain0C;patrio0Brevolut3;ion;anchester Be9i3ontreal impact;ami 7lwaukee b6nnesota 3;t4u0Fvi3;kings;imberwolv1wi2;rewe0uc0K;dolphi2heat,marli2;mphis grizz3ts;li1;cXu08;a4eicesterVos angeles 3;clippe0dodDla9; galaxy,ke0;ansas city 3nE;chiefs,roya0E; pace0polis colU;astr06dynamo,rockeTtexa2;olden state warrio0reen bay pac3;ke0;.c.Aallas 7e3i05od5;nver 5troit 3;lio2pisto2ti3;ge0;broncZnuggeM;cowbo4maver3;ic00;ys; uQ;arCelKh8incinnati 6leveland 5ol3;orado r3umbus crew sc;api5ocki1;brow2cavalie0india2;bengaWre3;ds;arlotte horAicago 3;b4cubs,fire,wh3;iteB;ea0ulR;diff3olina panthe0; c3;ity;altimore 9lackburn rove0oston 5rooklyn 3uffalo bilN;ne3;ts;cel4red3; sox;tics;rs;oriol1rave2;rizona Ast8tlanta 3;brav1falco2h4u3;nited;aw9;ns;es;on villa,r3;os;c5di3;amondbac3;ks;ardi3;na3;ls",
-  "Uncountable": "true\xA60:28;1:2R;2:2F;3:35;4:2W;a2Qb2Hc26d1Xe1Nf1Hg19h12i0Xjewel15k0Vl0Qm0Gn0Eo0Dp04rZsMtBv9w5you guys;a7hisky,i6oo5;d,l;ldlife,ne;rmAt2;ernacul25i5;neg24ol1Ktae;eEhCime off,oBr6un5yranny;a,gst15;aff2Jea1Go6ue nor5;th;o07u5;ble5se1Ot;!shoot1;night,othpas1P;er5und2;e,mod2O;a,nnis;aFcEeDhBilk,kiAo9p8t6u5weepstak0;g1Rnshi2Dshi;ati08e5;am,el;ace2Geci0;ap,cc2meth1;n,ttl0;eep,ingl0o5;pp1r18;lf,na1Cri0;ene0Disso18;d0Sfe4l5nd,t0F;m1St;a8e6ic5;e,ke12;c5ins,laxa0Zsearch;ogni0Yrea0Y;bi0in;aBeAhys9last1So7re5;amble,mis0s5ten1W;en1Vsu0H;l5rk;i24yH; 14i3;a20tr0A;nt5ti0J;i0s;bstetri3vercrowd1xyg04;a5ews;il polXtional securi4;aCeAo7u5;m5s1F;ps;n5o1I;ey,o5;gamy;a5cha0Drchandi1Ftallurgy;sl0t;chine5thema1O; learn1ry;aught2e8i7ogi6u5;ck,g11;c,s1K;ce,ghtn1nguis1JteraTv2;ath2isuTss;ara0CindergartMn5;icke08owled0X;ce,gnor8mp7n5;forma02ter5;net,sta08;atiUort5rov;an19;a8eListo7o5ung2;ckey,mework,ne5rserad9spitali4use arrest;s4y;ry;ir,lib03ppiJs5;h5te;ish;ene9l7o6r5um,ymnas13;aGe03;lf,re;ut5yce0J;en; 5ti3;edit1po5;ol;aQicJlour,o7urni5;tu5;re;od,rgive5uri2wl;ne5;ss;cono0MducaDlectrBn9quipAthi3very8x5;ist6per5;ti0C;en0K;body,o09th1;joy5tertain5;ment;ici4o5;ni3;tiU;eBi8o6raugh5ynas4;ts;pe,wnstai5;rs;abet0s5;hon01repu5;te;b5miX;ut;aEelciDhBivi3l9o5urrency;al,ld w7n5ral,ttJuscoC;fusiIt 5;ed;ar;assi3oth0;es;aos,e5;eNw1;us;d,rP;aAi8lood,read7u5;nt1tt2;er;!th;lliarKs5;on;g5ss;ga5;ge;cLdviKeroHirGmCn7ppeal court,rithmet6spi5thleM;rin;ic;i8y5;o6th1;ing;ne;se;en7n5;es4;ty;ds;craft;bi3d5nau9;yna5;mi3;ce;id,ous5;ti3;cs",
-  "Unit": "true\xA6a09b06cZdYexXfTgRhePin00joule0DkMlJmDnan0AoCp9quart0Dsq ft,t7volts,w6y2ze3\xB01\xB50;g,s;c,f,n;dXear1o0;ttT; 0s 0;old;att06b;erPon0;!ne04;ascals,e1i0;cZnt02;rcent,tL;hms,uI;/s,e4i0m\xB2,\xB2,\xB3;/h,cro2l0;e0liM;!\xB2;grNsT;gEtL;it1u0;menSx;erRreR;b5elvins,ilo1m0notQ;/h,ph,\xB2;!byIgrGmEs;ct0rtzN;aLogrE;allonLb0ig5rD;ps;a2emtGl0t6; oz,uid ou0;nceH;hrenheit,radG;aby9;eci3m1;aratDe1m0oulombD;\xB2,\xB3;lsius,nti0;gr2lit1m0;et0;er8;am7;b1y0;te5;l,ps;c2tt0;os0;econd1;re0;!s",
-  "Noun|Gerund": "true\xA60:26;1:25;2:1W;3:1I;4:1Y;5:1O;a25b1Oc1Cd17en15f0Zg0Xh0Ui0Sjog20k0Ql0Mm0Jn0Ho0Dp06ques09rXsHtCuAvolunt16w6yEzo2;a8ed5i3or7r6;ap1Oest1Ci1;ki0r1O;i1r2s1Utc1U;nder6pri23;st1Mta4;al4e9hin4i8ra6y1J;c4di0i2v6;el15;mi0p1G;a1Xs1;ai12cIeHhFin1OkatDlZmo4nowCpeBt9u7w6;ea3im1T;f02r6;fi0vi0J;a1Kretc1Iu6;d1AfJ;l0Wn5;b7i0;eb6i0;oar5;ip14o6;rte2u1;a1r0At1;h7o3re6;a1Ge2;edu0Noo0N;aDe9i5o7u6;li0n2;o6wi0;fi0;a8c7hear1Cnde3por1struct6;r1Au3;or5yc0G;di0so2;p0Qti0;aBeacekAla9o7r6ublis0X;a0Peten5in1oces16;iso2si6;tio2;n2yi0;ee0K;cka0Tin1rt0K;f8pe7rgani6vula1;si0zi0;ni0ra1;fe3;e6ur0W;gotia1twor4;a7e6i2onito3;e1ssa0L;nufactu3rke1;a8ea7i6od0Jyi0;cen0Qf1s1;r2si0;n5ug0E;i6n0J;c4lS;ci0magi2n6ro2;nova1terac1;andPea1i7o6un1;l5wO;ki0ri0;athe3rie6ui5;vi0;ar0CenHi8l7or6ros1un5;ecas1mat1;ir1oo5;l7n6;anDdi0;i0li0;di0gin6;ee3;a8eba1irec1oub1r6umO;awi0es05i6;n4vi0;n6ti0;ci0;aFelebra1hDlBo8r6ur7;aw6os00;li0;a7di0lo3mplai2n6o4pi0ve3;duc1sul1;cMti0;apDea3imIo6ubI;ni0tK;a6ee3;n1t1;m9s1te3;ri0;aJeGitElDoBr9u6;il5ll7r6;pi0;yi0;an5;di0;a1m6o4;bi0;esHoa1;c6i0;hi0;gin2lon6t1;gi0;ni0;bys7c4ki0;ki0;it1;c9dverti8gi0rg7ssu6;mi0;ui0;si0;coun1ti0;ti0;ng",
-  "PhrasalVerb": "true\xA60:93;1:97;2:8I;3:8W;4:8B;5:84;6:86;7:99;8:91;9:8H;A:8Y;B:8S;C:8V;D:8T;E:71;F:98;G:8Z;H:82;I:7I;J:7A;K:4H;a9Hb7Wc6Td6Ne6Lf5Jg52h4Diron0j49k42l3Gm33n30o2Yp2Equiet Hr1Zs0Lt00uYvacuu6SwOyammerBzL;ero Dip MonL;e0k0;by,ov9up;aReNhMiLor0Nrit1B;mp0n3Hpe0r5s5;ackAeel Di0U;aMiLn35;gh 3Yrd0;n Dr L;do1in,oJ;it 7Bk5lk Mrm 6Bsh Lt85v61;aw3do1o7up;aw3in,oC;rgeBsL;e 2herE;a01eZhWiSoRrNuLypQ;ckErn L;do1in,oJup;aMiLot0y 32;ckl81p F;ck HdL;e 60;n7Yp 3Gs5L;ck NdMe Lghten 6me0p o0Tre0;aw3ba4do1in,up;e Iy 2;by,oG;ink Mrow L;aw3ba4in,up;ba4ov9up;aLe 79ll64;m 2r 5O;ckBke Mlk L;ov9shit,u49;aLba4do1in,leave,o67up;ba4ft9pa6Bw3;a0Xc0Ve0Oh0Ki0Hl0Bm0An09o08p03quar5ItRuPwL;earNiL;ngMtch L;aw3ba4o8M; by;cLi6Dm 2ss0;k 66;aTeSiRoPrMuL;cKd36;aigh2Eet76iL;ke 7Tng L;al6Zup;p Lrm2G;by,in,oG;nKr 2tc4O;p F;cKmp0nd MrLveAy 2P;e Ht 2M;ba4do1up;arKeOiNlMrLurB;ead0ingBuc5;a49it 6I;c5ll o3Dn 2;ak Fe73ll0;aKber 2rt0und like;ap 5Wow Duggl5;ash 6Ooke0;eep OiLow 6;cMp L;o6Eup;e 69;in,oL;ff,v9;de1Agn 4OnLt 6Hz5;gLkE; al6Ble0;aNoLu5X;ot Lut0w 7N;aw3ba4f48oC;cKdeEk6FveA;e Qll1Ond Prv5tL; Ltl5K;do1foMin,o7upL;!on;ot,r60;aw3ba4do1in,o4Wup;oCto;al67out0rL;ap66ew 6K;ilAv5;aYeViToPuL;b 5Zle0n Lstl5;aMba4do1inLo2Jth4Ou5Q;!to;c2Xr8w3;ll Not MuL;g3IndA;a2Wf3Po7;ar8in,o7up;ng 69p oLs5;ff,p19;aLelAinEnt0;c6Id L;o3Oup;cKt0;a00eZiXlUoRrPsyc35uL;ll Nn5Lt L;aLba4do1in,oJto48up;pa4Ew3;a3Kdo1in,o22to46up;attleBess LiOop 2;ah2Fon;iMp Lr50u1Hwer 6O;do1in,o6Oup;nt0;aMuL;gEmp 6;ce u21y 6E;ck Lg0le 4Bn 6p5C;oJup;el 5OncilE;c54ir 3An0ss NtMy L;ba4oG; Hc2R;aw3ba4in,oJ;pLw4Z;e4Yt D;aMerd0oL;dAt54;il Hrrow H;aUeRiQoMuL;ddl5ll I;cKnkeyNp 6uthAve L;aLdo1in,o4Mup;l4Ow3; wi4L;ss0x 2;asur5e3TlMss L;a21up;t 6;ke Mn 6rLs2Ax0;k 6ryA;do,fun,oCsure,up;a03eWiRoMuL;ck0st I;aOc4Gg NoLse0;k Lse4E;aft9ba4do1forw38in57o10u47;in,oJ;d 6;e OghtNnMsLve 01;ten F;e 2k 2; 2e47;ar8do1in;aNt MvelL; oC;do1go,in,o7up;nEve L;in,oL;pLut;en;c5p 2sh MtchBughAy L;do1o5A;in4Qo7;eNick Mnock L;do1oCup;oCup;eMy L;in,up;l Ip L;aw3ba4do1f05in,oJto,up;aNoMuL;ic5mpE;ke3Tt H;c44zz 2;a02eXiUoQuL;nMrrLsh 6;y 2;keMt L;ar8do1;r H;lLneErse3L;d Le 2;ba4dLfast,o25up;ear,o1;de Mt L;ba4on,up;aw3o7;aLlp0;d Nl Ir Lt 2;fLof;rom;f11in,o1WuX;cKm 2nMsh0ve Lz2Q;at,it,to;d Mg LkerQ;do1in,o2Uup;do1in,oL;ut,v9;k 2;aZeUive Sloss IoNrMunL; f0S;ab hold,in44ow 2V; Lof 2J;aNb1Nit,oMr8th1JuL;nd9;ff,n,v9;bo7ft9hQw3;aw3bLdo1in,oJrise,up,w3;a4ir2I;ar 6ek0t L;aLb1Gdo1in,o1Dr8up;cMhLl2Hr8t,w3;ead;ross;d aLng 2;bo7;a0Fe08iZlVoRrNuL;ck Le2P;ar8up;eMighten LownBy 2;aw3oG;eLshe29; 2z5;g 2lNol Lrk I;aLwi22;bo7r8;d 6low 2;aMeLip0;sh0;g 6ke0mLrLtten H;e F;gSlQnOrMsLzzle0;h F;e Lm 2;aw3ba4up;d0isL;h 2;e Ll 1V;aw3fQin,o7;ht ba4ure0;eQnMsL;s 2;cNd L;fLoG;or;e D;d06l 2;cPll Lrm0t1I;aNbMdo1in,oLsho0Gth0Avictim;ff,ut,v9;a4ehi2P;pa0D;e L;do1oGup;at Ldge0nd 13y5;in,o7up;aPi1IoOrL;aMess 6op L;aw3b04in,oC;gBwB; Iubl1C;m 2;a0Bh06l03oPrMut L;aw3ba4do1oCup;ackBeep MoLy0;ss Dwd0;by,do1in,o0Vup;me OoMuntL; o2B;k 6l L;do1oG;aSbRforPin,oOtLu0P;hMoLrue;geth9;rough;ff,n,ut,v9;th,wL;ard;a4y;paLr8w3;rt;eaMose L;in,oCup;n 6r F;aOeMiL;ll0pE;ck Der Lw F;on,up;t 2;lSncel0rPsNtch MveE; in;o1Oup;h Dt L;doubt,oG;ry MvL;e 09;aw3oJ;l Lm H;aMba4do1oJup;ff,n,ut;r8w3;a0We0NiteAl0Go05rRuL;bblOckl06il0Elk 6ndl06rMsLtNy FzzA;t 01;n 0IsL;t D;e I;ov9;anXeaViMush L;oGup;ghRng L;aOba4do1forNin,oMuL;nd9p;n,ut;th;bo7lLr8w3;ong;teL;n 2;k L;do1in,o7up;ch0;arUg 6iSn5oQrOssNttlMunce Lx D;aw3ba4;e 6; ar8;e H;do1;k Dt 2;e 2;l 6;do1up;d 2;aQeed0oLurt0;cNw L;aw3ba4do1o7up;ck;k L;in,oC;ck0nk0stA; oRaOef 2lt0nd L;do1ov9up;er;up;r Mt L;do1in,oCup;do1o7;ff,nL;to;ck Qil0nNrgMsL;h D;ainBe D;g DkB; on;in,o7;aw3do1in,oCup;ff,ut;ay;ct FdRir0sk NuctionA; oG;ff;ar8o7;ouL;nd; o7;d L;do1oLup;ff,n;wn;o7up;ut",
-  "ProperNoun": "true\xA6barbie,c4diego,e3f2iron maiden,kirby,m0nis,riel,stevens;ercedes,i0;ckey,ssy;inn,lorence,ranco;lmo,uro;atalina,hristi",
-  "Ordinal": "true\xA6eBf7nin5s3t0zeroE;enDhir1we0;lfCn7;d,t3;e0ixt8;cond,vent7;et0th;e6ie7;i2o0;r0urt3;tie4;ft1rst;ight0lev1;e0h,ie1;en0;th",
-  "Cardinal": "true\xA6bEeBf5mEnine7one,s4t0zero;en,h2rDw0;e0o;lve,n5;irt6ousands,ree;even2ix2;i3o0;r1ur0;!t2;ty;ft0ve;e2y;ight0lev1;!e0y;en;illions",
-  "Multiple": "true\xA6b3hundred,m3qu2se1t0;housand,r2;pt1xt1;adr0int0;illion",
-  "City": "true\xA60:76;1:64;2:6J;3:6M;4:5V;a6Bb56c4Ld4Be47f3Zg3Kh3Ci33j2Yk2Hl25m1Nn1Do1Ap0Xq0Vr0Os05tRuQvLwDxiBy9z5;a7h5i4Puri4R;a5e5ongsh0;ng3K;greb,nzib5J;ang2e5okoha3Vunfu;katerin3Krev0;a5n0R;m5Kn;arsBeAi6roclBu5;h0xi,zh5S;c7n5;d5nipeg,terth4;hoek,s1N;hi62kl3D;l66xford;aw;a8e6i5ladivost5Polgogr6N;en3lni6U;ni24r5;n2o3saill4Q;lenc4Zncouv3Vr3ughn;lan bat1Erumqi,trecht;aFbilisi,eEheDiBo9r7u5;l23n66r5;in,ku;i5ondh65;es54poli;kyo,m32ron1Rulo5;n,uS;an5jua3l2Wmisoa6Dra3;j4Wshui; hag64ssaloni2K;gucigal28hr0l av1W;briz,i6llinn,mpe59ng5rtu,shk2U;i3Hsh0;an,chu1n0p2Hyu0;aEeDh8kopje,owe1It7u5;ra5zh50;ba0It;aten is58ockholm,rasbou69uttga2Y;an8e6i5;jiazhua1llo1m5Zy0;f53n5;ya1zh4K;gh3Nt4T;att48o1Yv47;cramen18int ClBn5o paulo,ppo3Urajevo; 7aa,t5;a 5o domin3H;a3fe,m1O;antonBdie3Ffrancisco,j5ped3Qsalvad0L;o5u0;se;em,z28;lou5Bpeters27;aAe9i7o5;me,sar5t5C;io;ga,o5yadh;! de janei3H;cife,im3Lnn3Lykjavik;b4Uip4lei2Knc2Rwalpindi;ingdao,u5;ez2i0R;aFeEhDiCo9r7u6yong5;ya1;eb5Aya1;a5etor3O;g53to;rt5zn0; 5la4Eo;au prin0Nelizabe26sa04;ls3Rrae5Btts28;iladelph3Inom pe1Coenix;r23tah tik3G;dua,lerZnaji,r4Qt5;na,r34;ak46des0Lm1Or6s5ttawa;a3Xlo;an,d07;a7ew5ing2Hovosibir1Lyc; 5cast38;del26orlea46taip16;g8iro4Xn5pl2Yshv35v0;ch6ji1t5;es,o1;a1o1;a6o5p4;ya;no,sa0Y;aFeCi9o6u5;mb2Cni28sc40;gadishu,nt6s5;c15ul;evideo,pelli1Tre31;ami,l6n16s5;kolc,sissauga;an,waukee;cca,d5lbour2Omph43ndo1Essi3;an,ell5i3;in,\xEDn;cau,drAkass2Tl9n8r5shh4A;aca6ib5rakesh,se2M;or;i1Ty;a4EchFdal10i47;mo;id;aDeAi8o6u5vSy2;anMckn0Pdhia3;n5s angel27;d2g bea1O;brev2Ce3Mma5nz,sb2verpo29;!ss28; ma3Ai5;c5pzig;est17; p6g5ho2Xn0Dusan25;os;az,la34;aHharFiClaipeBo9rak0Eu7y5;iv,o5;to;ala lump4n5;mi1sh0;hi0Ilka2Ypavog4si5wlo2;ce;da;ev,n5rkuk;gst2sha5;sa;k5toum;iv;bIdu3llakuric0Rmpa3Fn6ohsiu1ra5un1Jwaguc0R;c0Qj;d5o,p4;ah1Uy;a7e6i5ohannesW;l1Wn0;dd36rusalem;ip4k5;ar2I;bad0mph1PnBrkutVs8taYz5\u0307zm7;m6tapala5;pa;ir;fah0l6tanb5;ul;am2Yi2H;che2d5;ianap2Mo20;aAe7o5yder2V; chi mi5ms,nolulu;nh;f6lsin5rakli2;ki;ei;ifa,lifax,mCn5rb1Dva3;g8nov01oi;aFdanEenDhCiPlasgBo9raz,u5;a5jr23;dal6ng5yaquil;zh1J;aja2Nupe;ld coa1Bthen5;bu2R;ow;ent;e0Uoa;sk;lw7n5za;dhi5gt1E;nag0U;ay;aisal28es,o8r6ukuya5;ma;ankfu5esno;rt;rt5sh0; wor6ale5;za;th;d5indhov0Pl paso;in5mont2;bur5;gh;aBe8ha0Xisp4o7resd0Lu5;b5esseldorf,nkirk,rb0shanbe;ai,l0I;ha,nggu0rtmu13;hradSl6nv5troit;er;hi;donghIe6k09l5masc1Yr es sala1KugavpiY;i0lU;gu,je2;aJebu,hAleve0Vo5raio02uriti1P;lo7n6penhag0Ar5;do1Nk;akKst0V;gUm5;bo;aBen8i6ongqi1ristchur5;ch;ang m7ca5ttago1;go;g6n5;ai;du,zho1;ng5ttogr14;ch8sha,zh07;gliari,i9lga8mayenJn6pe town,r5tanO;acCdiff;ber19c5;un;ry;ro;aWeNhKirmingh0WoJr9u5;chareTdapeTenos air7r5s0tu0;g5sa;as;es;a9is6usse5;ls;ba6t5;ol;ne;sil8tisla7zzav5;il5;le;va;ia;goZst2;op6ubaneshw5;ar;al;iCl9ng8r5;g6l5n;in;en;aluru,hazi;fa6grade,o horizon5;te;st;ji1rut;ghd0AkFn9ot8r7s6yan n4;ur;el,r06;celo3i,ranquil08;ou;du1g6ja lu5;ka;alo6k5;ok;re;ng;ers5u;field;a04b01cc00ddis abaZgartaYhmedWizawl,lSmPnHqaZrEsBt7uck5;la5;nd;he7l5;an5;ta;ns;h5unci2;dod,gab5;at;li5;ngt2;on;a8c5kaNtwerp;hora6o3;na;ge;h7p5;ol5;is;eim;aravati,m0s5;terd5;am; 6buquerq5eppo,giers,maty;ue;basrah al qadim5mawsil al jadid5;ah;ab5;ad;la;ba;ra;idj0u dha5;bi;an;lbo6rh5;us;rg",
-  "Region": "true\xA60:2N;1:2T;2:2K;a2Qb2Dc1Zd1Ues1Tf1Rg1Lh1Hi1Cj18k13l10m0Pn07o05pZqWrTsKtFuCv9w5y3zacatec2U;akut0o0Du3;cat2k07;a4est 3isconsin,yomi1M;bengal,vi6;rwick2Bshington3;! dc;er4i3;rgin0;acruz,mont;dmurt0t3;ah,tar3; 2La0X;a5e4laxca1Rripu1Xu3;scaDva;langa1nnessee,x2F;bas0Vm3smNtar25;aulip2Dil nadu;a8i6o4taf11u3ylh1F;ffYrr04s1A;me1Cno1Quth 3;cVdU;ber0c3kkim,naloa;hu2ily;n4skatchew2xo3;ny; luis potosi,ta catari1;a3hode9;j3ngp07;asth2shahi;ingh25u3;e3intana roo;bec,en5reta0R;ara7e5rince edward3unjab; i3;sl0B;i,nnsylv3rnambu0B;an0;!na;axa0Ydisha,h3klaho20ntar3reg6ss0Bx0G;io;aJeDo5u3;evo le3nav0W;on;r3tt17va scot0;f8mandy,th3; 3ampton16;c5d4yo3;rk14;ako1N;aroli1;olk;bras1Mva0Cw3; 4foundland3;! and labrador;brunswick,hamp0Xjers4mexiSyork3;! state;ey;galOyarit;a9eghala0Mi5o3;nta1r3;dov0elos;ch5dlanCn4ss3zor11;issippi,ouri;as geraOneso18;ig2oac2;dhy12harasht0Gine,ni4r3ssachusetts;anhao,i el,ylF;p3toba;ur;anca0Ie3incoln0IouisH;e3iR;ds;a5e4h3omi;aka06ul1;ntucky,ra01;bardino,lmyk0ns0Qr3;achay,el0nata0X;alis5har3iangxi;kh3;and;co;daho,llino6n3owa;d4gush3;et0;ia1;is;a5ert4i3un2;dalFm0D;fordZ;mpYrya1waii;ansu,eorg0lou7oa,u3;an4erre3izhou,jarat;ro;ajuato,gdo3;ng;cesterS;lori3uji2;da;sex;ageTe6o4uran3;go;rs3;et;lawaLrbyK;aEeaDh8o3rimea ,umbr0;ahui6l5nnectic4rsi3ventry;ca;ut;i02orado;la;e4hattisgarh,i3uvash0;apQhuahua;chn4rke3;ss0;ya;ra;lFm3;bridge6peche;a8ihar,r7u3;ck3ryat0;ingham3;shi3;re;emen,itish columb0;h0ja cal7lk6s3v6;hkorto3que;st2;an;ar0;iforn0;ia;dygea,guascalientes,lAndhr8r4ss3;am;izo1kans4un3;achal 6;as;na;a 3;pradesh;a5ber4t3;ai;ta;ba4s3;ka;ma",
-  "Country": "true\xA60:39;1:2M;a2Xb2Ec22d1Ye1Sf1Mg1Ch1Ai14j12k0Zl0Um0Gn05om3DpZqat1KrXsKtCu6v4wal3yemTz2;a25imbabwe;es,lis and futu2Y;a2enezue32ietnam;nuatu,tican city;.5gTkraiZnited 3ruXs2zbeE;a,sr;arab emirat0Kkingdom,states2;! of am2Y;k.,s.2; 28a.;a7haBimor-les0Bo6rinidad4u2;nis0rk2valu;ey,me2Ys and caic1U; and 2-2;toba1K;go,kel0Znga;iw2Wji2nz2S;ki2U;aCcotl1eBi8lov7o5pa2Cri lanka,u4w2yr0;az2ed9itzerl1;il1;d2Rriname;lomon1Wmal0uth 2;afr2JkLsud2P;ak0en0;erra leoEn2;gapo1Xt maart2;en;negKrb0ychellY;int 2moa,n marino,udi arab0;hele25luc0mart20;epublic of ir0Dom2Duss0w2;an26;a3eHhilippinTitcairn1Lo2uerto riM;l1rtugE;ki2Cl3nama,pua new0Ura2;gu6;au,esti2;ne;aAe8i6or2;folk1Hth3w2;ay; k2ern mariana1C;or0N;caragua,ger2ue;!ia;p2ther19w zeal1;al;mib0u2;ru;a6exi5icro0Ao2yanm05;ldova,n2roc4zamb9;a3gol0t2;enegro,serrat;co;c9dagasc00l6r4urit3yot2;te;an0i15;shall0Wtin2;ique;a3div2i,ta;es;wi,ys0;ao,ed01;a5e4i2uxembourg;b2echtenste11thu1F;er0ya;ban0Hsotho;os,tv0;azakh1Ee3iriba03o2uwait,yrgyz1E;rWsovo;eling0Jnya;a2erF;ma15p1B;c6nd5r3s2taly,vory coast;le of m19rael;a2el1;n,q;ia,oI;el1;aiSon2ungary;dur0Mg kong;aAermany,ha0Pibralt9re7u2;a5ern4inea2ya0O;!-biss2;au;sey;deloupe,m,tema0P;e2na0M;ce,nl1;ar;bTmb0;a6i5r2;ance,ench 2;guia0Dpoly2;nes0;ji,nl1;lklandTroeT;ast tim6cu5gypt,l salv5ngl1quatorial3ritr4st2thiop0;on0; guin2;ea;ad2;or;enmark,jibou4ominica3r con2;go;!n B;ti;aAentral african 9h7o4roat0u3yprQzech2; 8ia;ba,racao;c3lo2morPngo-brazzaville,okFsta r03te d'ivoiK;mb0;osD;i2ristmasF;le,na;republic;m2naTpe verde,yman9;bod0ero2;on;aFeChut00o8r4u2;lgar0r2;kina faso,ma,undi;azil,itish 2unei;virgin2; is2;lands;liv0nai4snia and herzegoviGtswaGuvet2; isl1;and;re;l2n7rmuF;ar2gium,ize;us;h3ngladesh,rbad2;os;am3ra2;in;as;fghaFlCmAn5r3ustr2zerbaijH;al0ia;genti2men0uba;na;dorra,g4t2;arct6igua and barbu2;da;o2uil2;la;er2;ica;b2ger0;an0;ia;ni2;st2;an",
-  "Place": "true\xA6aVbTcPdOeNfMgIhHiFjfk,kDlBm9new eng8or7p5s4t2u1vostok,wake is8y0;akutDyz;laanbaatar,pP;ahiti,he 0;bronx,hamptons;akhalGfo,oho,under3yd;acifUek,h0itcairn;l,x;ange county,d;land;a0co,idHuc;gadRlibu,nhattR;a0gw,hr;s,x;osrae,rasnoyar0ul;sk;ax,cn,nd0st;ianKochina;arlem,kg,nd,ovd;ay village,re0;at 0enwich;brita0lakB;in;co,ra;urope,verglad8;en,fw,own2xb;dg,gk,h0lt;a1ina0uuk;town;morro,tham;cn,e0kk,rooklyn;l air,verly hills;frica,m7n2r3sia,tl1zor0;es;!ant2;adyr,tar0;ct0;ic0; oce0;an;ericas,s",
-  "WeekDay": "true\xA6fri2mon2s1t0wednesd3;hurs1ues1;aturd1und1;!d0;ay0;!s",
-  "Month": "true\xA6dec0february,july,nov0octo1sept0;em0;ber",
-  "Date": "true\xA6ago,t0week end,yesterd2;mr2o0;d0morrow;ay;!w",
-  "Duration": "true\xA6century,dAh9m6q5se4w1y0;ear,r;eek1k0;!s;!e4;ason,c;tr,uarter;i0onth;lliseco0nute;nd;our,r;ay,ecade",
-  "FemaleName": "true\xA60:IS;1:IW;2:I5;3:I4;4:IM;5:I9;6:JD;7:GQ;8:J9;9:J5;A:HD;B:HN;C:IE;D:J2;E:II;F:H2;G:C4;H:HP;aGIbFDcDJdCSeBIfB0gAAh9Qi9Dj8Ck7Cl5Wm46n3Ko3Gp34qu33r2Bs16t0Fu0Dv03wWxiUyPzI;aMeJineb,oIsof2;e3Rf2la,ra;h3iLlJna,ynI;ab,ep;da,ma;da,h3iIra;nab;aLeKi0GolB3uJvI;etAonDH;i0na;le0sen2;el,gm3Gn,rGAs8T;aoIme0nyi;m5YyAA;aNendDRhiD8iI;dele9lKnI;if45niIo0;e,f44;a,helmi0lIma;a,ow;ka0nB;aOeLiIusa5;ck82kJlAole7viI;anGenIQ;ky,toriBE;da,lA5rIs0;a,nIoniGV;a,iFH;leInesGV;nI7rI;i1y;g9rIxGW;su5te;aZeVhSiOoMrJuIy3;i,la;acIPiIu0L;c2na,sI;hGta;nIr0H;iGya;aKffaEGnIs6;a,gtiI;ng;!nFHra;aJeIomasi0;a,l9Lo87res1;l2ndolwethu;g9Co85rJssI;!a,ie;eIi,ri8;sa,za;bPlNmLnJrIs6tia0wa0;a60yn;iIya;a,ka,s6;arGe3iIm75ra;!ka;a,iI;a,t6;at6it6;a0Gcarlett,e0ChYiUkye,neza0oStOuJyI;bI2lvi1;ha,mayI5ni7sJzI;an3KetAie,y;anIi8;!a,e,nI;aCe;aKeI;fIl5DphI;an4;cHQr5;b2fiA3m0MnIphi1;d3ia,ja,ya;er3lKmon1nJobh8MtI;a,i;dy;lEHv2;aNeJirIo0risEZy5;a,lDD;ba,e0i5lKrI;iIr6Gyl;!d8Efa;ia,lDP;hd,iNki3nKrJu0w0yI;la,ma,na;i,le9on,ron;aJda,ia,nIon;a,on;!ya;k6mI;!aa;lKrJtaye7YvI;da,inj;e0ife;en1i0ma;anA0bMd3Kh1PiBkLlKmJnd3rIs6vannaC;aCi0;ant6i3;lDEma,ome;ee0in8Ou3;in1ri0;a05e00hYiVoIuthDC;bTcSghRl8GnQsKwJxI;anAUie,y;an,e0;aJeIie,lD; merBIann8ll1marD6t7;!lInn1;iIyn;e,nI;a,dG;da,i,na;ayy8B;hel63io;bDFer7yn;a,cJkImas,nGta,ya;ki,o;helHki;ea,iannG7oI;da,n1L;an0bKemGgi0iJnIta,y0;a86ee;han81na;a,eI;cE5kaC;bi0chJe,i0mo0nIquEFy0;di,ia;aEDelIiB;!e,le;een4ia0;aOeNhLipaluk,oKrIute67;iIudenCL;scil3LyamvaB;lly,rt2;ilome0oebe,ylI;is,lis;ggy,nelope,r5t3;ige,m0UnLo5rvaDBtJulI;a,etAin1;ricIt4T;a,e,ia;do3i07;ctav2dJfCUis6lIphCUumBYyunbileg;a,ga,iv2;eIvA9;l2tA;aXeViNoJurIy5;!ay,ul;a,eKor,rJuI;f,r;aCeEma;ll1mi;aOcMhariBJkLlaKna,sIta,vi;anIha;ur;!y;a,iDNki;hoHk9SolI;a,eDE;!mh;hir,lIna,risFsreE;!a,lBO;asuMdLh2i6CnKomi8rgEJtIzanin zah3;aIhal4;li1s6;cy,etA;e9iEP;nngu30;a0Ackenz4e02iNoKrignayani,uriD8yI;a,rI;a,lOna,tH;bi0i3llBDnI;a,iI;ca,ka,qCY;a,cUkaTlOmi,nMrJtzi,yI;ar;aJiam,lI;anEI;!l,nB;dy,eIh,n4;nhHrva;aLdKiCKlI;iIy;cent,e;red;!gros;!e5;ae5hI;ae5el40;ag5EgOi,lLrI;edi77iJjem,on,yI;em,l;em,sF;an4iIliF;nIsC9;a,da;!an,han;b0DcANd0Be,g09ha,i08ja,l06n04rMsoum5YtLuJv80x9FyIz4;bell,ra,soB4;de,rI;a,eE;h8Cild1t4;a,cYgUiLjor4l7Qn4s6tKwa,yI;!aIbe6Uja9lA9;m,nBC;a,ha,in1;!aKbC6eJja,lDna,sIt62;!a,ol,sa;!l1H;! Kh,mJnI;!a,e,n1;!awit,i;aliACcJeduarBfern5EjIlui5W;o6Dul2;ecil2la3;arKeJie,oIr46ueriA;!t;!ry;et44i39;el4Vi75y;dIon,ue5;akran7y;ak,en,iIlo3Q;a,ka,nB;a,re,s4te;daIg4;!l3C;alDd4elIge,isD6on0;ei9in1yn;el,le;a0Oe0DiZoRuMyI;d2la,nI;!a,dJeBCnIsCG;!a,eBB;a,sCE;aCRcKel0QiFlJna,pIz;e,i7;a,u,wa;iIy;a0Te,ja,l2LnB;is,l1TrKttJuIvel4;el5is1;e,ie;aLeJi8na,rI;a84i8;lIn1t7;ei;!in1;aTbb98dSepa,lNnKsJv2zI;!a,be5KetAz4;a,etA;!a,dI;a,sIy;ay,ey,i,y;a,iKja,lI;iIy;a9We;!aI;!nG;ia,ya;!nI;!a,ne;aQda,e0iOjZla,nNoLsKtIx4y5;iIt4;c2t2;e2NlCB;la,nIra;a,ie,o3;a,or1;a,gh,laI;!ni;!h,nI;a,d3e,n5O;cPdon93iOkes6mi96na,rNtKurJvIxmi,y5;ern1in2;a,e53ie,yn;as6iJoI;nya,ya;fa,s6;a,isF;a,la;ey,ie,y;a05e00hYiPlAFoOrKyI;lIra;a,ee,ie;istIy6B;a,en,iJyI;!na;!e,n58;nul,ri,urtnAV;aPerOlAUmKrIzzy;a,stI;en,in;!berlJmernI;aq;eIi,y;e,y;a,stE;!na,ra;aIei3ongordzol;dij1w5;el7MiLjsi,lKnJrI;a,i,ri;d3na,za;ey,i,lB8s4y;ra,s6;bi7cAEdiat7EeAXiSlRmQnyakuma1BrOss6HtLvi7yI;!e,lI;a,eI;e,i8H;a6BeJhIi4MlDri0y;ar69er69ie,leErAXy;!lyn8Cri0;a,en,iIl5Qoli0yn;!ma,nGsF;a5il1;ei8Ai,l4;a,tl6I;a09eZiWoOuI;anMdLliIst61;a8DeIsF;!n9tI;!a,te;e5Hi3Iy;a,i7;!anOcelDdNelHhan7NleMni,sJva0yI;a,ce;eIie;fIlDph5S;a,in1;en,n1;i8y;!a,e,n40;lIng;!i1DlI;!i1C;anOle0nLrKsI;i88sI;!e,i87;i,ri;!a,elHif2AnI;a,etAiIy;!e,f28;a,e89iJnI;a,e88iI;e,n1;cNda,mi,nJque4UsminGvie3y9zI;min8;a8eJiI;ce,e,n1s;!lIsFt0G;e,le;inJk4lDquelI;in1yn;da,ta;da,lSmQnPo0rOsJvaIzaro;!a0lu,na;aKiJlaIob7Z;!n9H;do3;belIdo3;!a,e,l37;a72en1i0ma;di3es,gr6Tji;a9elBogI;en1;a,e9iIo0se;a0na;aTePiKoIusFyacin29;da,ll4rten21snI;a,i9K;lJmaI;ri;aJdIlaJ;a,egard;ry;ath1AiKlJnriet7rmi9sI;sa,t19;en2Qga,mi;di;bi2Bil8ClOnNrKsJtIwa,yl8C;i5Nt4;n5Tti;iImo4Xri4Y;etI;!te;aCnaC;a,ey,l4;a03eXiSlQoOrLunKwI;enIyne1O;!dolD;ay,el;acieJetIiselB;a,chE;!la;ld19ogooI;sh;adys,enIor2yn2G;a,da,na;aLgi,lJna,ov84selIta;a,e,le;da,liI;an;!n0;mMnKorgJrI;ald3Ni,m3Atru86;etAi4S;a,eIna;s25vieve;ma;bJle,mIrnet,yH;al5Ji5;i5BrielI;a,l1;aUeRiQlorPoz2rI;anKeJiI;da,eB;da,ja;!cI;esJiIoi0N;n1s5X;!ca;a,enc2;en,o0;lJn0rnI;anB;ec2ic2;jr,n7rLtIy8;emJiIma,ouma7;ha,ma,n;eh;ah,iBrah,za0;cr4Ld0Oe0Ni0Mk7l05mXn4WrUsOtNuMvI;aKelJiI;!e,ta;inGyn;!ngel2S;geni1ni43;h5Qta;mMperanLtI;eJhIrel5;er;l2Zr8;za;a,eralB;iIma,nest2Jyn;cIka,n;a,ka;a,eNiKmI;aIie,y;!li9;lIn1;ee,iIy;a,e,ja;lIrald;da,y;aXeViOlNma,no3oLsKvI;a,iI;na,ra;a,ie;iIuiI;se;a,en,ie,y;a0c2da,f,nNsKzaI;!betIve7;e,h;aIe,ka;!beI;th;!a,or;anor,nG;!a;!in1na;leEs6;vi;eJiIna,wi0;e,th;l,n;aZeNh2iMjeneLoI;lor5Qminiq4Gn3DrItt4;a,eEis,la,othIthy;ea,y;ba;an0AnaCon9ya;anRbQde,ePiNlKmetr2nIsir5H;a,iI;ce,se;a,iJla,orIphi9;es,is;a,l6A;dIrdI;re;!d59na;!b2ForaCraC;a,d3nI;!a,e;hl2i0l0HmOnMphn1rJvi1WyI;le,na;a,by,cJia,lI;a,en1;ey,ie;a,etAiI;!ca,el1Bka,z;arIia;is;a0Se0Oh05i03lVoKristJynI;di,th2;al,i0;lQnNrJurI;tn1E;aKd2MiIn2Mri9;!nI;a,e,n1;!l4;cepci57n4sI;tanIuelo;ce,za;eIleE;en,tA;aKeoJotI;il4Z;!pat3;ir8rKudI;etAiI;a,ne;a,e,iI;ce,s00;a3er3ndI;i,y;aSeOloe,rI;isKyI;stI;al;sy,tI;a1Qen,iIy;an1e,n1;deKlseJrI;!i8yl;a,y;li9;nNrI;isLlJmI;ai9;a,eIotA;n1tA;!sa;d3elHtI;al,elH;cJlI;esAi42;el2ilI;e,ia,y;itlZlYmilXndWrOsMtIy5;aKeKhIri0;erIleErDy;in1;ri0;a32sI;a31ie;a,iOlMmeKolJrI;ie,ol;!e,in1yn;lIn;!a,la;a,eIie,o7y;ne,y;na,sF;a0Hi0H;a,e,l1;is7l4;in,yn;a0Ie02iZlXoUrI;andi8eRiKoJyI;an0nn;nwDoke;an3CdgMg0XtI;n2WtI;!aJnI;ey,i,y;ny;etI;!t8;an0e,nI;da,na;bbi8glarJlo06nI;i7n4;ka;ancIythe;a,he;an18lja0nIsm3I;i7tI;ou;aVcky,linUni7rQssPtKulaCvI;!erlI;ey,y;hKsy,tI;e,iIy8;e,na;!anI;ie,y;!ie;nIt6yl;adJiI;ce;etAi9;ay,da;!triI;ce,z;rbKyaI;rmI;aa;a3o3ra;a2Sb2Md23g1Zi1Qj5l16m0Xn0Aoi,r05sVtUuQvPwa,yJzI;ra,u0;aLes6gKlJseI;!l;in;un;!nI;a,na;a,i2I;drKgus1RrJsteI;ja;el2;a,ey,i,y;aahua,he0;hJi2Gja,mi7s2DtrI;id;aNlJraqIt21;at;eJi8yI;!n;e,iIy;gh;!nI;ti;iKleJo6pi7;ta;en,n1tA;aIelH;!n1J;a01dje5eZgViTjRnKohito,toIya;inetAnI;el5ia;!aLeJiImK;e,ka;!mItA;ar4;!belJliFmV;sa;!le;a,eliI;ca;ka,sIta;a,sa;elIie;a,iI;a,ca,n1qI;ue;!tA;te;!bJmIstasiNya;ar2;el;aMberLeliKiIy;e,l2naI;!ta;a,ja;!ly;hHiJl2nB;da;a,ra;le;aXba,eQiNlLthKyI;a,c2sI;a,on,sa;ea;iIys0O;e,s0N;a,cJn1sIza;a,e,ha,on,sa;e,ia,ja;c2is6jaLksaLna,sKxI;aIia;!nd3;ia,saI;nd3;ra;ia;i0nJyI;ah,na;a,is,naCoud;la;c6da,leEmOnMsI;haClI;inIyZ;g,n;!h;a,o,slI;ey;ee;en;at6g4nJusI;ti0;es;ie;aXdiUelNrI;eKiI;anNenI;a,e,ne;an0;na;!aMeLiJyI;nn;a,n1;a,e;!ne;!iI;de;e,lDsI;on;yn;!lI;i9yn;ne;aLbJiIrM;!gaL;ey,i8y;!e;gaI;il;dLliyKradhJs6;ha;ya;ah;a,ya",
-  "FirstName": "true\xA6aLblair,cHdevGgabrieFhinaEjCk9l8m4nelly,quinn,re3s0;h0umit;ay,e0iloh;a,lby;g6ne;a1el0ina,org5;!okuh9;naia,r0;ion,lo;ashawn,uca;asCe1ir0rE;an;lsAnyat2rry;am0ess6ie,ude;ie,m5;ta;le;an,on;as2h0;arl0eyenne;ie;ey,sidy;lex2ndr1ubr0;ey;a,ea;is",
-  "LastName": "true\xA60:9G;1:9W;2:9Y;3:9O;4:9I;5:8L;6:9L;7:A1;8:9F;9:8A;A:78;B:6G;C:6K;a9Vb8Nc7Ld6Ye6Tf6Fg5Wh59i55j4Qk45l3Nm2Sn2Fo27p1Oquispe,r18s0Ft05vVwOxNyGzD;aytsAEhD;aDou,u;ng,o;aGeun81iDoshiAAun;!lD;diDmaz;rim,z;maDng;da,guc98mo6VsDzaA;aAhiA8;iao,u;aHeGiEoDright,u;jc8Tng;lDmm0nkl0sniewsA;liA2s2;b0iss,lt0;a5Tgn0lDtanabe;k0sh;aHeGiEoDukB;lk5roby5;dBllalDnogr2Zr10ss0val37;ba,obos;lasEsel7P;lGn dFrg8FsEzD;qu7;ily9Pqu7silj9P;en b35ijk,yk;enzue96verde;aLeix1KhHi3j6ka3IoGrFsui,uD;om50rD;c3n0un1;an,embl8UynisA;dor96lst31m4rr9th;at5Ni7NoD;mErD;are70laci65;ps2s0Z;hirBkah8Enaka;a01chXeUhQiNmKoItFuEvDzabo;en8Bobod34;ar7bot4lliv3zuA;aEein0oD;i68j3Myan8W;l6rm0;kol5lovy5re6Rsa,to,uD;ng,sa;iDy60;rn5tD;!h;l5ZmEnDrbu;at8gh;mo6Eo6K;aFeDimizu;hu,vchD;en7Duk;la,r17;gu8mDoh,pulve8Trra4S;jDyD;on5;evi6Giltz,miDneid0roed0ulz,warz;dEtD;!z;!t;ar42h6ito,lFnDr4saAto,v4;ch7d0AtDz;a4Pe,os;as,ihBm3Zo0Q;aOeNiKoGuEyD;a67oo,u;bio,iz,sD;so,u;bEc7Bdrigue57g03j73mDosevelt,ssi,ta7Nux,w3Z;a4Ce0O;ertsDins2;!on;bei0LcEes,vDzzo;as,e8;ci,hards2;ag3es,it0ut0y9;dFmEnDsmu7Zv5F;tan1;ir7os;ic,u;aSeLhJiGoErDut6;asad,if60ochazk1V;lishc23pDrti63u55we67;e2Tov48;cEe09nD;as,to;as61hl0;aDillips;k,m,n5L;de3AetIna,rGtD;ersErovDtersC;!a,ic;en,on;eDic,ry,ss2;i8ra,tz,z;ers;h71k,rk0tEvD;ic,l3T;el,t2O;bJconnor,g2ClGnei5QrEzD;demir,turk;ella3MtDwe5O;ega,iz;iDof6GsC;vDyn1E;ei8;aPri1;aLeJguy1iFoDune44ym3;rodahl,vDwak;ak3Uik5otn57;eEkolDlsCx2;ic,ov6X;ls1miD;!n1;ils2mD;co42ec;gy,kaEray3varD;ro;jiDmu8shiD;ma;aWcUeQiPoIuD;lGnFrDssoli5T;atDpTr68;i,ov4;oz,te4C;d0l0;h3lInr13o0GrEsDza0Y;er,s;aFeEiDoz5r3Ete4C;!n6F;au,i8no,t4N;!l9;i2Rl0;crac5Ohhail5kke3Qll0;hmeFij0j2FlEn2Xrci0ssiDyer19;!er;n0Io;dBti;cartDlaughl6;hy;dMe6Egnu5Fi0jer35kLmJnci5ArFtEyD;er,r;ei,ic,su1O;iEkBqu9roqu6tinD;ez,s;a55c,nD;!o;a53mD;ad5;e5Pin1;rig4Ps1;aSeMiIoGuEyD;!nch;k4nDo;d,gu;mbarDpe2Svr4;di;!nDu,yana1T;coln,dD;bDholm;erg;bed5UfeGhtFitn0kaEn6rDw2H;oy;!j;in1on1;bvDvD;re;iDmmy,rsCu,voie;ne,t12;aTennedy,h3iSlQnez48oJrGuEvar3woD;k,n;cerDmar59znets5;a,o2H;aDem0i31yeziu;sni3RvD;ch3W;bay4Grh0Ksk0UvaFwalDzl5;czDsA;yk;cFlD;!cDen3S;huk;!ev4ic,s;e6uiveD;rt;eff0l4mu8nnun1;hn,llFminsArEstra33to,ur,yDzl5;a,s0;j0HlsC;oe;aMenLha2Qim0RoEuD;ng,r4;e2KhFnErge2Ku2OvD;anB;es,ss2;anEnsD;en,on,t2;nesDsC;en,s1;ki27s1;cGkob3RnsDrv06;en,sD;enDon;!s;ks2obs1;brahimBglesi3Ake4Ll0DnoZoneFshikEto,vanoD;u,v4A;awa;scu;aPeIitchcock,jaltal6oFrist46uD;!aDb0gh9ynh;m3ng;a24dz4fEjga2Tk,rDx3B;ak0Yvat;er,fm3B;iGmingw3NnErD;nand7re8;dDriks1;ers2;kkiEnD;on1;la,n1;dz4g1lvoLmJnsCqIrr0SsFuEyD;as36es;g1ng;anEhiD;mo0Q;i,ov08;ue;alaD;in1;rs1;aNeorgMheorghe,iKjonJoGrEuDw2;o,staf2Utierr7zm3;ayDg4iffitVub0;li1H;lub3Rme0JnEodD;e,m3;calv9zale0H;aj,i;bs2l,mDordaL;en7;iev3A;gnJlGmaFnd2Mo,rDs2Muthi0;cDza;ia;ge;eaElD;agh0i,o;no;e,on;ab0erLiHjeldsted,lor9oFriedm3uD;cDent9ji3E;hs;ntaDrt6urni0;na;lipEsD;ch0;ovD;!ic;hatBnanFrD;arDei8;a,i;deS;ov4;dGinste6riksCsDva0D;cob2YpDtra2W;inoza,osiL;en,s2;er,is2wards;aUeMiKjurhuJoHrisco0ZuEvorakD;!oQ;arte,boEmitru,rDt2U;and,ic;is;g3he0Imingu7n2Ord1AtD;to;us;aDmitr29ssanayake;s,z; GbnaFlEmirDrvis1Lvi,w3;!ov4;gado,ic;th;bo0groot,jo04lEsilDvri9;va;a cruz,e2uD;ca;hl,mcevsAnEt2EviD;d5es,s;ieDku1S;ls1;ki;a06e01hOiobNlarkMoFrD;ivDuz;elli;h1lHntGoFrDs26x;byn,reD;a,ia;ke,p0;i,rer0N;em3liD;ns;!e;anu;aLeIiu,oGriDuJwe;stD;eDiaD;ns1;i,ng,uFwDy;!dhury;!n,onEuD;ng;!g;kEnDpm3tterjee,v7;!d,g;ma,raboD;rty;bGl08ng4rD;eghetEnD;a,y;ti;an,ota0L;cer9lder2mpbeIrFstDvadi07;iDro;llo;doEt0uDvalho;so;so,zo;ll;es;a08eWhTiRlNoGrFyD;rne,tyD;qi;ank5iem,ooks,yant;gdan5nFruya,su,uchEyHziD;c,n5;ard;darDik;enD;ko;ov;aEondD;al;nco,zD;ev4;ancRshwD;as;a01oDuiy3;umDwmD;ik;ckNethov1gu,ktLnJrD;gGisFnD;ascoDds1;ni;ha;er,mD;ann;gtDit7nett;ss2;asD;hi;er,ham;b4ch,ez,hMiley,kk0nHrDu0;bEnDua;es,i0;ieDosa;ri;dDik;a8yopadhyD;ay;ra;er;k,ng;ic;cosZdYguilXkhtXlSnJrGsl3yD;aEd6;in;la;aEsl3;an;ujo,ya;dFgelD;ovD;!a;ersGov,reD;aDjL;ss1;en;en,on,s2;on;eksejGiyGmeiFvD;ar7es;ez;da;ev;ar;ams;ta",
-  "MaleName": "true\xA60:DN;1:CO;2:D6;3:AJ;4:CK;5:BZ;6:CF;7:D2;8:BS;9:AR;A:DA;B:D3;C:94;D:BM;aC9bB7cA7d98e8If82g7Fh6Si6Cj5Ek52l4Fm37n2Uo2Op2Gqu2Er1Ms12t0Gu0Fv08wUxTyJzE;aEor0;cEh9Jkaria,n0C;hFkE;!aC7;ar5UeC6;aMoGuE;sEu2LvBJ;if,uf;nGsFusE;ouf,sE;ef;aEg;s,tE;an,h0;hli,nB8ssY;avi3ho4;aNeLiGoEyaBN;jcie87lfgang,odrow,utE;!er;lEnst1;bGey,fredAlE;aAZiE;am,e,s;e97ur;i,nde9sE;!l8t1;lFyE;l1ne;lEt3;a9Xy;aHiEladimir,ojte7U;cFha0kt67nceErgA5va0;!nt;e3Xt65;lentEn9S;inE;!e;ghBElyss59nax,sm0;aXeShOiMoIrGuFyE;!l3ro6s1;n7r59;avAHeEist0oy,um0;ntA9v5Wy;bGd8RmEny;!as,mEoharu;aCBie,y;iCy;mEt5;!my,othy;adGeoFia0KomE;!as;!do8G;!de5;dHrE;en98rE;an97eEy;ll,n96;!dy;dgh,ha,iEnn3req,tsu4R;cAPka;aUcotSeQhMiKoIpenc3tEur1Xylve96zym1;anGeEua85;f0phBCvEwa84;e5Zie;!islaw,l8;lom1uE;leyma6ta;dElCm1yabonga;!dhart74n8;aGeE;lErm0;d1t1;h7Kne,qu11un,wn,y6;aEbasti0k2Cl4Prg4Mth,ymoAE;m5n;!tE;!ie,y;lFmEnti2Gq58ul;!ke5JmDu4;ik,vato7O;aZeVhe9ViRoIuFyE;an,ou;b7DdFf5pe7KssE;!elBI;ol3Fy;an,bLc62dJel,geIh0landAmHnGry,sFyE;!ce;coe,s;!aA1nD;an,eo;l45r;er78g3n8olfo,riE;go;bDeAQ;cEl8;ar6Ic6HhFkEo;!ey,ie,y;a8Vie;gFid,ubByEza;an1KnZ;g9SiE;na9Os;ch6Qfa4lImHndGpha4sFul,wi2HyE;an,mo6U;h7Jm5;alAWol2Uy;iACon;f,ph;ent2inE;cy,t1;aJeHhilGier6TrE;aka18eE;m,st1;!ip,lip;dA4rcy,tE;ar,e3Er1Y;b4Hdra73tr6JulE;!o19;ctav3Di3liv3m9Yndrej,rIsFtEum7wB;is,to;aFc7k7m0vE;al5S;ma;i,vM;aMeKiGoEu38;aEel,j5l0ma0r3I;h,m;cFg4i46kEl2R;!au,h7Gola;hEkEolC;olC;al,d,il,ls1vE;il8J;hom,tE;e,hE;anEy;!a4i4;a00eXiNoIuFyE;l2Gr1;hamFr6KstaE;fa,p54;ed,mI;di0Xe,hamGis2CntFsEussa;es,he;e,y;ad,ed,mE;ad,ed;cJgu4hai,kHlGnFtchE;!e9;a7Uik;house,o0Ct1;ae5Oe9MolE;aj;ah,hE;aFeE;al,l;el,l;hFlv2rE;le,ri9v2;di,met;ay0hUjd,ks2AlSmadXnRrLs1tGuricFxE;imilianAwe9;e,io;eHhFiCtEus,yC;!eo,hew,ia;eEis;us,w;j,o;cIio,kHlGqu6Ysha9tEv2;iEy;!m,n;in,on;el,oQus;!el90oPus;iHu4;achEcolm,ik;ai,y;amFdi,eEmoud;sh;adEm5G;ou;aXeRiPlo39oLuFyE;le,nd1;cHiGkEth3uk;aEe;!s;gi,s,z;as,iaE;no;g0nn7BrenGuEv81we9;!iE;e,s;!zo;am,oE;n4r;a7Uevi,la4AnIonHst3thaGvE;eEi;nte;bo;!a6Del;!ny;mFnd1rEur54wr54;ry,s;ar,o4Y;aMeIhal7GiFristEu4Ky6J;i0o54;er0p,rE;k,ollE;os;en0iGnErmit,v3U;!dr3XnEt1;e18y;r,th;cp3j5m5Sna6OrFsp7them,uE;ri;im,l;a01eViToHuE;an,lEst2;en,iE;an,en,o,us;aOeMhnLkubCnJrHsE;eFhEi7Vue;!ua;!ph;dEge;i,on;!aEny;h,s,th55;!ath54ie,nD;!l,sEy;ph;o,qu2;an,mE;!mD;d,ffHrEs5;a5YemFmai6oEry;me,ni0Y;i7Fy;!e5OrE;ey,y;cLdBkJmIrGsFvi3yE;dBs1;on,p3;ed,od,rEv4V;e5Bod;al,es4Mis1;a,e,oEub;b,v;ob,quE;es;aXbRchiQgOkeNlija,nuMonut,rKsGtEv0;ai,suE;ki;aFha0i6ZmaEsac;el,il;ac,iaE;h,s;a,vinEw2;!g;k,nngu5F;!r;nacEor;io;ka;ai,rahE;im;aQeKoJuEyd7;be2FgHmber4KsE;eyFsE;a2e2;in,n;h,o;m3ra36sse2wa40;aIctHitHnrFrE;be28m0;iEy;!q0Z;or;th;bMlLmza,nKo,rGsFyE;a47dB;an,s0;lGo4Nry,uEv8;hi44ki,tE;a,o;an,ey;k,s;!im;ib;aWeSiQlenPoMrIuE;ilFsE;!tavo;herme,lerE;mo;aGegEov3;!g,orE;io,y;dy,h5J;nzaFrE;an,d1;lo;!n;lbe4Xno,oE;rg37van4X;oGrE;aEry;ld,rdA;ffr8rge;brFlBrEv2;la14r3Hth,y;e33ielE;!i5;aSePiNlLorrest,rE;anFedEitz;!dDer11r11;cGkE;!ie,lE;in,yn;esLisE;!co,z2W;etch3oE;yd;d4lEonn;ip;deriFliEng,rnan05;pe,x;co;bi0di,hd;dYfrXit0lSmLnIo2rGsteb0th0uge6vEymBzra;an,eE;ns,re2X;gi,i0AnErol,v2w2;estAie;oFriqEzo;ue;ch;aJerIiFmE;aIe2Q;lErh0;!iE;o,s;s1y;nu4;be0Bd1iGliFm3t1viEwood;n,s;ot1Ss;!as,j4EsE;ha;a2en;!d2Vg7mHoFuFwE;a26in;arE;do;oWuW;a02eRiPoHrag0uGwFylE;an,l0;ay6ight;a6dl8nc0st2;minHnFri0ugEvydCy29;!lC;!a2HnEov0;e9ie,y;go,iFykC;as;cEk;!k;armuEll1on,rk;id;andNj0lbeMmetri5nKon,rIsGvFwExt3;ay6ey;en,in;hawn,moE;nd;ek,rE;ick;is,nE;is,y;rt;re;an,le,mLnKrGvE;e,iE;!d;en,iGne9rEyl;eEin,yl;l35n;n,o,us;!i4ny;iEon;an,en,on;a08e06hYiar0lOoJrHuFyrE;il,us;rtE;!is;aEistob0S;ig;dy,lHnFrE;ey,neli5y;or,rE;ad;by,e,in,l2t1;aIeGiEyK;fEnt;fo0Et1;meEt5;nt;rGuFyE;!t1;de;enE;ce;aIeGrisE;!toE;ph3;st3;er;d,rEs;b4leE;s,y;cEdric,s7;il;lHmer1rE;ey,lFro9y;ll;!os,t1;eb,v2;a07eZiVlaUoSrFuEyr1;ddy,rtL;aMeHiGuFyE;an,ce,on;ce,no;an,ce;nFtE;!t;dFtE;!on;an,on;dFndE;en,on;!foEl8y;rd;bby,rEyd;is;i6ke;bGlFshE;al;al,lD;ek;nIrEshoi;at,nFtE;!r1B;aEie;rdA;!iFjam2nD;ie,y;to;kaNlazs,nIrE;n8rEt;eEy;tt;ey;dEeF;ar,iE;le;ar16b0Ud0Qf0Ogust2hm0Li0Ija0Hl03mZnSputsiRrIsaHugust5veFyEziz;a0kh0;ry;us;hi;aLchKiJjun,maInGon,tEy0;hEu09;ur;av,oE;ld;an,ndA;!el,ki;ie;ta;aq;as,dIgelAtE;hony,oE;i6nE;!iAy;ne;er,reEy;!as,i,s,w;iGmaEos;nu4r;el;ne,r,t;an,beQdBeKfIi,lHonGphYt1vE;aOin;on;so,zo;an,en;onUrE;ed;c,jaHksandGssaHxE;!andE;er,ru;ar,er;ndE;ro;rtA;ni;dBm7;ar;en;ad,eE;d,t;in;onE;so;aFi,olfAri0vik;!o;mEn;!a;dIeHraFuE;!bakr,lfazl;hEm;am;!l;allJelGoulaye,ulE;!lErG;ah,o;! rE;ahm0;an;ah;av,on",
-  "Person": "true\xA6ashton kutchYbXcSdQeOgastThMinez,jLkKleJmFnEoDpBr5s4t2va1w0;arrHednesday adams,oode;lentino rossi,n go5;a0heresa may,iger woods,yra banks;tum,ylor;addam hussain,carlett johanssOlobodan milosevic;ay romano,e4o2u0;n dmc,sh limbau0;gh;d stewart,nald0;inho,o;ese witherspoIil6;a0ipM;lmLris hiltG;prah winfrIra;ettAiles crane;essia2i0ubarek;randa ju0tt romnF;ly;en;bron james,e;anye west,endall,iefer sutherland,obe bryant;aime,effers7k rowling;a0itlBulk hogan;lle berry,rris5;ff0meril lagasse,zekiel;ie;a0enzel washingt2ick wolf;lt1nte;ar1lint0;on;dinal wols1son0;! palm2;ey;arack obama,rock;er",
-  "Adjective": "true\xA60:8H;1:9N;2:8E;3:9E;4:8B;5:98;6:8M;7:8T;8:86;9:99;A:8W;B:7Z;C:60;D:9D;E:7J;a80b7Ic6Wd6Fe5Xf5Cg54h4Ui3Ujuni49k3Rl3Hm34n2Uo2Fp20quart6Ar1Qs0Ut0MuRvNwFye1M;ast58eKhIiHoF;man4oFrthwhi7u0I;dBzy;despr8Zn w7Cs6N;acked0XoleF;!sa7;ather14eFll o5Pste2Q;!k4;aHeGiFola5J;b9Qce versa,gi2Qle;ng4Yrsa5H;ca1lu8U;lt08nLpHrGsFttermo9I;efEu5;b7Age1; Hb2ApGsFti8H;ca7et,ide d3P;er,i4O;f3Xto da3;aYbecom2cXdSeRfPiOkn3MmNpMrJsGto49us0wF;a08iel2N;eBi2Fo47pGuF;pervis0spect2;e1okB;eFu4;cognTgul0NlFsolv0;at0ent2;aArecede01;arri0et;que,vers5;air,orF;eseBtun7S;mploy0nd2xpect0;eFisclos0ue;cid0rF;!a75covCly2sJwF;aFei7W;tCy;heck0onvinc2;ppeal2ssum2tteGuthorF;iz0;nd0;im4Bra;aKeHhough5Jip 1RoGrF;anspare1i3;gethCle8Qp notch,rpA;ena6UmpGrF;r3Ktia8;e9o76;leFst3V;nt0;a09c05e02h01iZkiYle5Mmug,nobbi46oTpQqueami46tKuFymb7L;bHi generis,pFr4;erFre69;! dupCb,vi00;du0p5HsFurb65;eq7Rtanda8C;atu6OeJi0WrFy3Z;aightGin4LungF; o25; fFfF;or6C;adfa84ri7;arGeFirit0lendAot on;c33e1F;k4se; call0lub7mbCphisticIrHuFviT;ndFth10;proof;dAry;at0;ll0n d6C;g22nF;ce5Mg7;am36eC;co1Lem4lfGnFre6;so8; suf45i3G;aGholFient2P;ar4;rlFth2;et;cr0me,tisfac5Z;aNeIheumatoAiGoF;bu7IttBy5;ghtFv5;-w2fE;cIdu79lHnown0sFtard0;is3JoF;lu3na1;e1Duc3H;e1ondi3;bAci5;aQeOicayu6laNopuli79rGuF;bl6Fnjabi;eKiIoF;b6HfGmi3IpFvBx23;er,ort6N;a6u6Q;maFor,sti6va3;!ry;ci6Nexist2ma1UpaA;cAid;ac2Dnt2XrFti3;feDma3Ati3Av6J;i2DrtFss6F;-4RiF;al,s4P;bQffOkNld MnKrJthCutIverF;!aGni5Vseas,t,wF;ei5Urou5U;ll;do14er,si51;d34g1U; bFbFe on o6go2li6;oa6P;fashion0school;!ay; gua6MbFli6;eat;eGsF;ce6er0Io0Z;dia1se;aNeMiLoFuanc0; mo47nHrthFt5P;!eF;rn;chaGdescri6Aprof2JsF;top;la1;ght4;arby,cessa8ighbor4xt;k0usiat2;aNeMiKoGuF;dHltip7;deHlGnFot,st;ochro3Yth4;dy;rn,st;ddle ag0nF;dblVi;ga,nac2re;cHgenta,in,j0Akeshift,mmGnFscu50;da4Ay;ali3Ooth;ab3Mho;aNeKiIoFumber2;ngFuti1I;stand2tF;erm,i3L;ghtwei4QteraF;l,te;ft-w2gFssCth5;al,eFit0I;nda8;nguAps0te4;apGind4nF;ow2;ut;ce co0Dgno5Kll09m01nHpso 2ErF;a3releF;va1; WaVcoSdPe2MfOgrNhibi3Ri02nMoLsHtFvalu4N;aDeF;n4Wrdep24;a6iGolFuboI;ub7ve1;de,gF;nifica1;rdi4O;a3er;own;eriGluenSreq4J;eGiIoFul1E;or;fini3p1Ttermi4I;mpGnside9rF;reD;le3;ccu9deq4Jppropr3Q;fFsitu,vitro;ro1;mJpF;arHeGl0YoFropC;li3r0V;nd2rfeD;ti5;aGeFi0Z;d3Hn48;tu2E;egGiF;c0Rte9;al,itF;ima3;ld;aMelLiJoFuma6;meHnGrrFs0Bur4;if3K;e4Co30; ma2Msick;ghfalut1VspF;an3G;liZpfE;i8llow0ndFrd05tL;sy,y;aiLener3Ciga2Jlob5oKraHuF;ilFng ho;ty;cGtF;efEis;efE;ldBod;nfE;aWeTiRlPoIrF;aGeFil4ozB;q3CtfE;gi7nt31;lk0WoJrF; keeps,eHge0OmCtunFwa3U;ateF;!ly;go2i1Os2Z;liF;sh;ag3Rowe8uF;e1oresce1;e8nF;al,i3;dGmini6rF;ti7; up;bl0l31mili0Lr Fux;oFreach2;ff;aTfSlQmNnLqu5reDthere5veryday,xF;aDem3AplIquisi3traHuF;be3FlF;ta1;!va1V;icF;it; Fti0Y;rou3sui3;erGiF;ne1;ge1;dFe1N;er4;ficie1;gCsF;t,ygo2;er;aUeMiHoGrFue;ea8owW;mina1ne,rma1ubO;dact1Yfficult,m,sGverF;ge1se;creGeNjoi1pa9tF;a1inD;et,te; Ladp0GceKfiJgene9liHpGreliDspe9voF;id,ut;ende1;ca3ghF;tfE;a1ni3;as0;facto;i4ngero05;arZeXhWivil,oMrHuF;stoma8teF;sy;aIeHu0WystalF; cleFli6;ar;epy;vBz0;erNgniza1loMmLnGrpo9veF;rt;cIduLgr1KjHsGtraF;dic0Hry;eq1Ita1;oi1ug5;a1Ci1L;mensu9pass1G;ni5ss5;ci19;ee8intzy;leba3rtaF;in;diac,efE;aUeOiJliSoGrFuck nak0;and new,isk,on1U;gGldface,naF; fiZfiZ;us;gHpartisGzarF;re;an;tiF;me;autifEhiIloHnFsiSyoI;e01iFt;gn;v0w;nd;ul;ckwards,rF;e,rB; priori,b12c0Zd0Tf0Ng0Ih0Hl0Amp7nt07pZrSsPttracti0MuLvIwF;aGkF;wa19;ke,re;ant garGeraF;ge;de;diHtF;heFoimmu6;nt07;to8;hBlF;eep;en;bitJchiv5roItF;iFsy;fiF;ci5;ga1;ra8;ry;pFt;aJetiz2roF;prHximF;ate4;ly;ia3;ll2re1;ing;iquFsy;at0e;ed;cohJiQkaHl,oGriFterW;ght;ne,of;li6;ne;olF;ic;ead;ain05ed,gressiIrF;eeF;ab7;le;ve;fGraA;id;ectGlF;ue1;ioF;na3; JeHvF;erF;se;pt,qF;ua3;hoc,infinitum;cu9tu5u3;al;ra3;erQlOoMrJsGuF;nda1;e1olu3traD;ct;te;eaGuF;pt;st;aFve;rd;aFe;ze;ra1;nt",
-  "Adverb": "true\xA6a08b05d01eXfRhePinOjustNkinda,likewi00mLnIoDpBquite,r8s4t1up0very,well; to,wards5;h1iny bit,o0wiO;o,t6;en,us;eldom,o0uch;!me1rt0; of;how,times,w0A;a1e0;alT;ndomSthN;ar excellenEer0oint blank; Nhaps;f3n0;ce0ly;! 0;ag03moX; courIten;ewKo0; longEt 0;onIwithstanding;aybe,eanwhiAore0;!ovB;! aboV;deed,steW;lla,n0;ce;or2u0;lArther0;!moK; 0ev3;examp0good,suI;le;n1v0;er; mas0ough;se;e0irect1; 1finite0;ly;ju9trop;ackward,y 0;far,no0; means,w; DbroCd nauseam,gBl6ny3part,s2t 0w4;be6l0mo6wor6;arge,ea5; soon,ide;mo1w0;ay;re;l 1mo0ready,so,ways;st;b1t0;hat;ut;ain;ad;lot,posteriori",
-  "Conjunction": "true\xA6aVbRcuz,eNhowMiEjustYnoBo9p8supposing,t5wh0yet;e1il0o3;e,st;n1re0thN; if,vM;evL;h0o;erefMo0;!uS;lus,rovided th9;r0therwiK;! not; mattEr,w0;! 0;since,th4w7;f4n0; 0asmuch;as mGcaDorder t0;h0o;at;! 0;only,t0w0;hen;!ev3;ith2ven0;! 0;if,t9;er;e0ut,y the time;cau1f0;ore;se;lt3nd,s 0;far1if,m0soon1t2;uch0; as;hou0;gh",
-  "Currency": "true\xA6$,aud,bQcOdJeurIfHgbp,hkd,iGjpy,kElDp8r7s3usd,x2y1z0\xA2,\xA3,\xA5,\u0434\u0435\u043D,\u043B\u0432,\u0440\u0443\u0431,\u0E3F,\u20A1,\u20A8,\u20AC,\u20AD,\uFDFC;lotyQ\u0142;en,uanP;af,of;h0t5;e0il5;k0q0;elK;oubleJp,upeeJ;e2ound st0;er0;lingG;n0soF;ceEnies;empi7i7;n,r0wanzaCyatC;!onaBw;ls,nr;ori7ranc9;!os;en3i2kk,o0;b0ll2;ra5;me4n0rham4;ar3;e0ny;nt1;aht,itcoin0;!s",
-  "Determiner": "true\xA6aAboth,d8e5few,le4mu7neiCplenty,s3th2various,wh0;at0ich0;evB;at,e3is,ose;everal,ome;!ast,s;a1l0very;!se;ch;e0u;!s;!n0;!o0y;th0;er",
-  "Adj|Present": "true\xA6a06b03cUdPeNfJhollIidQlEmCnarrIoBp9qua8r7s4t2utt3w0;aKet,ound,ro0;ng,ug07;end0hin;er;e1hort,l0mooth,our,pa8tray,u8;i2ow;cu6da01leRpaM;eplica00ig01;ck;aGr0;eseTime,omU;bscu1pen,wn;atu0e3odeG;re;a2e1i0;gTve;an;st,y;ow;a2i1oul,r0;ee,inge;rm;iHke,ncy,st;l0mpty,xpress;abo4ic7;amp,e2i1oub0ry,ull;le;ffu9re6;fu8libe0;raE;alm,l5o0;mpleCn3ol,rr1unterfe0;it;e0u7;ct;juga8sum7;ea1o0;se;n,r;ankru1lu0;nt;pt;lig2pproxi0;ma0;te;ht",
-  "Comparable": "true\xA60:38;1:3N;2:3C;3:2E;a3Rb39c30d2Re2Kf28g1Wh1Mi1Gj1Fk1Cl15m0Zn0Uo0Tp0Kqu0Ir09sJtEuDvBw5y4za0S;el12ouP;a8e6hi1Ii4ry;ck0Ede,l4n1ry,se;d,y;a4i3Q;k,ry;ntiJry;a4erda2ulgar;gue,in,st;g0pcomiG;a7en2Thi6i5ough,r4;anqu29en1ue;dy,g33me0ny,r04;ck,rs25;ll,me,rt,wd3F;aScarReQhOiNkin0ClJmHoFpEt7u5w4;eet,ift;b4dd0Wperfi1Xrre25;sta23t3;a9e8iff,r5u4;pVr1;a5ict,o4;ng;ig2Sn0N;a1ep,rn;le,rk,te0;e1Oi2Sright0;ci1Vft,l4on,re;emn,id;a4el0;ll,rt;e6i4y;g2Jm4;!y;ek,nd2P;ck,l0mp3;a4iRrill,y;dy,l01rp;ve0Ixy;ce,y;d,fe,int0l1Ev0U;a9e7i6o4ude;mantic,o16sy,u4;gh,nd;ch,pe,tzy;a4d,mo0A;dy,l;gg5ndom,p4re,w;id;ed;ai2i4;ck,et;hoBi1BlAo9r6u4;ny,r4;e,p3;egna2ic5o4;fouSud;ey,k0;liXor;ain,easa2;ny;dd,i0ld,ranL;aive,e6i5o4;b3isy,rm0Vsy;bb0ce,mb3;a4w;r,t;ad,e6ild,o5u4;nda0Xte;ist,o1;a5ek,l4;low;s0ty;a8ewd,i7o4ucky;f0Gn5o11u4ve0w0Vy0K;d,sy;e0g;ke0tt3ve0;me,r4te;ge;e5i4;nd;en;ol0ui17;cy,ll,n4;secu7t4;e4ima5;llege2rmedia4;te;re;aBe8i7o6u4;ge,m4ng1A;b3id;me0t;gh,l0;a4fVsita2;dy,v4;en0y;nd11ppy,r4;d,sh;aEenDhBiAl9oofy,r4;a7e6is0o4ue0Y;o4ss;vy;at,en,y;nd,y;ad,ib,ooE;a2d1;a4o4;st0;t3uiR;u1y;aDeeb3i9lat,o7r6u4;ll,n4r0O;!ny;aDesh,iend0;a4rmE;my;erce5nan4;ciB;! ;le;r,ul4;ty;a7erie,sse5v4xtre0C;il;nti4;al;r5s4;tern,y;ly,th0;aBe8i5ru4umb;nk;r5vi4;ne;e,ty;a4ep,nB;d4f,r;!ly;ppSrk;agey,h9l8o6r5u4;dd0r0te;isp,uel;ar4ld,mmon,st0ward0zy;se;evMou1;e4il0;ap,e4;sy;aJiHlEoCr6u4;r0sy;ly;a8i5o4;ad,wn;g5llia2;nt;ht;sh,ve;ld,un4;cy;a5o4ue;nd,o1;ck,nd;g,tt4;er;d,ld,w1;dy;bsu7ng6we4;so4;me;ry;rd",
-  "Infinitive": "true\xA60:8V;1:8G;2:9D;3:80;4:7N;5:91;6:9H;7:99;8:82;9:9G;A:92;B:8X;C:7K;D:7U;E:7Q;F:87;G:7V;H:7H;a82b7Jc6Sd5Le4Gf45g41h3Wi3Cj39k37l2Ym2Rnou3Vo2Lp25qu24r19s0AtYuTvRwI;aOeNiLors4rI;eJiI;ng,te;ak,st3;d4e7HthI;draw,er;a2d,ep;i2ke,nIrn;d0t;aIie;li9Eni9ry;nIplift;cov0dJear7JlIplug,tie,ve85;ea9o3K;erIo;cut,go,sta9Gval96whelm;aRePhMoLrI;aIemb3;ffi3Fmp3nsI;aDpi8;pp3ugh4;aJiJrIwaE;eat4i2;nk;aIm92;ch,se;ck3ilor,keImp0r7N;! paE;a0Fc0Ee0Ch08i06l04mugg3n03o01pYquXtQuKwI;all71eeIim;p,t4;bKccumb,ffJggeBmm93p2FrI;mouFvi2;er,i5;li80mJsiIveE;de,st;erAit;aMe7SiKrI;ang3eIi2;ng20w;fIng;f4le;gg0rI;t3ve;a3Ui9;a4DeJit,l6KoI;il,of;ak,nd;lIot6Nw;icCve;eak,i0L;aIi6;m,y;ft,nIt;g,k;aKi5LoJriIun;nk,v5X;ot,rt4;ke,rp4tt0;eIll,nd,que7Nv0w;!k,m;avenAul81;dd4tis1Ay;a0BeJip4oI;am,ut;a07b05c03d02fZgroup,heaYiXlVmUnTpRq36sNtLup,vI;amp,eJiIo2V;sCve;l,rt;i8rI;ie2ofC;eFiKtIurfa5;o1XrI;aHiDuctu8;de,gn,st;el,hra1lIreseF;a5e69;d0ew,o05;aHe31o2;a7eFiIoad,y;e2nq3Mve;mbur1nf2U;r1t;inJleDocus,re9uI;el,rbi9;an5e;aDu5;ei2k7Jla3OoIyc3;gni2Wnci3up,v0;oot,uI;ff;ct,d,liI;se,ze;tt3vi9;a9enGit,o7;aVerTinpoiFlumm0VoSrKuI;b3Oke,ni9rIt;poEs6W;eMoI;cKd,fe4BhibCnoJpo1sp0tru6vI;e,i6o4W;un5;la39u8;aGclu6dJf0occupy,sup0FvI;a5LeF;etermi47iD;aGrtr4Vsse44;cei2fo3Hi9mea7plex,sIva6;eve8iB;mp0rItrol,ve,y;a5St5O;bMccuLpKutJverIwe;lap,s19tu6Au1;gr4Pnu22pa5;era7i3Ypo1;py,r;ser2taH;aMe09iJoIultiply;leBu64;micJnIspla5;ce,g3us;!k;iIke,naA;m,ntaH;aPeLiIo1u39;e,ke,ng0quIv4;eIi66;fy;aKnIss4;d,gI;th4;rn,ve;ng26u1E;eep,nI;e3Row;oHuI;gg3xtaI;po1;gno8mWnIrk;cUdSfRgeBhQitia7ju8q14sOtKun5TvI;eIo0T;nt,st;erJimi5QoxiQrI;odu5u6;aDn,prIru5Q;et;iBpi8tIu8;il,ruD;abCibC;eBo2Bu1;iIulA;ca7;i7lu6;b5Cmer1pI;aEer47ly,oJrI;e2Ris5No2;rt,se,veI;ri9;aLeKiIoiBuE;de,jaInd0;ck;ar,iQ;mp0ng,pp4st4ve;ath0et,i2le1UoKrI;aIow;b,pp3ze;!ve4S;ast4er3Li58lRorMrJuI;lf3Tr3P;eJiIolic;ght4;e0Lsh4;b3DeKfeCgIs4B;eIi2;!t;clo1go,sIwa4J;had2Y;ee,i2Q;a0KdCl0Im0CnUquip,rTsStGvQxI;cNeEha3iMpJtI;ing0Uol;eJi8lIo1unA;aHoC;ct,di7;st,t;e2MlI;a0Xu6;alua7oI;ke,l2;chew,pou1tab13;a1u4G;aYcVdTfSgQhan5joy,lPqOrNsuMtKvI;e0VisI;aAi4L;er,i5rI;aHenGuB;e,re;iGol;ui8;arAiB;aAeIra2ulf;nd0;or5;ang0oIu8;r1w;lo1ou0CrJuI;mb0;oaGy3Z;b3ct;bKerApI;hasiIow0;ze;a0Tody,rI;a5oiI;d0l;ap1eDuI;ci3Ode;rIt;ma0Nn;a0Ne02iKo,rIwind3;aw,edAoI;wn;agno1e,ff0g,mi27sLvI;eIulA;rIst;ge,t;ab3bUcPlodAmant3pNru3GsMtI;iIoEu2W;lJngI;ui9;!l;ol2ua6;eIla5o1ro2;n1r1;a2Ne2WlKoIu0K;uIv0;raA;aIo1;im;a38ur1;af4bZcTduDep4fRliQmNnLpKra1TtaGvI;eIol2;lop;aEiDoE;oIy;te,un5;eJoI;li9;an;mCv0;a5i06oIraud,y;rm;ei2iMoKrI;ee,yI;!pt;de,mIup3;missi2Upo1;de,ma7ph0;aJrief,uI;g,nk;rk;mp4rk4uF;a06ea1h04i03l02oJrIurta17;a2ea7ipp3;ales5eZhabCinci6llYmWnIrro6;cTdQfNju8no7qu0sLtKvI;eIin5;ne,rA;aHin25ribu7;er2iIoli27pi8titu7ult;d0st;eJiIroFu1;de,gu8rm;ss;eJoI;ne;mn,n1;eIlu6ur;al,i2;buBe,men5pI;e7i3ly;eDi6u6;r5xiB;ean1iS;rcumveFte;eIoo1;ri9w;ncIre4t0ulk;el;aXeRi6lPoOrLuI;iJrIy;st,y;ld;aJeastfeMiIoad4;ng;ke;il,l12mba0XrrMth0;eIow;ed;!come,gHha2liLqueaKstJtrIwild0;ay;ow;th;e2tt3;in;bysCckfi8ff3tI;he;it;b17c0Vd0Mff0Kgr0Jl0Fm0Bn05pp01rZsSttPuNvKwaI;it,k4;en;eEoI;id;rt;gIto08;meF;aGeBraD;ct;ch;pi8sJtoI;ni9;aKeIi05u8;mb3rt,ss;le;il;re;g0Ji1ou1rI;anAi2;eaKly,oiFrI;ai1o2;nt;r,se;aMiQnJtI;icipa7;eJoIul;un5y;al;ly1;aJu1;se;lgaIze;ma7;iKlI;eAoIu6;t,w;gn;ee;ix,oI;rd;a01jNmiKoJsoI;rb;pt,rn;niIt;st0;er;ouJuB;st;rn;cLhie2knowledAquiItiva7;es5re;ce;ge;eOomKrJusI;e,tom;ue;moJpI;any,li9;da7;te;pt;andOet,i6oKsI;coKol2;ve;li9rt,uI;nd;sh;de;on",
-  "Modal": "true\xA6c5lets,m4ought3sh1w0;ill,o5;a0o4;ll,nt;! to,a;ight,ust;an,o0;uld",
-  "Verb": "true\xA6born,cannot,gonna,has,keep tabs,msg",
-  "Participle": "true\xA6fl3g1s0writt2;e1h2;iv0one;en;own",
-  "Adj|Gerund": "true\xA60:2F;1:2H;2:25;3:23;4:20;5:2D;6:27;7:22;a24b1Zc1Hd14e0Yf0Og0Ih0Hi0Ajud1Xl07m04o00pWrQsFtAup9v8w0Pyiel4;ar5eY;lif0s01;aWeBhr9i3ouc7r8wis0;e01oub2us0yi1;ea0Mi8;l2vi1;l2mp0;atisf5creec7hoc0Ekyrocke0lo13oGpFtBu9we8;e12l2;pp1Kr8;gi1pri6roun4;a9ea23i8ri0Aun1C;mula0r3;gge3r8;t2vi1;ark2ee4;a8ot7;ki1ri1;aCe9ive0o8us7;a3l2;defi13fres7ig13laEmai13s0v8war4;ea2itali8ol0Q;si1zi1;gi1ll5mb2vi1;a5erpleAier1Dlun18r8un1J;e8o11;ce4s6vai2;xi1;ffsApNut9ver8wi1;arc7lap0Hp09ri4whel1L;goi1l5st0Y;et0;eande3i9o0Fu8;mb2;s6tiga0;a9i8o0C;fesa0Bmi0vi1;cKg0Vs0;mDn8rri0C;cBsAt9vi8;go1Gti1;e15imida0;pi3ul0;orpo1Drea6;po6;arrowi1ea2orrif5umilia0;lCr8;a0ipZo9uel8;i1li1;undbrea8wi1;ki1;a3ea0Z;aGetc7it0lDoBr9ulf8;il2;ee0Yigh8ust12;te04;r8un4;ebo4th0H;a9o8;a0we3;mi1tte3;di1scina0;mBn9x8;ac0ci0is0plo4;ab2c8du3ga04sT;han0oura03;barras6er02p8;owe3;aJeCi8;s8zz5;appoin0gus0sen0t8;r8u0N;ac0es6;biliDcCfiMgra4mBpres6serAv8;asCelo8;pi1;vi1;an4eaI;a5liH;ta0;maOri1s7un0;aOhLlo6o8ripp2ut0;mEn8rrespon4;cerCfBspi3t8vinQ;in9r8;as0ibu0ol2;ui1;lic0u6;ni1;fCmBp8;e9ro8;mi6;l2ti1;an4;or0;a8ea0il2;llen8rQ;gi1;lOptiva0ri1;eBin4lin4o9rui6u8;d4st2;i2oLri1un8;ci1;coJ;bsoQcLgonJlarImGppea2rEs8;pi3su3to8;n9un4;di1;is7;hi1;ri1;res0;li1;aBu6;si1;mi1;i8zi1;zi1;c8hi1;ele9ompan5;yi1;ra0;ti1;rbi1;ng",
-  "Adj|Past": "true\xA60:30;1:2R;2:2U;a2Jb2Dc1Ud1Be15f10gift0h0Xi0Qj0Pknown,l0Mm0Hn0Fo0Cp05qua04rVsEtAu7v5w3;arp0ea3or5;kIth2T;a3e0W;ri0;n3pd1s0;derstood,i3;fi0t0;ar5hreatCr3wi2R;a3ou19;ck0in0pp0;get0ni1N;aHcaGeEhDimCm01oak0pAt6u3;bsid28gge2Ms3;pe3ta1S;ct0nd0;at0e5r3uV;ength3ip0;en0;am0reotyp0;eci3ik0ott0;al20fi0;pIul1;ar0ut;a3c1Jle2t1S;l0t0;r0tt25;t3ut0;is1Jur1;aAe3;c7duc0f1Cg6l1new0qu5s3;pe2t3;or0ri2;e22ir0;ist1Xul1;eiv0o3;mme09rd0v1V;lli0ti1A;li19;arallel0i0Kl7o6r3ump0;e4o3;ce0Ilo0Hnou1Tpos0te2;fe0Loc8pY;i1Gli0R;a3e19;nn0;c4rgan1Bverlo3;ok0;cupi0;e3ot0;ed0gle2;a5e4ix0o3ut0;di0Vt0G;as0Qlt0;n3rk0;ag0ufact0O;eft,i4o3;ad0st;cens0mit0st0;agg0us0N;mp8n3sol1;br0debt0f6t3volv0;e3ox0F;gr1n3re18;d0si0J;e2l1oX;li0oLrov0;amm10e1o3;ok0r3;ri0E;aNe6i5lavo09oc05r3;a3i0;ct07g0Mm0;niXx0;ar0;duc1l1mbarraKn7quipp0stabliVx3;agger1p3te5;a4e3;ct0rie0S;nd0;ha0QsZ;aJeAi3;gni01miniOre2s3;a7c5grun05t3;o3reBurb0;rt0;iplSou3;nt0rE;bl0;cenVdOf8l7pre6ra5t3velop0;a3ermO;il0;ng0;ss0;ay0ight0;e4o3;rm0;rr0;m3t0;ag0;alcul1eHharg0lGo8r5u3;lt3stomS;iv1;a4owd0u3;sh0;ck0mp0;d0lo9m6n3ok0vX;centr1f4s3troll0;idVolid1;us0;b4pl3;ic1;in0;ur0;assi5os0;lebr1n5r3;ti3;fi0;tralB;a7i6o4roken,urn3;ed,t;il0r0t3und;tl0;as0;k0laIs0;bandon0cJdGffe2lDnBpp9ss7u3ward0;g4thor3;iz0;me3;nt0;o5u3;m0r0;li0re3;ci1;im1ticip1;at0;leg0t3;er0;ct0;ju4o6va3;nc0;st0;ce3knowledg0;pt0;ed",
-  "Person|Place": "true\xA6a5darw6h3jordan,k2orlando,s0victo7;a0ydney;lvador,mara,ntiago;ent,obe;amil0ous0;ton;lexand1ust0;in;ria",
-  "Person|Date": "true\xA6a2j0sep;an0une;!uary;p0ugust,v0;ril"
-};
-
-// node_modules/efrt/src/encoding.js
-var BASE = 36;
-var seq = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
-var cache = seq.split("").reduce(function(h2, c2, i3) {
-  h2[c2] = i3;
-  return h2;
-}, {});
-var toAlphaCode = function(n3) {
-  if (seq[n3] !== void 0) {
-    return seq[n3];
-  }
-  let places2 = 1;
-  let range = BASE;
-  let s3 = "";
-  for (; n3 >= range; n3 -= range, places2++, range *= BASE) {
-  }
-  while (places2--) {
-    const d2 = n3 % BASE;
-    s3 = String.fromCharCode((d2 < 10 ? 48 : 55) + d2) + s3;
-    n3 = (n3 - d2) / BASE;
-  }
-  return s3;
-};
-var fromAlphaCode = function(s3) {
-  if (cache[s3] !== void 0) {
-    return cache[s3];
-  }
-  let n3 = 0;
-  let places2 = 1;
-  let range = BASE;
-  let pow = 1;
-  for (; places2 < s3.length; n3 += range, places2++, range *= BASE) {
-  }
-  for (let i3 = s3.length - 1; i3 >= 0; i3--, pow *= BASE) {
-    let d2 = s3.charCodeAt(i3) - 48;
-    if (d2 > 10) {
-      d2 -= 7;
-    }
-    n3 += d2 * pow;
-  }
-  return n3;
-};
-var encoding_default = {
-  toAlphaCode,
-  fromAlphaCode
-};
-
-// node_modules/efrt/src/unpack/symbols.js
-var symbols = function(t2) {
-  const reSymbol = new RegExp("([0-9A-Z]+):([0-9A-Z]+)");
-  for (let i3 = 0; i3 < t2.nodes.length; i3++) {
-    const m3 = reSymbol.exec(t2.nodes[i3]);
-    if (!m3) {
-      t2.symCount = i3;
-      break;
-    }
-    t2.syms[encoding_default.fromAlphaCode(m3[1])] = encoding_default.fromAlphaCode(m3[2]);
-  }
-  t2.nodes = t2.nodes.slice(t2.symCount, t2.nodes.length);
-};
-var symbols_default = symbols;
-
-// node_modules/efrt/src/unpack/traverse.js
-var indexFromRef = function(trie, ref, index3) {
-  const dnode = encoding_default.fromAlphaCode(ref);
-  if (dnode < trie.symCount) {
-    return trie.syms[dnode];
-  }
-  return index3 + dnode + 1 - trie.symCount;
-};
-var toArray = function(trie) {
-  const all4 = [];
-  const crawl = (index3, pref) => {
-    let node = trie.nodes[index3];
-    if (node[0] === "!") {
-      all4.push(pref);
-      node = node.slice(1);
-    }
-    const matches3 = node.split(/([A-Z0-9,]+)/g);
-    for (let i3 = 0; i3 < matches3.length; i3 += 2) {
-      const str = matches3[i3];
-      const ref = matches3[i3 + 1];
-      if (!str) {
-        continue;
-      }
-      const have = pref + str;
-      if (ref === "," || ref === void 0) {
-        all4.push(have);
-        continue;
-      }
-      const newIndex = indexFromRef(trie, ref, index3);
-      crawl(newIndex, have);
-    }
-  };
-  crawl(0, "");
-  return all4;
-};
-var unpack = function(str) {
-  const trie = {
-    nodes: str.split(";"),
-    syms: [],
-    symCount: 0
-  };
-  if (str.match(":")) {
-    symbols_default(trie);
-  }
-  return toArray(trie);
-};
-var traverse_default = unpack;
-
-// node_modules/efrt/src/unpack/index.js
-var unpack2 = function(str) {
-  if (!str) {
-    return {};
-  }
-  const obj = str.split("|").reduce((h2, s3) => {
-    const arr = s3.split("\xA6");
-    h2[arr[0]] = arr[1];
-    return h2;
-  }, {});
-  const all4 = {};
-  Object.keys(obj).forEach(function(cat) {
-    const arr = traverse_default(obj[cat]);
-    if (cat === "true") {
-      cat = true;
-    }
-    for (let i3 = 0; i3 < arr.length; i3++) {
-      const k2 = arr[i3];
-      if (all4.hasOwnProperty(k2) === true) {
-        if (Array.isArray(all4[k2]) === false) {
-          all4[k2] = [all4[k2], cat];
-        } else {
-          all4[k2].push(cat);
-        }
-      } else {
-        all4[k2] = cat;
-      }
-    }
-  });
-  return all4;
-};
-var unpack_default = unpack2;
-
-// node_modules/compromise/src/2-two/preTagger/model/lexicon/misc.js
-var prp = ["Possessive", "Pronoun"];
-var misc = {
-  "20th century fox": "Organization",
-  "7 eleven": "Organization",
-  "motel 6": "Organization",
-  g8: "Organization",
-  vh1: "Organization",
-  "km2": "Unit",
-  "m2": "Unit",
-  "dm2": "Unit",
-  "cm2": "Unit",
-  "mm2": "Unit",
-  "mile2": "Unit",
-  "in2": "Unit",
-  "yd2": "Unit",
-  "ft2": "Unit",
-  "m3": "Unit",
-  "dm3": "Unit",
-  "cm3": "Unit",
-  "in3": "Unit",
-  "ft3": "Unit",
-  "yd3": "Unit",
-  "at&t": "Organization",
-  "black & decker": "Organization",
-  "h & m": "Organization",
-  "johnson & johnson": "Organization",
-  "procter & gamble": "Organization",
-  "ben & jerry's": "Organization",
-  "&": "Conjunction",
-  i: ["Pronoun", "Singular"],
-  he: ["Pronoun", "Singular"],
-  she: ["Pronoun", "Singular"],
-  it: ["Pronoun", "Singular"],
-  they: ["Pronoun", "Plural"],
-  we: ["Pronoun", "Plural"],
-  was: ["Copula", "PastTense"],
-  is: ["Copula", "PresentTense"],
-  are: ["Copula", "PresentTense"],
-  am: ["Copula", "PresentTense"],
-  were: ["Copula", "PastTense"],
-  her: prp,
-  his: prp,
-  hers: prp,
-  their: prp,
-  theirs: prp,
-  themselves: prp,
-  your: prp,
-  our: prp,
-  ours: prp,
-  my: prp,
-  its: prp,
-  vs: ["Conjunction", "Abbreviation"],
-  if: ["Condition", "Preposition"],
-  closer: "Comparative",
-  closest: "Superlative",
-  much: "Adverb",
-  may: "Modal",
-  babysat: "PastTense",
-  blew: "PastTense",
-  drank: "PastTense",
-  drove: "PastTense",
-  forgave: "PastTense",
-  skiied: "PastTense",
-  spilt: "PastTense",
-  stung: "PastTense",
-  swam: "PastTense",
-  swung: "PastTense",
-  guaranteed: "PastTense",
-  shrunk: "PastTense",
-  nears: "PresentTense",
-  nearing: "Gerund",
-  neared: "PastTense",
-  no: ["Negative", "Expression"]
-};
-var misc_default2 = misc;
-
-// node_modules/compromise/src/2-two/preTagger/model/lexicon/emoticons.js
-var emoticons_default = [
-  ":(",
-  ":)",
-  ":P",
-  ":p",
-  ":O",
-  ";(",
-  ";)",
-  ";P",
-  ";p",
-  ";O",
-  ":3",
-  ":|",
-  ":/",
-  ":\\",
-  ":$",
-  ":*",
-  ":@",
-  ":-(",
-  ":-)",
-  ":-P",
-  ":-p",
-  ":-O",
-  ":-3",
-  ":-|",
-  ":-/",
-  ":-\\",
-  ":-$",
-  ":-*",
-  ":-@",
-  ":^(",
-  ":^)",
-  ":^P",
-  ":^p",
-  ":^O",
-  ":^3",
-  ":^|",
-  ":^/",
-  ":^\\",
-  ":^$",
-  ":^*",
-  ":^@",
-  "):",
-  "(:",
-  "$:",
-  "*:",
-  ")-:",
-  "(-:",
-  "$-:",
-  "*-:",
-  ")^:",
-  "(^:",
-  "$^:",
-  "*^:",
-  "<3",
-  "</3",
-  "<\\3",
-  "=("
-];
-
-// node_modules/compromise/src/2-two/preTagger/methods/transform/nouns/toPlural/_rules.js
-var suffixes = {
-  a: [
-    [/(antenn|formul|nebul|vertebr|vit)a$/i, "$1ae"],
-    [/ia$/i, "ia"]
-  ],
-  e: [
-    [/(kn|l|w)ife$/i, "$1ives"],
-    [/(hive)$/i, "$1s"],
-    [/([m|l])ouse$/i, "$1ice"],
-    [/([m|l])ice$/i, "$1ice"]
-  ],
-  f: [
-    [/^(dwar|handkerchie|hoo|scar|whar)f$/i, "$1ves"],
-    [/^((?:ca|e|ha|(?:our|them|your)?se|she|wo)l|lea|loa|shea|thie)f$/i, "$1ves"]
-  ],
-  i: [[/(octop|vir)i$/i, "$1i"]],
-  m: [[/([ti])um$/i, "$1a"]],
-  n: [[/^(oxen)$/i, "$1"]],
-  o: [[/(al|ad|at|er|et|ed)o$/i, "$1oes"]],
-  s: [
-    [/(ax|test)is$/i, "$1es"],
-    [/(alias|status)$/i, "$1es"],
-    [/sis$/i, "ses"],
-    [/(bu)s$/i, "$1ses"],
-    [/(sis)$/i, "ses"],
-    [/^(?!talis|.*hu)(.*)man$/i, "$1men"],
-    [/(octop|vir|radi|nucle|fung|cact|stimul)us$/i, "$1i"]
-  ],
-  x: [
-    [/(matr|vert|ind|cort)(ix|ex)$/i, "$1ices"],
-    [/^(ox)$/i, "$1en"]
-  ],
-  y: [[/([^aeiouy]|qu)y$/i, "$1ies"]],
-  z: [[/(quiz)$/i, "$1zes"]]
-};
-var rules_default = suffixes;
-
-// node_modules/compromise/src/2-two/preTagger/methods/transform/nouns/toPlural/index.js
-var addE = /([xsz]|ch|sh)$/;
-var trySuffix = function(str) {
-  let c2 = str[str.length - 1];
-  if (rules_default.hasOwnProperty(c2) === true) {
-    for (let i3 = 0; i3 < rules_default[c2].length; i3 += 1) {
-      let reg = rules_default[c2][i3][0];
-      if (reg.test(str) === true) {
-        return str.replace(reg, rules_default[c2][i3][1]);
-      }
-    }
-  }
-  return null;
-};
-var pluralize = function(str = "", model5) {
-  let { irregularPlurals, uncountable: uncountable2 } = model5.two;
-  if (uncountable2.hasOwnProperty(str)) {
-    return str;
-  }
-  if (irregularPlurals.hasOwnProperty(str)) {
-    return irregularPlurals[str];
-  }
-  let plural2 = trySuffix(str);
-  if (plural2 !== null) {
-    return plural2;
-  }
-  if (addE.test(str)) {
-    return str + "es";
-  }
-  return str + "s";
-};
-var toPlural_default = pluralize;
-
-// node_modules/compromise/src/2-two/preTagger/model/lexicon/index.js
-var hasSwitch = /\|/;
-var lexicon3 = misc_default2;
-var switches = {};
-var tmpModel = { two: { irregularPlurals: plurals_default, uncountable: {} } };
-Object.keys(data_default).forEach((tag) => {
-  let wordsObj = unpack_default(data_default[tag]);
-  if (!hasSwitch.test(tag)) {
-    Object.keys(wordsObj).forEach((w) => {
-      lexicon3[w] = tag;
-    });
-    return;
-  }
-  Object.keys(wordsObj).forEach((w) => {
-    switches[w] = tag;
-    if (tag === "Noun|Verb") {
-      let plural2 = toPlural_default(w, tmpModel);
-      switches[plural2] = "Plural|Verb";
-    }
-  });
-});
-emoticons_default.forEach((str) => lexicon3[str] = "Emoticon");
-delete lexicon3[""];
-delete lexicon3[null];
-delete lexicon3[" "];
-
-// node_modules/compromise/src/2-two/preTagger/model/clues/_adj.js
-var jj = "Adjective";
-var adj_default = {
-  beforeTags: {
-    Determiner: jj,
-    Possessive: jj,
-    Hyphenated: jj
-  },
-  afterTags: {
-    Adjective: jj
-  },
-  beforeWords: {
-    seem: jj,
-    seemed: jj,
-    seems: jj,
-    feel: jj,
-    feels: jj,
-    felt: jj,
-    stay: jj,
-    appear: jj,
-    appears: jj,
-    appeared: jj,
-    also: jj,
-    over: jj,
-    under: jj,
-    too: jj,
-    it: jj,
-    but: jj,
-    still: jj,
-    really: jj,
-    quite: jj,
-    well: jj,
-    very: jj,
-    how: jj,
-    deeply: jj,
-    hella: jj,
-    profoundly: jj,
-    extremely: jj,
-    so: jj,
-    badly: jj,
-    mostly: jj,
-    totally: jj,
-    awfully: jj,
-    rather: jj,
-    nothing: jj,
-    something: jj,
-    anything: jj,
-    not: jj,
-    me: jj,
-    is: jj
-  },
-  afterWords: {
-    too: jj,
-    also: jj,
-    or: jj
-  }
-};
-
-// node_modules/compromise/src/2-two/preTagger/model/clues/_gerund.js
-var g2 = "Gerund";
-var gerund_default = {
-  beforeTags: {
-    Adverb: g2,
-    Preposition: g2,
-    Conjunction: g2
-  },
-  afterTags: {
-    Adverb: g2,
-    Possessive: g2,
-    Person: g2,
-    Pronoun: g2,
-    Determiner: g2,
-    Copula: g2,
-    Preposition: g2,
-    Conjunction: g2,
-    Comparative: g2
-  },
-  beforeWords: {
-    been: g2,
-    keep: g2,
-    continue: g2,
-    stop: g2,
-    am: g2,
-    be: g2,
-    me: g2,
-    began: g2,
-    start: g2,
-    starts: g2,
-    started: g2,
-    stops: g2,
-    stopped: g2,
-    help: g2,
-    helps: g2,
-    avoid: g2,
-    avoids: g2,
-    love: g2,
-    loves: g2,
-    loved: g2,
-    hate: g2,
-    hates: g2,
-    hated: g2
-  },
-  afterWords: {
-    you: g2,
-    me: g2,
-    her: g2,
-    him: g2,
-    them: g2,
-    their: g2,
-    it: g2,
-    this: g2,
-    there: g2,
-    on: g2,
-    about: g2,
-    for: g2
-  }
-};
-
-// node_modules/compromise/src/2-two/preTagger/model/clues/adj-gerund.js
-var clue = {
-  beforeTags: Object.assign({}, adj_default.beforeTags, gerund_default.beforeTags, {
-    Imperative: "Gerund",
-    Infinitive: "Adjective",
-    PresentTense: "Gerund",
-    Plural: "Gerund"
-  }),
-  afterTags: Object.assign({}, adj_default.afterTags, gerund_default.afterTags, {
-    Singular: "Adjective"
-  }),
-  beforeWords: Object.assign({}, adj_default.beforeWords, gerund_default.beforeWords, {
-    is: "Adjective",
-    was: "Adjective",
-    of: "Adjective",
-    suggest: "Gerund",
-    recommend: "Gerund"
-  }),
-  afterWords: Object.assign({}, adj_default.afterWords, gerund_default.afterWords, {
-    to: "Gerund",
-    not: "Gerund",
-    the: "Gerund"
-  })
-};
-var adj_gerund_default = clue;
-
-// node_modules/compromise/src/2-two/preTagger/model/clues/_noun.js
-var n2 = "Singular";
-var noun_default = {
-  beforeTags: {
-    Determiner: n2,
-    Possessive: n2,
-    Acronym: n2,
-    Noun: n2,
-    Adjective: n2,
-    PresentTense: n2,
-    Gerund: n2,
-    PastTense: n2,
-    Infinitive: n2,
-    Date: n2,
-    Ordinal: n2,
-    Demonym: n2
-  },
-  afterTags: {
-    Value: n2,
-    Modal: n2,
-    Copula: n2,
-    PresentTense: n2,
-    PastTense: n2,
-    Demonym: n2
-  },
-  beforeWords: {
-    the: n2,
-    with: n2,
-    without: n2,
-    of: n2,
-    for: n2,
-    any: n2,
-    all: n2,
-    on: n2,
-    cut: n2,
-    cuts: n2,
-    increase: n2,
-    decrease: n2,
-    raise: n2,
-    drop: n2,
-    save: n2,
-    saved: n2,
-    saves: n2,
-    make: n2,
-    makes: n2,
-    made: n2,
-    minus: n2,
-    plus: n2,
-    than: n2,
-    another: n2,
-    versus: n2,
-    neither: n2,
-    about: n2,
-    favorite: n2,
-    best: n2,
-    daily: n2,
-    weekly: n2,
-    linear: n2,
-    binary: n2,
-    mobile: n2,
-    lexical: n2,
-    technical: n2,
-    computer: n2,
-    scientific: n2,
-    security: n2,
-    government: n2,
-    popular: n2,
-    formal: n2,
-    no: n2,
-    more: n2,
-    one: n2
-  },
-  afterWords: {
-    of: n2,
-    system: n2,
-    aid: n2,
-    method: n2,
-    utility: n2,
-    tool: n2,
-    reform: n2,
-    therapy: n2,
-    philosophy: n2,
-    room: n2,
-    authority: n2,
-    says: n2,
-    said: n2,
-    wants: n2,
-    wanted: n2,
-    is: n2,
-    can: n2,
-    wise: n2
-  }
-};
-
-// node_modules/compromise/src/2-two/preTagger/model/clues/adj-noun.js
-var misc2 = {
-  beforeTags: {
-    Determiner: void 0,
-    Cardinal: "Noun",
-    PhrasalVerb: "Adjective"
-  }
-};
-var clue2 = {
-  beforeTags: Object.assign({}, adj_default.beforeTags, noun_default.beforeTags, misc2.beforeTags),
-  afterTags: Object.assign({}, adj_default.afterTags, noun_default.afterTags),
-  beforeWords: Object.assign({}, adj_default.beforeWords, noun_default.beforeWords, {
-    are: "Adjective",
-    is: "Adjective",
-    was: "Adjective",
-    be: "Adjective",
-    off: "Adjective",
-    out: "Adjective"
-  }),
-  afterWords: Object.assign({}, adj_default.afterWords, noun_default.afterWords)
-};
-var adj_noun_default = clue2;
-
-// node_modules/compromise/src/2-two/preTagger/model/clues/adj-past.js
-var past = "PastTense";
-var adjPast = {
-  beforeTags: {
-    Adverb: past,
-    Pronoun: past,
-    ProperNoun: past,
-    Auxiliary: past,
-    Noun: past
-  },
-  afterTags: {
-    Possessive: past,
-    Pronoun: past,
-    Determiner: past,
-    Adverb: past,
-    Comparative: past,
-    Date: past,
-    Gerund: past
-  },
-  beforeWords: {
-    be: past,
-    who: past,
-    get: "Adjective",
-    had: past,
-    has: past,
-    have: past,
-    been: past,
-    it: past,
-    as: past,
-    for: "Adjective"
-  },
-  afterWords: {
-    by: past,
-    back: past,
-    out: past,
-    in: past,
-    up: past,
-    down: past,
-    before: past,
-    after: past,
-    for: past,
-    the: past,
-    with: past,
-    as: past,
-    on: past,
-    at: past,
-    between: past,
-    to: past,
-    into: past,
-    us: past,
-    them: past,
-    me: past
-  }
-};
-var adj_past_default = {
-  beforeTags: Object.assign({}, adj_default.beforeTags, adjPast.beforeTags),
-  afterTags: Object.assign({}, adj_default.afterTags, adjPast.afterTags),
-  beforeWords: Object.assign({}, adj_default.beforeWords, adjPast.beforeWords),
-  afterWords: Object.assign({}, adj_default.afterWords, adjPast.afterWords)
-};
-
-// node_modules/compromise/src/2-two/preTagger/model/clues/_verb.js
-var v = "Infinitive";
-var verb_default = {
-  beforeTags: {
-    Modal: v,
-    Adverb: v,
-    Negative: v,
-    Plural: v
-  },
-  afterTags: {
-    Determiner: v,
-    Adverb: v,
-    Possessive: v,
-    Reflexive: v,
-    Preposition: v,
-    Cardinal: v,
-    Comparative: v,
-    Superlative: v
-  },
-  beforeWords: {
-    i: v,
-    we: v,
-    you: v,
-    they: v,
-    to: v,
-    please: v,
-    will: v,
-    have: v,
-    had: v,
-    would: v,
-    could: v,
-    should: v,
-    do: v,
-    did: v,
-    does: v,
-    can: v,
-    must: v,
-    us: v,
-    me: v,
-    let: v,
-    even: v,
-    when: v,
-    help: v,
-    he: v,
-    she: v,
-    it: v,
-    being: v,
-    bi: v,
-    co: v,
-    contra: v,
-    de: v,
-    inter: v,
-    intra: v,
-    mis: v,
-    pre: v,
-    out: v,
-    counter: v
-  },
-  afterWords: {
-    the: v,
-    me: v,
-    you: v,
-    him: v,
-    us: v,
-    her: v,
-    them: v,
-    it: v,
-    himself: v,
-    herself: v,
-    itself: v,
-    myself: v,
-    ourselves: v,
-    themselves: v,
-    something: v,
-    anything: v,
-    a: v,
-    an: v,
-    up: v,
-    down: v,
-    by: v,
-    out: v,
-    off: v,
-    under: v,
-    what: v,
-    all: v,
-    to: v,
-    because: v,
-    although: v,
-    after: v,
-    before: v,
-    how: v,
-    otherwise: v,
-    together: v,
-    though: v,
-    into: v,
-    yet: v,
-    more: v,
-    here: v,
-    there: v
-  }
-};
-
-// node_modules/compromise/src/2-two/preTagger/model/clues/adj-present.js
-var misc3 = {
-  afterTags: {
-    Noun: "Adjective",
-    Conjunction: void 0
-  }
-};
-var clue3 = {
-  beforeTags: Object.assign({}, adj_default.beforeTags, verb_default.beforeTags, {
-    Adverb: void 0,
-    Negative: void 0
-  }),
-  afterTags: Object.assign({}, adj_default.afterTags, verb_default.afterTags, misc3.afterTags),
-  beforeWords: Object.assign({}, adj_default.beforeWords, verb_default.beforeWords, {
-    have: void 0,
-    had: void 0,
-    not: void 0,
-    went: "Adjective",
-    goes: "Adjective",
-    got: "Adjective",
-    be: "Adjective"
-  }),
-  afterWords: Object.assign({}, adj_default.afterWords, verb_default.afterWords, {
-    to: void 0,
-    as: "Adjective"
-  })
-};
-var adj_present_default = clue3;
-
-// node_modules/compromise/src/2-two/preTagger/model/clues/noun-gerund.js
-var misc4 = {
-  beforeTags: {
-    Copula: "Gerund",
-    PastTense: "Gerund",
-    PresentTense: "Gerund",
-    Infinitive: "Gerund"
-  },
-  afterTags: {},
-  beforeWords: {
-    are: "Gerund",
-    were: "Gerund",
-    be: "Gerund",
-    no: "Gerund",
-    without: "Gerund",
-    you: "Gerund",
-    we: "Gerund",
-    they: "Gerund",
-    he: "Gerund",
-    she: "Gerund",
-    us: "Gerund",
-    them: "Gerund"
-  },
-  afterWords: {
-    the: "Gerund",
-    this: "Gerund",
-    that: "Gerund",
-    me: "Gerund",
-    us: "Gerund",
-    them: "Gerund"
-  }
-};
-var clue4 = {
-  beforeTags: Object.assign({}, gerund_default.beforeTags, noun_default.beforeTags, misc4.beforeTags),
-  afterTags: Object.assign({}, gerund_default.afterTags, noun_default.afterTags, misc4.afterTags),
-  beforeWords: Object.assign({}, gerund_default.beforeWords, noun_default.beforeWords, misc4.beforeWords),
-  afterWords: Object.assign({}, gerund_default.afterWords, noun_default.afterWords, misc4.afterWords)
-};
-var noun_gerund_default = clue4;
-
-// node_modules/compromise/src/2-two/preTagger/model/clues/noun-verb.js
-var nn = "Singular";
-var vb = "Infinitive";
-var clue5 = {
-  beforeTags: Object.assign({}, verb_default.beforeTags, noun_default.beforeTags, {
-    Adjective: nn,
-    Particle: nn
-  }),
-  afterTags: Object.assign({}, verb_default.afterTags, noun_default.afterTags, {
-    ProperNoun: vb,
-    Gerund: vb,
-    Adjective: vb,
-    Copula: nn
-  }),
-  beforeWords: Object.assign({}, verb_default.beforeWords, noun_default.beforeWords, {
-    is: nn,
-    was: nn,
-    of: nn,
-    have: null
-  }),
-  afterWords: Object.assign({}, verb_default.afterWords, noun_default.afterWords, {
-    instead: vb,
-    about: vb,
-    his: vb,
-    her: vb,
-    to: null,
-    by: null,
-    in: null
-  })
-};
-var noun_verb_default = clue5;
-
-// node_modules/compromise/src/2-two/preTagger/model/clues/_person.js
-var p2 = "Person";
-var person_default = {
-  beforeTags: {
-    Honorific: p2,
-    Person: p2
-  },
-  afterTags: {
-    Person: p2,
-    ProperNoun: p2,
-    Verb: p2
-  },
-  ownTags: {
-    ProperNoun: p2
-  },
-  beforeWords: {
-    hi: p2,
-    hey: p2,
-    yo: p2,
-    dear: p2,
-    hello: p2
-  },
-  afterWords: {
-    said: p2,
-    says: p2,
-    told: p2,
-    tells: p2,
-    feels: p2,
-    felt: p2,
-    seems: p2,
-    thinks: p2,
-    thought: p2,
-    spends: p2,
-    spendt: p2,
-    plays: p2,
-    played: p2,
-    sing: p2,
-    sang: p2,
-    learn: p2,
-    learned: p2,
-    wants: p2,
-    wanted: p2
-  }
-};
-
-// node_modules/compromise/src/2-two/preTagger/model/clues/person-date.js
-var m = "Month";
-var month = {
-  beforeTags: {
-    Date: m,
-    Value: m
-  },
-  afterTags: {
-    Date: m,
-    Value: m
-  },
-  beforeWords: {
-    by: m,
-    in: m,
-    on: m,
-    during: m,
-    after: m,
-    before: m,
-    between: m,
-    until: m,
-    til: m,
-    sometime: m,
-    of: m,
-    this: m,
-    next: m,
-    last: m,
-    previous: m,
-    following: m
-  },
-  afterWords: {
-    sometime: m,
-    in: m,
-    of: m,
-    until: m,
-    the: m
-  }
-};
-var person_date_default = {
-  beforeTags: Object.assign({}, person_default.beforeTags, month.beforeTags),
-  afterTags: Object.assign({}, person_default.afterTags, month.afterTags),
-  beforeWords: Object.assign({}, person_default.beforeWords, month.beforeWords),
-  afterWords: Object.assign({}, person_default.afterWords, month.afterWords)
-};
-
-// node_modules/compromise/src/2-two/preTagger/model/clues/person-noun.js
-var clue6 = {
-  beforeTags: Object.assign({}, noun_default.beforeTags, person_default.beforeTags),
-  afterTags: Object.assign({}, noun_default.afterTags, person_default.afterTags),
-  beforeWords: Object.assign({}, noun_default.beforeWords, person_default.beforeWords, { i: "Infinitive", we: "Infinitive" }),
-  afterWords: Object.assign({}, noun_default.afterWords, person_default.afterWords)
-};
-var person_noun_default = clue6;
-
-// node_modules/compromise/src/2-two/preTagger/model/clues/person-verb.js
-var clues = {
-  beforeTags: Object.assign({}, noun_default.beforeTags, person_default.beforeTags, verb_default.beforeTags),
-  afterTags: Object.assign({}, noun_default.afterTags, person_default.afterTags, verb_default.afterTags),
-  beforeWords: Object.assign({}, noun_default.beforeWords, person_default.beforeWords, verb_default.beforeWords),
-  afterWords: Object.assign({}, noun_default.afterWords, person_default.afterWords, verb_default.afterWords)
-};
-var person_verb_default = clues;
-
-// node_modules/compromise/src/2-two/preTagger/model/clues/person-place.js
-var p3 = "Place";
-var place = {
-  beforeTags: {
-    Place: p3
-  },
-  afterTags: {
-    Place: p3,
-    Abbreviation: p3
-  },
-  beforeWords: {
-    in: p3,
-    by: p3,
-    near: p3,
-    from: p3,
-    to: p3
-  },
-  afterWords: {
-    in: p3,
-    by: p3,
-    near: p3,
-    from: p3,
-    to: p3,
-    government: p3,
-    council: p3,
-    region: p3,
-    city: p3
-  }
-};
-var clue7 = {
-  beforeTags: Object.assign({}, place.beforeTags, person_default.beforeTags),
-  afterTags: Object.assign({}, place.afterTags, person_default.afterTags),
-  beforeWords: Object.assign({}, place.beforeWords, person_default.beforeWords),
-  afterWords: Object.assign({}, place.afterWords, person_default.afterWords)
-};
-var person_place_default = clue7;
-
-// node_modules/compromise/src/2-two/preTagger/model/clues/unit-noun.js
-var un = "Unit";
-var clues2 = {
-  beforeTags: { Value: un },
-  afterTags: {},
-  beforeWords: {
-    per: un,
-    every: un,
-    each: un,
-    square: un,
-    cubic: un,
-    sq: un,
-    metric: un
-  },
-  afterWords: {
-    per: un,
-    squared: un,
-    cubed: un,
-    long: un
-  }
-};
-var unit_noun_default = clues2;
-
-// node_modules/compromise/src/2-two/preTagger/model/clues/index.js
-var clues3 = {
-  "Adj|Gerund": adj_gerund_default,
-  "Adj|Noun": adj_noun_default,
-  "Adj|Past": adj_past_default,
-  "Adj|Present": adj_present_default,
-  "Noun|Verb": noun_verb_default,
-  "Noun|Gerund": noun_gerund_default,
-  "Person|Noun": person_noun_default,
-  "Person|Date": person_date_default,
-  "Person|Verb": person_verb_default,
-  "Person|Place": person_place_default,
-  "Unit|Noun": unit_noun_default
-};
-var copy = (obj, more) => {
-  let res = Object.keys(obj).reduce((h2, k2) => {
-    h2[k2] = obj[k2] === "Infinitive" ? "PresentTense" : "Plural";
-    return h2;
-  }, {});
-  return Object.assign(res, more);
-};
-clues3["Plural|Verb"] = {
-  beforeWords: copy(clues3["Noun|Verb"].beforeWords, {
-    had: "Plural",
-    have: "Plural"
-  }),
-  afterWords: copy(clues3["Noun|Verb"].afterWords, {
-    his: "PresentTense",
-    her: "PresentTense",
-    its: "PresentTense",
-    in: null,
-    to: null,
-    is: "PresentTense",
-    by: "PresentTense"
-  }),
-  beforeTags: copy(clues3["Noun|Verb"].beforeTags, {
-    Conjunction: "PresentTense",
-    Noun: void 0,
-    ProperNoun: "PresentTense"
-  }),
-  afterTags: copy(clues3["Noun|Verb"].afterTags, {
-    Gerund: "Plural",
-    Noun: "PresentTense",
-    Value: "PresentTense"
-  })
-};
-var clues_default = clues3;
-
-// node_modules/compromise/src/2-two/preTagger/model/patterns/suffixes.js
-var Adj = "Adjective";
-var Inf = "Infinitive";
-var Pres = "PresentTense";
-var Sing = "Singular";
-var Past = "PastTense";
-var Avb = "Adverb";
-var Plrl = "Plural";
-var Actor = "Actor";
-var Vb = "Verb";
-var Noun = "Noun";
-var Last = "LastName";
-var Modal = "Modal";
-var Place = "Place";
-var Prt = "Participle";
-var suffixes_default2 = [
-  null,
-  null,
-  {
-    ea: Sing,
-    ia: Noun,
-    ic: Adj,
-    ly: Avb,
-    "'n": Vb,
-    "'t": Vb
-  },
-  {
-    oed: Past,
-    ued: Past,
-    xed: Past,
-    " so": Avb,
-    "'ll": Modal,
-    "'re": "Copula",
-    azy: Adj,
-    eer: Noun,
-    end: Vb,
-    ped: Past,
-    ffy: Adj,
-    ify: Inf,
-    ing: "Gerund",
-    ize: Inf,
-    ibe: Inf,
-    lar: Adj,
-    mum: Adj,
-    nes: Pres,
-    nny: Adj,
-    ous: Adj,
-    que: Adj,
-    ger: Noun,
-    ber: Noun,
-    rol: Sing,
-    sis: Sing,
-    ogy: Sing,
-    oid: Sing,
-    ian: Sing,
-    zes: Pres,
-    eld: Past,
-    ken: Prt,
-    ven: Prt,
-    ten: Prt,
-    ect: Inf,
-    ict: Inf,
-    ign: Inf,
-    ful: Adj,
-    bal: Adj
-  },
-  {
-    amed: Past,
-    aped: Past,
-    ched: Past,
-    lked: Past,
-    rked: Past,
-    reed: Past,
-    nded: Past,
-    mned: Adj,
-    cted: Past,
-    dged: Past,
-    ield: Sing,
-    akis: Last,
-    cede: Inf,
-    chuk: Last,
-    czyk: Last,
-    ects: Pres,
-    ends: Vb,
-    enko: Last,
-    ette: Sing,
-    iary: Sing,
-    wner: Sing,
-    fies: Pres,
-    fore: Avb,
-    gate: Inf,
-    gone: Adj,
-    ices: Plrl,
-    ints: Plrl,
-    ruct: Inf,
-    ines: Plrl,
-    ions: Plrl,
-    ners: Plrl,
-    pers: Plrl,
-    lers: Plrl,
-    less: Adj,
-    llen: Adj,
-    made: Adj,
-    nsen: Last,
-    oses: Pres,
-    ould: Modal,
-    some: Adj,
-    sson: Last,
-    ians: Plrl,
-    tion: Sing,
-    tage: Noun,
-    ique: Sing,
-    tive: Adj,
-    tors: Noun,
-    vice: Sing,
-    lier: Sing,
-    fier: Sing,
-    wned: Past,
-    gent: Sing,
-    tist: Actor,
-    pist: Actor,
-    rist: Actor,
-    mist: Actor,
-    yist: Actor,
-    vist: Actor,
-    ists: Actor,
-    lite: Sing,
-    site: Sing,
-    rite: Sing,
-    mite: Sing,
-    bite: Sing,
-    mate: Sing,
-    date: Sing,
-    ndal: Sing,
-    vent: Sing,
-    uist: Actor,
-    gist: Actor,
-    note: Sing,
-    cide: Sing,
-    ence: Sing,
-    wide: Adj,
-    vide: Inf,
-    ract: Inf,
-    duce: Inf,
-    pose: Inf,
-    eive: Inf,
-    lyze: Inf,
-    lyse: Inf,
-    iant: Adj,
-    nary: Adj
-  },
-  {
-    elist: Actor,
-    holic: Sing,
-    phite: Sing,
-    tized: Past,
-    urned: Past,
-    eased: Past,
-    ances: Plrl,
-    bound: Adj,
-    ettes: Plrl,
-    fully: Avb,
-    ishes: Pres,
-    ities: Plrl,
-    marek: Last,
-    nssen: Last,
-    ology: Noun,
-    osome: Sing,
-    tment: Sing,
-    ports: Plrl,
-    rough: Adj,
-    tches: Pres,
-    tieth: "Ordinal",
-    tures: Plrl,
-    wards: Avb,
-    where: Avb,
-    archy: Noun,
-    pathy: Noun,
-    opoly: Noun,
-    embly: Noun,
-    phate: Noun,
-    ndent: Sing,
-    scent: Sing,
-    onist: Actor,
-    anist: Actor,
-    alist: Actor,
-    olist: Actor,
-    icist: Actor,
-    ounce: Inf,
-    iable: Adj,
-    borne: Adj,
-    gnant: Adj,
-    inant: Adj,
-    igent: Adj,
-    atory: Adj,
-    rient: Sing,
-    dient: Sing
-  },
-  {
-    auskas: Last,
-    parent: Sing,
-    cedent: Sing,
-    ionary: Sing,
-    cklist: Sing,
-    keeper: Actor,
-    logist: Actor,
-    teenth: "Value"
-  },
-  {
-    logists: Actor,
-    opoulos: Last,
-    borough: Place,
-    sdottir: Last
-  }
-];
-
-// node_modules/compromise/src/2-two/preTagger/model/patterns/prefixes.js
-var Adj2 = "Adjective";
-var Noun2 = "Noun";
-var Verb = "Verb";
-var prefixes_default2 = [
-  null,
-  null,
-  {},
-  {
-    neo: Noun2,
-    bio: Noun2,
-    "de-": Verb,
-    "re-": Verb,
-    "un-": Verb
-  },
-  {
-    anti: Noun2,
-    auto: Noun2,
-    faux: Adj2,
-    hexa: Noun2,
-    kilo: Noun2,
-    mono: Noun2,
-    nano: Noun2,
-    octa: Noun2,
-    poly: Noun2,
-    semi: Adj2,
-    tele: Noun2,
-    "pro-": Adj2,
-    "mis-": Verb,
-    "dis-": Verb,
-    "pre-": Adj2
-  },
-  {
-    anglo: Noun2,
-    centi: Noun2,
-    ethno: Noun2,
-    ferro: Noun2,
-    grand: Noun2,
-    hepta: Noun2,
-    hydro: Noun2,
-    intro: Noun2,
-    macro: Noun2,
-    micro: Noun2,
-    milli: Noun2,
-    nitro: Noun2,
-    penta: Noun2,
-    quasi: Adj2,
-    radio: Noun2,
-    tetra: Noun2,
-    "omni-": Adj2,
-    "post-": Adj2
-  },
-  {
-    pseudo: Adj2,
-    "extra-": Adj2,
-    "hyper-": Adj2,
-    "inter-": Adj2,
-    "intra-": Adj2,
-    "deca-": Adj2
-  },
-  {
-    electro: Noun2
-  }
-];
-
-// node_modules/compromise/src/2-two/preTagger/model/patterns/endsWith.js
-var Adj3 = "Adjective";
-var Inf2 = "Infinitive";
-var Pres2 = "PresentTense";
-var Sing2 = "Singular";
-var Past2 = "PastTense";
-var Adverb = "Adverb";
-var Exp = "Expression";
-var Actor2 = "Actor";
-var Verb2 = "Verb";
-var Noun3 = "Noun";
-var Last2 = "LastName";
-var endsWith_default = {
-  a: [
-    [/.[aeiou]na$/, Noun3, "tuna"],
-    [/.[oau][wvl]ska$/, Last2],
-    [/.[^aeiou]ica$/, Sing2, "harmonica"],
-    [/^([hyj]a+)+$/, Exp, "haha"]
-  ],
-  c: [[/.[^aeiou]ic$/, Adj3]],
-  d: [
-    [/[aeiou](pp|ll|ss|ff|gg|tt|rr|bb|nn|mm)ed$/, Past2, "popped"],
-    [/.[aeo]{2}[bdgmnprvz]ed$/, Past2, "rammed"],
-    [/.[aeiou][sg]hed$/, Past2, "gushed"],
-    [/.[aeiou]red$/, Past2, "hired"],
-    [/.[aeiou]r?ried$/, Past2, "hurried"],
-    [/[^aeiou]ard$/, Sing2, "steward"],
-    [/[aeiou][^aeiou]id$/, Adj3, ""],
-    [/.[vrl]id$/, Adj3, "livid"],
-    [/..led$/, Past2, "hurled"],
-    [/.[iao]sed$/, Past2, ""],
-    [/[aeiou]n?[cs]ed$/, Past2, ""],
-    [/[aeiou][rl]?[mnf]ed$/, Past2, ""],
-    [/[aeiou][ns]?c?ked$/, Past2, "bunked"],
-    [/[aeiou]gned$/, Past2],
-    [/[aeiou][nl]?ged$/, Past2],
-    [/.[tdbwxyz]ed$/, Past2],
-    [/[^aeiou][aeiou][tvx]ed$/, Past2],
-    [/.[cdflmnprstv]ied$/, Past2, "emptied"]
-  ],
-  e: [
-    [/.[lnr]ize$/, Inf2, "antagonize"],
-    [/.[^aeiou]ise$/, Inf2, "antagonise"],
-    [/.[aeiou]te$/, Inf2, "bite"],
-    [/.[^aeiou][ai]ble$/, Adj3, "fixable"],
-    [/.[^aeiou]eable$/, Adj3, "maleable"],
-    [/.[ts]ive$/, Adj3, "festive"],
-    [/[a-z]-like$/, Adj3, "woman-like"]
-  ],
-  h: [
-    [/.[^aeiouf]ish$/, Adj3, "cornish"],
-    [/.v[iy]ch$/, Last2, "..ovich"],
-    [/^ug?h+$/, Exp, "ughh"],
-    [/^uh[ -]?oh$/, Exp, "uhoh"],
-    [/[a-z]-ish$/, Adj3, "cartoon-ish"]
-  ],
-  i: [[/.[oau][wvl]ski$/, Last2, "polish-male"]],
-  k: [
-    [/^(k){2}$/, Exp, "kkkk"]
-  ],
-  l: [
-    [/.[gl]ial$/, Adj3, "familial"],
-    [/.[^aeiou]ful$/, Adj3, "fitful"],
-    [/.[nrtumcd]al$/, Adj3, "natal"],
-    [/.[^aeiou][ei]al$/, Adj3, "familial"]
-  ],
-  m: [
-    [/.[^aeiou]ium$/, Sing2, "magnesium"],
-    [/[^aeiou]ism$/, Sing2, "schism"],
-    [/^[hu]m+$/, Exp, "hmm"],
-    [/^\d+ ?[ap]m$/, "Date", "3am"]
-  ],
-  n: [
-    [/.[lsrnpb]ian$/, Adj3, "republican"],
-    [/[^aeiou]ician$/, Actor2, "musician"],
-    [/[aeiou][ktrp]in'$/, "Gerund", "cookin'"]
-  ],
-  o: [
-    [/^no+$/, Exp, "noooo"],
-    [/^(yo)+$/, Exp, "yoo"],
-    [/^wo{2,}[pt]?$/, Exp, "woop"]
-  ],
-  r: [
-    [/.[bdfklmst]ler$/, "Noun"],
-    [/[aeiou][pns]er$/, Sing2],
-    [/[^i]fer$/, Inf2],
-    [/.[^aeiou][ao]pher$/, Actor2],
-    [/.[lk]er$/, "Noun"],
-    [/.ier$/, "Comparative"]
-  ],
-  t: [
-    [/.[di]est$/, "Superlative"],
-    [/.[icldtgrv]ent$/, Adj3],
-    [/[aeiou].*ist$/, Adj3],
-    [/^[a-z]et$/, Verb2]
-  ],
-  s: [
-    [/.[^aeiou]ises$/, Pres2],
-    [/.[rln]ates$/, Pres2],
-    [/.[^z]ens$/, Verb2],
-    [/.[lstrn]us$/, Sing2],
-    [/.[aeiou]sks$/, Pres2],
-    [/.[aeiou]kes$/, Pres2],
-    [/[aeiou][^aeiou]is$/, Sing2],
-    [/[a-z]'s$/, Noun3],
-    [/^yes+$/, Exp]
-  ],
-  v: [
-    [/.[^aeiou][ai][kln]ov$/, Last2]
-  ],
-  y: [
-    [/.[cts]hy$/, Adj3],
-    [/.[st]ty$/, Adj3],
-    [/.[tnl]ary$/, Adj3],
-    [/.[oe]ry$/, Sing2],
-    [/[rdntkbhs]ly$/, Adverb],
-    [/.(gg|bb|zz)ly$/, Adj3],
-    [/...lly$/, Adverb],
-    [/.[gk]y$/, Adj3],
-    [/[bszmp]{2}y$/, Adj3],
-    [/.[ai]my$/, Adj3],
-    [/[ea]{2}zy$/, Adj3],
-    [/.[^aeiou]ity$/, Sing2]
-  ]
-};
-
-// node_modules/compromise/src/2-two/preTagger/model/patterns/neighbours.js
-var vb2 = "Verb";
-var nn2 = "Noun";
-var neighbours_default = {
-  leftTags: [
-    ["Adjective", nn2],
-    ["Possessive", nn2],
-    ["Determiner", nn2],
-    ["Adverb", vb2],
-    ["Pronoun", vb2],
-    ["Value", nn2],
-    ["Ordinal", nn2],
-    ["Modal", vb2],
-    ["Superlative", nn2],
-    ["Demonym", nn2],
-    ["Honorific", "Person"]
-  ],
-  leftWords: [
-    ["i", vb2],
-    ["first", nn2],
-    ["it", vb2],
-    ["there", vb2],
-    ["not", vb2],
-    ["because", nn2],
-    ["if", nn2],
-    ["but", nn2],
-    ["who", vb2],
-    ["this", nn2],
-    ["his", nn2],
-    ["when", nn2],
-    ["you", vb2],
-    ["very", "Adjective"],
-    ["old", nn2],
-    ["never", vb2],
-    ["before", nn2],
-    ["a", nn2],
-    ["the", nn2],
-    ["been", vb2]
-  ],
-  rightTags: [
-    ["Copula", nn2],
-    ["PastTense", nn2],
-    ["Conjunction", nn2],
-    ["Modal", nn2]
-  ],
-  rightWords: [
-    ["there", vb2],
-    ["me", vb2],
-    ["man", "Adjective"],
-    ["him", vb2],
-    ["it", vb2],
-    ["were", nn2],
-    ["took", nn2],
-    ["himself", vb2],
-    ["went", nn2],
-    ["who", nn2],
-    ["jr", "Person"]
-  ]
-};
-
-// node_modules/compromise/src/2-two/preTagger/model/models/_data.js
-var data_default2 = {
-  "Comparative": {
-    "rules": "ig|2ger,ng|2er,hin|3ner,n|1er,ot|2ter,lat|3ter,t|1er,ray|3er,y|ier,ross|4er,im|2mer,m|1er,f|1er,b|1er,er|2,r|1er,p|1er,h|1er,w|1er,k|1er,l|1er,d|1er,e|1r",
-    "exceptions": "good|better,bad|worse,wet|3ter,lay|3er,neat|4ter,fat|3ter,mad|3der,sad|3der,wide|4r,late|4r,safe|4r,fine|4r,dire|4r,fake|4r,pale|4r,rare|4r,rude|4r,sore|4r",
-    "rev": "arger|4,esser|5,igger|2,impler|5,reer|3,hinner|3,remier|6,urer|3,aucher|5,almer|3,raver|4,uter|3,iviner|5,erier|4,enuiner|6,rosser|4,uger|3,andomer|5,emoter|5,quarer|5,taler|4,iper|3,hiter|4,rther|5,rmer|2,ayer|2,immer|2,somer|4,amer|3,adder|2,nger|2,fer|1,tler|3,cer|2,ber|1,uer|2,bler|3,tter|1,rer|1,ser|2,per|1,her|1,wer|1,ker|1,ner|1,ler|1,ter|1,der|1,ier|y"
-  },
-  "Gerund": {
-    "rules": "omoting|4e,haring|3e,ploring|4e,mbining|4e,nviting|4e,belling|3,ntoring|4e,uiding|3e,orging|3e,dhering|4e,alysing|4e,nciling|4e,mpeding|4e,uoting|3e,evoting|4e,nsating|4e,gnoring|4e,roding|3e,iaising|4e,esaling|4e,rowsing|4e,rfering|4e,kating|3e,robing|3e,tponing|4e,mmuting|4e,laning|3e,moking|3e,nfining|4e,nduring|4e,nciting|4e,busing|3e,eleting|4e,esiring|4e,rbating|4e,larging|4e,ploding|4e,haking|3e,hading|3e,biding|3e,udding|2,neating|4e,craping|4e,efuting|4e,thoring|4e,eusing|3e,agining|4e,rekking|3,suading|4e,ubating|4e,ronzing|4e,euvring|4e,bliging|4e,laking|3e,riming|3e,asising|4e,lunging|4e,cilling|3,pinging|4e,hoking|3e,creting|4e,ralling|3,miling|3e,wathing|4e,edoring|4e,odding|2,aloging|4e,rseding|4e,xcusing|4e,halling|3,ialling|3,inuting|4e,xciting|4e,chuting|4e,hrining|4e,eciting|4e,xuding|3e,isusing|4e,uizzing|3,ithing|3e,izzling|4e,haling|3e,dmiring|4e,rsaking|4e,parging|4e,ixating|4e,anuring|4e,iecing|3e,erusing|4e,eething|4e,entring|4e,goating|4e,langing|4e,stining|4e,lescing|4e,erlying|3ie,pleting|4e,ausing|3e,ciding|3e,enging|3e,casing|3e,cising|3e,esiding|4e,uning|2e,delling|3,storing|4e,tiring|3e,leging|3e,piling|3e,tising|3e,ecuting|4e,eduling|4e,uelling|3,liding|3e,uging|2e,celling|3,ubing|2e,laming|3e,ebating|4e,njuring|4e,scaping|4e,truding|4e,chising|4e,vading|3e,shaping|4e,iping|2e,naming|3e,ulging|3e,raking|3e,fling|2e,taping|3e,noting|3e,lading|3e,scaling|4e,riding|3e,rasing|3e,coping|3e,ruling|3e,wining|3e,viding|3e,quiring|4e,velling|3,alyzing|4e,laring|3e,coring|3e,ranging|4e,ousing|3e,puting|3e,vening|3e,idding|2,hining|3e,urging|3e,coding|3e,niting|3e,nelling|3,dising|3e,uising|3e,caring|3e,lapsing|4e,erging|3e,pating|3e,mining|3e,ibuting|4e,coming|3e,paring|3e,taking|3e,hasing|3e,vising|3e,ituting|4e,writing|4e,eezing|3e,piring|3e,luting|3e,voking|3e,iguring|4e,uming|2e,curing|3e,mising|3e,iking|2e,edding|2,luding|3e,suring|3e,rising|3e,ribing|3e,rading|3e,ceding|3e,nsing|2e,kling|2e,fusing|3e,azing|2e,cling|2e,nising|3e,ducing|3e,rcing|2e,gling|2e,easing|3e,uating|3e,lising|3e,lining|3e,mating|3e,mming|1,pling|2e,bbing|1,vating|3e,dling|2e,dating|3e,rsing|2e,dging|2e,tling|2e,turing|3e,icing|2e,acing|2e,gating|3e,gging|1,tating|3e,rring|1,nning|1,uing|1e,bling|2e,iating|3e,cating|3e,aging|2e,osing|2e,ncing|2e,nating|3e,pping|1,lating|3e,tting|1,rating|3e,ving|1e,izing|2e,ing|",
-    "exceptions": "being|is,using|2e,making|3e,creating|5e,changing|5e,owing|2e,raising|4e,competing|6e,defining|5e,counselling|7,hiring|3e,filing|3e,controlling|7,totalling|5,infringing|7e,citing|3e,dying|1ie,doping|3e,baking|3e,hoping|3e,refining|5e,exchanging|7e,charging|5e,stereotyping|9e,voting|3e,tying|1ie,discharging|8e,basing|3e,lying|1ie,expediting|7e,typing|3e,breathing|6e,framing|4e,boring|3e,dining|3e,firing|3e,hiding|3e,appraising|7e,tasting|4e,waning|3e,distilling|6,baling|3e,boning|3e,faring|3e,honing|3e,wasting|4e,phoning|4e,luring|3e,propelling|6,timing|3e,wading|3e,abating|4e,compelling|6,vying|1ie,fading|3e,biting|3e,zoning|3e,dispelling|6,pasting|4e,praising|5e,telephoning|8e,daring|3e,waking|3e,shoring|4e,gaming|3e,padding|3,rerouting|6e,fringing|5e,braising|5e,coking|3e,recreating|7e,sloping|4e,sunbathing|7e,overcharging|9e,everchanging|9e,patrolling|6,joking|3e,extolling|5,expelling|5,reappraising|9e,wadding|3,gaping|3e,poking|3e,persevering|8e,pining|3e,recordkeeping|10e,landfilling|7,liming|3e,interchanging|10e,toting|3e,roping|3e,wiring|3e,aching|3e,gassing|3,getting|3,travelling|6,putting|3,sitting|3,betting|3,mapping|3,tapping|3,letting|3,hitting|3,tanning|3,netting|3,popping|3,fitting|3,deterring|5,barring|3,banning|3,vetting|3,omitting|4,wetting|3,plotting|4,budding|3,clotting|4,hemming|3,slotting|4,singeing|5,reprogramming|9,jetting|3,kidding|3,befitting|5,podding|3,wedding|3,donning|3,warring|3,penning|3,gutting|3,cueing|3,refitting|5,petting|3,cramming|4,napping|3,tinning|3",
-    "rev": "lan|3ning,egin|4ning,can|3ning,pan|3ning,hin|3ning,kin|3ning,win|3ning,un|2ning,pin|3ning,n|1ing,ounsel|6ling,otal|4ling,abel|4ling,evel|4ling,ancel|5ling,istil|5ling,xcel|4ling,tencil|6ling,piral|5ling,arshal|6ling,nitial|6ling,hrivel|6ling,xtol|4ling,andfil|6ling,trol|4ling,fuel|4ling,model|5ling,nnel|4ling,pel|3ling,l|1ing,ransfer|7ring,lur|3ring,tir|3ring,tar|3ring,pur|3ring,car|3ring,nfer|4ring,efer|4ring,cur|3ring,r|1ing,ermit|5ting,ransmit|7ting,ommit|5ting,nit|3ting,orget|5ting,abysit|6ting,dmit|4ting,hut|3ting,hat|3ting,utfit|5ting,but|3ting,egret|5ting,llot|4ting,mat|3ting,pot|3ting,lit|3ting,emit|4ting,submit|6ting,pit|3ting,rot|3ting,quit|4ting,cut|3ting,set|3ting,t|1ing,tem|3ming,wim|3ming,kim|3ming,um|2ming,rim|3ming,m|1ing,tep|3ping,wap|3ping,top|3ping,hop|3ping,cap|3ping,rop|3ping,rap|3ping,lap|3ping,ip|2ping,p|1ing,ye|2ing,oe|2ing,ie|ying,ee|2ing,e|ing,hed|3ding,hred|4ding,bed|3ding,bid|3ding,d|1ing,ki|2ing,rek|3king,k|1ing,isc|3ing,echarg|6ing,ng|2ing,g|1ging,uiz|3zing,z|1ing,mb|2ing,rb|2ing,b|1bing,o|1ing,x|1ing,f|1ing,s|1ing,w|1ing,y|1ing,h|1ing"
-  },
-  "Participle": {
-    "rules": "roken|1ake,hosen|2ose,allen|3,rozen|1eeze,asten|4,engthen|5,essen|3,hrunken|2ink,lain|2y,poken|1eak,tolen|1eal,eaten|3,un|in,itten|2e,gotten|1et,ighten|4,idden|2e,worn|1ear,sen|2,aken|3,ven|2,wn|1,rought|1ing,uilt|3d,urst|4,ealt|3,reamt|4,urt|3,nelt|2el,eapt|3,eft|1ave,eant|3,hot|2ot,pat|1it,et|2,ut|2,it|2,ent|2d,ept|1ep,urned|3,reated|5,eard|3,eld|old,ead|3,lid|3e,old|ell,ped|2ed,pilled|4,ound|ind,ved|2,aid|1y,ug|ig,ung|ing,ade|1ke,hone|1ine,come|4,gone|2,nuck|1eak,unk|ink",
-    "exceptions": "been|2,bled|3ed,bought|1uy,fed|2ed,fled|3e,flown|2y,fought|1ight,had|2ve,hung|1ang,led|2ad,lit|2ght,met|2et,run|3,sat|1eat,seen|3,sought|1eek,woven|1eave,bet|3,brought|2ing,dealt|4,dived|4,heard|4,left|2ave,made|2ke,read|4,shaved|5,slain|3y",
-    "rev": "uy|ought,ly|1own,ay|1id,rake|1oken,hoose|2sen,reate|5d,lee|2d,reeze|1ozen,aste|4n,rove|4n,hine|1one,lide|3,hrive|5d,come|4,ite|2ten,ide|2den,se|2n,ake|3n,ive|3n,uild|3t,old|eld,ind|ound,eed|1d,end|2t,urn|3ed,ean|3t,un|2,in|un,urst|4,right|5en,eight|5en,urt|3,eet|1t,hoot|2t,pit|1at,eat|3en,get|1otten,set|3,ut|2,it|2,ream|4t,ig|ug,ang|ung,ing|ung,all|3en,neel|2lt,ell|old,pill|4ed,teal|1olen,eap|3t,eep|1pt,ength|5en,ess|3en,hrink|2unken,neak|1uck,eek|ought,peak|1oken,ink|unk,wear|1orn,go|2ne,w|1n"
-  },
-  "PastTense": {
-    "rules": "een|1,egan|2in,on|in,pun|1in,ewn|2,ave|ive,poke|1eak,hose|2ose,roke|1eak,roze|1eeze,ode|ide,orbade|3id,hone|1ine,tole|1eal,rose|1ise,woke|1ake,wrote|2ite,made|2ke,came|1ome,ove|ive,ore|ear,elped|3,elcomed|6,hared|4,nvited|5,eclared|6,eard|3,avelled|4,ombined|6,uided|4,etired|5,choed|3,ncelled|4,epeated|5,moked|4,entred|5,dhered|5,esired|5,ompeted|6,erseded|6,ramed|4,qualled|4,iloted|4,stponed|6,uelled|3,opelled|4,gnored|5,xtruded|6,caled|4,ndured|5,lamed|4,quared|5,mpeded|5,rouped|4,efeated|5,robed|4,lid|3e,magined|6,nselled|4,uthored|6,ebuted|4,shrined|6,tialled|4,erfered|6,eaped|3,yped|3,laked|4,tirred|3,ooted|3,leated|4,ncited|5,oubted|4,mpelled|4,nnulled|4,pined|4,ircled|5,ecited|5,reathed|6,nvaded|5,onfided|6,pedited|6,alcined|6,ycotted|5,dmired|5,xcreted|6,ubed|3,taked|4,onfined|6,heated|4,rimed|4,amelled|4,achined|6,litzed|4,xcited|5,xpelled|4,xtolled|4,ouled|3,imicked|4,ivalled|4,eeped|3,naked|4,tyled|4,iased|3,nhaled|5,oeuvred|6,grammed|6,kied|2,miled|4,pited|4,eterred|4,hoked|4,kidded|3,ollided|6,pleted|5,cided|4,plored|5,stored|5,longed|4,filed|4,rbed|2,suaded|5,ciled|4,edded|2,tined|4,phoned|5,fled|3,nited|4,iped|3,hauled|4,treated|5,nnelled|4,basted|5,njured|5,twined|5,uzzed|3,did|1o,odded|2,vided|4,old|ell,pared|4,mbed|2,stood|2and,pired|4,held|1old,vened|4,cored|4,read|4,piled|4,aped|3,gled|3,named|4,arred|2,oated|3,kled|3,ooled|3,uned|3,figured|6,bid|3,ound|ind,oped|2,ibed|3,quired|5,uled|3,oded|3,ceded|4,cured|4,sided|4,voked|4,rled|2,outed|3,mined|4,urred|2,ighted|4,umed|3,sured|4,iked|3,mmed|1,pled|3,fed|1,bbed|1,eled|2,luded|4,aid|1y,ferred|3,tled|3,dled|3,raded|4,oted|3,eed|2,aled|2,lined|4,mped|2,fted|2,lted|2,gged|1,eted|2,xed|1,bled|3,pted|2,tured|4,uted|3,ued|2,iled|2,nned|1,yed|1,rted|2,pped|1,tted|1,wed|1,lled|2,ited|2,med|1,sted|2,ssed|2,ged|2,ved|2,nted|2,ked|1,cted|2,ced|2,ied|y,hed|1,sed|2,ded|1,zed|2,ned|1,red|1,ated|3,ell|all,rought|1ing,hought|1ink,eft|1ave,eant|3,ealt|3,eat|3,hot|2ot,urt|3,eapt|3,elt|1el,went|go,built|4d,at|it,got|1et,ut|2,it|2,et|2,ent|2d,ept|1ep,st|2,truck|2ike,nuck|1eak,tunk|1ink,ank|ink,ook|ake,ug|ig,ang|ing,ung|ing,nderlay|5ie,dezvous|7,wam|1im,drew|2aw,saw|1ee,ew|ow",
-    "exceptions": "was|is,were|are,had|2ve,led|2ad,met|2et,cited|4,focused|5,sought|1eek,lost|3e,defined|6,died|3,hired|4,bought|1uy,ran|1un,controlled|7,taught|1each,hoped|4,shed|4,refined|6,caught|2tch,flew|2y,owed|3,fought|1ight,fired|4,fed|2ed,pied|3,fared|4,tied|3,fled|3e,cared|4,ate|eat,dyed|3,lit|2ght,winged|4,bred|3ed,pent|3,wired|4,persevered|9,baked|4,dined|4,fined|4,shored|5,hid|3e,padded|3,waned|4,wove|1eave,lied|3,wasted|5,sloped|5,joked|4,ached|4,baled|4,bit|3e,bled|3ed,boned|4,caned|4,dispelled|6,egged|3,hung|1ang,patrolled|6,tasted|5,faked|4,bored|4,eyed|3,gamed|4,gassed|3,pored|4,timed|4,toned|4,zoned|4,poked|4,dared|4,been|2,said|2y,found|1ind,took|1ake,came|1ome,gave|1ive,fell|1all,brought|2ing,rose|1ise,put|3,sent|3d,spent|4d,spoke|2eak,left|2ave,won|1in,told|1ell,meant|4,heard|4,got|1et,arose|2ise,read|4,let|3,hit|3,cost|4,dealt|4,laid|2y,drove|2ive,sat|1it,cast|4,beat|4,lent|3d,sang|1ing,banned|3,jarred|3,wound|1ind,omitted|4,quit|4,slid|4e,rang|1ing,fit|3,rent|3d,bet|3,sank|1ink,reaped|4,manned|3,rode|1ide,rebutted|5,bound|1ind,barred|3,recast|6,netted|3,tanned|3,plotted|4,tore|1ear,spun|2in,pitted|3,shone|2ine,donned|3,dove|1ive,spat|2it,bent|3d,leapt|4,seeped|4,sewn|3,twinned|4,wrung|2ing,deterred|5,blew|2ow",
-    "rev": "egin|2an,lan|3ned,nderpin|7ned,kin|3ned,hin|3ned,pan|3ned,can|3ned,un|2ned,n|1ed,ecome|2ame,hoose|2se,trike|2uck,lee|2d,trive|2ove,vercome|4ame,reeze|1oze,hake|1ook,nderlie|5ay,istake|3ook,etake|2ook,wake|1oke,write|2ote,make|2de,rtake|2ook,see|1aw,e|1d,elp|3ed,roup|4ed,oop|3ed,velop|5ed,eep|1pt,mp|2ed,p|1ped,hink|1ought,eek|ought,reak|1oke,neak|1uck,tink|1unk,rink|1ank,k|1ed,ommit|5ted,ermit|5ted,oadcast|7,dmit|4ted,hoot|2t,plit|4,hut|3,llot|4ted,nit|3ted,orget|3ot,egret|5ted,hrust|5,ormat|5ted,hat|3ted,lat|3ted,urt|3,cquit|5ted,urst|4,ransmit|7ted,emit|4ted,pot|3ted,cut|3,submit|6ted,set|3,t|1ed,now|1ew,trew|4n,draw|2ew,throw|3ew,grow|2ew,w|1ed,uy|ought,ey|2ed,pay|2id,oy|2ed,ay|2ed,y|ied,ravel|5led,ancel|5led,qual|4led,uel|3led,ounsel|6led,nitial|6led,nnul|4led,namel|5led,xtol|4led,ival|4led,teal|1ole,eel|1lt,trol|4led,sell|1old,nnel|4led,pel|3led,l|1ed,ransfer|7red,pur|3red,lur|3red,tir|3red,par|3red,nfer|4red,wear|1ore,bear|1ore,efer|4red,cur|3red,r|1ed,pread|5,hed|3,rind|1ound,mbed|4ded,reed|2d,hred|4ded,eread|5,orbid|3ade,leed|2d,kid|3ded,build|4t,od|2ded,stand|2ood,hold|1eld,bid|3,d|1ed,cho|3ed,go|went,do|1id,tem|3med,um|2med,rim|3med,kim|3med,wim|1am,lam|3med,m|1ed,lug|3ged,ig|ug,pring|2ang,gg|2ed,ang|ung,long|4ed,og|2ged,ling|1ung,ag|2ged,ub|2bed,ib|2bed,ob|2bed,rb|2ed,ab|2bed,mb|2ed,imic|4ked,dezvous|7,s|1ed,ki|2ed,z|1ed,f|1ed,x|1ed,h|1ed"
-  },
-  "PresentTense": {
-    "rules": "as|1ve,tudies|3y,mbodies|4y,evies|2y,arties|3y,emedies|4y,mpties|3y,eadies|3y,obbies|3y,ullies|3y,nesties|4y,zzes|2,pies|1y,nies|1y,oes|1,xes|1,plies|2y,ries|1y,shes|2,sses|2,ches|2,fies|1y,s|",
-    "exceptions": "are|is,focuses|5,relies|3y,flies|2y,gasses|3,has|2ve",
-    "rev": "uy|2s,oy|2s,ey|2s,ay|2s,y|ies,adio|4s,aboo|4s,o|1es,tograph|7s,erth|4s,gh|2s,h|1es,as|2ses,s|1es,ic|2s,zz|2es,x|1es,f|1s,b|1s,g|1s,m|1s,w|1s,p|1s,k|1s,l|1s,d|1s,n|1s,r|1s,t|1s,e|1s"
-  },
-  "Superlative": {
-    "rules": "east|4,uthwest|7,ot|2test,it|2test,lat|3test,weet|4test,t|1est,ig|2gest,ng|2est,hin|3nest,n|1est,nner|4most,uter|4most,r|1est,rey|3est,ricey|3iest,y|iest,ross|4est,f|1est,b|1est,m|1est,p|1est,h|1est,w|1est,k|1est,l|1est,d|1est,e|1st",
-    "exceptions": "good|best,bad|worst,wet|3test,far|1urthest,gay|3est,neat|4test,shy|3est,fat|3test,late|4st,wide|4st,fine|4st,severe|6st,fake|4st,pale|4st,rare|4st,rude|4st,sore|4st,dire|4st",
-    "rev": "east|4,argest|4,iggest|2,implest|5,afest|3,uthwest|7,hinnest|3,ncerest|5,urthest|ar,ravest|4,utest|3,eriest|4,rossest|4,dsomest|5,ugest|3,riciest|3ey,emotest|5,quarest|5,rangest|5,ipest|3,urest|3,cest|2,ermost|2,fest|1,best|1,amest|3,itest|3,ngest|2,uest|2,yest|1,tlest|3,mest|1,blest|3,sest|2,pest|1,hest|1,ttest|1,west|1,rest|1,kest|1,nest|1,lest|1,test|1,dest|1,iest|y"
-  }
-};
-
-// node_modules/suffix-thumb/src/convert/index.js
-var prefix2 = /^.([0-9]+)/;
-var getKeyVal = function(word, model5) {
-  let val = model5.exceptions[word];
-  let m3 = val.match(prefix2);
-  if (m3 === null) {
-    return model5.exceptions[word];
-  }
-  let num = Number(m3[1]) || 0;
-  let pre = word.substr(0, num);
-  return pre + val.replace(prefix2, "");
-};
-var getRules = function(word, rules2 = {}) {
-  let char = word[word.length - 1];
-  let list4 = rules2[char] || [];
-  if (rules2[""]) {
-    list4 = list4.concat(rules2[""]);
-  }
-  return list4;
-};
-var convert = function(word, model5, debug2) {
-  if (model5.exceptions.hasOwnProperty(word)) {
-    if (debug2) {
-      console.log("exception, ", word, model5.exceptions[word]);
-    }
-    return getKeyVal(word, model5);
-  }
-  let rules2 = model5.rules;
-  if (model5.reversed) {
-    rules2 = model5.rev;
-  }
-  rules2 = getRules(word, rules2);
-  for (let i3 = 0; i3 < rules2.length; i3 += 1) {
-    let suffix = rules2[i3][0];
-    if (word.endsWith(suffix)) {
-      if (debug2) {
-        console.log("rule, ", rules2[i3]);
-      }
-      let reg = new RegExp(suffix + "$");
-      return word.replace(reg, rules2[i3][1]);
-    }
-  }
-  if (debug2) {
-    console.log(" x - " + word);
-  }
-  return word;
-};
-var convert_default = convert;
-
-// node_modules/suffix-thumb/src/_lib.js
-var indexRules = function(rules2) {
-  let byChar = {};
-  rules2.forEach((a2) => {
-    let suff = a2[0] || "";
-    let char = suff[suff.length - 1] || "";
-    byChar[char] = byChar[char] || [];
-    byChar[char].push(a2);
-  });
-  return byChar;
-};
-
-// node_modules/suffix-thumb/src/compress/uncompress.js
-var prefix3 = /^([0-9]+)/;
-var expand3 = function(key = "", val = "") {
-  val = String(val);
-  let m3 = val.match(prefix3);
-  if (m3 === null) {
-    return [key, val];
-  }
-  let num = Number(m3[1]) || 0;
-  let pre = key.substring(0, num);
-  let full = pre + val.replace(prefix3, "");
-  return [key, full];
-};
-var toArray2 = function(txt) {
-  const pipe = /\|/;
-  return txt.split(/,/).map((str) => {
-    let a2 = str.split(pipe);
-    return expand3(a2[0], a2[1]);
-  });
-};
-var uncompress = function(model5 = {}) {
-  model5 = Object.assign({}, model5);
-  model5.rules = toArray2(model5.rules);
-  model5.rules = indexRules(model5.rules);
-  if (model5.rev) {
-    model5.rev = toArray2(model5.rev);
-    model5.rev = indexRules(model5.rev);
-  }
-  model5.exceptions = toArray2(model5.exceptions);
-  model5.exceptions = model5.exceptions.reduce((h2, a2) => {
-    h2[a2[0]] = a2[1];
-    return h2;
-  }, {});
-  return model5;
-};
-var uncompress_default = uncompress;
-
-// node_modules/suffix-thumb/src/reverse/index.js
-var reverseObj = function(obj) {
-  return Object.entries(obj).reduce((h2, a2) => {
-    h2[a2[1]] = a2[0];
-    return h2;
-  }, {});
-};
-var reverse2 = function(model5) {
-  let { rules: rules2, exceptions: exceptions5, rev } = model5;
-  exceptions5 = reverseObj(exceptions5);
-  return {
-    reversed: !Boolean(model5.reversed),
-    rules: rules2,
-    exceptions: exceptions5,
-    rev
-  };
-};
-var reverse_default = reverse2;
-
-// node_modules/compromise/src/2-two/preTagger/model/models/index.js
-var fromPast = uncompress_default(data_default2.PastTense);
-var fromPresent = uncompress_default(data_default2.PresentTense);
-var fromGerund = uncompress_default(data_default2.Gerund);
-var fromParticiple = uncompress_default(data_default2.Participle);
-var toPast = reverse_default(fromPast);
-var toPresent = reverse_default(fromPresent);
-var toGerund = reverse_default(fromGerund);
-var toParticiple = reverse_default(fromParticiple);
-var toComparative = uncompress_default(data_default2.Comparative);
-var toSuperlative = uncompress_default(data_default2.Superlative);
-var fromComparative = reverse_default(toComparative);
-var fromSuperlative = reverse_default(toSuperlative);
-var models_default = {
-  fromPast,
-  fromPresent,
-  fromGerund,
-  fromParticiple,
-  toPast,
-  toPresent,
-  toGerund,
-  toParticiple,
-  toComparative,
-  toSuperlative,
-  fromComparative,
-  fromSuperlative
-};
-
-// node_modules/compromise/src/2-two/preTagger/model/regex/regex-normal.js
-var regex_normal_default = [
-  [/^[\w.]+@[\w.]+\.[a-z]{2,3}$/, "Email"],
-  [/^(https?:\/\/|www\.)+\w+\.[a-z]{2,3}/, "Url", "http.."],
-  [/^[a-z0-9./].+\.(com|net|gov|org|ly|edu|info|biz|dev|ru|jp|de|in|uk|br|io|ai)/, "Url", ".com"],
-  [/^[PMCE]ST$/, "Timezone", "EST"],
-  [/^ma?c'.*/, "LastName", "mc'neil"],
-  [/^o'[drlkn].*/, "LastName", "o'connor"],
-  [/^ma?cd[aeiou]/, "LastName", "mcdonald"],
-  [/^(lol)+[sz]$/, "Expression", "lol"],
-  [/^wo{2,}a*h?$/, "Expression", "wooah"],
-  [/^(hee?){2,}h?$/, "Expression", "hehe"],
-  [/^(un|de|re)\\-[a-z\u00C0-\u00FF]{2}/, "Verb", "un-vite"],
-  [/^(m|k|cm|km)\/(s|h|hr)$/, "Unit", "5 k/m"],
-  [/^(ug|ng|mg)\/(l|m3|ft3)$/, "Unit", "ug/L"]
-];
-
-// node_modules/compromise/src/2-two/preTagger/model/regex/regex-text.js
-var regex_text_default = [
-  [/^#[\p{Number}_]*\p{Letter}/u, "HashTag"],
-  [/^@\w{2,}$/, "AtMention"],
-  [/^([A-Z]\.){2}[A-Z]?/i, ["Acronym", "Noun"], "F.B.I"],
-  [/.{3}[lkmnp]in['‘’‛‵′`´]$/, "Gerund", "chillin'"],
-  [/.{4}s['‘’‛‵′`´]$/, "Possessive", "flanders'"],
-  [/^[\p{Emoji_Presentation}\p{Extended_Pictographic}]/u, "Emoji", "emoji-class"]
-];
-
-// node_modules/compromise/src/2-two/preTagger/model/regex/regex-numbers.js
-var regex_numbers_default = [
-  [/^@1?[0-9](am|pm)$/i, "Time", "3pm"],
-  [/^@1?[0-9]:[0-9]{2}(am|pm)?$/i, "Time", "3:30pm"],
-  [/^'[0-9]{2}$/, "Year"],
-  [/^[012]?[0-9](:[0-5][0-9])(:[0-5][0-9])$/, "Time", "3:12:31"],
-  [/^[012]?[0-9](:[0-5][0-9])?(:[0-5][0-9])? ?(am|pm)$/i, "Time", "1:12pm"],
-  [/^[012]?[0-9](:[0-5][0-9])(:[0-5][0-9])? ?(am|pm)?$/i, "Time", "1:12:31pm"],
-  [/^[0-9]{4}-[0-9]{2}-[0-9]{2}T[0-9]{2}:[0-9]{2}/i, "Date", "iso-date"],
-  [/^[0-9]{1,4}-[0-9]{1,2}-[0-9]{1,4}$/, "Date", "iso-dash"],
-  [/^[0-9]{1,4}\/[0-9]{1,2}\/([0-9]{4}|[0-9]{2})$/, "Date", "iso-slash"],
-  [/^[0-9]{1,4}\.[0-9]{1,2}\.[0-9]{1,4}$/, "Date", "iso-dot"],
-  [/^[0-9]{1,4}-[a-z]{2,9}-[0-9]{1,4}$/i, "Date", "12-dec-2019"],
-  [/^utc ?[+-]?[0-9]+$/, "Timezone", "utc-9"],
-  [/^(gmt|utc)[+-][0-9]{1,2}$/i, "Timezone", "gmt-3"],
-  [/^[0-9]{3}-[0-9]{4}$/, "PhoneNumber", "421-0029"],
-  [/^(\+?[0-9][ -])?[0-9]{3}[ -]?[0-9]{3}-[0-9]{4}$/, "PhoneNumber", "1-800-"],
-  [
-    /^[-+]?\p{Currency_Symbol}[-+]?[0-9]+(,[0-9]{3})*(\.[0-9]+)?([kmb]|bn)?\+?$/u,
-    ["Money", "Value"],
-    "$5.30"
-  ],
-  [
-    /^[-+]?[0-9]+(,[0-9]{3})*(\.[0-9]+)?\p{Currency_Symbol}\+?$/u,
-    ["Money", "Value"],
-    "5.30\xA3"
-  ],
-  [/^[-+]?[$£]?[0-9]([0-9,.])+(usd|eur|jpy|gbp|cad|aud|chf|cny|hkd|nzd|kr|rub)$/i, ["Money", "Value"], "$400usd"],
-  [/^[-+]?[0-9]+(,[0-9]{3})*(\.[0-9]+)?\+?$/, ["Cardinal", "NumericValue"], "5,999"],
-  [/^[-+]?[0-9]+(,[0-9]{3})*(\.[0-9]+)?(st|nd|rd|r?th)$/, ["Ordinal", "NumericValue"], "53rd"],
-  [/^\.[0-9]+\+?$/, ["Cardinal", "NumericValue"], ".73th"],
-  [/^[-+]?[0-9]+(,[0-9]{3})*(\.[0-9]+)?%\+?$/, ["Percent", "Cardinal", "NumericValue"], "-4%"],
-  [/^\.[0-9]+%$/, ["Percent", "Cardinal", "NumericValue"], ".3%"],
-  [/^[0-9]{1,4}\/[0-9]{1,4}(st|nd|rd|th)?s?$/, ["Fraction", "NumericValue"], "2/3rds"],
-  [/^[0-9.]{1,3}[a-z]{0,2}[-–—][0-9]{1,3}[a-z]{0,2}$/, ["Value", "NumberRange"], "3-4"],
-  [/^[0-9]{1,2}(:[0-9][0-9])?(am|pm)? ?[-–—] ?[0-9]{1,2}(:[0-9][0-9])?(am|pm)$/, ["Time", "NumberRange"], "3-4pm"],
-  [/^[0-9.]+([a-z°]{1,4})$/, "NumericValue", "9km"]
-];
-
-// node_modules/compromise/src/2-two/preTagger/model/orgWords.js
-var orgWords_default = [
-  "academy",
-  "administration",
-  "agence",
-  "agences",
-  "agencies",
-  "agency",
-  "airlines",
-  "airways",
-  "army",
-  "assoc",
-  "associates",
-  "association",
-  "assurance",
-  "authority",
-  "autorite",
-  "aviation",
-  "bank",
-  "banque",
-  "board",
-  "boys",
-  "brands",
-  "brewery",
-  "brotherhood",
-  "brothers",
-  "bureau",
-  "cafe",
-  "co",
-  "caisse",
-  "capital",
-  "care",
-  "cathedral",
-  "center",
-  "centre",
-  "chemicals",
-  "choir",
-  "chronicle",
-  "church",
-  "circus",
-  "clinic",
-  "clinique",
-  "club",
-  "co",
-  "coalition",
-  "coffee",
-  "collective",
-  "college",
-  "commission",
-  "committee",
-  "communications",
-  "community",
-  "company",
-  "comprehensive",
-  "computers",
-  "confederation",
-  "conference",
-  "conseil",
-  "consulting",
-  "containers",
-  "corporation",
-  "corps",
-  "corp",
-  "council",
-  "crew",
-  "data",
-  "departement",
-  "department",
-  "departments",
-  "design",
-  "development",
-  "directorate",
-  "division",
-  "drilling",
-  "education",
-  "eglise",
-  "electric",
-  "electricity",
-  "energy",
-  "ensemble",
-  "enterprise",
-  "enterprises",
-  "entertainment",
-  "estate",
-  "etat",
-  "faculty",
-  "federation",
-  "financial",
-  "fm",
-  "foundation",
-  "fund",
-  "gas",
-  "gazette",
-  "girls",
-  "government",
-  "group",
-  "guild",
-  "herald",
-  "holdings",
-  "hospital",
-  "hotel",
-  "hotels",
-  "inc",
-  "industries",
-  "institut",
-  "institute",
-  "institutes",
-  "insurance",
-  "international",
-  "interstate",
-  "investment",
-  "investments",
-  "investors",
-  "journal",
-  "laboratory",
-  "labs",
-  "llc",
-  "ltd",
-  "limited",
-  "machines",
-  "magazine",
-  "management",
-  "marine",
-  "marketing",
-  "markets",
-  "media",
-  "memorial",
-  "ministere",
-  "ministry",
-  "military",
-  "mobile",
-  "motor",
-  "motors",
-  "musee",
-  "museum",
-  "news",
-  "observatory",
-  "office",
-  "oil",
-  "optical",
-  "orchestra",
-  "organization",
-  "partners",
-  "partnership",
-  "petrol",
-  "petroleum",
-  "pharmacare",
-  "pharmaceutical",
-  "pharmaceuticals",
-  "pizza",
-  "plc",
-  "police",
-  "polytechnic",
-  "post",
-  "power",
-  "press",
-  "productions",
-  "quartet",
-  "radio",
-  "reserve",
-  "resources",
-  "restaurant",
-  "restaurants",
-  "savings",
-  "school",
-  "securities",
-  "service",
-  "services",
-  "societe",
-  "society",
-  "sons",
-  "subcommittee",
-  "syndicat",
-  "systems",
-  "telecommunications",
-  "telegraph",
-  "television",
-  "times",
-  "tribunal",
-  "tv",
-  "union",
-  "university",
-  "utilities",
-  "workers"
-].reduce((h2, str) => {
-  h2[str] = true;
-  return h2;
-}, {});
-
-// node_modules/compromise/src/2-two/preTagger/methods/transform/nouns/toSingular/_rules.js
-var rules_default2 = [
-  [/([^v])ies$/i, "$1y"],
-  [/(ise)s$/i, "$1"],
-  [/(kn|[^o]l|w)ives$/i, "$1ife"],
-  [/^((?:ca|e|ha|(?:our|them|your)?se|she|wo)l|lea|loa|shea|thie)ves$/i, "$1f"],
-  [/^(dwar|handkerchie|hoo|scar|whar)ves$/i, "$1f"],
-  [/(antenn|formul|nebul|vertebr|vit)ae$/i, "$1a"],
-  [/(octop|vir|radi|nucle|fung|cact|stimul)(i)$/i, "$1us"],
-  [/(buffal|tomat|tornad)(oes)$/i, "$1o"],
-  [/(ause)s$/i, "$1"],
-  [/(ease)s$/i, "$1"],
-  [/(ious)es$/i, "$1"],
-  [/(ouse)s$/i, "$1"],
-  [/(ose)s$/i, "$1"],
-  [/(..[aeiu]s)es$/i, "$1"],
-  [/(vert|ind|cort)(ices)$/i, "$1ex"],
-  [/(matr|append)(ices)$/i, "$1ix"],
-  [/([xo]|ch|ss|sh)es$/i, "$1"],
-  [/men$/i, "man"],
-  [/(n)ews$/i, "$1ews"],
-  [/([ti])a$/i, "$1um"],
-  [/([^aeiouy]|qu)ies$/i, "$1y"],
-  [/(s)eries$/i, "$1eries"],
-  [/(m)ovies$/i, "$1ovie"],
-  [/(cris|ax|test)es$/i, "$1is"],
-  [/(alias|status)es$/i, "$1"],
-  [/(ss)$/i, "$1"],
-  [/(ic)s$/i, "$1"],
-  [/s$/i, ""]
-];
-
-// node_modules/compromise/src/2-two/preTagger/methods/transform/nouns/toSingular/index.js
-var invertObj = function(obj) {
-  return Object.keys(obj).reduce((h2, k2) => {
-    h2[obj[k2]] = k2;
-    return h2;
-  }, {});
-};
-var toSingular = function(str, model5) {
-  const { irregularPlurals } = model5.two;
-  let invert = invertObj(irregularPlurals);
-  if (invert.hasOwnProperty(str)) {
-    return invert[str];
-  }
-  for (let i3 = 0; i3 < rules_default2.length; i3++) {
-    if (rules_default2[i3][0].test(str) === true) {
-      str = str.replace(rules_default2[i3][0], rules_default2[i3][1]);
-      return str;
-    }
-  }
-  return str;
-};
-var toSingular_default = toSingular;
-
-// node_modules/compromise/src/2-two/preTagger/methods/transform/nouns/index.js
-var all = function(str, model5) {
-  let arr = [str];
-  let p4 = toPlural_default(str, model5);
-  if (p4 !== str) {
-    arr.push(p4);
-  }
-  let s3 = toSingular_default(str, model5);
-  if (s3 !== str) {
-    arr.push(s3);
-  }
-  return arr;
-};
-var nouns_default2 = { toPlural: toPlural_default, toSingular: toSingular_default, all };
-
-// node_modules/compromise/src/2-two/preTagger/methods/transform/verbs/getTense/_guess.js
-var guessVerb = {
-  Gerund: ["ing"],
-  Actor: ["erer"],
-  Infinitive: [
-    "ate",
-    "ize",
-    "tion",
-    "rify",
-    "then",
-    "ress",
-    "ify",
-    "age",
-    "nce",
-    "ect",
-    "ise",
-    "ine",
-    "ish",
-    "ace",
-    "ash",
-    "ure",
-    "tch",
-    "end",
-    "ack",
-    "and",
-    "ute",
-    "ade",
-    "ock",
-    "ite",
-    "ase",
-    "ose",
-    "use",
-    "ive",
-    "int",
-    "nge",
-    "lay",
-    "est",
-    "ain",
-    "ant",
-    "ent",
-    "eed",
-    "er",
-    "le",
-    "unk",
-    "ung",
-    "upt",
-    "en"
-  ],
-  PastTense: ["ept", "ed", "lt", "nt", "ew", "ld"],
-  PresentTense: [
-    "rks",
-    "cks",
-    "nks",
-    "ngs",
-    "mps",
-    "tes",
-    "zes",
-    "ers",
-    "les",
-    "acks",
-    "ends",
-    "ands",
-    "ocks",
-    "lays",
-    "eads",
-    "lls",
-    "els",
-    "ils",
-    "ows",
-    "nds",
-    "ays",
-    "ams",
-    "ars",
-    "ops",
-    "ffs",
-    "als",
-    "urs",
-    "lds",
-    "ews",
-    "ips",
-    "es",
-    "ts",
-    "ns"
-  ],
-  Participle: ["ken", "wn"]
-};
-guessVerb = Object.keys(guessVerb).reduce((h2, k2) => {
-  guessVerb[k2].forEach((a2) => h2[a2] = k2);
-  return h2;
-}, {});
-var guess_default = guessVerb;
-
-// node_modules/compromise/src/2-two/preTagger/methods/transform/verbs/getTense/index.js
-var getTense = function(str) {
-  let three = str.substring(str.length - 3);
-  if (guess_default.hasOwnProperty(three) === true) {
-    return guess_default[three];
-  }
-  let two = str.substring(str.length - 2);
-  if (guess_default.hasOwnProperty(two) === true) {
-    return guess_default[two];
-  }
-  let one = str.substring(str.length - 1);
-  if (one === "s") {
-    return "PresentTense";
-  }
-  return null;
-};
-var getTense_default = getTense;
-
-// node_modules/compromise/src/2-two/preTagger/methods/transform/verbs/toInfinitive/index.js
-var toParts = function(str, model5) {
-  let prefix6 = "";
-  let prefixes2 = {};
-  if (model5.one && model5.one.prefixes) {
-    prefixes2 = model5.one.prefixes;
-  }
-  let [verb, particle] = str.split(/ /);
-  if (particle && prefixes2[verb] === true) {
-    prefix6 = verb;
-    verb = particle;
-    particle = "";
-  }
-  return {
-    prefix: prefix6,
-    verb,
-    particle
-  };
-};
-var copulaMap = {
-  are: "be",
-  were: "be",
-  been: "be",
-  is: "be",
-  am: "be",
-  was: "be",
-  be: "be",
-  being: "be"
-};
-var toInfinitive = function(str, model5, tense) {
-  const { fromPast: fromPast2, fromPresent: fromPresent2, fromGerund: fromGerund2, fromParticiple: fromParticiple2 } = model5.two.models;
-  let { prefix: prefix6, verb, particle } = toParts(str, model5);
-  let inf = "";
-  if (!tense) {
-    tense = getTense_default(str);
-  }
-  if (copulaMap.hasOwnProperty(str)) {
-    inf = copulaMap[str];
-  } else if (tense === "Participle") {
-    inf = convert_default(verb, fromParticiple2);
-  } else if (tense === "PastTense") {
-    inf = convert_default(verb, fromPast2);
-  } else if (tense === "PresentTense") {
-    inf = convert_default(verb, fromPresent2);
-  } else if (tense === "Gerund") {
-    inf = convert_default(verb, fromGerund2);
-  } else {
-    return str;
-  }
-  if (particle) {
-    inf += " " + particle;
-  }
-  if (prefix6) {
-    inf = prefix6 + " " + inf;
-  }
-  return inf;
-};
-var toInfinitive_default = toInfinitive;
-
-// node_modules/compromise/src/2-two/preTagger/methods/transform/verbs/conjugate/index.js
-var parse3 = (inf) => {
-  if (/ /.test(inf)) {
-    return inf.split(/ /);
-  }
-  return [inf, ""];
-};
-var conjugate = function(inf, model5) {
-  const { toPast: toPast4, toPresent: toPresent4, toGerund: toGerund4, toParticiple: toParticiple2 } = model5.two.models;
-  if (inf === "be") {
-    return {
-      Infinitive: inf,
-      Gerund: "being",
-      PastTense: "was",
-      PresentTense: "is"
-    };
-  }
-  let [str, particle] = parse3(inf);
-  let found = {
-    Infinitive: inf,
-    PastTense: convert_default(str, toPast4),
-    PresentTense: convert_default(str, toPresent4),
-    Gerund: convert_default(str, toGerund4),
-    FutureTense: "will " + inf
-  };
-  let pastPrt = convert_default(str, toParticiple2);
-  if (pastPrt !== inf && pastPrt !== found.PastTense) {
-    found.Participle = pastPrt;
-  }
-  if (particle) {
-    Object.keys(found).forEach((k2) => {
-      found[k2] += " " + particle;
-    });
-  }
-  return found;
-};
-var conjugate_default = conjugate;
-
-// node_modules/compromise/src/2-two/preTagger/methods/transform/verbs/index.js
-var all2 = function(str, model5) {
-  let res = conjugate_default(str, model5);
-  delete res.FutureTense;
-  return Object.values(res).filter((s3) => s3);
-};
-var verbs_default = {
-  toInfinitive: toInfinitive_default,
-  conjugate: conjugate_default,
-  all: all2
-};
-
-// node_modules/compromise/src/2-two/preTagger/methods/transform/adjectives/inflect.js
-var toSuperlative2 = function(adj, model5) {
-  const mod = model5.two.models.toSuperlative;
-  return convert_default(adj, mod);
-};
-var toComparative2 = function(adj, model5) {
-  const mod = model5.two.models.toComparative;
-  return convert_default(adj, mod);
-};
-var fromComparative2 = function(adj, model5) {
-  const mod = model5.two.models.fromComparative;
-  return convert_default(adj, mod);
-};
-var fromSuperlative2 = function(adj, model5) {
-  const mod = model5.two.models.fromSuperlative;
-  return convert_default(adj, mod);
-};
-
-// node_modules/compromise/src/2-two/preTagger/methods/transform/adjectives/adverbs/lib.js
-var suffixLoop = function(str = "", suffixes6 = []) {
-  const len = str.length;
-  let max3 = len <= 6 ? len - 1 : 6;
-  for (let i3 = max3; i3 >= 1; i3 -= 1) {
-    let suffix = str.substring(len - i3, str.length);
-    if (suffixes6[suffix.length].hasOwnProperty(suffix) === true) {
-      let pre = str.slice(0, len - i3);
-      let post = suffixes6[suffix.length][suffix];
-      return pre + post;
-    }
-  }
-  return null;
-};
-var lib_default6 = suffixLoop;
-
-// node_modules/compromise/src/2-two/preTagger/methods/transform/adjectives/adverbs/toAdjective.js
-var s2 = "ically";
-var ical = /* @__PURE__ */ new Set([
-  "analyt" + s2,
-  "chem" + s2,
-  "class" + s2,
-  "clin" + s2,
-  "crit" + s2,
-  "ecolog" + s2,
-  "electr" + s2,
-  "empir" + s2,
-  "frant" + s2,
-  "grammat" + s2,
-  "ident" + s2,
-  "ideolog" + s2,
-  "log" + s2,
-  "mag" + s2,
-  "mathemat" + s2,
-  "mechan" + s2,
-  "med" + s2,
-  "method" + s2,
-  "method" + s2,
-  "mus" + s2,
-  "phys" + s2,
-  "phys" + s2,
-  "polit" + s2,
-  "pract" + s2,
-  "rad" + s2,
-  "satir" + s2,
-  "statist" + s2,
-  "techn" + s2,
-  "technolog" + s2,
-  "theoret" + s2,
-  "typ" + s2,
-  "vert" + s2,
-  "whims" + s2
-]);
-var suffixes2 = [
-  null,
-  {},
-  { "ly": "" },
-  {
-    "ily": "y",
-    "bly": "ble",
-    "ply": "ple"
-  },
-  {
-    "ally": "al",
-    "rply": "rp"
-  },
-  {
-    "ually": "ual",
-    "ially": "ial",
-    "cally": "cal",
-    "eally": "eal",
-    "rally": "ral",
-    "nally": "nal",
-    "mally": "mal",
-    "eeply": "eep",
-    "eaply": "eap"
-  },
-  {
-    ically: "ic"
-  }
-];
-var noAdj = /* @__PURE__ */ new Set([
-  "early",
-  "only",
-  "hourly",
-  "daily",
-  "weekly",
-  "monthly",
-  "yearly",
-  "mostly",
-  "duly",
-  "unduly",
-  "especially",
-  "undoubtedly",
-  "conversely",
-  "namely",
-  "exceedingly",
-  "presumably",
-  "accordingly",
-  "overly",
-  "best",
-  "latter",
-  "little",
-  "long",
-  "low"
-]);
-var exceptions = {
-  wholly: "whole",
-  fully: "full",
-  truly: "true",
-  gently: "gentle",
-  singly: "single",
-  customarily: "customary",
-  idly: "idle",
-  publically: "public",
-  quickly: "fast",
-  well: "good"
-};
-var toAdjective = function(str) {
-  if (!str.endsWith("ly")) {
-    return null;
-  }
-  if (ical.has(str)) {
-    return str.replace(/ically/, "ical");
-  }
-  if (noAdj.has(str)) {
-    return null;
-  }
-  if (exceptions.hasOwnProperty(str)) {
-    return exceptions[str];
-  }
-  return lib_default6(str, suffixes2) || str;
-};
-var toAdjective_default = toAdjective;
-
-// node_modules/compromise/src/2-two/preTagger/methods/transform/adjectives/adverbs/toAdverb.js
-var suffixes3 = [
-  null,
-  {
-    y: "ily"
-  },
-  {
-    ly: "ly",
-    ic: "ically"
-  },
-  {
-    ial: "ially",
-    ual: "ually",
-    tle: "tly",
-    ble: "bly",
-    ple: "ply",
-    ary: "arily"
-  },
-  {},
-  {},
-  {}
-];
-var exceptions2 = {
-  cool: "cooly",
-  whole: "wholly",
-  full: "fully",
-  good: "well",
-  idle: "idly",
-  public: "publicly",
-  single: "singly",
-  special: "especially"
-};
-var toAdverb = function(str) {
-  if (exceptions2.hasOwnProperty(str)) {
-    return exceptions2[str];
-  }
-  let res = lib_default6(str, suffixes3);
-  if (res) {
-    return res;
-  }
-  return str + "ly";
-};
-var toAdverb_default = toAdverb;
-
-// node_modules/compromise/src/2-two/preTagger/methods/transform/adjectives/adverbs/toNoun.js
-var suffixes4 = [
-  null,
-  {
-    "y": "iness"
-  },
-  {
-    "le": "ility",
-    "al": "ality",
-    "ay": "ayness"
-  },
-  {
-    "ial": "y",
-    "ing": "ment",
-    "ess": "essness",
-    "ous": "ousness",
-    "ive": "ivity",
-    "ect": "ection"
-  },
-  {
-    "ting": "ting",
-    "ring": "ring",
-    "cial": "ciality",
-    "nate": "nation",
-    "rate": "ration",
-    "bing": "bingness",
-    "atic": "acy",
-    "sing": "se",
-    "iful": "y",
-    "ible": "ibility"
-  },
-  {
-    "erate": "eration"
-  },
-  {
-    "ionate": "ion"
-  }
-];
-var exceptions3 = {
-  clean: "cleanliness",
-  naive: "naivety",
-  dramatic: "drama",
-  ironic: "irony",
-  deep: "depth",
-  automatic: "automation",
-  simple: "simplicity",
-  boring: "boredom",
-  free: "freedom",
-  wise: "wisdom",
-  fortunate: "fortune",
-  gentle: "gentleness",
-  quiet: "quiet",
-  expensive: "expense",
-  offensive: "offence"
-};
-var dontDo = /* @__PURE__ */ new Set([
-  "terrible",
-  "annoying"
-]);
-var toNoun = function(str) {
-  if (exceptions3.hasOwnProperty(str)) {
-    return exceptions3[str];
-  }
-  if (dontDo.has(str)) {
-    return null;
-  }
-  let res = lib_default6(str, suffixes4);
-  if (res) {
-    return res;
-  }
-  return str + "ness";
-};
-var toNoun_default = toNoun;
-
-// node_modules/compromise/src/2-two/preTagger/methods/transform/adjectives/index.js
-var all3 = function(str, model5) {
-  let arr = [str];
-  arr.push(toSuperlative2(str, model5));
-  arr.push(toComparative2(str, model5));
-  arr.push(toAdverb_default(str));
-  arr = arr.filter((s3) => s3);
-  arr = new Set(arr);
-  return Array.from(arr);
-};
-var adjectives_default = {
-  toSuperlative: toSuperlative2,
-  toComparative: toComparative2,
-  toAdverb: toAdverb_default,
-  toNoun: toNoun_default,
-  fromAdverb: toAdjective_default,
-  fromSuperlative: fromSuperlative2,
-  fromComparative: fromComparative2,
-  all: all3
-};
-
-// node_modules/compromise/src/2-two/preTagger/methods/transform/index.js
-var transform_default = {
-  noun: nouns_default2,
-  verb: verbs_default,
-  adjective: adjectives_default
-};
-
-// node_modules/compromise/src/2-two/preTagger/methods/expand/byTag.js
-var byTag_default = {
-  Singular: (word, lex, methods16, model5) => {
-    let already = model5.one.lexicon;
-    let plural2 = methods16.two.transform.noun.toPlural(word, model5);
-    if (!already[plural2]) {
-      lex[plural2] = lex[plural2] || "Plural";
-    }
-  },
-  Actor: (word, lex, methods16, model5) => {
-    let already = model5.one.lexicon;
-    let plural2 = methods16.two.transform.noun.toPlural(word, model5);
-    if (!already[plural2]) {
-      lex[plural2] = lex[plural2] || ["Plural", "Actor"];
-    }
-  },
-  Comparable: (word, lex, methods16, model5) => {
-    let already = model5.one.lexicon;
-    let { toSuperlative: toSuperlative3, toComparative: toComparative3 } = methods16.two.transform.adjective;
-    let sup = toSuperlative3(word, model5);
-    if (!already[sup]) {
-      lex[sup] = lex[sup] || "Superlative";
-    }
-    let comp = toComparative3(word, model5);
-    if (!already[comp]) {
-      lex[comp] = lex[comp] || "Comparative";
-    }
-    lex[word] = "Adjective";
-  },
-  Demonym: (word, lex, methods16, model5) => {
-    let plural2 = methods16.two.transform.noun.toPlural(word, model5);
-    lex[plural2] = lex[plural2] || ["Demonym", "Plural"];
-  },
-  Infinitive: (word, lex, methods16, model5) => {
-    let already = model5.one.lexicon;
-    let all4 = methods16.two.transform.verb.conjugate(word, model5);
-    Object.entries(all4).forEach((a2) => {
-      if (!already[a2[1]] && !lex[a2[1]]) {
-        lex[a2[1]] = a2[0];
-      }
-    });
-  },
-  PhrasalVerb: (word, lex, methods16, model5) => {
-    let already = model5.one.lexicon;
-    lex[word] = ["PhrasalVerb", "Infinitive"];
-    let _multi = model5.one._multiCache;
-    let [inf, rest] = word.split(" ");
-    if (!already[inf]) {
-      lex[inf] = lex[inf] || "Infinitive";
-    }
-    let all4 = methods16.two.transform.verb.conjugate(inf, model5);
-    delete all4.FutureTense;
-    Object.entries(all4).forEach((a2) => {
-      if (a2[0] === "Actor" || a2[1] === "") {
-        return;
-      }
-      if (!lex[a2[1]] && !already[a2[1]]) {
-        lex[a2[1]] = a2[0];
-      }
-      _multi[a2[1]] = true;
-      let str = a2[1] + " " + rest;
-      lex[str] = lex[str] || [a2[0], "PhrasalVerb"];
-    });
-  },
-  Multiple: (word, lex) => {
-    lex[word] = ["Multiple", "Cardinal"];
-    lex[word + "th"] = ["Multiple", "Ordinal"];
-    lex[word + "ths"] = ["Multiple", "Fraction"];
-  },
-  Cardinal: (word, lex) => {
-    lex[word] = ["TextValue", "Cardinal"];
-  },
-  Ordinal: (word, lex) => {
-    lex[word] = ["TextValue", "Ordinal"];
-    lex[word + "s"] = ["TextValue", "Fraction"];
-  }
-};
-
-// node_modules/compromise/src/2-two/preTagger/methods/expand/index.js
-var expand4 = function(words, world2) {
-  const { methods: methods16, model: model5 } = world2;
-  let lex = {};
-  let _multi = {};
-  Object.keys(words).forEach((word) => {
-    let tag = words[word];
-    word = word.toLowerCase().trim();
-    word = word.replace(/'s\b/, "");
-    let split3 = word.split(/ /);
-    if (split3.length > 1) {
-      _multi[split3[0]] = true;
-    }
-    if (byTag_default.hasOwnProperty(tag) === true) {
-      byTag_default[tag](word, lex, methods16, model5);
-    }
-    lex[word] = lex[word] || tag;
-  });
-  delete lex[""];
-  delete lex[null];
-  delete lex[" "];
-  return { lex, _multi };
-};
-var expand_default2 = expand4;
-
-// node_modules/compromise/src/2-two/preTagger/methods/quickSplit.js
-var splitOn = function(terms, i3) {
-  const isNum = /^[0-9]+$/;
-  let term = terms[i3];
-  if (!term) {
-    return false;
-  }
-  const maybeDate = /* @__PURE__ */ new Set(["may", "april", "august", "jan"]);
-  if (term.normal === "like" || maybeDate.has(term.normal)) {
-    return false;
-  }
-  if (term.tags.has("Place") || term.tags.has("Date")) {
-    return false;
-  }
-  if (terms[i3 - 1]) {
-    let lastTerm = terms[i3 - 1];
-    if (lastTerm.tags.has("Date") || maybeDate.has(lastTerm.normal)) {
-      return false;
-    }
-    if (lastTerm.tags.has("Adjective") || term.tags.has("Adjective")) {
-      return false;
-    }
-  }
-  let str = term.normal;
-  if (str.length === 1 || str.length === 2 || str.length === 4) {
-    if (isNum.test(str)) {
-      return false;
-    }
-  }
-  return true;
-};
-var quickSplit = function(document2) {
-  const splitHere = /[,:;]/;
-  let arr = [];
-  document2.forEach((terms) => {
-    let start2 = 0;
-    terms.forEach((term, i3) => {
-      if (splitHere.test(term.post) && splitOn(terms, i3 + 1)) {
-        arr.push(terms.slice(start2, i3 + 1));
-        start2 = i3 + 1;
-      }
-    });
-    if (start2 < terms.length) {
-      arr.push(terms.slice(start2, terms.length));
-    }
-  });
-  return arr;
-};
-var quickSplit_default = quickSplit;
-
-// node_modules/compromise/src/2-two/preTagger/methods/looksPlural.js
-var isPlural = {
-  e: [
-    "mice",
-    "louse",
-    "antennae",
-    "formulae",
-    "nebulae",
-    "vertebrae",
-    "vitae"
-  ],
-  i: [
-    "tia",
-    "octopi",
-    "viri",
-    "radii",
-    "nuclei",
-    "fungi",
-    "cacti",
-    "stimuli"
-  ],
-  n: [
-    "men"
-  ],
-  t: [
-    "feet"
-  ]
-};
-var exceptions4 = /* @__PURE__ */ new Set([
-  "formulas",
-  "koalas",
-  "israelis",
-  "menus"
-]);
-var notPlural = [
-  "bus",
-  "mas",
-  "was",
-  "las",
-  "ias",
-  "xas",
-  "vas",
-  "cis",
-  "lis",
-  "nis",
-  "ois",
-  "ris",
-  "sis",
-  "tis",
-  "xis",
-  "aus",
-  "cus",
-  "eus",
-  "fus",
-  "gus",
-  "ius",
-  "lus",
-  "nus",
-  "ous",
-  "pus",
-  "rus",
-  "sus",
-  "tus",
-  "xus",
-  "'s",
-  "ss"
-];
-var looksPlural = function(str) {
-  if (!str || str.length <= 3) {
-    return false;
-  }
-  if (exceptions4.has(str)) {
-    return true;
-  }
-  let end2 = str[str.length - 1];
-  if (isPlural.hasOwnProperty(end2)) {
-    return isPlural[end2].find((suff) => str.endsWith(suff));
-  }
-  if (end2 !== "s") {
-    return false;
-  }
-  if (notPlural.find((suff) => str.endsWith(suff))) {
-    return false;
-  }
-  return true;
-};
-var looksPlural_default = looksPlural;
-
-// node_modules/compromise/src/2-two/preTagger/methods/index.js
-var methods_default9 = {
-  two: {
-    quickSplit: quickSplit_default,
-    expandLexicon: expand_default2,
-    transform: transform_default,
-    looksPlural: looksPlural_default
-  }
-};
-
-// node_modules/compromise/src/2-two/preTagger/model/_expand/irregulars.js
-var expandIrregulars = function(model5) {
-  const { irregularPlurals } = model5.two;
-  const { lexicon: lexicon4 } = model5.one;
-  Object.entries(irregularPlurals).forEach((a2) => {
-    lexicon4[a2[0]] = lexicon4[a2[0]] || "Singular";
-    lexicon4[a2[1]] = lexicon4[a2[1]] || "Plural";
-  });
-  return model5;
-};
-var irregulars_default = expandIrregulars;
-
-// node_modules/compromise/src/2-two/preTagger/model/_expand/models.js
-var getWords = function(model5, left, right) {
-  return Object.entries(model5.exceptions).reduce((h2, a2) => {
-    if (left) {
-      h2[a2[0]] = left;
-    }
-    h2[a2[1]] = right;
-    return h2;
-  }, {});
-};
-var expandModels = function(model5) {
-  let { lexicon: lexicon4 } = model5.one;
-  const { toPast: toPast4, toPresent: toPresent4, toGerund: toGerund4, toSuperlative: toSuperlative3, toComparative: toComparative3 } = model5.two.models;
-  let res = {};
-  let words = {};
-  words = getWords(toPast4, "Infinitive", "PastTense");
-  Object.assign(res, words);
-  words = getWords(toPresent4, "Infinitive", "Verb");
-  Object.assign(res, words);
-  words = getWords(toGerund4, "Infinitive", "Gerund");
-  Object.assign(res, words);
-  words = getWords(toSuperlative3, "Adjective", "Superlative");
-  Object.assign(res, words);
-  words = getWords(toComparative3, "Adjective", "Comparative");
-  Object.assign(res, words);
-  model5.one.lexicon = Object.assign(res, lexicon4);
-  return model5;
-};
-var models_default2 = expandModels;
-
-// node_modules/compromise/src/2-two/preTagger/model/_expand/index.js
-var tmpModel2 = {
-  two: { models: models_default }
-};
-var switchDefaults = {
-  "Adj|Gerund": "Adjective",
-  "Adj|Noun": "Adjective",
-  "Adj|Past": "Adjective",
-  "Adj|Present": "Adjective",
-  "Noun|Verb": "Singular",
-  "Noun|Gerund": "Gerund",
-  "Person|Noun": "Noun",
-  "Person|Date": "Month",
-  "Person|Verb": "FirstName",
-  "Person|Place": "Person",
-  "Plural|Verb": "Plural",
-  "Unit|Noun": "Noun"
-};
-var expandLexicon = function(words, model5) {
-  const world2 = { model: model5, methods: methods_default9 };
-  let { lex, _multi } = methods_default9.two.expandLexicon(words, world2);
-  Object.assign(model5.one.lexicon, lex);
-  Object.assign(model5.one._multiCache, _multi);
-  return model5;
-};
-var addUncountables = function(words, model5) {
-  Object.keys(words).forEach((k2) => {
-    if (words[k2] === "Uncountable") {
-      model5.two.uncountable[k2] = true;
-      words[k2] = "Uncountable";
-    }
-  });
-  return model5;
-};
-var expandVerb = function(str, words, doPresent) {
-  let obj = conjugate_default(str, tmpModel2);
-  words[obj.PastTense] = words[obj.PastTense] || "PastTense";
-  words[obj.Gerund] = words[obj.Gerund] || "Gerund";
-  if (doPresent === true) {
-    words[obj.PresentTense] = words[obj.PresentTense] || "PresentTense";
-  }
-};
-var expandAdjective = function(str, words, model5) {
-  let sup = toSuperlative2(str, model5);
-  words[sup] = words[sup] || "Superlative";
-  let comp = toComparative2(str, model5);
-  words[comp] = words[comp] || "Comparative";
-};
-var expandNoun = function(str, words, model5) {
-  let plur = toPlural_default(str, model5);
-  words[plur] = words[plur] || "Plural";
-};
-var expandVariable = function(switchWords, model5) {
-  let words = {};
-  const lex = model5.one.lexicon;
-  Object.keys(switchWords).forEach((w) => {
-    const name = switchWords[w];
-    words[w] = switchDefaults[name];
-    if (name === "Noun|Verb" || name === "Person|Verb") {
-      expandVerb(w, lex, false);
-    }
-    if (name === "Adj|Present") {
-      expandVerb(w, lex, true);
-      expandAdjective(w, lex, model5);
-    }
-    if (name === "Adj|Gerund" || name === "Noun|Gerund") {
-      let inf = toInfinitive_default(w, tmpModel2, "Gerund");
-      if (!lex[inf]) {
-        words[inf] = "Infinitive";
-      }
-    }
-    if (name === "Noun|Gerund" || name === "Adj|Noun" || name === "Person|Noun") {
-      expandNoun(w, lex, model5);
-    }
-    if (name === "Adj|Past") {
-      let inf = toInfinitive_default(w, tmpModel2, "PastTense");
-      if (!lex[inf]) {
-        words[inf] = "Infinitive";
-      }
-    }
-  });
-  model5 = expandLexicon(words, model5);
-  return model5;
-};
-var expand5 = function(model5) {
-  model5 = expandLexicon(model5.one.lexicon, model5);
-  model5 = addUncountables(model5.one.lexicon, model5);
-  model5 = expandVariable(model5.two.switches, model5);
-  model5 = models_default2(model5);
-  model5 = irregulars_default(model5);
-  return model5;
-};
-var expand_default3 = expand5;
-
-// node_modules/compromise/src/2-two/preTagger/model/index.js
-var model4 = {
-  one: {
-    _multiCache: {},
-    lexicon: lexicon3
-  },
-  two: {
-    irregularPlurals: plurals_default,
-    models: models_default,
-    suffixPatterns: suffixes_default2,
-    prefixPatterns: prefixes_default2,
-    endsWith: endsWith_default,
-    neighbours: neighbours_default,
-    regexNormal: regex_normal_default,
-    regexText: regex_text_default,
-    regexNumbers: regex_numbers_default,
-    switches,
-    clues: clues_default,
-    uncountable: {},
-    orgWords: orgWords_default
-  }
-};
-model4 = expand_default3(model4);
-var model_default3 = model4;
-
-// node_modules/compromise/src/2-two/preTagger/compute/tagger/1st-pass/01-colons.js
-var byPunctuation = function(terms, i3, model5, world2) {
-  const setTag3 = world2.methods.one.setTag;
-  if (i3 === 0 && terms.length >= 3) {
-    const hasColon = /:/;
-    let post = terms[0].post;
-    if (post.match(hasColon)) {
-      let nextTerm = terms[1];
-      if (nextTerm.tags.has("Value") || nextTerm.tags.has("Email") || nextTerm.tags.has("PhoneNumber")) {
-        return;
-      }
-      setTag3([terms[0]], "Expression", world2, null, `2-punct-colon''`);
-    }
-  }
-};
-var colons_default = byPunctuation;
-
-// node_modules/compromise/src/2-two/preTagger/compute/tagger/1st-pass/02-hyphens.js
-var byHyphen = function(terms, i3, model5, world2) {
-  const setTag3 = world2.methods.one.setTag;
-  if (terms[i3].post === "-" && terms[i3 + 1]) {
-    setTag3([terms[i3], terms[i3 + 1]], "Hyphenated", world2, null, `1-punct-hyphen''`);
-  }
-};
-var hyphens_default = byHyphen;
-
-// node_modules/compromise/src/2-two/preTagger/compute/tagger/2nd-pass/00-tagSwitch.js
-var prefix4 = /^(under|over|mis|re|un|dis|semi)-?/;
-var tagSwitch = function(terms, i3, model5) {
-  const switches2 = model5.two.switches;
-  let term = terms[i3];
-  if (switches2.hasOwnProperty(term.normal)) {
-    term.switch = switches2[term.normal];
-    return;
-  }
-  if (prefix4.test(term.normal)) {
-    let stem = term.normal.replace(prefix4, "");
-    if (stem.length > 3 && switches2.hasOwnProperty(stem)) {
-      term.switch = switches2[stem];
-    }
-  }
-};
-var tagSwitch_default = tagSwitch;
-
-// node_modules/compromise/src/2-two/preTagger/compute/tagger/_fastTag.js
-var log2 = (term, tag, reason = "") => {
-  const yellow = (str) => "\x1B[33m\x1B[3m" + str + "\x1B[0m";
-  const i3 = (str) => "\x1B[3m" + str + "\x1B[0m";
-  let word = term.text || "[" + term.implicit + "]";
-  if (typeof tag !== "string" && tag.length > 2) {
-    tag = tag.slice(0, 2).join(", #") + " +";
-  }
-  tag = typeof tag !== "string" ? tag.join(", #") : tag;
-  console.log(` ${yellow(word).padEnd(24)} \x1B[32m\u2192\x1B[0m #${tag.padEnd(22)}  ${i3(reason)}`);
-};
-var setTag2 = function(term, tag, reason) {
-  if (!tag || tag.length === 0) {
-    return;
-  }
-  const env2 = typeof process === "undefined" || !process.env ? self.env || {} : process.env;
-  if (env2 && env2.DEBUG_TAGS) {
-    log2(term, tag, reason);
-  }
-  term.tags = term.tags || /* @__PURE__ */ new Set();
-  if (typeof tag === "string") {
-    term.tags.add(tag);
-  } else {
-    tag.forEach((tg) => term.tags.add(tg));
-  }
-};
-var fastTag_default = setTag2;
-
-// node_modules/compromise/src/2-two/preTagger/compute/tagger/3rd-pass/_fillTags.js
-var uncountable = [
-  "Acronym",
-  "Abbreviation",
-  "ProperNoun",
-  "Uncountable",
-  "Possessive",
-  "Pronoun",
-  "Activity",
-  "Honorific"
-];
-var setPluralSingular = function(term) {
-  if (!term.tags.has("Noun") || term.tags.has("Plural") || term.tags.has("Singular") || term.tags.has("Date")) {
-    return;
-  }
-  if (uncountable.find((tag) => term.tags.has(tag))) {
-    return;
-  }
-  if (looksPlural_default(term.normal)) {
-    fastTag_default(term, "Plural", "3-plural-guess");
-  } else {
-    fastTag_default(term, "Singular", "3-singular-guess");
-  }
-};
-var setTense = function(term) {
-  let tags = term.tags;
-  if (tags.has("Verb") && tags.size === 1) {
-    let guess = getTense_default(term.normal);
-    if (guess) {
-      fastTag_default(term, guess, "3-verb-tense-guess");
-    }
-  }
-};
-var fillTags = function(terms, i3, model5) {
-  let term = terms[i3];
-  let tags = Array.from(term.tags);
-  for (let k2 = 0; k2 < tags.length; k2 += 1) {
-    if (model5.one.tagSet[tags[k2]]) {
-      let toAdd = model5.one.tagSet[tags[k2]].parents;
-      fastTag_default(term, toAdd, ` -inferred by #${tags[k2]}`);
-    }
-  }
-  setPluralSingular(term);
-  setTense(term, model5);
-};
-var fillTags_default = fillTags;
-
-// node_modules/compromise/src/2-two/preTagger/compute/tagger/2nd-pass/01-case.js
-var titleCase3 = /^\p{Lu}[\p{Ll}'’]/u;
-var hasNumber = /[0-9]/;
-var notProper = ["Date", "Month", "WeekDay", "Unit", "Expression"];
-var hasIVX = /[IVX]/;
-var romanNumeral = /^[IVXLCDM]{2,}$/;
-var romanNumValid = /^M{0,4}(CM|CD|D?C{0,3})(XC|XL|L?X{0,3})(IX|IV|V?I{0,3})$/;
-var nope = {
-  li: true,
-  dc: true,
-  md: true,
-  dm: true,
-  ml: true
-};
-var checkCase = function(terms, i3, model5) {
-  let term = terms[i3];
-  term.index = term.index || [0, 0];
-  let index3 = term.index[1];
-  let str = term.text || "";
-  if (index3 !== 0 && titleCase3.test(str) === true && hasNumber.test(str) === false) {
-    if (notProper.find((tag) => term.tags.has(tag))) {
-      return null;
-    }
-    if (term.pre.match(/["']$/)) {
-      return null;
-    }
-    fillTags_default(terms, i3, model5);
-    if (!term.tags.has("Noun")) {
-      term.tags.clear();
-    }
-    fastTag_default(term, "ProperNoun", "2-titlecase");
-    return true;
-  }
-  if (str.length >= 2 && romanNumeral.test(str) && hasIVX.test(str) && romanNumValid.test(str) && !nope[term.normal]) {
-    fastTag_default(term, "RomanNumeral", "2-xvii");
-    return true;
-  }
-  return null;
-};
-var case_default2 = checkCase;
-
-// node_modules/compromise/src/2-two/preTagger/compute/tagger/2nd-pass/02-suffix.js
-var suffixLoop2 = function(str = "", suffixes6 = []) {
-  const len = str.length;
-  let max3 = 7;
-  if (len <= max3) {
-    max3 = len - 1;
-  }
-  for (let i3 = max3; i3 > 1; i3 -= 1) {
-    let suffix = str.substring(len - i3, len);
-    if (suffixes6[suffix.length].hasOwnProperty(suffix) === true) {
-      let tag = suffixes6[suffix.length][suffix];
-      return tag;
-    }
-  }
-  return null;
-};
-var tagBySuffix = function(terms, i3, model5) {
-  let term = terms[i3];
-  if (term.tags.size === 0) {
-    let tag = suffixLoop2(term.normal, model5.two.suffixPatterns);
-    if (tag !== null) {
-      fastTag_default(term, tag, "2-suffix");
-      term.confidence = 0.7;
-      return true;
-    }
-    if (term.implicit) {
-      tag = suffixLoop2(term.implicit, model5.two.suffixPatterns);
-      if (tag !== null) {
-        fastTag_default(term, tag, "2-implicit-suffix");
-        term.confidence = 0.7;
-        return true;
-      }
-    }
-  }
-  return null;
-};
-var suffix_default = tagBySuffix;
-
-// node_modules/compromise/src/2-two/preTagger/compute/tagger/2nd-pass/03-regex.js
-var hasApostrophe = /['‘’‛‵′`´]/;
-var doRegs = function(str, regs) {
-  for (let i3 = 0; i3 < regs.length; i3 += 1) {
-    if (regs[i3][0].test(str) === true) {
-      return regs[i3];
-    }
-  }
-  return null;
-};
-var doEndsWith = function(str = "", byEnd3) {
-  let char = str[str.length - 1];
-  if (byEnd3.hasOwnProperty(char) === true) {
-    let regs = byEnd3[char] || [];
-    for (let r2 = 0; r2 < regs.length; r2 += 1) {
-      if (regs[r2][0].test(str) === true) {
-        return regs[r2];
-      }
-    }
-  }
-  return null;
-};
-var checkRegex = function(terms, i3, model5, world2) {
-  const setTag3 = world2.methods.one.setTag;
-  let { regexText, regexNormal, regexNumbers, endsWith } = model5.two;
-  let term = terms[i3];
-  let normal = term.machine || term.normal;
-  let text = term.text;
-  if (hasApostrophe.test(term.post) && !hasApostrophe.test(term.pre)) {
-    text += term.post.trim();
-  }
-  let arr = doRegs(text, regexText) || doRegs(normal, regexNormal);
-  if (!arr && /[0-9]/.test(normal)) {
-    arr = doRegs(normal, regexNumbers);
-  }
-  if (!arr && term.tags.size === 0) {
-    arr = doEndsWith(normal, endsWith);
-  }
-  if (arr) {
-    setTag3([term], arr[1], world2, null, `2-regex-'${arr[2] || arr[0]}'`);
-    term.confidence = 0.6;
-    return true;
-  }
-  return null;
-};
-var regex_default = checkRegex;
-
-// node_modules/compromise/src/2-two/preTagger/compute/tagger/2nd-pass/04-prefix.js
-var prefixLoop = function(str = "", prefixes2 = []) {
-  const len = str.length;
-  let max3 = 7;
-  if (max3 > len - 3) {
-    max3 = len - 3;
-  }
-  for (let i3 = max3; i3 > 2; i3 -= 1) {
-    let prefix6 = str.substring(0, i3);
-    if (prefixes2[prefix6.length].hasOwnProperty(prefix6) === true) {
-      let tag = prefixes2[prefix6.length][prefix6];
-      return tag;
-    }
-  }
-  return null;
-};
-var checkPrefix = function(terms, i3, model5) {
-  let term = terms[i3];
-  if (term.tags.size === 0) {
-    let tag = prefixLoop(term.normal, model5.two.prefixPatterns);
-    if (tag !== null) {
-      fastTag_default(term, tag, "2-prefix");
-      term.confidence = 0.5;
-      return true;
-    }
-  }
-  return null;
-};
-var prefix_default = checkPrefix;
-
-// node_modules/compromise/src/2-two/preTagger/compute/tagger/2nd-pass/05-year.js
-var min = 1400;
-var max2 = 2100;
-var dateWords = /* @__PURE__ */ new Set([
-  "in",
-  "on",
-  "by",
-  "until",
-  "for",
-  "to",
-  "during",
-  "throughout",
-  "through",
-  "within",
-  "before",
-  "after",
-  "of",
-  "this",
-  "next",
-  "last",
-  "circa",
-  "around",
-  "post",
-  "pre",
-  "budget",
-  "classic",
-  "plan",
-  "may"
-]);
-var seemsGood = function(term) {
-  if (!term) {
-    return false;
-  }
-  let str = term.normal || term.implicit;
-  if (dateWords.has(str)) {
-    return true;
-  }
-  if (term.tags.has("Date") || term.tags.has("Month") || term.tags.has("WeekDay") || term.tags.has("Year")) {
-    return true;
-  }
-  if (term.tags.has("ProperNoun")) {
-    return true;
-  }
-  return false;
-};
-var seemsOkay = function(term) {
-  if (!term) {
-    return false;
-  }
-  if (term.tags.has("Ordinal")) {
-    return true;
-  }
-  if (term.tags.has("Cardinal") && term.normal.length < 3) {
-    return true;
-  }
-  if (term.normal === "is" || term.normal === "was") {
-    return true;
-  }
-  return false;
-};
-var seemsFine = function(term) {
-  return term && (term.tags.has("Date") || term.tags.has("Month") || term.tags.has("WeekDay") || term.tags.has("Year"));
-};
-var tagYear = function(terms, i3) {
-  const term = terms[i3];
-  if (term.tags.has("NumericValue") && term.tags.has("Cardinal") && term.normal.length === 4) {
-    let num = Number(term.normal);
-    if (num && !isNaN(num)) {
-      if (num > min && num < max2) {
-        let lastTerm = terms[i3 - 1];
-        let nextTerm = terms[i3 + 1];
-        if (seemsGood(lastTerm) || seemsGood(nextTerm)) {
-          return fastTag_default(term, "Year", "2-tagYear");
-        }
-        if (num >= 1920 && num < 2025) {
-          if (seemsOkay(lastTerm) || seemsOkay(nextTerm)) {
-            return fastTag_default(term, "Year", "2-tagYear-close");
-          }
-          if (seemsFine(terms[i3 - 2]) || seemsFine(terms[i3 + 2])) {
-            return fastTag_default(term, "Year", "2-tagYear-far");
-          }
-          if (lastTerm && (lastTerm.tags.has("Determiner") || lastTerm.tags.has("Possessive"))) {
-            if (nextTerm && nextTerm.tags.has("Noun") && !nextTerm.tags.has("Plural")) {
-              return fastTag_default(term, "Year", "2-tagYear-noun");
-            }
-          }
-        }
-      }
-    }
-  }
-  return null;
-};
-var year_default = tagYear;
-
-// node_modules/compromise/src/2-two/preTagger/compute/tagger/3rd-pass/06-verb-type.js
-var verbType = function(terms, i3, model5, world2) {
-  const setTag3 = world2.methods.one.setTag;
-  const term = terms[i3];
-  const types = ["PastTense", "PresentTense", "Auxiliary", "Modal", "Particle"];
-  if (term.tags.has("Verb")) {
-    let type = types.find((typ) => term.tags.has(typ));
-    if (!type) {
-      setTag3([term], "Infinitive", world2, null, `2-verb-type''`);
-    }
-  }
-};
-var verb_type_default = verbType;
-
-// node_modules/compromise/src/2-two/preTagger/compute/tagger/3rd-pass/01-acronym.js
-var oneLetterAcronym2 = /^[A-Z]('s|,)?$/;
-var isUpperCase = /^[A-Z-]+$/;
-var upperThenS = /^[A-Z]+s$/;
-var periodAcronym2 = /([A-Z]\.)+[A-Z]?,?$/;
-var noPeriodAcronym2 = /[A-Z]{2,}('s|,)?$/;
-var lowerCaseAcronym2 = /([a-z]\.)+[a-z]\.?$/;
-var oneLetterWord = {
-  I: true,
-  A: true
-};
-var places = {
-  la: true,
-  ny: true,
-  us: true,
-  dc: true,
-  gb: true
-};
-var isNoPeriodAcronym = function(term, model5) {
-  let str = term.text;
-  if (isUpperCase.test(str) === false) {
-    if (str.length > 3 && upperThenS.test(str) === true) {
-      str = str.replace(/s$/, "");
-    } else {
-      return false;
-    }
-  }
-  if (str.length > 5) {
-    return false;
-  }
-  if (oneLetterWord.hasOwnProperty(str)) {
-    return false;
-  }
-  if (model5.one.lexicon.hasOwnProperty(term.normal)) {
-    return false;
-  }
-  if (periodAcronym2.test(str) === true) {
-    return true;
-  }
-  if (lowerCaseAcronym2.test(str) === true) {
-    return true;
-  }
-  if (oneLetterAcronym2.test(str) === true) {
-    return true;
-  }
-  if (noPeriodAcronym2.test(str) === true) {
-    return true;
-  }
-  return false;
-};
-var isAcronym3 = function(terms, i3, model5) {
-  let term = terms[i3];
-  if (term.tags.has("RomanNumeral") || term.tags.has("Acronym")) {
-    return null;
-  }
-  if (isNoPeriodAcronym(term, model5)) {
-    term.tags.clear();
-    fastTag_default(term, ["Acronym", "Noun"], "3-no-period-acronym");
-    if (places[term.normal] === true) {
-      fastTag_default(term, "Place", "3-place-acronym");
-    }
-    if (upperThenS.test(term.text) === true) {
-      fastTag_default(term, "Plural", "3-plural-acronym");
-    }
-    return true;
-  }
-  if (!oneLetterWord.hasOwnProperty(term.text) && oneLetterAcronym2.test(term.text)) {
-    term.tags.clear();
-    fastTag_default(term, ["Acronym", "Noun"], "3-one-letter-acronym");
-    return true;
-  }
-  if (term.tags.has("Organization") && term.text.length <= 3) {
-    fastTag_default(term, "Acronym", "3-org-acronym");
-    return true;
-  }
-  if (term.tags.has("Organization") && isUpperCase.test(term.text) && term.text.length <= 6) {
-    fastTag_default(term, "Acronym", "3-titlecase-acronym");
-    return true;
-  }
-  return null;
-};
-var acronym_default = isAcronym3;
-
-// node_modules/compromise/src/2-two/preTagger/compute/tagger/3rd-pass/02-neighbours.js
-var lookAtWord = function(term, words) {
-  if (!term) {
-    return null;
-  }
-  let found = words.find((a2) => term.normal === a2[0]);
-  if (found) {
-    return found[1];
-  }
-  return null;
-};
-var lookAtTag = function(term, tags) {
-  if (!term) {
-    return null;
-  }
-  let found = tags.find((a2) => term.tags.has(a2[0]));
-  if (found) {
-    return found[1];
-  }
-  return null;
-};
-var neighbours = function(terms, i3, model5) {
-  const { leftTags, leftWords, rightWords, rightTags } = model5.two.neighbours;
-  let term = terms[i3];
-  if (term.tags.size === 0) {
-    let tag = null;
-    tag = tag || lookAtWord(terms[i3 - 1], leftWords);
-    tag = tag || lookAtWord(terms[i3 + 1], rightWords);
-    tag = tag || lookAtTag(terms[i3 - 1], leftTags);
-    tag = tag || lookAtTag(terms[i3 + 1], rightTags);
-    if (tag) {
-      fastTag_default(term, tag, "3-[neighbour]");
-      fillTags_default(terms, i3, model5);
-      terms[i3].confidence = 0.2;
-      return true;
-    }
-  }
-  return null;
-};
-var neighbours_default2 = neighbours;
-
-// node_modules/compromise/src/2-two/preTagger/compute/tagger/3rd-pass/03-orgWords.js
-var isTitleCase2 = (str) => /^\p{Lu}[\p{Ll}'’]/u.test(str);
-var isOrg = function(term, i3, yelling) {
-  if (!term) {
-    return false;
-  }
-  if (term.tags.has("FirstName") || term.tags.has("Place")) {
-    return false;
-  }
-  if (term.tags.has("ProperNoun") || term.tags.has("Organization") || term.tags.has("Acronym")) {
-    return true;
-  }
-  if (!yelling && isTitleCase2(term.text)) {
-    if (i3 === 0) {
-      return term.tags.has("Singular");
-    }
-    return true;
-  }
-  return false;
-};
-var tagOrgs = function(terms, i3, world2, yelling) {
-  const orgWords = world2.model.two.orgWords;
-  const setTag3 = world2.methods.one.setTag;
-  let term = terms[i3];
-  let str = term.machine || term.normal;
-  if (orgWords[str] === true && isOrg(terms[i3 - 1], i3 - 1, yelling)) {
-    setTag3([terms[i3]], "Organization", world2, null, "3-[org-word]");
-    for (let t2 = i3; t2 >= 0; t2 -= 1) {
-      if (isOrg(terms[t2], t2, yelling)) {
-        setTag3([terms[t2]], "Organization", world2, null, "3-[org-word]");
-      } else {
-        break;
-      }
-    }
-  }
-  return null;
-};
-var orgWords_default2 = tagOrgs;
-
-// node_modules/compromise/src/2-two/preTagger/compute/tagger/3rd-pass/04-fallback.js
-var nounFallback = function(terms, i3, model5) {
-  let isEmpty = false;
-  let tags = terms[i3].tags;
-  if (tags.size === 0) {
-    isEmpty = true;
-  } else if (tags.size === 1) {
-    if (tags.has("Hyphenated") || tags.has("HashTag") || tags.has("Prefix")) {
-      isEmpty = true;
-    }
-  }
-  if (isEmpty) {
-    fastTag_default(terms[i3], "Noun", "3-[fallback]");
-    fillTags_default(terms, i3, model5);
-    terms[i3].confidence = 0.1;
-  }
-};
-var fallback_default = nounFallback;
-
-// node_modules/compromise/src/2-two/preTagger/compute/tagger/3rd-pass/_adhoc.js
-var isTitleCase3 = /^[A-Z][a-z]/;
-var isCapital = (terms, i3) => {
-  if (terms[i3].tags.has("ProperNoun") && isTitleCase3.test(terms[i3].text)) {
-    return "Noun";
-  }
-  return null;
-};
-var isAloneVerb = (terms, i3, tag) => {
-  if (i3 === 0 && !terms[1]) {
-    return tag;
-  }
-  return null;
-};
-var isEndNoun = function(terms, i3) {
-  if (!terms[i3 + 1] && terms[i3 - 1] && terms[i3 - 1].tags.has("Determiner")) {
-    return "Noun";
-  }
-  return null;
-};
-var isStart = function(terms, i3, tag) {
-  if (i3 === 0 && terms.length > 3) {
-    return tag;
-  }
-  return null;
-};
-var adhoc = {
-  "Adj|Gerund": (terms, i3) => {
-    return isCapital(terms, i3);
-  },
-  "Adj|Noun": (terms, i3) => {
-    return isCapital(terms, i3) || isEndNoun(terms, i3);
-  },
-  "Adj|Past": (terms, i3) => {
-    return isCapital(terms, i3);
-  },
-  "Adj|Present": (terms, i3) => {
-    return isCapital(terms, i3);
-  },
-  "Noun|Gerund": (terms, i3) => {
-    return isCapital(terms, i3);
-  },
-  "Noun|Verb": (terms, i3) => {
-    return isCapital(terms, i3) || isAloneVerb(terms, i3, "Infinitive");
-  },
-  "Plural|Verb": (terms, i3) => {
-    return isCapital(terms, i3) || isAloneVerb(terms, i3, "PresentTense") || isStart(terms, i3, "Plural");
-  },
-  "Person|Noun": (terms, i3) => {
-    return isCapital(terms, i3);
-  },
-  "Person|Verb": (terms, i3) => {
-    if (i3 !== 0) {
-      return isCapital(terms, i3);
-    }
-    return null;
-  }
-};
-var adhoc_default = adhoc;
-
-// node_modules/compromise/src/2-two/preTagger/compute/tagger/3rd-pass/06-switches.js
-var env = typeof process === "undefined" || !process.env ? self.env || {} : process.env;
-var prefix5 = /^(under|over|mis|re|un|dis|semi)-?/;
-var checkWord = (term, obj) => {
-  if (!term || !obj) {
-    return null;
-  }
-  let str = term.normal || term.implicit;
-  let found = null;
-  if (obj.hasOwnProperty(str)) {
-    found = obj[str];
-  }
-  if (found && env.DEBUG_TAGS) {
-    console.log(`
-  \x1B[2m\x1B[3m     \u2193 - '${str}' \x1B[0m`);
-  }
-  return found;
-};
-var checkTag = (term, obj = {}, tagSet) => {
-  if (!term || !obj) {
-    return null;
-  }
-  let tags = Array.from(term.tags).sort((a2, b) => {
-    let numA = tagSet[a2] ? tagSet[a2].parents.length : 0;
-    let numB = tagSet[b] ? tagSet[b].parents.length : 0;
-    return numA > numB ? -1 : 1;
-  });
-  let found = tags.find((tag) => obj[tag]);
-  if (found && env.DEBUG_TAGS) {
-    console.log(`  \x1B[2m\x1B[3m      \u2193 - '${term.normal || term.implicit}' (#${found})  \x1B[0m`);
-  }
-  found = obj[found];
-  return found;
-};
-var pickTag = function(terms, i3, clues4, model5) {
-  if (!clues4) {
-    return null;
-  }
-  const tagSet = model5.one.tagSet;
-  let tag = checkWord(terms[i3 + 1], clues4.afterWords);
-  tag = tag || checkWord(terms[i3 - 1], clues4.beforeWords);
-  tag = tag || checkTag(terms[i3 - 1], clues4.beforeTags, tagSet);
-  tag = tag || checkTag(terms[i3 + 1], clues4.afterTags, tagSet);
-  return tag;
-};
-var doSwitches = function(terms, i3, world2) {
-  const model5 = world2.model;
-  const setTag3 = world2.methods.one.setTag;
-  const { switches: switches2, clues: clues4 } = model5.two;
-  const term = terms[i3];
-  let str = term.normal || term.implicit || "";
-  if (prefix5.test(str) && !switches2[str]) {
-    str = str.replace(prefix5, "");
-  }
-  if (term.switch) {
-    let form = term.switch;
-    if (term.tags.has("Acronym") || term.tags.has("PhrasalVerb")) {
-      return;
-    }
-    let tag = pickTag(terms, i3, clues4[form], model5);
-    if (adhoc_default[form]) {
-      tag = adhoc_default[form](terms, i3) || tag;
-    }
-    if (tag) {
-      setTag3([term], tag, world2, null, `3-[switch] (${form})`);
-      fillTags_default(terms, i3, model5);
-    } else if (env.DEBUG_TAGS) {
-      console.log(`
- -> X  - '${str}'  : (${form})  `);
-    }
-  }
-};
-var switches_default = doSwitches;
-
-// node_modules/compromise/src/2-two/preTagger/compute/tagger/3rd-pass/07-imperative.js
-var beside = {
-  there: true,
-  this: true,
-  it: true,
-  him: true,
-  her: true,
-  us: true
-};
-var imperative = function(terms, world2) {
-  const setTag3 = world2.methods.one.setTag;
-  const multiWords = world2.model.one._multiCache || {};
-  let t2 = terms[0];
-  let isRight = t2.switch === "Noun|Verb" || t2.tags.has("Infinitive");
-  if (isRight && terms.length >= 2) {
-    if (terms.length < 4 && !beside[terms[1].normal]) {
-      return;
-    }
-    if (!t2.tags.has("PhrasalVerb") && multiWords.hasOwnProperty(t2.normal)) {
-      return;
-    }
-    let nextNoun = terms[1].tags.has("Noun") || terms[1].tags.has("Determiner");
-    if (nextNoun) {
-      let soonVerb = terms.slice(1, 3).some((term) => term.tags.has("Verb"));
-      if (!soonVerb || t2.tags.has("#PhrasalVerb")) {
-        setTag3([t2], "Imperative", world2, null, "3-[imperative]");
-      }
-    }
-  }
-};
-var imperative_default = imperative;
-
-// node_modules/compromise/src/2-two/preTagger/compute/tagger/index.js
-var ignoreCase = function(terms) {
-  if (terms.filter((t2) => !t2.tags.has("ProperNoun")).length <= 3) {
-    return false;
-  }
-  const lowerCase = /^[a-z]/;
-  return terms.every((t2) => !lowerCase.test(t2.text));
-};
-var firstPass = function(docs, model5, world2) {
-  docs.forEach((terms) => {
-    colons_default(terms, 0, model5, world2);
-    for (let i3 = 0; i3 < terms.length; i3 += 1) {
-    }
-  });
-};
-var secondPass = function(terms, model5, world2, isYelling) {
-  for (let i3 = 0; i3 < terms.length; i3 += 1) {
-    tagSwitch_default(terms, i3, model5);
-    if (isYelling === false) {
-      case_default2(terms, i3, model5);
-    }
-    suffix_default(terms, i3, model5);
-    regex_default(terms, i3, model5, world2);
-    prefix_default(terms, i3, model5);
-    year_default(terms, i3, model5);
-  }
-};
-var thirdPass = function(terms, model5, world2, isYelling) {
-  for (let i3 = 0; i3 < terms.length; i3 += 1) {
-    let found = acronym_default(terms, i3, model5);
-    fillTags_default(terms, i3, model5);
-    found = found || neighbours_default2(terms, i3, model5);
-    found = found || fallback_default(terms, i3, model5);
-  }
-  for (let i3 = 0; i3 < terms.length; i3 += 1) {
-    orgWords_default2(terms, i3, world2, isYelling);
-    switches_default(terms, i3, world2);
-    verb_type_default(terms, i3, model5, world2);
-    hyphens_default(terms, i3, model5, world2);
-  }
-  imperative_default(terms, world2);
-};
-var preTagger = function(view) {
-  const { methods: methods16, model: model5, world: world2 } = view;
-  let docs = view.docs;
-  firstPass(docs, model5, world2);
-  let document2 = methods16.two.quickSplit(docs);
-  for (let n3 = 0; n3 < document2.length; n3 += 1) {
-    let terms = document2[n3];
-    const isYelling = ignoreCase(terms);
-    secondPass(terms, model5, world2, isYelling);
-    thirdPass(terms, model5, world2, isYelling);
-  }
-  return document2;
-};
-var tagger_default2 = preTagger;
-
-// node_modules/compromise/src/2-two/preTagger/compute/root.js
-var toRoot = {
-  "Possessive": (term) => {
-    let str = term.machine || term.normal || term.text;
-    str = str.replace(/'s$/, "");
-    return str;
-  },
-  "Plural": (term, world2) => {
-    let str = term.machine || term.normal || term.text;
-    return world2.methods.two.transform.noun.toSingular(str, world2.model);
-  },
-  "Copula": () => {
-    return "is";
-  },
-  "PastTense": (term, world2) => {
-    let str = term.machine || term.normal || term.text;
-    return world2.methods.two.transform.verb.toInfinitive(str, world2.model, "PastTense");
-  },
-  "Gerund": (term, world2) => {
-    let str = term.machine || term.normal || term.text;
-    return world2.methods.two.transform.verb.toInfinitive(str, world2.model, "Gerund");
-  },
-  "PresentTense": (term, world2) => {
-    let str = term.machine || term.normal || term.text;
-    if (term.tags.has("Infinitive")) {
-      return str;
-    }
-    return world2.methods.two.transform.verb.toInfinitive(str, world2.model, "PresentTense");
-  },
-  "Comparative": (term, world2) => {
-    let str = term.machine || term.normal || term.text;
-    return world2.methods.two.transform.adjective.fromComparative(str, world2.model);
-  },
-  "Superlative": (term, world2) => {
-    let str = term.machine || term.normal || term.text;
-    return world2.methods.two.transform.adjective.fromSuperlative(str, world2.model);
-  },
-  "Adverb": (term, world2) => {
-    const { fromAdverb } = world2.methods.two.transform.adjective;
-    let str = term.machine || term.normal || term.text;
-    return fromAdverb(str);
-  }
-};
-var getRoot = function(view) {
-  const world2 = view.world;
-  const keys = Object.keys(toRoot);
-  view.docs.forEach((terms) => {
-    for (let i3 = 0; i3 < terms.length; i3 += 1) {
-      const term = terms[i3];
-      for (let k2 = 0; k2 < keys.length; k2 += 1) {
-        if (term.tags.has(keys[k2])) {
-          const fn = toRoot[keys[k2]];
-          let root = fn(term, world2);
-          if (term.normal !== root) {
-            term.root = root;
-          }
-          break;
-        }
-      }
-    }
-  });
-};
-var root_default = getRoot;
-
-// node_modules/compromise/src/2-two/preTagger/compute/penn.js
-var mapping = {
-  "Adverb": "RB",
-  "Comparative": "JJR",
-  "Superlative": "JJS",
-  "Adjective": "JJ",
-  "TO": "Conjunction",
-  "Modal": "MD",
-  "Auxiliary": "MD",
-  "Gerund": "VBG",
-  "PastTense": "VBD",
-  "Participle": "VBN",
-  "PresentTense": "VBZ",
-  "Infinitive": "VB",
-  "Particle": "RP",
-  "Verb": "VB",
-  "Pronoun": "PRP",
-  "Cardinal": "CD",
-  "Conjunction": "CC",
-  "Determiner": "DT",
-  "Preposition": "IN",
-  "QuestionWord": "WP",
-  "Expression": "UH",
-  "Possessive": "POS",
-  "ProperNoun": "NNP",
-  "Person": "NNP",
-  "Place": "NNP",
-  "Organization": "NNP",
-  "Singular": "NNP",
-  "Plural": "NNS",
-  "Noun": "NN",
-  "There": "EX"
-};
-var toPenn = function(term) {
-  if (term.tags.has("ProperNoun") && term.tags.has("Plural")) {
-    return "NNPS";
-  }
-  if (term.tags.has("Possessive") && term.tags.has("Pronoun")) {
-    return "PRP$";
-  }
-  if (term.normal === "there") {
-    return "EX";
-  }
-  if (term.normal === "to") {
-    return "TO";
-  }
-  let arr = term.tagRank || [];
-  for (let i3 = 0; i3 < arr.length; i3 += 1) {
-    if (mapping.hasOwnProperty(arr[i3])) {
-      return mapping[arr[i3]];
-    }
-  }
-  return null;
-};
-var pennTag = function(view) {
-  view.compute("tagRank");
-  view.docs.forEach((terms) => {
-    terms.forEach((term) => {
-      term.penn = toPenn(term);
-    });
-  });
-};
-var penn_default = pennTag;
-
-// node_modules/compromise/src/2-two/preTagger/compute/index.js
-var compute_default8 = { preTagger: tagger_default2, root: root_default, penn: penn_default };
-
-// node_modules/compromise/src/2-two/preTagger/tagSet/nouns.js
-var entity = ["Person", "Place", "Organization"];
-var nouns_default3 = {
-  Noun: {
-    not: ["Verb", "Adjective", "Adverb", "Value", "Determiner"]
-  },
-  Singular: {
-    is: "Noun",
-    not: ["Plural", "Uncountable"]
-  },
-  ProperNoun: {
-    is: "Noun"
-  },
-  Person: {
-    is: "Singular",
-    also: ["ProperNoun"],
-    not: ["Place", "Organization", "Date"]
-  },
-  FirstName: {
-    is: "Person"
-  },
-  MaleName: {
-    is: "FirstName",
-    not: ["FemaleName", "LastName"]
-  },
-  FemaleName: {
-    is: "FirstName",
-    not: ["MaleName", "LastName"]
-  },
-  LastName: {
-    is: "Person",
-    not: ["FirstName"]
-  },
-  Honorific: {
-    is: "Person",
-    not: ["FirstName", "LastName", "Value"]
-  },
-  Place: {
-    is: "Singular",
-    not: ["Person", "Organization"]
-  },
-  Country: {
-    is: "Place",
-    also: ["ProperNoun"],
-    not: ["City"]
-  },
-  City: {
-    is: "Place",
-    also: ["ProperNoun"],
-    not: ["Country"]
-  },
-  Region: {
-    is: "Place",
-    also: ["ProperNoun"]
-  },
-  Address: {},
-  Organization: {
-    is: "ProperNoun",
-    not: ["Person", "Place"]
-  },
-  SportsTeam: {
-    is: "Organization"
-  },
-  School: {
-    is: "Organization"
-  },
-  Company: {
-    is: "Organization"
-  },
-  Plural: {
-    is: "Noun",
-    not: ["Singular", "Uncountable"]
-  },
-  Uncountable: {
-    is: "Noun"
-  },
-  Pronoun: {
-    is: "Noun",
-    not: entity
-  },
-  Actor: {
-    is: "Noun",
-    not: entity
-  },
-  Activity: {
-    is: "Noun",
-    not: ["Person", "Place"]
-  },
-  Unit: {
-    is: "Noun",
-    not: entity
-  },
-  Demonym: {
-    is: "Noun",
-    also: ["ProperNoun"],
-    not: entity
-  },
-  Possessive: {
-    is: "Noun"
-  },
-  Reflexive: {
-    is: "Pronoun"
-  }
-};
-
-// node_modules/compromise/src/2-two/preTagger/tagSet/verbs.js
-var verbs_default2 = {
-  Verb: {
-    not: ["Noun", "Adjective", "Adverb", "Value", "Expression"]
-  },
-  PresentTense: {
-    is: "Verb",
-    not: ["PastTense"]
-  },
-  Infinitive: {
-    is: "PresentTense",
-    not: ["Gerund"]
-  },
-  Imperative: {
-    is: "Infinitive",
-    not: ["PastTense", "Gerund", "Copula"]
-  },
-  Gerund: {
-    is: "PresentTense",
-    not: ["Copula"]
-  },
-  PastTense: {
-    is: "Verb",
-    not: ["PresentTense", "Gerund"]
-  },
-  Copula: {
-    is: "Verb"
-  },
-  Modal: {
-    is: "Verb",
-    not: ["Infinitive"]
-  },
-  Participle: {
-    is: "PastTense"
-  },
-  Auxiliary: {
-    is: "Verb",
-    not: ["PastTense", "PresentTense", "Gerund", "Conjunction"]
-  },
-  PhrasalVerb: {
-    is: "Verb"
-  },
-  Particle: {
-    is: "PhrasalVerb",
-    not: ["PastTense", "PresentTense", "Copula", "Gerund"]
-  },
-  Passive: {
-    is: "Verb"
-  }
-};
-
-// node_modules/compromise/src/2-two/preTagger/tagSet/values.js
-var values_default = {
-  Value: {
-    not: ["Verb", "Adjective", "Adverb"]
-  },
-  Ordinal: {
-    is: "Value",
-    not: ["Cardinal"]
-  },
-  Cardinal: {
-    is: "Value",
-    not: ["Ordinal"]
-  },
-  Fraction: {
-    is: "Value",
-    not: ["Noun"]
-  },
-  Multiple: {
-    is: "TextValue"
-  },
-  RomanNumeral: {
-    is: "Cardinal",
-    not: ["TextValue"]
-  },
-  TextValue: {
-    is: "Value",
-    not: ["NumericValue"]
-  },
-  NumericValue: {
-    is: "Value",
-    not: ["TextValue"]
-  },
-  Money: {
-    is: "Cardinal"
-  },
-  Percent: {
-    is: "Value"
-  }
-};
-
-// node_modules/compromise/src/2-two/preTagger/tagSet/dates.js
-var dates_default = {
-  Date: {
-    not: ["Verb", "Adverb", "Adjective"]
-  },
-  Month: {
-    is: "Date",
-    also: ["Noun"],
-    not: ["Year", "WeekDay", "Time"]
-  },
-  WeekDay: {
-    is: "Date",
-    also: ["Noun"]
-  },
-  Year: {
-    is: "Date",
-    not: ["RomanNumeral"]
-  },
-  FinancialQuarter: {
-    is: "Date",
-    not: "Fraction"
-  },
-  Holiday: {
-    is: "Date",
-    also: ["Noun"]
-  },
-  Season: {
-    is: "Date"
-  },
-  Timezone: {
-    is: "Date",
-    also: ["Noun"],
-    not: ["ProperNoun"]
-  },
-  Time: {
-    is: "Date",
-    not: ["AtMention"]
-  },
-  Duration: {
-    is: "Date",
-    also: ["Noun"]
-  }
-};
-
-// node_modules/compromise/src/2-two/preTagger/tagSet/misc.js
-var anything = ["Noun", "Verb", "Adjective", "Adverb", "Value", "QuestionWord"];
-var misc_default3 = {
-  Adjective: {
-    not: ["Noun", "Verb", "Adverb", "Value"]
-  },
-  Comparable: {
-    is: "Adjective"
-  },
-  Comparative: {
-    is: "Adjective"
-  },
-  Superlative: {
-    is: "Adjective",
-    not: ["Comparative"]
-  },
-  NumberRange: {},
-  Adverb: {
-    not: ["Noun", "Verb", "Adjective", "Value"]
-  },
-  Determiner: {
-    not: ["Noun", "Verb", "Adjective", "Adverb", "QuestionWord", "Conjunction"]
-  },
-  Conjunction: {
-    not: anything
-  },
-  Preposition: {
-    not: ["Noun", "Verb", "Adjective", "Adverb", "QuestionWord", "Determiner"]
-  },
-  QuestionWord: {
-    not: ["Determiner"]
-  },
-  Currency: {
-    is: "Noun"
-  },
-  Expression: {
-    not: ["Noun", "Adjective", "Verb", "Adverb"]
-  },
-  Abbreviation: {},
-  Url: {
-    not: ["HashTag", "PhoneNumber", "Verb", "Adjective", "Value", "AtMention", "Email"]
-  },
-  PhoneNumber: {
-    not: ["HashTag", "Verb", "Adjective", "Value", "AtMention", "Email"]
-  },
-  HashTag: {},
-  AtMention: {
-    is: "Noun",
-    not: ["HashTag", "Email"]
-  },
-  Emoji: {
-    not: ["HashTag", "Verb", "Adjective", "Value", "AtMention"]
-  },
-  Emoticon: {
-    not: ["HashTag", "Verb", "Adjective", "Value", "AtMention"]
-  },
-  Email: {
-    not: ["HashTag", "Verb", "Adjective", "Value", "AtMention"]
-  },
-  Acronym: {
-    not: ["Plural", "RomanNumeral"]
-  },
-  Negative: {
-    not: ["Noun", "Adjective", "Value", "Expression"]
-  },
-  Condition: {
-    not: ["Verb", "Adjective", "Noun", "Value"]
-  },
-  There: {
-    not: ["Verb", "Adjective", "Noun", "Value", "Conjunction", "Preposition"]
-  },
-  Prefix: {
-    not: ["Abbreviation", "Acronym", "ProperNoun"]
-  },
-  Hyphenated: {}
-};
-
-// node_modules/compromise/src/2-two/preTagger/tagSet/index.js
-var allTags = Object.assign({}, nouns_default3, verbs_default2, values_default, dates_default, misc_default3);
-var tagSet_default = allTags;
-
-// node_modules/compromise/src/2-two/preTagger/plugin.js
-var plugin_default13 = {
-  compute: compute_default8,
-  methods: methods_default9,
-  model: model_default3,
-  tags: tagSet_default,
-  hooks: ["preTagger"]
-};
-
-// node_modules/compromise/src/2-two/contraction-two/api/contract.js
-var postPunct = /[,)"';:\-–—.…]/;
-var setContraction = function(m3, suffix) {
-  if (!m3.found) {
-    return;
-  }
-  let terms = m3.termList();
-  for (let i3 = 0; i3 < terms.length - 1; i3++) {
-    const t2 = terms[i3];
-    if (postPunct.test(t2.post)) {
-      return;
-    }
-  }
-  terms[0].implicit = terms[0].normal;
-  terms[0].text += suffix;
-  terms[0].normal += suffix;
-  terms.slice(1).forEach((t2) => {
-    t2.implicit = t2.normal;
-    t2.text = "";
-    t2.normal = "";
-  });
-  for (let i3 = 0; i3 < terms.length - 1; i3++) {
-    terms[i3].post = terms[i3].post.replace(/ /, "");
-  }
-};
-var contract = function() {
-  let doc = this.not("@hasContraction");
-  let m3 = doc.match("(we|they|you) are");
-  setContraction(m3, `'re`);
-  m3 = doc.match("(he|she|they|it|we|you) will");
-  setContraction(m3, `'ll`);
-  m3 = doc.match("(he|she|they|it|we) is");
-  setContraction(m3, `'s`);
-  m3 = doc.match("#Person is");
-  setContraction(m3, `'s`);
-  m3 = doc.match("#Person would");
-  setContraction(m3, `'d`);
-  m3 = doc.match("(is|was|had|would|should|could|do|does|have|has|can) not");
-  setContraction(m3, `n't`);
-  m3 = doc.match("(i|we|they) have");
-  setContraction(m3, `'ve`);
-  m3 = doc.match("(would|should|could) have");
-  setContraction(m3, `'ve`);
-  m3 = doc.match("i am");
-  setContraction(m3, `'m`);
-  m3 = doc.match("going to");
-  return this;
-};
-var contract_default = contract;
-
-// node_modules/compromise/src/2-two/contraction-two/api/index.js
-var titleCase4 = /^\p{Lu}[\p{Ll}'’]/u;
-var toTitleCase2 = function(str = "") {
-  str = str.replace(/^ *[a-z\u00C0-\u00FF]/, (x) => x.toUpperCase());
-  return str;
-};
-var api3 = function(View2) {
-  class Contractions extends View2 {
-    constructor(document2, pointer, groups) {
-      super(document2, pointer, groups);
-      this.viewType = "Contraction";
-    }
-    expand() {
-      this.docs.forEach((terms) => {
-        let isTitleCase4 = titleCase4.test(terms[0].text);
-        terms.forEach((t2, i3) => {
-          t2.text = t2.implicit;
-          delete t2.implicit;
-          if (i3 < terms.length - 1 && t2.post === "") {
-            t2.post += " ";
-          }
-          t2.dirty = true;
-        });
-        if (isTitleCase4) {
-          terms[0].text = toTitleCase2(terms[0].text);
-        }
-      });
-      this.compute("normal");
-      return this;
-    }
-  }
-  View2.prototype.contractions = function() {
-    let m3 = this.match("@hasContraction+");
-    return new Contractions(this.document, m3.pointer);
-  };
-  View2.prototype.contract = contract_default;
-};
-var api_default10 = api3;
-
-// node_modules/compromise/src/2-two/contraction-two/compute/_splice.js
-var insertContraction2 = function(document2, point, words) {
-  let [n3, w] = point;
-  if (!words || words.length === 0) {
-    return;
-  }
-  words = words.map((word, i3) => {
-    word.implicit = word.text;
-    word.machine = word.text;
-    word.pre = "";
-    word.post = "";
-    word.text = "";
-    word.normal = "";
-    word.index = [n3, w + i3];
-    return word;
-  });
-  if (words[0]) {
-    words[0].pre = document2[n3][w].pre;
-    words[words.length - 1].post = document2[n3][w].post;
-    words[0].text = document2[n3][w].text;
-    words[0].normal = document2[n3][w].normal;
-  }
-  document2[n3].splice(w, 1, ...words);
-};
-var splice_default2 = insertContraction2;
-
-// node_modules/compromise/src/2-two/contraction-two/compute/apostrophe-s.js
-var hasContraction3 = /'/;
-var isHas = (terms, i3) => {
-  let after2 = terms.slice(i3 + 1, i3 + 3);
-  return after2.some((t2) => t2.tags.has("PastTense"));
-};
-var apostropheS = function(terms, i3) {
-  let before2 = terms[i3].normal.split(hasContraction3)[0];
-  if (isHas(terms, i3)) {
-    return [before2, "has"];
-  }
-  if (before2 === "let") {
-    return [before2, "us"];
-  }
-  if (before2 === "there") {
-    let nextTerm = terms[i3 + 1];
-    if (nextTerm && nextTerm.tags.has("Plural")) {
-      return [before2, "are"];
-    }
-  }
-  return [before2, "is"];
-};
-var apostrophe_s_default = apostropheS;
-
-// node_modules/compromise/src/2-two/contraction-two/compute/apostrophe-d.js
-var hasContraction4 = /'/;
-var pickHad = (terms, i3) => {
-  if (terms[i3 + 1] && terms[i3 + 1].normal == "better") {
-    return true;
-  }
-  let after2 = terms.slice(i3 + 1, i3 + 3);
-  return after2.some((t2) => t2.tags.has("PastTense"));
-};
-var _apostropheD2 = function(terms, i3) {
-  let before2 = terms[i3].normal.split(hasContraction4)[0];
-  if (before2 === "how" || before2 === "what") {
-    return [before2, "did"];
-  }
-  if (pickHad(terms, i3) === true) {
-    return [before2, "had"];
-  }
-  return [before2, "would"];
-};
-var apostrophe_d_default2 = _apostropheD2;
-
-// node_modules/compromise/src/2-two/contraction-two/compute/apostrophe-t.js
-var lastNoun = function(terms, i3) {
-  for (let n3 = i3 - 1; n3 >= 0; n3 -= 1) {
-    if (terms[n3].tags.has("Noun") || terms[n3].tags.has("Pronoun") || terms[n3].tags.has("Plural") || terms[n3].tags.has("Singular")) {
-      return terms[n3];
-    }
-  }
-  return null;
-};
-var apostropheT2 = function(terms, i3) {
-  if (terms[i3].normal === "ain't" || terms[i3].normal === "aint") {
-    if (terms[i3 + 1] && terms[i3 + 1].normal === "never") {
-      return ["have"];
-    }
-    let noun = lastNoun(terms, i3);
-    if (noun) {
-      if (noun.normal === "we" || noun.normal === "they") {
-        return ["are", "not"];
-      }
-      if (noun.normal === "i") {
-        return ["am", "not"];
-      }
-      if (noun.tags && noun.tags.has("Plural")) {
-        return ["are", "not"];
-      }
-    }
-    return ["is", "not"];
-  }
-  let before2 = terms[i3].normal.replace(/n't/, "");
-  return [before2, "not"];
-};
-var apostrophe_t_default2 = apostropheT2;
-
-// node_modules/compromise/src/2-two/contraction-two/compute/isPossessive.js
-var banList = {
-  that: true,
-  there: true,
-  let: true,
-  here: true,
-  everywhere: true
-};
-var beforePossessive = {
-  in: true,
-  by: true,
-  for: true
-};
-var isPossessive = (terms, i3) => {
-  let term = terms[i3];
-  if (banList.hasOwnProperty(term.machine || term.normal)) {
-    return false;
-  }
-  if (term.tags.has("Possessive")) {
-    return true;
-  }
-  if (term.tags.has("QuestionWord")) {
-    return false;
-  }
-  if (term.normal === `he's` || term.normal === `she's`) {
-    return false;
-  }
-  let nextTerm = terms[i3 + 1];
-  if (!nextTerm) {
-    return true;
-  }
-  if (term.normal === `it's`) {
-    if (nextTerm.tags.has("#Noun")) {
-      return true;
-    }
-    return false;
-  }
-  if (nextTerm.tags.has("Verb")) {
-    if (nextTerm.tags.has("Infinitive")) {
-      return true;
-    }
-    if (nextTerm.tags.has("PresentTense")) {
-      return true;
-    }
-    return false;
-  }
-  if (nextTerm.tags.has("Noun")) {
-    let nextStr = nextTerm.machine || nextTerm.normal;
-    if (nextStr === "here" || nextStr === "there" || nextStr === "everywhere") {
-      return false;
-    }
-    if (nextTerm.tags.has("Possessive")) {
-      return false;
-    }
-    if (nextTerm.tags.has("ProperNoun") && !term.tags.has("ProperNoun")) {
-      return false;
-    }
-    return true;
-  }
-  if (terms[i3 - 1] && beforePossessive[terms[i3 - 1].normal] === true) {
-    return true;
-  }
-  let twoTerm = terms[i3 + 2];
-  if (twoTerm && twoTerm.tags.has("Noun") && !twoTerm.tags.has("Pronoun")) {
-    return true;
-  }
-  if (nextTerm.tags.has("Adjective") || nextTerm.tags.has("Adverb") || nextTerm.tags.has("Verb")) {
-    return false;
-  }
-  return false;
-};
-var isPossessive_default = isPossessive;
-
-// node_modules/compromise/src/2-two/contraction-two/compute/index.js
-var byApostrophe2 = /'/;
-var reIndex = function(terms) {
-  terms.forEach((t2, i3) => {
-    if (t2.index) {
-      t2.index[1] = i3;
-    }
-  });
-};
-var reTag2 = function(terms, view, start2, len) {
-  let tmp = view.update();
-  tmp.document = [terms];
-  let end2 = start2 + len;
-  if (start2 > 0) {
-    start2 -= 1;
-  }
-  if (terms[end2]) {
-    end2 += 1;
-  }
-  tmp.ptrs = [[0, start2, end2]];
-  tmp.compute(["lexicon", "preTagger"]);
-  reIndex(terms);
-};
-var byEnd2 = {
-  d: (terms, i3) => apostrophe_d_default2(terms, i3),
-  t: (terms, i3) => apostrophe_t_default2(terms, i3),
-  s: (terms, i3, world2) => {
-    if (isPossessive_default(terms, i3)) {
-      return world2.methods.one.setTag([terms[i3]], "Possessive", world2, "2-contraction");
-    }
-    return apostrophe_s_default(terms, i3);
-  }
-};
-var toDocs2 = function(words, view) {
-  let doc = view.fromText(words.join(" "));
-  doc.compute("id");
-  return doc.docs[0];
-};
-var contractionTwo = (view) => {
-  let { world: world2, document: document2 } = view;
-  document2.forEach((terms, n3) => {
-    for (let i3 = terms.length - 1; i3 >= 0; i3 -= 1) {
-      if (terms[i3].implicit) {
-        return;
-      }
-      let after2 = null;
-      if (byApostrophe2.test(terms[i3].normal) === true) {
-        [, after2] = terms[i3].normal.split(byApostrophe2);
-      }
-      let words = null;
-      if (byEnd2.hasOwnProperty(after2)) {
-        words = byEnd2[after2](terms, i3, world2);
-      }
-      if (words) {
-        words = toDocs2(words, view);
-        splice_default2(document2, [n3, i3], words);
-        reTag2(document2[n3], view, i3, words.length);
-        continue;
-      }
-    }
-  });
-};
-var compute_default9 = { contractionTwo };
-
-// node_modules/compromise/src/2-two/contraction-two/plugin.js
-var plugin_default14 = {
-  compute: compute_default9,
-  api: api_default10,
-  hooks: ["contractionTwo"]
-};
-
-// node_modules/compromise/src/2-two/postTagger/model/adjective/adjective.js
-var adjective_default = [
-  { match: "[(all|both)] #Determiner #Noun", group: 0, tag: "Noun", reason: "all-noun" },
-  { match: "#Copula [(just|alone)]$", group: 0, tag: "Adjective", reason: "not-adverb" },
-  { match: "#Singular is #Adverb? [#PastTense$]", group: 0, tag: "Adjective", reason: "is-filled" },
-  { match: "[#PastTense] #Singular is", group: 0, tag: "Adjective", reason: "smoked-poutine" },
-  { match: "[#PastTense] #Plural are", group: 0, tag: "Adjective", reason: "baked-onions" },
-  { match: "well [#PastTense]", group: 0, tag: "Adjective", reason: "well-made" },
-  { match: "#Copula [fucked up?]", group: 0, tag: "Adjective", reason: "swears-adjective" },
-  { match: "#Singular (seems|appears) #Adverb? [#PastTense$]", group: 0, tag: "Adjective", reason: "seems-filled" },
-  { match: "#Copula #Adjective? [(out|in|through)]$", group: 0, tag: "Adjective", reason: "still-out" },
-  { match: "^[#Adjective] (the|your) #Noun", group: 0, notIf: "(all|even)", tag: "Infinitive", reason: "shut-the" },
-  { match: "the [said] #Noun", group: 0, tag: "Adjective", reason: "the-said-card" },
-  { match: "[#Hyphenated (#Hyphenated && #PastTense)] (#Noun|#Conjunction)", group: 0, tag: "Adjective", notIf: "#Adverb", reason: "faith-based" },
-  { match: "[#Hyphenated (#Hyphenated && #Gerund)] (#Noun|#Conjunction)", group: 0, tag: "Adjective", notIf: "#Adverb", reason: "self-driving" },
-  { match: "[#PastTense (#Hyphenated && #PhrasalVerb)] (#Noun|#Conjunction)", group: 0, tag: "Adjective", reason: "dammed-up" },
-  { match: "(#Hyphenated && #Value) fold", tag: "Adjective", reason: "two-fold" },
-  { match: "must (#Hyphenated && #Infinitive)", tag: "Adjective", reason: "must-win" },
-  { match: `(#Hyphenated && #Infinitive) #Hyphenated`, tag: "Adjective", notIf: "#PhrasalVerb", reason: "vacuum-sealed" },
-  { match: "too much", tag: "Adverb Adjective", reason: "bit-4" },
-  { match: "a bit much", tag: "Determiner Adverb Adjective", reason: "bit-3" },
-  { match: "[(un|contra|extra|inter|intra|macro|micro|mid|mis|mono|multi|pre|sub|tri|ex)] #Adjective", group: 0, tag: ["Adjective", "Prefix"], reason: "un-skilled" }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/adjective/adj-adverb.js
-var adverbAdj = `(dark|bright|flat|light|soft|pale|dead|dim|faux|little|wee|sheer|most|near|good|extra|all)`;
-var adj_adverb_default = [
-  { match: `#Adverb [#Adverb] (and|or|then)`, group: 0, tag: "Adjective", reason: "kinda-sparkly-and" },
-  { match: `[${adverbAdj}] #Adjective`, group: 0, tag: "Adverb", reason: "dark-green" },
-  { match: `#Copula [far too] #Adjective`, group: 0, tag: "Adverb", reason: "far-too" },
-  { match: `#Copula [still] (in|#Gerund|#Adjective)`, group: 0, tag: "Adverb", reason: "was-still-walking" }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/adjective/adj-gerund.js
-var adj_gerund_default2 = [
-  { match: "(a|an) [#Gerund]", group: 0, tag: "Adjective", reason: "a|an" },
-  { match: "as [#Gerund] as", group: 0, tag: "Adjective", reason: "as-gerund-as" },
-  { match: "more [#Gerund] than", group: 0, tag: "Adjective", reason: "more-gerund-than" },
-  { match: "(so|very|extremely) [#Gerund]", group: 0, tag: "Adjective", reason: "so-gerund" },
-  { match: "(found|found) it #Adverb? [#Gerund]", group: 0, tag: "Adjective", reason: "found-it-gerund" },
-  { match: "a (little|bit|wee) bit? [#Gerund]", group: 0, tag: "Adjective", reason: "a-bit-gerund" },
-  { match: "#Gerund [#Gerund]", group: 0, tag: "Adjective", notIf: "(impersonating|practicing|considering|assuming)", reason: "looking-annoying" }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/adjective/adj-noun.js
-var adj_noun_default2 = [
-  { match: "#Determiner [#Adjective] #Copula", group: 0, tag: "Noun", reason: "the-adj-is" },
-  { match: "#Adjective [#Adjective] #Copula", group: 0, tag: "Noun", reason: "adj-adj-is" },
-  { match: "(his|its) [%Adj|Noun%]", group: 0, tag: "Noun", notIf: "#Hyphenated", reason: "his-fine" },
-  { match: "#Copula #Adverb? [all]", group: 0, tag: "Noun", reason: "is-all" },
-  { match: `(have|had) [#Adjective] #Preposition .`, group: 0, tag: "Noun", reason: "have-fun" },
-  { match: `#Gerund (giant|capital|center|zone|application)`, tag: "Noun", reason: "brewing-giant" },
-  { match: `#Preposition (a|an) [#Adjective]$`, group: 0, tag: "Noun", reason: "an-instant" },
-  { match: `no [#Adjective] #Modal`, group: 0, tag: "Noun", reason: "no-golden" },
-  { match: `[brand #Gerund?] new`, group: 0, tag: "Adverb", reason: "brand-new" },
-  { match: `(#Determiner|#Comparative|new|different) [kind]`, group: 0, tag: "Noun", reason: "some-kind" },
-  { match: `#Possessive [%Adj|Noun%] #Noun`, group: 0, tag: "Adjective", reason: "her-favourite" },
-  { match: `must && #Hyphenated .`, tag: "Adjective", reason: "must-win" },
-  { match: `#Determiner [#Adjective]$`, tag: "Noun", notIf: "(this|that|#Comparative|#Superlative)", reason: "the-south" },
-  { match: `(#Noun && #Hyphenated) (#Adjective && #Hyphenated)`, tag: "Adjective", notIf: "(this|that|#Comparative|#Superlative)", reason: "company-wide" }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/adjective/adj-verb.js
-var adj_verb_default = [
-  { match: "(slowly|quickly) [#Adjective]", group: 0, tag: "Verb", reason: "slowly-adj" },
-  { match: "does (#Adverb|not)? [#Adjective]", group: 0, tag: "PresentTense", reason: "does-mean" },
-  { match: "[(fine|okay|cool|ok)] by me", group: 0, tag: "Adjective", reason: "okay-by-me" },
-  { match: "i (#Adverb|do)? not? [mean]", group: 0, tag: "PresentTense", reason: "i-mean" },
-  { match: "will #Adjective", tag: "Auxiliary Infinitive", reason: "will-adj" },
-  { match: "#Pronoun [#Adjective] #Determiner #Adjective? #Noun", group: 0, tag: "Verb", reason: "he-adj-the" },
-  { match: "#Copula [%Adj|Present%] to #Verb", group: 0, tag: "Verb", reason: "adj-to" },
-  { match: "#Copula [#Adjective] (well|badly|quickly|slowly)", group: 0, tag: "Verb", reason: "done-well" },
-  { match: "#Adjective and [#Gerund] !#Preposition?", group: 0, tag: "Adjective", reason: "rude-and-x" },
-  { match: "#Copula #Adverb? (over|under) [#PastTense]", group: 0, tag: "Adjective", reason: "over-cooked" },
-  { match: "#Copula #Adjective+ (and|or) [#PastTense]$", group: 0, tag: "Adjective", reason: "bland-and-overcooked" },
-  { match: "got #Adverb? [#PastTense] of", group: 0, tag: "Adjective", reason: "got-tired-of" },
-  { match: "(seem|seems|seemed|appear|appeared|appears|feel|feels|felt|sound|sounds|sounded) (#Adverb|#Adjective)? [#PastTense]", group: 0, tag: "Adjective", reason: "felt-loved" },
-  { match: "(seem|feel|seemed|felt) [#PastTense #Particle?]", group: 0, tag: "Adjective", reason: "seem-confused" },
-  { match: "a (bit|little|tad) [#PastTense #Particle?]", group: 0, tag: "Adjective", reason: "a-bit-confused" },
-  { match: "not be [%Adj|Past% #Particle?]", group: 0, tag: "Adjective", reason: "do-not-be-confused" },
-  { match: "#Copula just [%Adj|Past% #Particle?]", group: 0, tag: "Adjective", reason: "is-just-right" },
-  { match: "as [#Infinitive] as", group: 0, tag: "Adjective", reason: "as-pale-as" },
-  { match: "[%Adj|Past%] and #Adjective", group: 0, tag: "Adjective", reason: "faled-and-oppressive" },
-  { match: "or [#PastTense] #Noun", group: 0, tag: "Adjective", notIf: "(#Copula|#Pronoun)", reason: "or-heightened-emotion" }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/adverb.js
-var adverb_default = [
-  { match: "[still] #Adjective", group: 0, tag: "Adverb", reason: "still-advb" },
-  { match: "[still] #Verb", group: 0, tag: "Adverb", reason: "still-verb" },
-  { match: "[so] #Adjective", group: 0, tag: "Adverb", reason: "so-adv" },
-  { match: "[way] #Comparative", group: 0, tag: "Adverb", reason: "way-adj" },
-  { match: "[way] #Adverb #Adjective", group: 0, tag: "Adverb", reason: "way-too-adj" },
-  { match: "[all] #Verb", group: 0, tag: "Adverb", reason: "all-verb" },
-  { match: "#Verb  [like]", group: 0, notIf: "(#Modal|#PhrasalVerb)", tag: "Adverb", reason: "verb-like" },
-  { match: "(barely|hardly) even", tag: "Adverb", reason: "barely-even" },
-  { match: "[even] #Verb", group: 0, tag: "Adverb", reason: "even-walk" },
-  { match: "[even] #Comparative", group: 0, tag: "Adverb", reason: "even-worse" },
-  { match: "[even] (#Determiner|#Possessive)", group: 0, tag: "#Adverb", reason: "even-the" },
-  { match: "even left", tag: "#Adverb #Verb", reason: "even-left" },
-  { match: "[way] #Adjective", group: 0, tag: "#Adverb", reason: "way-over" },
-  {
-    match: "#PresentTense [(hard|quick|long|bright|slow|fast|backwards|forwards)]",
-    notIf: "#Copula",
-    group: 0,
-    tag: "Adverb",
-    reason: "lazy-ly"
-  },
-  { match: "[much] #Adjective", group: 0, tag: "Adverb", reason: "bit-1" },
-  { match: "#Copula [#Adverb]$", group: 0, tag: "Adjective", reason: "is-well" },
-  { match: "a [(little|bit|wee) bit?] #Adjective", group: 0, tag: "Adverb", reason: "a-bit-cold" },
-  { match: `[(super|pretty)] #Adjective`, group: 0, tag: "Adverb", reason: "super-strong" },
-  { match: "(become|fall|grow) #Adverb? [#PastTense]", group: 0, tag: "Adjective", reason: "overly-weakened" },
-  { match: "(a|an) #Adverb [#Participle] #Noun", group: 0, tag: "Adjective", reason: "completely-beaten" },
-  { match: "#Determiner #Adverb? [close]", group: 0, tag: "Adjective", reason: "a-close" },
-  { match: "#Gerund #Adverb? [close]", group: 0, tag: "Adverb", reason: "being-close" },
-  { match: "(the|those|these|a|an) [#Participle] #Noun", group: 0, tag: "Adjective", reason: "blown-motor" },
-  { match: "(#PresentTense|#PastTense) [back]", group: 0, tag: "Adverb", notIf: "#PhrasalVerb", reason: "charge-back" },
-  { match: "#Verb [around]", group: 0, tag: "Adverb", notIf: "#PhrasalVerb", reason: "send-around" },
-  { match: "[later] #PresentTense", group: 0, tag: "Adverb", reason: "later-say" }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/dates/date-phrase.js
-var date_phrase_default = [
-  { match: "#Holiday (day|eve)", tag: "Holiday", reason: "holiday-day" },
-  { match: "#Value of #Month", tag: "Date", reason: "value-of-month" },
-  { match: "#Cardinal #Month", tag: "Date", reason: "cardinal-month" },
-  { match: "#Month #Value to #Value", tag: "Date", reason: "value-to-value" },
-  { match: "#Month the #Value", tag: "Date", reason: "month-the-value" },
-  { match: "(#WeekDay|#Month) #Value", tag: "Date", reason: "date-value" },
-  { match: "#Value (#WeekDay|#Month)", tag: "Date", reason: "value-date" },
-  { match: "(#TextValue && #Date) #TextValue", tag: "Date", reason: "textvalue-date" },
-  { match: `#Month #NumberRange`, tag: "Date", reason: "aug 20-21" },
-  { match: `#WeekDay #Month #Ordinal`, tag: "Date", reason: "week mm-dd" },
-  { match: `#Month #Ordinal #Cardinal`, tag: "Date", reason: "mm-dd-yyy" },
-  { match: `(#Place|#Demonmym|#Time) (standard|daylight|central|mountain)? time`, tag: "Timezone", reason: "std-time" },
-  {
-    match: `(eastern|mountain|pacific|central|atlantic) (standard|daylight|summer)? time`,
-    tag: "Timezone",
-    reason: "eastern-time"
-  },
-  { match: `#Time [(eastern|mountain|pacific|central|est|pst|gmt)]`, group: 0, tag: "Timezone", reason: "5pm-central" },
-  { match: `(central|western|eastern) european time`, tag: "Timezone", reason: "cet" }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/dates/date.js
-var date_default = [
-  { match: "[sun] the #Ordinal", tag: "WeekDay", reason: "sun-the-5th" },
-  { match: "[sun] #Date", group: 0, tag: "WeekDay", reason: "sun-feb" },
-  { match: "#Date (on|this|next|last|during)? [sun]", group: 0, tag: "WeekDay", reason: "1pm-sun" },
-  { match: `(in|by|before|during|on|until|after|of|within|all) [sat]`, group: 0, tag: "WeekDay", reason: "sat" },
-  { match: `(in|by|before|during|on|until|after|of|within|all) [wed]`, group: 0, tag: "WeekDay", reason: "wed" },
-  { match: `(in|by|before|during|on|until|after|of|within|all) [march]`, group: 0, tag: "Month", reason: "march" },
-  { match: "[sat] #Date", group: 0, tag: "WeekDay", reason: "sat-feb" },
-  { match: `#Preposition [(march|may)]`, group: 0, tag: "Month", reason: "in-month" },
-  { match: `(this|next|last) (march|may) !#Infinitive`, tag: "#Date #Month", reason: "this-month" },
-  { match: `(march|may) the? #Value`, tag: "#Month #Date #Date", reason: "march-5th" },
-  { match: `#Value of? (march|may)`, tag: "#Date #Date #Month", reason: "5th-of-march" },
-  { match: `[(march|may)] .? #Date`, group: 0, tag: "Month", reason: "march-and-feb" },
-  { match: `#Date .? [(march|may)]`, group: 0, tag: "Month", reason: "feb-and-march" },
-  { match: `#Adverb [(march|may)]`, group: 0, tag: "Verb", reason: "quickly-march" },
-  { match: `[(march|may)] #Adverb`, group: 0, tag: "Verb", reason: "march-quickly" }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/nouns/nouns.js
-var infNouns = "(feel|sense|process|rush|side|bomb|bully|challenge|cover|crush|dump|exchange|flow|function|issue|lecture|limit|march|process)";
-var nouns_default4 = [
-  { match: "(the|any) [more]", group: 0, tag: "Singular", reason: "more-noun" },
-  { match: "[more] #Noun", group: 0, tag: "Adjective", reason: "more-noun" },
-  { match: "(right|rights) of .", tag: "Noun", reason: "right-of" },
-  { match: "a [bit]", group: 0, tag: "Singular", reason: "bit-2" },
-  { match: "a [must]", group: 0, tag: "Singular", reason: "must-2" },
-  { match: "(we|us) [all]", group: 0, tag: "Noun", reason: "we all" },
-  { match: "due to [#Verb]", group: 0, tag: "Noun", reason: "due-to" },
-  { match: "some [#Verb] #Plural", group: 0, tag: "Noun", reason: "determiner6" },
-  { match: "#Possessive #Ordinal [#PastTense]", group: 0, tag: "Noun", reason: "first-thought" },
-  { match: "(the|this|those|these) #Adjective [%Verb|Noun%]", group: 0, tag: "Noun", notIf: "#Copula", reason: "the-adj-verb" },
-  { match: "(the|this|those|these) #Adverb #Adjective [#Verb]", group: 0, tag: "Noun", reason: "determiner4" },
-  { match: "the [#Verb] #Preposition .", group: 0, tag: "Noun", reason: "determiner1" },
-  { match: "(a|an|the) [#Verb] of", group: 0, tag: "Noun", reason: "the-verb-of" },
-  { match: "#Determiner #Noun of [#Verb]", group: 0, tag: "Noun", notIf: "#Gerund", reason: "noun-of-noun" },
-  { match: "#PastTense #Preposition [#PresentTense]", group: 0, notIf: "#Gerund", tag: "Noun", reason: "ended-in-ruins" },
-  { match: "#Conjunction [u]", group: 0, tag: "Pronoun", reason: "u-pronoun-2" },
-  { match: "[u] #Verb", group: 0, tag: "Pronoun", reason: "u-pronoun-1" },
-  { match: "#Determiner [(western|eastern|northern|southern|central)] #Noun", group: 0, tag: "Noun", reason: "western-line" },
-  { match: "(#Singular && @hasHyphen) #PresentTense", tag: "Noun", reason: "hyphen-verb" },
-  { match: "is no [#Verb]", group: 0, tag: "Noun", reason: "is-no-verb" },
-  { match: "do [so]", group: 0, tag: "Noun", reason: "so-noun" },
-  { match: "#Determiner [(shit|damn|hell)]", group: 0, tag: "Noun", reason: "swears-noun" },
-  { match: "to [(shit|hell)]", group: 0, tag: "Noun", reason: "to-swears" },
-  { match: "(the|these) [#Singular] (were|are)", group: 0, tag: "Plural", reason: "singular-were" },
-  { match: `a #Noun+ or #Adverb+? [#Verb]`, group: 0, tag: "Noun", reason: "noun-or-noun" },
-  { match: "(the|those|these|a|an) #Adjective? [#PresentTense #Particle?]", group: 0, tag: "Noun", notIf: "(seem|appear|include|#Gerund|#Copula)", reason: "det-inf" },
-  { match: "#Noun #Actor", tag: "Actor", reason: "thing-doer" },
-  { match: "[#Actor+] #ProperNoun", group: 0, tag: "Honorific", reason: "sgt-kelly" },
-  { match: `co #Singular`, tag: "Actor", reason: "co-noun" },
-  { match: "#Determiner [sun]", group: 0, tag: "Singular", reason: "the-sun" },
-  { match: "#Verb (a|an) [#Value]", group: 0, tag: "Singular", reason: "did-a-value" },
-  { match: "the [(can|will|may)]", group: 0, tag: "Singular", reason: "the can" },
-  { match: "#FirstName #Acronym? (#Possessive && #LastName)", tag: "Possessive", reason: "name-poss" },
-  { match: "#Organization+ #Possessive", tag: "Possessive", reason: "org-possessive" },
-  { match: "#Place+ #Possessive", tag: "Possessive", reason: "place-possessive" },
-  { match: "#Possessive #PresentTense #Particle?", notIf: "(#Gerund|her)", tag: "Noun", reason: "possessive-verb" },
-  { match: "(my|our|their|her|his|its) [(#Plural && #Actor)] #Noun", tag: "Possessive", reason: "my-dads" },
-  { match: "#Value of a [second]", group: 0, unTag: "Value", tag: "Singular", reason: "10th-of-a-second" },
-  { match: "#Value [seconds]", group: 0, unTag: "Value", tag: "Plural", reason: "10-seconds" },
-  { match: "in [#Infinitive]", group: 0, tag: "Singular", reason: "in-age" },
-  { match: "a [#Adjective] #Preposition", group: 0, tag: "Noun", reason: "a-minor-in" },
-  { match: "#Determiner [#Singular] said", group: 0, tag: "Actor", reason: "the-actor-said" },
-  { match: `#Determiner #Noun [${infNouns}] !(#Preposition|to|#Adverb)?`, group: 0, tag: "Noun", reason: "the-noun-sense" },
-  { match: "[#PresentTense] (of|by|for) (a|an|the) #Noun #Copula", group: 0, tag: "Plural", reason: "photographs-of" },
-  { match: "#Infinitive and [%Noun|Verb%]", group: 0, tag: "Infinitive", reason: "fight and win" },
-  { match: "#Noun and [#Verb] and #Noun", group: 0, tag: "Noun", reason: "peace-and-flowers" },
-  { match: "the #Cardinal [%Adj|Noun%]", group: 0, tag: "Noun", reason: "the-1992-classic" },
-  { match: "#Copula the [%Adj|Noun%] #Noun", group: 0, tag: "Adjective", reason: "the-premier-university" },
-  { match: "i #Verb [me] #Noun", group: 0, tag: "Possessive", reason: "scottish-me" },
-  { match: "[#PresentTense] (music|class|lesson|night|party|festival|league|ceremony)", group: 0, tag: "Noun", reason: "dance-music" }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/verbs/noun-gerund.js
-var noun_gerund_default2 = [
-  { match: "(this|that|the|a|an) [#Gerund #Infinitive]", group: 0, tag: "Singular", reason: "the-planning-process" },
-  { match: "(that|the) [#Gerund #PresentTense]", group: 0, ifNo: "#Copula", tag: "Plural", reason: "the-paving-stones" },
-  { match: "#Determiner [#Gerund] #Noun", group: 0, tag: "Adjective", reason: "the-gerund-noun" },
-  { match: `#Pronoun #Infinitive [#Gerund] #PresentTense`, group: 0, tag: "Noun", reason: "tipping-sucks" },
-  { match: "#Adjective [#Gerund]", group: 0, tag: "Noun", notIf: "(still|even|just)", reason: "early-warning" },
-  { match: "[#Gerund] #Adverb? not? #Copula", group: 0, tag: "Activity", reason: "gerund-copula" },
-  { match: "[#Gerund] #Modal", group: 0, tag: "Activity", reason: "gerund-modal" },
-  { match: "#Singular for [%Noun|Gerund%]", group: 0, tag: "Gerund", reason: "noun-for-gerund" },
-  { match: "#Comparative (for|at) [%Noun|Gerund%]", group: 0, tag: "Gerund", reason: "better-for-gerund" },
-  { match: "#PresentTense the [#Gerund]", group: 0, tag: "Noun", reason: "keep-the-touching" }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/verbs/verb-noun.js
-var verb_noun_default = [
-  { match: "#Infinitive (this|that|the) [#Infinitive]", group: 0, tag: "Noun", reason: "do-this-dance" },
-  { match: "#Gerund #Determiner [#Infinitive]", group: 0, tag: "Noun", reason: "running-a-show" },
-  { match: "#Determiner (only|further|just|more|backward) [#Infinitive]", group: 0, tag: "Noun", reason: "the-only-reason" },
-  { match: "(the|this|a|an) [#Infinitive] #Adverb? #Verb", group: 0, tag: "Noun", reason: "determiner5" },
-  { match: "#Determiner #Adjective #Adjective? [#Infinitive]", group: 0, tag: "Noun", reason: "a-nice-inf" },
-  { match: "#Determiner #Demonym [#PresentTense]", group: 0, tag: "Noun", reason: "mexican-train" },
-  { match: "#Adjective #Noun+ [#Infinitive] #Copula", group: 0, tag: "Noun", reason: "career-move" },
-  { match: "at some [#Infinitive]", group: 0, tag: "Noun", reason: "at-some-inf" },
-  { match: "(go|goes|went) to [#Infinitive]", group: 0, tag: "Noun", reason: "goes-to-verb" },
-  { match: "(a|an) #Adjective? #Noun [#Infinitive] (#Preposition|#Noun)", group: 0, tag: "Noun", reason: "a-noun-inf" },
-  { match: "(a|an) #Noun [#Infinitive]$", group: 0, tag: "Noun", reason: "a-noun-inf2" },
-  { match: "#Gerund #Adjective? for [#Infinitive]", group: 0, tag: "Noun", reason: "running-for" },
-  { match: "#Gerund #Adjective to [#Infinitive]", group: 0, tag: "Noun", reason: "running-to" },
-  { match: "about [#Infinitive]", group: 0, tag: "Singular", reason: "about-love" },
-  { match: "#Plural on [#Infinitive]", group: 0, tag: "Noun", reason: "on-stage" },
-  { match: "any [#Infinitive]", group: 0, tag: "Noun", reason: "any-charge" },
-  { match: "no [#Infinitive]", group: 0, tag: "Noun", reason: "no-doubt" },
-  { match: "number of [#PresentTense]", group: 0, tag: "Noun", reason: "number-of-x" },
-  { match: "(taught|teaches|learns|learned) [#PresentTense]", group: 0, tag: "Noun", reason: "teaches-x" },
-  { match: "(try|use|attempt|build|make) [#Verb #Particle?]", notIf: "(#Copula|#Noun|sure|fun|up)", group: 0, tag: "Noun", reason: "do-verb" },
-  { match: "^[#Infinitive] (is|was)", group: 0, tag: "Noun", reason: "checkmate-is" },
-  { match: "#Infinitive much [#Infinitive]", group: 0, tag: "Noun", reason: "get-much" },
-  { match: "[cause] #Pronoun #Verb", group: 0, tag: "Conjunction", reason: "cause-cuz" },
-  { match: "the #Singular [#Infinitive] #Noun", group: 0, tag: "Noun", notIf: "#Pronoun", reason: "cardio-dance" },
-  { match: "#Determiner #Modal [#Noun]", group: 0, tag: "PresentTense", reason: "should-smoke" },
-  { match: "(this|that) [#Plural]", group: 0, tag: "PresentTense", notIf: "#Preposition", reason: "this-verbs" },
-  {
-    match: "(let|make|made) (him|her|it|#Person|#Place|#Organization)+ [#Singular] (a|an|the|it)",
-    group: 0,
-    tag: "Infinitive",
-    reason: "let-him-glue"
-  },
-  { match: "#Verb (all|every|each|most|some|no) [#PresentTense]", notIf: "#Modal", group: 0, tag: "Noun", reason: "all-presentTense" },
-  { match: "(had|have|#PastTense) #Adjective [#PresentTense]", group: 0, tag: "Noun", notIf: "better", reason: "adj-presentTense" },
-  { match: "#Value #Adjective [#PresentTense]", group: 0, tag: "Noun", notIf: "#Copula", reason: "one-big-reason" },
-  { match: "#PastTense #Adjective+ [#PresentTense]", group: 0, tag: "Noun", notIf: "(#Copula|better)", reason: "won-wide-support" },
-  { match: "(many|few|several|couple) [#PresentTense]", group: 0, tag: "Noun", notIf: "#Copula", reason: "many-poses" },
-  { match: "#Determiner #Adverb #Adjective [%Noun|Verb%]", group: 0, tag: "Noun", notIf: "#Copula", reason: "very-big-dream" },
-  { match: "from #Noun to [%Noun|Verb%]", group: 0, tag: "Noun", reason: "start-to-finish" },
-  { match: "(for|with|of) #Noun (and|or|not) [%Noun|Verb%]", group: 0, tag: "Noun", notIf: "#Pronoun", reason: "for-food-and-gas" },
-  { match: "#Adjective #Adjective [#PresentTense]", group: 0, tag: "Noun", notIf: "#Copula", reason: "adorable-little-store" },
-  { match: "#Gerund #Adverb? #Comparative [#PresentTense]", group: 0, tag: "Noun", notIf: "#Copula", reason: "higher-costs" },
-  { match: "(#Noun && @hasComma) #Noun (and|or) [#PresentTense]", group: 0, tag: "Noun", notIf: "#Copula", reason: "noun-list" },
-  { match: "(many|any|some|several) [#PresentTense] for", group: 0, tag: "Noun", reason: "any-verbs-for" },
-  { match: `to #PresentTense #Noun [#PresentTense] #Preposition`, group: 0, tag: "Noun", reason: "gas-exchange" },
-  { match: `#PastTense (until|as|through|without) [#PresentTense]`, group: 0, tag: "Noun", reason: "waited-until-release" },
-  { match: `#Gerund like #Adjective? [#PresentTense]`, group: 0, tag: "Plural", reason: "like-hot-cakes" },
-  { match: `some #Adjective [#PresentTense]`, group: 0, tag: "Noun", reason: "some-reason" },
-  { match: `for some [#PresentTense]`, group: 0, tag: "Noun", reason: "for-some-reason" },
-  { match: `(same|some|the|that|a) kind of [#PresentTense]`, group: 0, tag: "Noun", reason: "some-kind-of" },
-  { match: `(same|some|the|that|a) type of [#PresentTense]`, group: 0, tag: "Noun", reason: "some-type-of" },
-  { match: `#Gerund #Adjective #Preposition [#PresentTense]`, group: 0, tag: "Noun", reason: "doing-better-for-x" },
-  { match: `(get|got|have) #Comparative [#PresentTense]`, group: 0, tag: "Noun", reason: "got-better-aim" },
-  { match: "whose [#PresentTense] #Copula", group: 0, tag: "Noun", reason: "whos-name-was" },
-  { match: `#PhrasalVerb #Particle #Preposition [#PresentTense]`, group: 0, tag: "Noun", reason: "given-up-on-x" },
-  { match: "there (are|were) #Adjective? [#PresentTense]", group: 0, tag: "Plural", reason: "there-are" },
-  { match: "#Value [#PresentTense] of", group: 0, notIf: "(one|1|#Copula|#Infinitive)", tag: "Plural", reason: "2-trains" },
-  { match: "[#PresentTense] (are|were) #Adjective", group: 0, tag: "Plural", reason: "compromises-are-possible" },
-  { match: "^[(hope|guess|thought|think)] #Pronoun #Verb", group: 0, tag: "Infinitive", reason: "suppose-i" },
-  { match: "#Possessive #Adjective [#Verb]", group: 0, tag: "Noun", notIf: "#Copula", reason: "our-full-support" },
-  { match: "[(tastes|smells)] #Adverb? #Adjective", group: 0, tag: "PresentTense", reason: "tastes-good" },
-  { match: "#Copula #Gerund [#PresentTense] !by?", group: 0, tag: "Noun", notIf: "going", reason: "ignoring-commute" },
-  { match: "#Determiner #Adjective? [(shed|thought|rose|bid|saw|spelt)]", group: 0, tag: "Noun", reason: "noun-past" },
-  { match: "how to [%Noun|Verb%]", group: 0, tag: "Infinitive", reason: "how-to-noun" },
-  { match: "which [%Noun|Verb%] #Noun", group: 0, tag: "Infinitive", reason: "which-boost-it" },
-  { match: "#Gerund [%Plural|Verb%]", group: 0, tag: "Plural", reason: "asking-questions" },
-  { match: "(ready|available|difficult|hard|easy|made|attempt|try) to [%Noun|Verb%]", group: 0, tag: "Infinitive", reason: "ready-to-noun" },
-  { match: "(bring|went|go|drive|run|bike) to [%Noun|Verb%]", group: 0, tag: "Noun", reason: "bring-to-noun" },
-  { match: "#Modal #Noun [%Noun|Verb%]", group: 0, tag: "Infinitive", reason: "would-you-look" },
-  { match: "#Copula just [#Infinitive]", group: 0, tag: "Noun", reason: "is-just-spam" },
-  { match: "^%Noun|Verb% %Plural|Verb%", tag: "Imperative #Plural", reason: "request-copies" },
-  { match: "#Adjective #Plural and [%Plural|Verb%]", group: 0, tag: "#Plural", reason: "pickles-and-drinks" },
-  { match: "#Determiner #Year [#Verb]", group: 0, tag: "Noun", reason: "the-1968-film" },
-  { match: "#Determiner [#PhrasalVerb #Particle]", group: 0, tag: "Noun", reason: "the-break-up" },
-  { match: "#Determiner [%Adj|Noun%] #Noun", group: 0, tag: "Adjective", notIf: "(#Pronoun|#Possessive|#ProperNoun)", reason: "the-individual-goals" },
-  { match: "[%Noun|Verb%] or #Infinitive", group: 0, tag: "Infinitive", reason: "work-or-prepare" },
-  { match: "to #Infinitive [#PresentTense]", group: 0, tag: "Noun", notIf: "(#Gerund|#Copula|help)", reason: "to-give-thanks" }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/numbers/money.js
-var money_default = [
-  { match: "#Money and #Money #Currency?", tag: "Money", reason: "money-and-money" },
-  { match: "#Value #Currency [and] #Value (cents|ore|centavos|sens)", group: 0, tag: "money", reason: "and-5-cents" },
-  { match: "#Value (mark|rand|won|rub|ore)", tag: "#Money #Currency", reason: "4 mark" }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/numbers/fractions.js
-var fractions_default = [
-  { match: "[(half|quarter)] of? (a|an)", group: 0, tag: "Fraction", reason: "millionth" },
-  { match: "#Adverb [half]", group: 0, tag: "Fraction", reason: "nearly-half" },
-  { match: "[half] the", group: 0, tag: "Fraction", reason: "half-the" },
-  { match: "#Cardinal and a half", tag: "Fraction", reason: "and-a-half" },
-  { match: "#Value (halves|halfs|quarters)", tag: "Fraction", reason: "two-halves" },
-  { match: "a #Ordinal", tag: "Fraction", reason: "a-quarter" },
-  { match: "[#Cardinal+] (#Fraction && /s$/)", tag: "Fraction", reason: "seven-fifths" },
-  { match: "[#Cardinal+ #Ordinal] of .", group: 0, tag: "Fraction", reason: "ordinal-of" },
-  { match: "[(#NumericValue && #Ordinal)] of .", group: 0, tag: "Fraction", reason: "num-ordinal-of" },
-  { match: "(a|one) #Cardinal?+ #Ordinal", tag: "Fraction", reason: "a-ordinal" },
-  { match: "#Cardinal+ out? of every? #Cardinal", tag: "Fraction", reason: "out-of" }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/numbers/numbers.js
-var numbers_default = [
-  { match: `#Cardinal [second]`, tag: "Unit", reason: "one-second" },
-  {
-    match: "!once? [(a|an)] (#Duration|hundred|thousand|million|billion|trillion)",
-    group: 0,
-    tag: "Value",
-    reason: "a-is-one"
-  },
-  { match: "1 #Value #PhoneNumber", tag: "PhoneNumber", reason: "1-800-Value" },
-  { match: "#NumericValue #PhoneNumber", tag: "PhoneNumber", reason: "(800) PhoneNumber" },
-  { match: "#Demonym #Currency", tag: "Currency", reason: "demonym-currency" },
-  { match: "#Value [(buck|bucks|grand)]", group: 0, tag: "Currency", reason: "value-bucks" },
-  { match: "[#Value+] #Currency", group: 0, tag: "Money", reason: "15 usd" },
-  { match: "[second] #Noun", group: 0, tag: "Ordinal", reason: "second-noun" },
-  { match: "#Value+ [#Currency]", group: 0, tag: "Unit", reason: "5-yan" },
-  { match: "#Value [(foot|feet)]", group: 0, tag: "Unit", reason: "foot-unit" },
-  { match: "#Value [#Abbreviation]", group: 0, tag: "Unit", reason: "value-abbr" },
-  { match: "#Value [k]", group: 0, tag: "Unit", reason: "value-k" },
-  { match: "#Unit an hour", tag: "Unit", reason: "unit-an-hour" },
-  { match: "(minus|negative) #Value", tag: "Value", reason: "minus-value" },
-  { match: "#Value (point|decimal) #Value", tag: "Value", reason: "value-point-value" },
-  { match: "#Determiner [(half|quarter)] #Ordinal", group: 0, tag: "Value", reason: "half-ordinal" },
-  { match: `#Multiple+ and #Value`, tag: "Value", reason: "magnitude-and-value" },
-  { match: "#Value #Unit [(per|an) (hr|hour|sec|second|min|minute)]", group: 0, tag: "Unit", reason: "12-miles-per-second" },
-  { match: "#Value [(square|cubic)] #Unit", group: 0, tag: "Unit", reason: "square-miles" }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/person/person-phrase.js
-var person_phrase_default = [
-  { match: "#Copula [(#Noun|#PresentTense)] #LastName", group: 0, tag: "FirstName", reason: "copula-noun-lastname" },
-  { match: "(sister|pope|brother|father|aunt|uncle|grandpa|grandfather|grandma) #ProperNoun", tag: "Person", reason: "lady-titlecase", safe: true },
-  { match: "#FirstName [#Determiner #Noun] #LastName", group: 0, tag: "Person", reason: "first-noun-last" },
-  {
-    match: "#ProperNoun (b|c|d|e|f|g|h|j|k|l|m|n|o|p|q|r|s|t|u|v|w|x|y|z) #ProperNoun",
-    tag: "Person",
-    reason: "titlecase-acronym-titlecase",
-    safe: true
-  },
-  { match: "#Acronym #LastName", tag: "Person", reason: "acronym-lastname", safe: true },
-  { match: "#Person (jr|sr|md)", tag: "Person", reason: "person-honorific" },
-  { match: "#Honorific #Acronym", tag: "Person", reason: "Honorific-TitleCase" },
-  { match: "#Person #Person the? #RomanNumeral", tag: "Person", reason: "roman-numeral" },
-  { match: "#FirstName [/^[^aiurck]$/]", group: 0, tag: ["Acronym", "Person"], reason: "john-e" },
-  { match: "#Noun van der? #Noun", tag: "Person", reason: "van der noun", safe: true },
-  { match: "(king|queen|prince|saint|lady) of #Noun", tag: "Person", reason: "king-of-noun", safe: true },
-  { match: "(prince|lady) #Place", tag: "Person", reason: "lady-place" },
-  { match: "(king|queen|prince|saint) #ProperNoun", tag: "Person", reason: "saint-foo" },
-  { match: "al (#Person|#ProperNoun)", tag: "Person", reason: "al-borlen", safe: true },
-  { match: "#FirstName de #Noun", tag: "Person", reason: "bill-de-noun" },
-  { match: "#FirstName (bin|al) #Noun", tag: "Person", reason: "bill-al-noun" },
-  { match: "#FirstName #Acronym #ProperNoun", tag: "Person", reason: "bill-acronym-title" },
-  { match: "#FirstName #FirstName #ProperNoun", tag: "Person", reason: "bill-firstname-title" },
-  { match: "(#Honorific|#Actor) #FirstName? #ProperNoun", tag: "Person", reason: "dr-john-Title" },
-  { match: "#FirstName the #Adjective", tag: "Person", reason: "name-the-great" },
-  { match: "#ProperNoun (van|al|bin) #ProperNoun", tag: "Person", reason: "title-van-title", safe: true },
-  { match: "#ProperNoun (de|du) la? #ProperNoun", tag: "Person", reason: "title-de-title" },
-  { match: "#Singular #Acronym #LastName", tag: "#FirstName #Person .", reason: "title-acro-noun", safe: true },
-  { match: "[#ProperNoun] #Person", group: 0, tag: "Person", reason: "proper-person", safe: true },
-  { match: "#Person [#ProperNoun #ProperNoun]", group: 0, tag: "Person", notIf: "#Possessive", reason: "three-name-person", safe: true },
-  { match: "#FirstName #Acronym? [#ProperNoun]", group: 0, tag: "LastName", notIf: "#Possessive", reason: "firstname-titlecase" },
-  { match: "#FirstName [#FirstName]", group: 0, tag: "LastName", reason: "firstname-firstname" },
-  { match: "#FirstName #Acronym #Noun", tag: "Person", reason: "n-acro-noun", safe: true },
-  { match: "#FirstName [(de|di|du|van|von)] #Person", group: 0, tag: "LastName", reason: "de-firstname" },
-  { match: "[(private|general|major|rear|prime|field|count|miss)] #Honorific? #Person", group: 0, tag: ["Honorific", "Person"], reason: "ambg-honorifics" },
-  { match: "#Honorific #FirstName [#Singular]", group: 0, tag: "LastName", notIf: "#Possessive", reason: "dr-john-foo", safe: true },
-  { match: "[(his|her) (majesty|honour|worship|excellency|honorable)] #Person", group: 0, tag: "Honorific", reason: "his-excellency" },
-  { match: "#Honorific #Actor", tag: "Honorific", reason: "Lieutenant colonel" },
-  { match: "(first|second|third|1st|2nd|3rd) #Actor", tag: "Honorific", reason: "first lady" }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/person/ambig-name.js
-var personAdj = "(misty|rusty|dusty|rich|randy|sandy|young|earnest|frank|brown)";
-var ambig_name_default = [
-  { match: "%Person|Date% #Acronym? #ProperNoun", tag: "Person", reason: "jan-thierson" },
-  { match: "%Person|Noun% #Acronym? #ProperNoun", tag: "Person", reason: "switch-person", safe: true },
-  { match: "%Person|Noun% #Organization", tag: "Organization", reason: "olive-garden" },
-  { match: "%Person|Verb% #Acronym? #ProperNoun", tag: "Person", reason: "verb-propernoun" },
-  { match: `[%Person|Verb%] (will|had|has|said|says|told|did|learned|wants|wanted)`, group: 0, tag: "Person", reason: "person-said" },
-  { match: `[%Person|Place%] (harbor|harbour|pier|town|city|place|dump|landfill)`, group: 0, tag: "Place", reason: "sydney-harbour" },
-  { match: `(west|east|north|south) [%Person|Place%]`, group: 0, tag: "Place", reason: "east-sydney" },
-  { match: `${personAdj} #Person`, tag: "Person", reason: "randy-smith" },
-  { match: `${personAdj} #Acronym? #ProperNoun`, tag: "Person", reason: "rusty-smith" },
-  { match: `#Adverb [${personAdj}]`, group: 0, tag: "Adjective", reason: "really-rich" },
-  { match: `#Modal [%Person|Verb%]`, group: 0, tag: "Verb", reason: "would-mark" },
-  { match: `#Adverb [%Person|Verb%]`, group: 0, tag: "Verb", reason: "really-mark" },
-  { match: `[%Person|Verb%] (#Adverb|#Comparative)`, group: 0, tag: "Verb", reason: "drew-closer" },
-  { match: `%Person|Verb% #Person`, tag: "Person", reason: "rob-smith" },
-  { match: `%Person|Verb% #Acronym #ProperNoun`, tag: "Person", reason: "rob-a-smith" },
-  { match: "[will] #Verb", group: 0, tag: "Modal", reason: "will-verb" },
-  { match: "(will && @isTitleCase) #ProperNoun", tag: "Person", reason: "will-name" }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/verbs/verbs.js
-var verbs_default3 = [
-  {
-    match: "#Copula (pretty|dead|full|well|sure) (#Adjective|#Noun)",
-    tag: "#Copula #Adverb #Adjective",
-    reason: "sometimes-adverb"
-  },
-  { match: "(#Pronoun|#Person) (had|#Adverb)? [better] #PresentTense", group: 0, tag: "Modal", reason: "i-better" },
-  { match: "(#Modal|i|they|we|do) not? [like]", group: 0, tag: "PresentTense", reason: "modal-like" },
-  { match: "#Noun #Adverb? [left]", group: 0, tag: "PastTense", reason: "left-verb" },
-  { match: "will #Adverb? not? #Adverb? [be] #Gerund", group: 0, tag: "Copula", reason: "will-be-copula" },
-  { match: "will #Adverb? not? #Adverb? [be] #Adjective", group: 0, tag: "Copula", reason: "be-copula" },
-  { match: "[march] (up|down|back|toward)", notIf: "#Date", group: 0, tag: "Infinitive", reason: "march-to" },
-  { match: "#Modal [march]", group: 0, tag: "Infinitive", reason: "must-march" },
-  { match: `[may] be`, group: 0, tag: "Verb", reason: "may-be" },
-  { match: `[(subject|subjects|subjected)] to`, group: 0, tag: "Verb", reason: "subject to" },
-  { match: `[home] to`, group: 0, tag: "PresentTense", reason: "home to" },
-  { match: "[open] #Determiner", group: 0, tag: "Infinitive", reason: "open-the" },
-  { match: `(were|was) being [#PresentTense]`, group: 0, tag: "PastTense", reason: "was-being" },
-  { match: `(had|has|have) [been /en$/]`, group: 0, tag: "Auxiliary Participle", reason: "had-been-broken" },
-  { match: `(had|has|have) [been /ed$/]`, group: 0, tag: "Auxiliary PastTense", reason: "had-been-smoked" },
-  { match: `(had|has) #Adverb? [been] #Adverb? #PastTense`, group: 0, tag: "Auxiliary", reason: "had-been-adj" },
-  { match: `(had|has) to [#Noun] (#Determiner|#Possessive)`, group: 0, tag: "Infinitive", reason: "had-to-noun" },
-  { match: `have [#PresentTense]`, group: 0, tag: "PastTense", notIf: "(come|gotten)", reason: "have-read" },
-  { match: `(does|will|#Modal) that [work]`, group: 0, tag: "PastTense", reason: "does-that-work" },
-  { match: `[(sound|sounds)] #Adjective`, group: 0, tag: "PresentTense", reason: "sounds-fun" },
-  { match: `[(look|looks)] #Adjective`, group: 0, tag: "PresentTense", reason: "looks-good" },
-  { match: `[(need|needs)] to #Infinitive`, group: 0, tag: "PresentTense", reason: "need-to-learn" },
-  { match: `[(start|starts|stop|stops|begin|begins)] #Gerund`, group: 0, tag: "Verb", reason: "starts-thinking" },
-  { match: `(have|had) read`, tag: "Modal #PastTense", reason: "read-read" },
-  {
-    match: `(is|was|were) [(under|over) #PastTense]`,
-    group: 0,
-    tag: "Adverb Adjective",
-    reason: "was-under-cooked"
-  },
-  { match: "[shit] (#Determiner|#Possessive|them)", group: 0, tag: "Verb", reason: "swear1-verb" },
-  { match: "[damn] (#Determiner|#Possessive|them)", group: 0, tag: "Verb", reason: "swear2-verb" },
-  { match: "[fuck] (#Determiner|#Possessive|them)", group: 0, tag: "Verb", reason: "swear3-verb" },
-  { match: "#Plural that %Noun|Verb%", tag: ". #Preposition #Infinitive", reason: "jobs-that-work" },
-  { match: "[works] for me", group: 0, tag: "PresentTense", reason: "works-for-me" },
-  { match: "as #Pronoun [please]", group: 0, tag: "Infinitive", reason: "as-we-please" },
-  { match: "[(co|mis|de|inter|intra|pre|re|un|out|under|over|counter)] #Verb", group: 0, tag: ["Verb", "Prefix"], notIf: "(#Copula|#PhrasalVerb)", reason: "co-write" },
-  { match: "#PastTense and [%Adj|Past%]", group: 0, tag: "PastTense", reason: "dressed-and-left" },
-  { match: "[%Adj|Past%] and #PastTense", group: 0, tag: "PastTense", reason: "dressed-and-left" }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/verbs/auxiliary.js
-var auxiliary_default = [
-  { match: `will (#Adverb|not)+? [have] (#Adverb|not)+? #Verb`, group: 0, tag: "Auxiliary", reason: "will-have-vb" },
-  { match: `[#Copula] (#Adverb|not)+? (#Gerund|#PastTense)`, group: 0, tag: "Auxiliary", reason: "copula-walking" },
-  { match: `[(#Modal|did)+] (#Adverb|not)+? #Verb`, group: 0, tag: "Auxiliary", reason: "modal-verb" },
-  { match: `#Modal (#Adverb|not)+? [have] (#Adverb|not)+? [had] (#Adverb|not)+? #Verb`, group: 0, tag: "Auxiliary", reason: "would-have" },
-  { match: `[(has|had)] (#Adverb|not)+? #PastTense`, group: 0, tag: "Auxiliary", reason: "had-walked" },
-  { match: "[(do|does|did|will|have|had|has|got)] (not|#Adverb)+? #Verb", group: 0, tag: "Auxiliary", reason: "have-had" },
-  { match: "[about to] #Adverb? #Verb", group: 0, tag: ["Auxiliary", "Verb"], reason: "about-to" },
-  { match: `#Modal (#Adverb|not)+? [be] (#Adverb|not)+? #Verb`, group: 0, tag: "Auxiliary", reason: "would-be" },
-  { match: `[(#Modal|had|has)] (#Adverb|not)+? [been] (#Adverb|not)+? #Verb`, group: 0, tag: "Auxiliary", reason: "had-been" },
-  { match: "[(be|being|been)] #Participle", group: 0, tag: "Auxiliary", reason: "being-driven" },
-  { match: "[may] #Adverb? #Infinitive", group: 0, tag: "Auxiliary", reason: "may-want" },
-  { match: "#Copula (#Adverb|not)+? [(be|being|been)] #Adverb+? #PastTense", group: 0, tag: "Auxiliary", reason: "being-walked" },
-  { match: "will [be] #PastTense", group: 0, tag: "Auxiliary", reason: "will-be-x" },
-  { match: "[(be|been)] (#Adverb|not)+? #Gerund", group: 0, tag: "Auxiliary", reason: "been-walking" },
-  { match: "[used to] #PresentTense", group: 0, tag: "Auxiliary", reason: "used-to-walk" },
-  { match: "#Copula (#Adverb|not)+? [going to] #Adverb+? #PresentTense", group: 0, tag: "Auxiliary", reason: "going-to-walk" },
-  { match: "#Imperative [(me|him|her)]", group: 0, tag: "Reflexive", reason: "tell-him" },
-  { match: "(is|was) #Adverb? [no]", group: 0, tag: "Negative", reason: "is-no" },
-  { match: "[(been|had|became|came)] #PastTense", group: 0, notIf: "#PhrasalVerb", tag: "Auxiliary", reason: "been-told" },
-  { match: "[(being|having|getting)] #Verb", group: 0, tag: "Auxiliary", reason: "being-born" },
-  { match: "[be] #Gerund", group: 0, tag: "Auxiliary", reason: "be-walking" },
-  { match: "[better] #PresentTense", group: 0, tag: "Modal", notIf: "(#Copula|#Gerund)", reason: "better-go" },
-  { match: "even better", tag: "Adverb #Comparative", reason: "even-better" }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/verbs/phrasal.js
-var phrasal_default = [
-  { match: "(#Verb && @hasHyphen) up", tag: "PhrasalVerb", reason: "foo-up" },
-  { match: "(#Verb && @hasHyphen) off", tag: "PhrasalVerb", reason: "foo-off" },
-  { match: "(#Verb && @hasHyphen) over", tag: "PhrasalVerb", reason: "foo-over" },
-  { match: "(#Verb && @hasHyphen) out", tag: "PhrasalVerb", reason: "foo-out" },
-  {
-    match: "[#Verb (in|out|up|down|off|back)] (on|in)",
-    notIf: "#Copula",
-    tag: "PhrasalVerb Particle",
-    reason: "walk-in-on"
-  },
-  { match: "(lived|went|crept|go) [on] for", group: 0, tag: "PhrasalVerb", reason: "went-on" },
-  { match: "#Verb (up|down|in|on|for)$", tag: "PhrasalVerb #Particle", notIf: "#PhrasalVerb", reason: "come-down$" },
-  { match: "help [(stop|end|make|start)]", group: 0, tag: "Infinitive", reason: "help-stop" },
-  { match: "[(stop|start|finish|help)] #Gerund", group: 0, tag: "Infinitive", reason: "start-listening" },
-  {
-    match: "#Verb (him|her|it|us|himself|herself|itself|everything|something) [(up|down)]",
-    group: 0,
-    tag: "Adverb",
-    reason: "phrasal-pronoun-advb"
-  }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/verbs/imperative.js
-var notIf2 = "(i|we|they)";
-var imperative_default2 = [
-  { match: "^do not? [#Infinitive #Particle?]", notIf: notIf2, group: 0, tag: "Imperative", reason: "do-eat" },
-  { match: "^please do? not? [#Infinitive #Particle?]", group: 0, tag: "Imperative", reason: "please-go" },
-  { match: "^just do? not? [#Infinitive #Particle?]", group: 0, tag: "Imperative", reason: "just-go" },
-  { match: "^[#Infinitive] it #Comparative", notIf: notIf2, group: 0, tag: "Imperative", reason: "do-it-better" },
-  { match: "^[#Infinitive] it (please|now|again|plz)", notIf: notIf2, group: 0, tag: "Imperative", reason: "do-it-please" },
-  { match: "^[#Infinitive] (#Adjective|#Adverb)$", group: 0, tag: "Imperative", notIf: "(so|such|rather|enough)", reason: "go-quickly" },
-  { match: "^[#Infinitive] (up|down|over) #Determiner", group: 0, tag: "Imperative", reason: "turn-down" },
-  { match: "^[#Infinitive] (your|my|the|a|an|any|each|every|some|more|with|on)", group: 0, notIf: "like", tag: "Imperative", reason: "eat-my-shorts" },
-  { match: "^[#Infinitive] (him|her|it|us|me|there)", group: 0, tag: "Imperative", reason: "tell-him" },
-  { match: "^[#Infinitive] #Adjective #Noun$", group: 0, tag: "Imperative", reason: "avoid-loud-noises" },
-  { match: "^[#Infinitive] (#Adjective|#Adverb)? and #Infinitive", group: 0, tag: "Imperative", reason: "call-and-reserve" },
-  { match: "^(go|stop|wait|hurry) please?$", tag: "Imperative", reason: "go" },
-  { match: "^(somebody|everybody) [#Infinitive]", group: 0, tag: "Imperative", reason: "somebody-call" },
-  { match: "^let (us|me) [#Infinitive]", group: 0, tag: "Imperative", reason: "lets-leave" },
-  { match: "^[(shut|close|open|start|stop|end|keep)] #Determiner #Noun", group: 0, tag: "Imperative", reason: "shut-the-door" },
-  { match: "^[go] to .", group: 0, tag: "Imperative", reason: "go-to-toronto" },
-  { match: "^#Modal you [#Infinitive]", group: 0, tag: "Imperative", reason: "would-you-" },
-  { match: "^never [#Infinitive]", group: 0, tag: "Imperative", reason: "never-stop" },
-  { match: "^come #Infinitive", tag: "Imperative", notIf: "on", reason: "come-have" },
-  { match: "^come and? #Infinitive", tag: "Imperative . Imperative", notIf: "#PhrasalVerb", reason: "come-and-have" },
-  { match: "^stay (out|away|back)", tag: "Imperative", reason: "stay-away" },
-  { match: "^[(stay|be|keep)] #Adjective", group: 0, tag: "Imperative", reason: "stay-cool" },
-  { match: "^[keep it] #Adjective", group: 0, tag: "Imperative", reason: "keep-it-cool" },
-  { match: "^do not [#Infinitive]", group: 0, tag: "Imperative", reason: "do-not-be" },
-  { match: "[#Infinitive] (yourself|yourselves)", group: 0, tag: "Imperative", reason: "allow-yourself" },
-  { match: "[#Infinitive] what .", group: 0, tag: "Imperative", reason: "look-what" },
-  { match: "^[#Infinitive] #Gerund", group: 0, tag: "Imperative", reason: "keep-playing" },
-  { match: "^[#Infinitive] (to|for|into|toward|here|there)", group: 0, tag: "Imperative", reason: "go-to" },
-  { match: "^[#Infinitive] (and|or) #Infinitive", group: 0, tag: "Imperative", reason: "inf-and-inf" },
-  { match: "^[%Noun|Verb%] to", group: 0, tag: "Imperative", reason: "commit-to" },
-  { match: "^[#Infinitive] #Adjective? #Singular #Singular", group: 0, tag: "Imperative", reason: "maintain-eye-contact" },
-  { match: "do not (forget|omit|neglect) to [#Infinitive]", group: 0, tag: "Imperative", reason: "do-not-forget" }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/verbs/adj-gerund.js
-var adj_gerund_default3 = [
-  { match: "(that|which) were [%Adj|Gerund%]", group: 0, tag: "Gerund", reason: "that-were-growing" },
-  { match: "#Gerund [#Gerund] #Plural", group: 0, tag: "Adjective", reason: "hard-working-fam" }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/verbs/passive.js
-var passive_default = [
-  { match: "(got|were|was|is|are|am) (#PastTense|#Participle)", tag: "Passive", reason: "got-walked" },
-  { match: "(was|were|is|are|am) being (#PastTense|#Participle)", tag: "Passive", reason: "was-being" },
-  { match: "(had|have|has) been (#PastTense|#Participle)", tag: "Passive", reason: "had-been" },
-  { match: "will be being? (#PastTense|#Participle)", tag: "Passive", reason: "will-be-cleaned" },
-  { match: "#Noun [(#PastTense|#Participle)] by (the|a) #Noun", group: 0, tag: "Passive", reason: "suffered-by" }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/_misc.js
-var matches = [
-  { match: "u r", tag: "#Pronoun #Copula", reason: "u r" },
-  { match: "#Noun [(who|whom)]", group: 0, tag: "Determiner", reason: "captain-who" },
-  { match: "[had] #Noun+ #PastTense", group: 0, tag: "Condition", reason: "had-he" },
-  { match: "[were] #Noun+ to #Infinitive", group: 0, tag: "Condition", reason: "were-he" },
-  { match: "some sort of", tag: "Adjective Noun Conjunction", reason: "some-sort-of" },
-  { match: "of some sort", tag: "Conjunction Adjective Noun", reason: "of-some-sort" },
-  { match: "[such] (a|an|is)? #Noun", group: 0, tag: "Determiner", reason: "such-skill" },
-  { match: "[right] (before|after|in|into|to|toward)", group: 0, tag: "#Adverb", reason: "right-into" },
-  { match: "#Preposition [about]", group: 0, tag: "Adjective", reason: "at-about" },
-  { match: "(are|#Modal|see|do|for) [ya]", group: 0, tag: "Pronoun", reason: "are-ya" },
-  { match: "[long live] .", group: 0, tag: "#Adjective #Infinitive", reason: "long-live" },
-  { match: "[plenty] of", group: 0, tag: "#Uncountable", reason: "plenty-of" },
-  { match: "(always|nearly|barely|practically) [there]", group: 0, tag: "Adjective", reason: "always-there" },
-  { match: "[there] (#Adverb|#Pronoun)? #Copula", group: 0, tag: "There", reason: "there-is" },
-  { match: "#Copula [there] .", group: 0, tag: "There", reason: "is-there" },
-  { match: "#Modal #Adverb? [there]", group: 0, tag: "There", reason: "should-there" },
-  { match: "^[do] (you|we|they)", group: 0, tag: "QuestionWord", reason: "do-you" },
-  { match: "^[does] (he|she|it|#ProperNoun)", group: 0, tag: "QuestionWord", reason: "does-he" },
-  { match: "a [while]", group: 0, tag: "Noun", reason: "a-while" },
-  { match: "guess who", tag: "#Infinitive #QuestionWord", reason: "guess-who" }
-];
-var misc_default4 = matches;
-
-// node_modules/compromise/src/2-two/postTagger/model/orgs/organizations.js
-var organizations_default2 = [
-  { match: "#Noun (&|n) #Noun", tag: "Organization", reason: "Noun-&-Noun" },
-  { match: "#Organization of the? #ProperNoun", tag: "Organization", reason: "org-of-place", safe: true },
-  { match: "#Organization #Country", tag: "Organization", reason: "org-country" },
-  { match: "#ProperNoun #Organization", tag: "Organization", reason: "titlecase-org" },
-  { match: "#ProperNoun (ltd|co|inc|dept|assn|bros)", tag: "Organization", reason: "org-abbrv" },
-  { match: "the [#Acronym]", group: 0, tag: "Organization", reason: "the-acronym", safe: true },
-  {
-    match: "(world|global|international|national|#Demonym) #Organization",
-    tag: "Organization",
-    reason: "global-org"
-  },
-  { match: "#Noun+ (public|private) school", tag: "School", reason: "noun-public-school" }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/nouns/places.js
-var places_default2 = [
-  {
-    match: "(west|north|south|east|western|northern|southern|eastern)+ #Place",
-    tag: "Region",
-    reason: "west-norfolk"
-  },
-  {
-    match: "#City [(al|ak|az|ar|ca|ct|dc|fl|ga|id|il|nv|nh|nj|ny|oh|pa|sc|tn|tx|ut|vt|pr)]",
-    group: 0,
-    tag: "Region",
-    reason: "us-state"
-  },
-  {
-    match: "portland [or]",
-    group: 0,
-    tag: "Region",
-    reason: "portland-or"
-  },
-  {
-    match: "#ProperNoun+ (district|region|province|county|prefecture|municipality|territory|burough|reservation)",
-    tag: "Region",
-    reason: "foo-district"
-  },
-  {
-    match: "(district|region|province|municipality|territory|burough|state) of #ProperNoun",
-    tag: "Region",
-    reason: "district-of-Foo"
-  },
-  {
-    match: "in [#ProperNoun] #Place",
-    group: 0,
-    tag: "Place",
-    reason: "propernoun-place"
-  },
-  {
-    match: "#Value #Noun (st|street|rd|road|crescent|cr|way|tr|terrace|avenue|ave)",
-    tag: "Address",
-    reason: "address-st"
-  }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/conjunctions.js
-var conjunctions_default = [
-  { match: "[so] #Noun", group: 0, tag: "Conjunction", reason: "so-conj" },
-  {
-    match: "[(who|what|where|why|how|when)] #Noun #Copula #Adverb? (#Verb|#Adjective)",
-    group: 0,
-    tag: "Conjunction",
-    reason: "how-he-is-x"
-  },
-  { match: "#Copula [(who|what|where|why|how|when)] #Noun", group: 0, tag: "Conjunction", reason: "when-he" },
-  { match: "#Verb [that] #Pronoun", group: 0, tag: "Conjunction", reason: "said-that-he" },
-  { match: "#Noun [that] #Copula", group: 0, tag: "Conjunction", reason: "that-are" },
-  { match: "#Noun [that] #Verb #Adjective", group: 0, tag: "Conjunction", reason: "that-seem" },
-  { match: "#Noun #Copula not? [that] #Adjective", group: 0, tag: "Adverb", reason: "that-adj" },
-  { match: "#Verb #Adverb? #Noun [(that|which)]", group: 0, tag: "Preposition", reason: "that-prep" },
-  { match: "@hasComma [which] (#Pronoun|#Verb)", group: 0, tag: "Preposition", reason: "which-copula" },
-  { match: "#Noun [like] #Noun", group: 0, tag: "Preposition", reason: "noun-like" },
-  { match: "^[like] #Determiner", group: 0, tag: "Preposition", reason: "like-the" },
-  { match: "a #Noun [like] (#Noun|#Determiner)", group: 0, tag: "Preposition", reason: "a-noun-like" },
-  { match: "#Adverb [like]", group: 0, tag: "Verb", reason: "really-like" },
-  { match: "(not|nothing|never) [like]", group: 0, tag: "Preposition", reason: "nothing-like" },
-  { match: "#Infinitive #Pronoun [like]", group: 0, tag: "Preposition", reason: "treat-them-like" },
-  { match: "[#QuestionWord] (#Pronoun|#Determiner)", group: 0, tag: "Preposition", reason: "how-he" },
-  { match: "[#QuestionWord] #Participle", group: 0, tag: "Preposition", reason: "when-stolen" },
-  { match: "[how] (#Determiner|#Copula|#Modal|#PastTense)", group: 0, tag: "QuestionWord", reason: "how-is" },
-  { match: "#Plural [(who|which|when)] .", group: 0, tag: "Preposition", reason: "people-who" }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/expressions.js
-var expressions_default = [
-  { match: "holy (shit|fuck|hell)", tag: "Expression", reason: "swears-expression" },
-  { match: "^[(well|so|okay|now)] !#Adjective?", group: 0, tag: "Expression", reason: "well-" },
-  { match: "^come on", tag: "Expression", reason: "come-on" },
-  { match: "(say|says|said) [sorry]", group: 0, tag: "Expression", reason: "say-sorry" },
-  { match: "^(ok|alright|shoot|hell|anyways)", tag: "Expression", reason: "ok-" },
-  { match: "^(say && @hasComma)", tag: "Expression", reason: "say-" },
-  { match: "^(like && @hasComma)", tag: "Expression", reason: "like-" },
-  { match: "^[(dude|man|girl)] #Pronoun", group: 0, tag: "Expression", reason: "dude-i" }
-];
-
-// node_modules/compromise/src/2-two/postTagger/model/index.js
-var matches2 = [].concat(passive_default, adjective_default, adj_adverb_default, adj_gerund_default2, adj_noun_default2, adverb_default, date_default, date_phrase_default, nouns_default4, noun_gerund_default2, verb_noun_default, money_default, fractions_default, numbers_default, person_phrase_default, ambig_name_default, verbs_default3, adj_verb_default, auxiliary_default, phrasal_default, imperative_default2, adj_gerund_default3, misc_default4, organizations_default2, places_default2, conjunctions_default, expressions_default);
-var model_default4 = {
-  two: {
-    matches: matches2
-  }
-};
-
-// node_modules/compromise/src/2-two/postTagger/compute/index.js
-var net = null;
-var postTagger = function(view) {
-  const { world: world2 } = view;
-  const { model: model5, methods: methods16 } = world2;
-  net = net || methods16.one.buildNet(model5.two.matches, world2);
-  let document2 = methods16.two.quickSplit(view.document);
-  let ptrs = document2.map((terms) => {
-    let t2 = terms[0];
-    return [t2.index[0], t2.index[1], t2.index[1] + terms.length];
-  });
-  let m3 = view.update(ptrs);
-  m3.cache();
-  m3.sweep(net);
-  view.uncache();
-  return view;
-};
-var tagger2 = (view) => view.compute(["lexicon", "preTagger", "postTagger"]);
-var compute_default10 = { postTagger, tagger: tagger2 };
-
-// node_modules/compromise/src/2-two/postTagger/api.js
-var round = (n3) => Math.round(n3 * 100) / 100;
-function api_default11(View2) {
-  View2.prototype.confidence = function() {
-    let sum = 0;
-    let count = 0;
-    this.docs.forEach((terms) => {
-      terms.forEach((term) => {
-        count += 1;
-        sum += term.confidence || 1;
-      });
-    });
-    if (count === 0) {
-      return 1;
-    }
-    return round(sum / count);
-  };
-  View2.prototype.tagger = function() {
-    return this.compute(["tagger"]);
-  };
-}
-
-// node_modules/compromise/src/2-two/postTagger/plugin.js
-var plugin2 = {
-  api: api_default11,
-  compute: compute_default10,
-  model: model_default4,
-  hooks: ["postTagger"]
-};
-var plugin_default15 = plugin2;
-
-// node_modules/compromise/src/2-two/lazy/maybeMatch.js
-var getWords2 = function(net3) {
-  return Object.keys(net3.hooks).filter((w) => !w.startsWith("#") && !w.startsWith("%"));
-};
-var maybeMatch = function(doc, net3) {
-  let words = getWords2(net3);
-  if (words.length === 0) {
-    return doc;
-  }
-  if (!doc._cache) {
-    doc.cache();
-  }
-  let cache2 = doc._cache;
-  return doc.filter((_m, i3) => {
-    return words.some((str) => cache2[i3].has(str));
-  });
-};
-var maybeMatch_default = maybeMatch;
-
-// node_modules/compromise/src/2-two/lazy/lazyParse.js
-var lazyParse = function(input, reg) {
-  let net3 = reg;
-  if (typeof reg === "string") {
-    net3 = this.buildNet([{ match: reg }]);
-  }
-  let doc = this.tokenize(input);
-  let m3 = maybeMatch_default(doc, net3);
-  if (m3.found) {
-    m3.compute(["index", "tagger"]);
-    return m3.match(reg);
-  }
-  return doc.none();
-};
-var lazyParse_default = lazyParse;
-
-// node_modules/compromise/src/2-two/lazy/plugin.js
-var plugin_default16 = {
-  lib: {
-    lazy: lazyParse_default
-  }
-};
-
-// node_modules/compromise/src/2-two/swap/api/swap-verb.js
-var matchVerb = function(m3, lemma) {
-  const conjugate2 = m3.methods.two.transform.verb.conjugate;
-  let all4 = conjugate2(lemma, m3.model);
-  if (m3.has("#Gerund")) {
-    return all4.Gerund;
-  }
-  if (m3.has("#PastTense")) {
-    return all4.PastTense;
-  }
-  if (m3.has("#PresentTense")) {
-    return all4.PresentTense;
-  }
-  if (m3.has("#Gerund")) {
-    return all4.Gerund;
-  }
-  return lemma;
-};
-var swapVerb = function(vb3, lemma) {
-  let str = lemma;
-  vb3.forEach((m3) => {
-    if (!m3.has("#Infinitive")) {
-      str = matchVerb(m3, lemma);
-    }
-    m3.replaceWith(str);
-  });
-  return vb3;
-};
-var swap_verb_default = swapVerb;
-
-// node_modules/compromise/src/2-two/swap/api/swap.js
-var swapNoun = function(m3, lemma) {
-  let str = lemma;
-  if (m3.has("#Plural")) {
-    const toPlural = m3.methods.two.transform.noun.toPlural;
-    str = toPlural(lemma, m3.model);
-  }
-  m3.replaceWith(str);
-};
-var swapAdverb = function(m3, lemma) {
-  const { toAdverb: toAdverb2 } = m3.methods.two.transform.adjective;
-  let str = lemma;
-  let adv = toAdverb2(str);
-  if (adv) {
-    m3.replaceWith(adv);
-  }
-};
-var swapAdjective = function(m3, lemma) {
-  const { toComparative: toComparative3, toSuperlative: toSuperlative3 } = m3.methods.two.transform.adjective;
-  let str = lemma;
-  if (m3.has("#Comparative")) {
-    str = toComparative3(str, m3.model);
-  } else if (m3.has("#Superlative")) {
-    str = toSuperlative3(str, m3.model);
-  }
-  if (str) {
-    m3.replaceWith(str);
-  }
-};
-var swap = function(from, to, tag) {
-  let reg = from.split(/ /g).map((str) => `{${str}}`).join(" ");
-  let m3 = this.match(reg);
-  if (tag) {
-    m3 = m3.if(tag);
-  }
-  if (m3.has("#Verb")) {
-    return swap_verb_default(m3, to);
-  }
-  if (m3.has("#Noun")) {
-    return swapNoun(m3, to);
-  }
-  if (m3.has("#Adverb")) {
-    return swapAdverb(m3, to);
-  }
-  if (m3.has("#Adjective")) {
-    return swapAdjective(m3, to);
-  }
-  return this;
-};
-var swap_default = swap;
-
-// node_modules/compromise/src/2-two/swap/plugin.js
-var api4 = function(View2) {
-  View2.prototype.swap = swap_default;
-};
-var plugin_default17 = {
-  api: api4
-};
-
-// node_modules/compromise/src/two.js
-one_default.plugin(plugin_default13);
-one_default.plugin(plugin_default14);
-one_default.plugin(plugin_default15);
-one_default.plugin(plugin_default16);
-one_default.plugin(plugin_default17);
-var two_default = one_default;
-
-// node_modules/compromise/src/3-three/chunker/api/clauses.js
-var byComma = function(doc) {
-  let commas = doc.match("@hasComma");
-  commas = commas.filter((m3) => {
-    if (m3.growLeft(".").wordCount() === 1) {
-      return false;
-    }
-    if (m3.growRight(". .").wordCount() === 1) {
-      return false;
-    }
-    let more = m3.grow(".");
-    more = more.ifNo("@hasComma @hasComma");
-    more = more.ifNo("@hasComma (and|or) .");
-    more = more.ifNo("(#City && @hasComma) #Country");
-    more = more.ifNo("(#WeekDay && @hasComma) #Date");
-    more = more.ifNo("(#Date+ && @hasComma) #Value");
-    more = more.ifNo("(#Adjective && @hasComma) #Adjective");
-    return more.found;
-  });
-  return doc.splitAfter(commas);
-};
-var splitParentheses = function(doc) {
-  let matches3 = doc.parentheses();
-  matches3 = matches3.filter((m3) => {
-    return m3.wordCount() >= 3 && m3.has("#Verb") && m3.has("#Noun");
-  });
-  return doc.splitOn(matches3);
-};
-var splitQuotes = function(doc) {
-  let matches3 = doc.quotations();
-  matches3 = matches3.filter((m3) => {
-    return m3.wordCount() >= 3 && m3.has("#Verb") && m3.has("#Noun");
-  });
-  return doc.splitOn(matches3);
-};
-var clauses = function(n3) {
-  let found = this;
-  found = splitParentheses(found);
-  found = splitQuotes(found);
-  found = byComma(found);
-  found = found.splitAfter("(@hasEllipses|@hasSemicolon|@hasDash|@hasColon)");
-  found = found.splitAfter("^#Pronoun (said|says)");
-  found = found.splitBefore("(said|says) #ProperNoun$");
-  found = found.splitBefore(". . if .{4}");
-  found = found.splitBefore("and while");
-  found = found.splitBefore("now that");
-  found = found.splitBefore("ever since");
-  found = found.splitBefore("(supposing|although)");
-  found = found.splitBefore("even (while|if|though)");
-  found = found.splitBefore("(whereas|whose)");
-  found = found.splitBefore("as (though|if)");
-  found = found.splitBefore("(til|until)");
-  if (typeof n3 === "number") {
-    found = found.get(n3);
-  }
-  return found;
-};
-var clauses_default = clauses;
-
-// node_modules/compromise/src/3-three/chunker/api/chunks.js
-var chunks = function(doc) {
-  let carry = [];
-  let ptr = null;
-  let current = null;
-  doc.docs.forEach((terms) => {
-    terms.forEach((term) => {
-      if (term.chunk !== current) {
-        if (ptr) {
-          ptr[2] = term.index[1];
-          carry.push(ptr);
-        }
-        current = term.chunk;
-        ptr = [term.index[0], term.index[1]];
-      }
-    });
-  });
-  if (ptr) {
-    carry.push(ptr);
-  }
-  let parts = doc.update(carry);
-  parts = parts.map((c2) => {
-    if (c2.has("<Noun>")) {
-      return c2.nouns();
-    }
-    return c2;
-  });
-  return parts;
-};
-var chunks_default2 = chunks;
-
-// node_modules/compromise/src/3-three/chunker/api/api.js
-var api5 = function(View2) {
-  class Chunks extends View2 {
-    constructor(document2, pointer, groups) {
-      super(document2, pointer, groups);
-      this.viewType = "Chunks";
-    }
-    isVerb() {
-      return this.filter((c2) => c2.has("<Verb>"));
-    }
-    isNoun() {
-      return this.filter((c2) => c2.has("<Noun>"));
-    }
-    isAdjective() {
-      return this.filter((c2) => c2.has("<Adjective>"));
-    }
-    isPivot() {
-      return this.filter((c2) => c2.has("<Pivot>"));
-    }
-    debug() {
-      this.toView().debug("chunks");
-      return this;
-    }
-    update(pointer) {
-      let m3 = new Chunks(this.document, pointer);
-      m3._cache = this._cache;
-      return m3;
-    }
-  }
-  View2.prototype.chunks = function(n3) {
-    let m3 = chunks_default2(this);
-    m3 = m3.getNth(n3);
-    return new Chunks(this.document, m3.pointer);
-  };
-  View2.prototype.clauses = clauses_default;
-};
-var api_default12 = api5;
-
-// node_modules/compromise/src/3-three/chunker/compute/01-easy.js
-var byWord2 = {
-  this: "Noun",
-  then: "Pivot"
-};
-var easyMode = function(document2) {
-  for (let n3 = 0; n3 < document2.length; n3 += 1) {
-    for (let t2 = 0; t2 < document2[n3].length; t2 += 1) {
-      let term = document2[n3][t2];
-      if (byWord2.hasOwnProperty(term.normal) === true) {
-        term.chunk = byWord2[term.normal];
-        continue;
-      }
-      if (term.tags.has("Verb")) {
-        term.chunk = "Verb";
-        continue;
-      }
-      if (term.tags.has("Noun") || term.tags.has("Determiner")) {
-        term.chunk = "Noun";
-        continue;
-      }
-      if (term.tags.has("Value")) {
-        term.chunk = "Noun";
-        continue;
-      }
-      if (term.tags.has("QuestionWord")) {
-        term.chunk = "Pivot";
-        continue;
-      }
-    }
-  }
-};
-var easy_default = easyMode;
-
-// node_modules/compromise/src/3-three/chunker/compute/02-neighbours.js
-var byNeighbour = function(document2) {
-  for (let n3 = 0; n3 < document2.length; n3 += 1) {
-    for (let t2 = 0; t2 < document2[n3].length; t2 += 1) {
-      let term = document2[n3][t2];
-      if (term.chunk) {
-        continue;
-      }
-      let onRight = document2[n3][t2 + 1];
-      let onLeft = document2[n3][t2 - 1];
-      if (term.tags.has("Adjective")) {
-        if (onLeft && onLeft.tags.has("Copula")) {
-          term.chunk = "Adjective";
-          continue;
-        }
-        if (onLeft && onLeft.tags.has("Determiner")) {
-          term.chunk = "Noun";
-          continue;
-        }
-        if (onRight && onRight.tags.has("Noun")) {
-          term.chunk = "Noun";
-          continue;
-        }
-        continue;
-      }
-      if (term.tags.has("Adverb") || term.tags.has("Negative")) {
-        if (onLeft && onLeft.tags.has("Adjective")) {
-          term.chunk = "Adjective";
-          continue;
-        }
-        if (onLeft && onLeft.tags.has("Verb")) {
-          term.chunk = "Verb";
-          continue;
-        }
-        if (onRight && onRight.tags.has("Adjective")) {
-          term.chunk = "Adjective";
-          continue;
-        }
-        if (onRight && onRight.tags.has("Verb")) {
-          term.chunk = "Verb";
-          continue;
-        }
-      }
-    }
-  }
-};
-var neighbours_default3 = byNeighbour;
-
-// node_modules/compromise/src/3-three/chunker/compute/03-matcher.js
-var rules = [
-  { match: "[that] #Determiner #Noun", group: 0, chunk: "Pivot" },
-  { match: "#PastTense [that]", group: 0, chunk: "Pivot" },
-  { match: "[so] #Determiner", group: 0, chunk: "Pivot" },
-  { match: "#Copula #Adverb+? [#Adjective]", group: 0, chunk: "Adjective" },
-  { match: "#Adjective and #Adjective", chunk: "Adjective" },
-  { match: "#Adverb+ and #Adverb #Verb", chunk: "Verb" },
-  { match: "#Gerund #Adjective", chunk: "Verb" },
-  { match: "#Gerund to #Verb", chunk: "Verb" },
-  { match: "#PresentTense and #PresentTense", chunk: "Verb" },
-  { match: "#Adverb #Negative", chunk: "Verb" },
-  { match: "(want|wants|wanted) to #Infinitive", chunk: "Verb" },
-  { match: "#Verb #Reflexive", chunk: "Verb" },
-  { match: "#PresentTense [#Pronoun] #Determiner", group: 0, chunk: "Verb" },
-  { match: "#Verb [to] #Adverb? #Infinitive", group: 0, chunk: "Verb" },
-  { match: "[#Preposition] #Gerund", group: 0, chunk: "Verb" },
-  { match: "#Noun of #Determiner? #Noun", chunk: "Noun" },
-  { match: "#Noun in #Determiner? #Noun", chunk: "Noun" },
-  { match: "#Singular and #Determiner? #Singular", chunk: "Noun" }
-];
-var net2 = null;
-var matcher = function(view, _2, world2) {
-  const { methods: methods16 } = world2;
-  net2 = net2 || methods16.one.buildNet(rules, world2);
-  view.sweep(net2);
-};
-var matcher_default = matcher;
-
-// node_modules/compromise/src/3-three/chunker/compute/04-fallback.js
-var setChunk = function(term, chunk) {
-  const env2 = typeof process === "undefined" || !process.env ? self.env || {} : process.env;
-  if (env2.DEBUG_CHUNKS) {
-    let str = (term.normal + "'").padEnd(8);
-    console.log(`  | '${str}  \u2192  \x1B[34m${chunk.padEnd(12)}\x1B[0m \x1B[2m -fallback- \x1B[0m`);
-  }
-  term.chunk = chunk;
-};
-var fallback = function(document2) {
-  for (let n3 = 0; n3 < document2.length; n3 += 1) {
-    for (let t2 = 0; t2 < document2[n3].length; t2 += 1) {
-      let term = document2[n3][t2];
-      if (term.chunk === void 0) {
-        if (term.tags.has("Conjunction")) {
-          setChunk(term, "Pivot");
-        } else if (term.tags.has("Preposition")) {
-          setChunk(term, "Pivot");
-        } else if (term.tags.has("Adverb")) {
-          setChunk(term, "Verb");
-        } else {
-          term.chunk = "Noun";
-        }
-      }
-    }
-  }
-};
-var fallback_default2 = fallback;
-
-// node_modules/compromise/src/3-three/chunker/compute/05-fixUp.js
-var fixUp = function(docs) {
-  let byChunk = [];
-  let current = null;
-  docs.forEach((terms) => {
-    for (let i3 = 0; i3 < terms.length; i3 += 1) {
-      let term = terms[i3];
-      if (current && term.chunk === current) {
-        byChunk[byChunk.length - 1].terms.push(term);
-      } else {
-        byChunk.push({ chunk: term.chunk, terms: [term] });
-        current = term.chunk;
-      }
-    }
-  });
-  byChunk.forEach((c2) => {
-    if (c2.chunk === "Verb") {
-      const hasVerb = c2.terms.find((t2) => t2.tags.has("Verb"));
-      if (!hasVerb) {
-        c2.terms.forEach((t2) => t2.chunk = null);
-      }
-    }
-  });
-};
-var fixUp_default = fixUp;
-
-// node_modules/compromise/src/3-three/chunker/compute/index.js
-var findChunks = function(view) {
-  const { document: document2, world: world2 } = view;
-  easy_default(document2);
-  neighbours_default3(document2);
-  matcher_default(view, document2, world2);
-  fallback_default2(document2, world2);
-  fixUp_default(document2, world2);
-};
-var compute_default11 = { chunks: findChunks };
-
-// node_modules/compromise/src/3-three/chunker/plugin.js
-var plugin_default18 = {
-  compute: compute_default11,
-  api: api_default12,
-  hooks: ["chunks"]
-};
-
-// node_modules/compromise/src/3-three/misc/acronyms/index.js
-var hasPeriod = /\./g;
-var api6 = function(View2) {
-  class Acronyms extends View2 {
-    constructor(document2, pointer, groups) {
-      super(document2, pointer, groups);
-      this.viewType = "Acronyms";
-    }
-    strip() {
-      this.docs.forEach((terms) => {
-        terms.forEach((term) => {
-          term.text = term.text.replace(hasPeriod, "");
-          term.normal = term.normal.replace(hasPeriod, "");
-        });
-      });
-      return this;
-    }
-    addPeriods() {
-      this.docs.forEach((terms) => {
-        terms.forEach((term) => {
-          term.text = term.text.replace(hasPeriod, "");
-          term.normal = term.normal.replace(hasPeriod, "");
-          term.text = term.text.split("").join(".") + ".";
-          term.normal = term.normal.split("").join(".") + ".";
-        });
-      });
-      return this;
-    }
-  }
-  View2.prototype.acronyms = function(n3) {
-    let m3 = this.match("#Acronym");
-    m3 = m3.getNth(n3);
-    return new Acronyms(m3.document, m3.pointer);
-  };
-};
-var acronyms_default2 = api6;
-
-// node_modules/compromise/src/3-three/misc/adjectives/index.js
-var toRoot2 = function(adj) {
-  const { fromComparative: fromComparative3, fromSuperlative: fromSuperlative3 } = adj.methods.two.transform.adjective;
-  let str = adj.text("normal");
-  if (adj.has("#Comparative")) {
-    return fromComparative3(str, adj.model);
-  }
-  if (adj.has("#Superlative")) {
-    return fromSuperlative3(str, adj.model);
-  }
-  return str;
-};
-var api7 = function(View2) {
-  class Adjectives extends View2 {
-    constructor(document2, pointer, groups) {
-      super(document2, pointer, groups);
-      this.viewType = "Adjectives";
-    }
-    json(opts2 = {}) {
-      const { toAdverb: toAdverb2, toNoun: toNoun2, toSuperlative: toSuperlative3, toComparative: toComparative3 } = this.methods.two.transform.adjective;
-      opts2.normal = true;
-      return this.map((m3) => {
-        let json = m3.toView().json(opts2)[0] || {};
-        let str = toRoot2(m3);
-        json.adjective = {
-          adverb: toAdverb2(str),
-          noun: toNoun2(str),
-          superlative: toSuperlative3(str, this.model),
-          comparative: toComparative3(str, this.model)
-        };
-        return json;
-      }, []);
-    }
-    adverbs() {
-      return this.before("#Adverb+$").concat(this.after("^#Adverb+"));
-    }
-    conjugate(n3) {
-      const { toComparative: toComparative3, toSuperlative: toSuperlative3, toNoun: toNoun2, toAdverb: toAdverb2 } = this.methods.two.transform.adjective;
-      return this.getNth(n3).map((adj) => {
-        let root = toRoot2(adj);
-        return {
-          Adjective: root,
-          Comparative: toComparative3(root, this.model),
-          Superlative: toSuperlative3(root, this.model),
-          Noun: toNoun2(root, this.model),
-          Adverb: toAdverb2(root, this.model)
-        };
-      }, []);
-    }
-    toComparative(n3) {
-      const { toComparative: toComparative3 } = this.methods.two.transform.adjective;
-      return this.getNth(n3).map((adj) => {
-        let root = toRoot2(adj);
-        let str = toComparative3(root, this.model);
-        return adj.replaceWith(str);
-      });
-    }
-    toSuperlative(n3) {
-      const { toSuperlative: toSuperlative3 } = this.methods.two.transform.adjective;
-      return this.getNth(n3).map((adj) => {
-        let root = toRoot2(adj);
-        let str = toSuperlative3(root, this.model);
-        return adj.replaceWith(str);
-      });
-    }
-    toAdverb(n3) {
-      const { toAdverb: toAdverb2 } = this.methods.two.transform.adjective;
-      return this.getNth(n3).map((adj) => {
-        let root = toRoot2(adj);
-        let str = toAdverb2(root, this.model);
-        return adj.replaceWith(str);
-      });
-    }
-    toNoun(n3) {
-      const { toNoun: toNoun2 } = this.methods.two.transform.adjective;
-      return this.getNth(n3).map((adj) => {
-        let root = toRoot2(adj);
-        let str = toNoun2(root, this.model);
-        return adj.replaceWith(str);
-      });
-    }
-  }
-  View2.prototype.adjectives = function(n3) {
-    let m3 = this.match("#Adjective");
-    m3 = m3.getNth(n3);
-    return new Adjectives(m3.document, m3.pointer);
-  };
-  View2.prototype.superlatives = function(n3) {
-    let m3 = this.match("#Superlative");
-    m3 = m3.getNth(n3);
-    return new Adjectives(m3.document, m3.pointer);
-  };
-  View2.prototype.comparatives = function(n3) {
-    let m3 = this.match("#Comparative");
-    m3 = m3.getNth(n3);
-    return new Adjectives(m3.document, m3.pointer);
-  };
-};
-var adjectives_default2 = api7;
-
-// node_modules/compromise/src/3-three/misc/adverbs/index.js
-var api8 = function(View2) {
-  class Adverbs extends View2 {
-    constructor(document2, pointer, groups) {
-      super(document2, pointer, groups);
-      this.viewType = "Adverbs";
-    }
-    json(opts2 = {}) {
-      const fromAdverb = this.methods.two.transform.adjective.fromAdverb;
-      opts2.normal = true;
-      return this.map((m3) => {
-        let json = m3.toView().json(opts2)[0] || {};
-        json.adverb = {
-          adjective: fromAdverb(json.normal)
-        };
-        return json;
-      }, []);
-    }
-  }
-  View2.prototype.adverbs = function(n3) {
-    let m3 = this.match("#Adverb");
-    m3 = m3.getNth(n3);
-    return new Adverbs(m3.document, m3.pointer);
-  };
-};
-var adverbs_default = api8;
-
-// node_modules/compromise/src/3-three/misc/parentheses/fns.js
-var hasOpen2 = /\(/;
-var hasClosed2 = /\)/;
-var findEnd = function(terms, i3) {
-  for (; i3 < terms.length; i3 += 1) {
-    if (terms[i3].post && hasClosed2.test(terms[i3].post)) {
-      return i3;
-    }
-  }
-  return null;
-};
-var find2 = function(doc) {
-  let ptrs = [];
-  doc.docs.forEach((terms) => {
-    let isOpen = false;
-    for (let i3 = 0; i3 < terms.length; i3 += 1) {
-      let term = terms[i3];
-      if (!isOpen && term.pre && hasOpen2.test(term.pre)) {
-        let end2 = findEnd(terms, i3);
-        if (end2 !== null) {
-          let [n3, start2] = terms[i3].index;
-          ptrs.push([n3, start2, end2 + 1, terms[i3].id]);
-          i3 = end2;
-        }
-      }
-    }
-  });
-  return doc.update(ptrs);
-};
-var strip = function(m3) {
-  m3.docs.forEach((terms) => {
-    terms[0].pre = terms[0].pre.replace(hasOpen2, "");
-    let last = terms[terms.length - 1];
-    last.post = last.post.replace(hasClosed2, "");
-  });
-  return m3;
-};
-
-// node_modules/compromise/src/3-three/misc/parentheses/index.js
-var api9 = function(View2) {
-  class Parentheses extends View2 {
-    constructor(document2, pointer, groups) {
-      super(document2, pointer, groups);
-      this.viewType = "Possessives";
-    }
-    strip() {
-      return strip(this);
-    }
-  }
-  View2.prototype.parentheses = function(n3) {
-    let m3 = find2(this);
-    m3 = m3.getNth(n3);
-    return new Parentheses(m3.document, m3.pointer);
-  };
-};
-var parentheses_default = api9;
-
-// node_modules/compromise/src/3-three/misc/possessives/index.js
-var apostropheS2 = /'s$/;
-var find3 = function(doc) {
-  let m3 = doc.match("#Possessive+");
-  if (m3.has("#Person")) {
-    m3 = m3.growLeft("#Person+");
-  }
-  if (m3.has("#Place")) {
-    m3 = m3.growLeft("#Place+");
-  }
-  if (m3.has("#Organization")) {
-    m3 = m3.growLeft("#Organization+");
-  }
-  return m3;
-};
-var api10 = function(View2) {
-  class Possessives extends View2 {
-    constructor(document2, pointer, groups) {
-      super(document2, pointer, groups);
-      this.viewType = "Possessives";
-    }
-    strip() {
-      this.docs.forEach((terms) => {
-        terms.forEach((term) => {
-          term.text = term.text.replace(apostropheS2, "");
-          term.normal = term.normal.replace(apostropheS2, "");
-        });
-      });
-      return this;
-    }
-  }
-  View2.prototype.possessives = function(n3) {
-    let m3 = find3(this);
-    m3 = m3.getNth(n3);
-    return new Possessives(m3.document, m3.pointer);
-  };
-};
-var possessives_default = api10;
-
-// node_modules/compromise/src/3-three/misc/quotations/fns.js
-var pairs2 = {
-  '"': '"',
-  "\uFF02": "\uFF02",
-  "'": "'",
-  "\u201C": "\u201D",
-  "\u2018": "\u2019",
-  "\u201F": "\u201D",
-  "\u201B": "\u2019",
-  "\u201E": "\u201D",
-  "\u2E42": "\u201D",
-  "\u201A": "\u2019",
-  "\xAB": "\xBB",
-  "\u2039": "\u203A",
-  "\u2035": "\u2032",
-  "\u2036": "\u2033",
-  "\u2037": "\u2034",
-  "\u301D": "\u301E",
-  "`": "\xB4",
-  "\u301F": "\u301E"
-};
-var hasOpen3 = RegExp("(" + Object.keys(pairs2).join("|") + ")");
-var hasClosed3 = RegExp("(" + Object.values(pairs2).join("|") + ")");
-var findEnd2 = function(terms, i3) {
-  const have = terms[i3].pre.match(hasOpen3)[0] || "";
-  if (!have || !pairs2[have]) {
-    return null;
-  }
-  const want = pairs2[have];
-  for (; i3 < terms.length; i3 += 1) {
-    if (terms[i3].post && terms[i3].post.match(want)) {
-      return i3;
-    }
-  }
-  return null;
-};
-var find4 = function(doc) {
-  let ptrs = [];
-  doc.docs.forEach((terms) => {
-    let isOpen = false;
-    for (let i3 = 0; i3 < terms.length; i3 += 1) {
-      let term = terms[i3];
-      if (!isOpen && term.pre && hasOpen3.test(term.pre)) {
-        let end2 = findEnd2(terms, i3);
-        if (end2 !== null) {
-          let [n3, start2] = terms[i3].index;
-          ptrs.push([n3, start2, end2 + 1, terms[i3].id]);
-          i3 = end2;
-        }
-      }
-    }
-  });
-  return doc.update(ptrs);
-};
-var strip2 = function(m3) {
-  m3.docs.forEach((terms) => {
-    terms[0].pre = terms[0].pre.replace(hasOpen3, "");
-    let lastTerm = terms[terms.length - 1];
-    lastTerm.post = lastTerm.post.replace(hasClosed3, "");
-  });
-};
-
-// node_modules/compromise/src/3-three/misc/quotations/index.js
-var api11 = function(View2) {
-  class Quotations extends View2 {
-    constructor(document2, pointer, groups) {
-      super(document2, pointer, groups);
-      this.viewType = "Possessives";
-    }
-    strip() {
-      return strip2(this);
-    }
-  }
-  View2.prototype.quotations = function(n3) {
-    let m3 = find4(this);
-    m3 = m3.getNth(n3);
-    return new Quotations(m3.document, m3.pointer);
-  };
-};
-var quotations_default = api11;
-
-// node_modules/compromise/src/3-three/misc/selections/index.js
-var phoneNumbers = function(n3) {
-  let m3 = this.splitAfter("@hasComma");
-  m3 = m3.match("#PhoneNumber+");
-  m3 = m3.getNth(n3);
-  return m3;
-};
-var selections = [
-  ["hyphenated", "@hasHyphen ."],
-  ["hashTags", "#HashTag"],
-  ["emails", "#Email"],
-  ["emoji", "#Emoji"],
-  ["emoticons", "#Emoticon"],
-  ["atMentions", "#AtMention"],
-  ["urls", "#Url"],
-  ["conjunctions", "#Conjunction"],
-  ["prepositions", "#Preposition"],
-  ["abbreviations", "#Abbreviation"],
-  ["honorifics", "#Honorific"]
-];
-var aliases2 = [
-  ["emojis", "emoji"],
-  ["atmentions", "atMentions"]
-];
-var addMethods = function(View2) {
-  selections.forEach((a2) => {
-    View2.prototype[a2[0]] = function(n3) {
-      let m3 = this.match(a2[1]);
-      return typeof n3 === "number" ? m3.get(n3) : m3;
-    };
-  });
-  View2.prototype.phoneNumbers = phoneNumbers;
-  aliases2.forEach((a2) => {
-    View2.prototype[a2[0]] = View2.prototype[a2[1]];
-  });
-};
-var selections_default = addMethods;
-
-// node_modules/compromise/src/3-three/misc/plugin.js
-var plugin_default19 = {
-  api: function(View2) {
-    acronyms_default2(View2);
-    adjectives_default2(View2);
-    adverbs_default(View2);
-    parentheses_default(View2);
-    possessives_default(View2);
-    quotations_default(View2);
-    selections_default(View2);
-  }
-};
-
-// node_modules/compromise/src/3-three/normalize/methods.js
-var termLoop2 = function(view, cb) {
-  view.docs.forEach((terms) => {
-    terms.forEach(cb);
-  });
-};
-var methods_default10 = {
-  "case": (doc) => {
-    termLoop2(doc, (term) => {
-      term.text = term.text.toLowerCase();
-    });
-  },
-  "unicode": (doc) => {
-    const world2 = doc.world;
-    const killUnicode2 = world2.methods.one.killUnicode;
-    termLoop2(doc, (term) => term.text = killUnicode2(term.text, world2));
-  },
-  "whitespace": (doc) => {
-    termLoop2(doc, (term) => {
-      term.post = term.post.replace(/\s+/g, " ");
-      term.post = term.post.replace(/\s([.,?!:;])/g, "$1");
-      term.pre = term.pre.replace(/\s+/g, "");
-    });
-  },
-  "punctuation": (doc) => {
-    termLoop2(doc, (term) => {
-      term.post = term.post.replace(/[–—-]/g, " ");
-      term.post = term.post.replace(/[,:;]/g, "");
-      term.post = term.post.replace(/\.{2,}/g, "");
-      term.post = term.post.replace(/\?{2,}/g, "?");
-      term.post = term.post.replace(/!{2,}/g, "!");
-      term.post = term.post.replace(/\?!+/g, "?");
-    });
-    let docs = doc.docs;
-    let terms = docs[docs.length - 1];
-    if (terms && terms.length > 0) {
-      let lastTerm = terms[terms.length - 1];
-      lastTerm.post = lastTerm.post.replace(/ /g, "");
-    }
-  },
-  "contractions": (doc) => {
-    doc.contractions().expand();
-  },
-  "acronyms": (doc) => {
-    doc.acronyms().strip();
-  },
-  "parentheses": (doc) => {
-    doc.parentheses().strip();
-  },
-  "possessives": (doc) => {
-    doc.possessives().strip();
-  },
-  "quotations": (doc) => {
-    doc.quotations().strip();
-  },
-  "emoji": (doc) => {
-    doc.emojis().remove();
-  },
-  "honorifics": (doc) => {
-    doc.match("#Honorific+ #Person").honorifics().remove();
-  },
-  "adverbs": (doc) => {
-    doc.adverbs().remove();
-  },
-  "nouns": (doc) => {
-    doc.nouns().toSingular();
-  },
-  "verbs": (doc) => {
-    doc.verbs().toInfinitive();
-  },
-  "numbers": (doc) => {
-    doc.numbers().toNumber();
-  }
-};
-
-// node_modules/compromise/src/3-three/normalize/api.js
-var split2 = (str) => {
-  return str.split("|").reduce((h2, k2) => {
-    h2[k2] = true;
-    return h2;
-  }, {});
-};
-var light = "unicode|punctuation|whitespace|acronyms";
-var medium = "|case|contractions|parentheses|quotations|emoji|honorifics";
-var heavy = "|possessives|adverbs|nouns|verbs";
-var presets = {
-  light: split2(light),
-  medium: split2(light + medium),
-  heavy: split2(light + medium + heavy)
-};
-function api_default13(View2) {
-  View2.prototype.normalize = function(opts2 = "light") {
-    if (typeof opts2 === "string") {
-      opts2 = presets[opts2];
-    }
-    Object.keys(opts2).forEach((fn) => {
-      if (methods_default10.hasOwnProperty(fn)) {
-        methods_default10[fn](this, opts2[fn]);
-      }
-    });
-    return this;
-  };
-}
-
-// node_modules/compromise/src/3-three/normalize/plugin.js
-var plugin_default20 = {
-  api: api_default13
-};
-
-// node_modules/compromise/src/3-three/nouns/find.js
-var findNouns = function(doc) {
-  let m3 = doc.match("<Noun>");
-  let commas = m3.match("@hasComma");
-  commas = commas.not("#Place");
-  if (commas.found) {
-    m3 = m3.splitAfter(commas);
-  }
-  m3 = m3.splitOn("#Expression");
-  m3 = m3.splitOn("(he|she|we|you|they|i)");
-  m3 = m3.splitOn("(#Noun|#Adjective) [(he|him|she|it)]", 0);
-  m3 = m3.splitOn("[(he|him|she|it)] (#Determiner|#Value)", 0);
-  m3 = m3.splitBefore("#Noun [(the|a|an)] #Adjective? #Noun", 0);
-  m3 = m3.splitOn("[(here|there)] #Noun", 0);
-  m3 = m3.splitOn("[#Noun] (here|there)", 0);
-  m3 = m3.splitBefore("(our|my|their|your)");
-  m3 = m3.if("#Noun");
-  return m3;
-};
-var find_default = findNouns;
-
-// node_modules/compromise/src/3-three/nouns/api/isSubordinate.js
-var list2 = [
-  "after",
-  "although",
-  "as if",
-  "as long as",
-  "as",
-  "because",
-  "before",
-  "even if",
-  "even though",
-  "ever since",
-  "if",
-  "in order that",
-  "provided that",
-  "since",
-  "so that",
-  "than",
-  "that",
-  "though",
-  "unless",
-  "until",
-  "what",
-  "whatever",
-  "when",
-  "whenever",
-  "where",
-  "whereas",
-  "wherever",
-  "whether",
-  "which",
-  "whichever",
-  "who",
-  "whoever",
-  "whom",
-  "whomever",
-  "whose"
-];
-var isSubordinate = function(m3) {
-  if (m3.before("#Preposition$").found) {
-    return true;
-  }
-  let leadIn = m3.before();
-  if (!leadIn.found) {
-    return false;
-  }
-  for (let i3 = 0; i3 < list2.length; i3 += 1) {
-    if (m3.has(list2[i3])) {
-      return true;
-    }
-  }
-  return false;
-};
-var isSubordinate_default = isSubordinate;
-
-// node_modules/compromise/src/3-three/nouns/api/isPlural.js
-var notPlural2 = "(#Pronoun|#Place|#Value|#Person|#Uncountable|#Month|#WeekDay|#Holiday|#Possessive)";
-var isPlural2 = function(m3, root) {
-  if (m3.has("#Plural")) {
-    return true;
-  }
-  if (m3.has("#Noun and #Noun")) {
-    return true;
-  }
-  if (m3.has("(we|they)")) {
-    return true;
-  }
-  if (root.has(notPlural2) === true) {
-    return false;
-  }
-  if (m3.has("#Singular")) {
-    return false;
-  }
-  let str = root.text("normal");
-  return str.length > 3 && str.endsWith("s") && !str.endsWith("ss");
-};
-var isPlural_default = isPlural2;
-
-// node_modules/compromise/src/3-three/nouns/api/parse.js
-var getRoot2 = function(m3) {
-  let tmp = m3.clone();
-  tmp = tmp.match("#Noun+");
-  tmp = tmp.remove("(#Adjective|#Preposition|#Determiner|#Value)");
-  tmp = tmp.not("#Possessive");
-  tmp = tmp.first();
-  if (!tmp.found) {
-    return m3;
-  }
-  return tmp;
-};
-var parseNoun = function(m3) {
-  let root = getRoot2(m3);
-  return {
-    determiner: m3.match("#Determiner").eq(0),
-    adjectives: m3.match("#Adjective"),
-    number: m3.values(),
-    isPlural: isPlural_default(m3, root),
-    isSubordinate: isSubordinate_default(m3),
-    root
-  };
-};
-var parse_default3 = parseNoun;
-
-// node_modules/compromise/src/3-three/nouns/api/toJSON.js
-var toText2 = (m3) => m3.text();
-var toArray3 = (m3) => m3.json({ terms: false, normal: true }).map((s3) => s3.normal);
-var getNum = function(m3) {
-  let num = null;
-  if (!m3.found) {
-    return num;
-  }
-  let val = m3.values(0);
-  if (val.found) {
-    let obj = val.parse()[0] || {};
-    return obj.num;
-  }
-  return num;
-};
-var toJSON2 = function(m3) {
-  let res = parse_default3(m3);
-  return {
-    root: toText2(res.root),
-    number: getNum(res.number),
-    determiner: toText2(res.determiner),
-    adjectives: toArray3(res.adjectives),
-    isPlural: res.isPlural,
-    isSubordinate: res.isSubordinate
-  };
-};
-var toJSON_default = toJSON2;
-
-// node_modules/compromise/src/3-three/nouns/api/toPlural.js
-var keep = { tags: true };
-var hasPlural = function(parsed) {
-  let { root } = parsed;
-  if (root.has("^(#Uncountable|#Possessive|#ProperNoun|#Place|#Pronoun|#Acronym)+$")) {
-    return false;
-  }
-  return true;
-};
-var nounToPlural = function(m3, parsed) {
-  if (parsed.isPlural === true) {
-    return m3;
-  }
-  if (!hasPlural(parsed)) {
-    return m3;
-  }
-  const { methods: methods16, model: model5 } = m3.world;
-  const { toPlural } = methods16.two.transform.noun;
-  let str = parsed.root.text({ keepPunct: false });
-  let plural2 = toPlural(str, model5);
-  m3.match(parsed.root).replaceWith(plural2, keep).tag("Plural", "toPlural");
-  if (parsed.determiner.has("(a|an)")) {
-    m3.remove(parsed.determiner);
-  }
-  let copula = parsed.root.after("not? #Adverb+? [#Copula]", 0);
-  if (copula.found) {
-    if (copula.has("is")) {
-      m3.replace(copula, "are");
-    } else if (copula.has("was")) {
-      m3.replace(copula, "were");
-    }
-  }
-  return m3;
-};
-var toPlural_default2 = nounToPlural;
-
-// node_modules/compromise/src/3-three/nouns/api/toSingular.js
-var keep2 = { tags: true };
-var nounToSingular = function(m3, parsed) {
-  if (parsed.isPlural === false) {
-    return m3;
-  }
-  const { methods: methods16, model: model5 } = m3.world;
-  const { toSingular: toSingular2 } = methods16.two.transform.noun;
-  let str = parsed.root.text("normal");
-  let single = toSingular2(str, model5);
-  m3.replace(parsed.root, single, keep2).tag("Singular", "toPlural");
-  return m3;
-};
-var toSingular_default2 = nounToSingular;
-
-// node_modules/compromise/src/3-three/nouns/api/api.js
-var api12 = function(View2) {
-  class Nouns extends View2 {
-    constructor(document2, pointer, groups) {
-      super(document2, pointer, groups);
-      this.viewType = "Nouns";
-    }
-    parse(n3) {
-      return this.getNth(n3).map(parse_default3);
-    }
-    json(n3) {
-      let opts2 = typeof n3 === "object" ? n3 : {};
-      return this.getNth(n3).map((m3) => {
-        let json = m3.toView().json(opts2)[0] || {};
-        if (opts2 && opts2.noun !== true) {
-          json.noun = toJSON_default(m3);
-        }
-        return json;
-      }, []);
-    }
-    isPlural(n3) {
-      let res = this.filter((m3) => parse_default3(m3).isPlural);
-      return res.getNth(n3);
-    }
-    isSingular(n3) {
-      let res = this.filter((m3) => !parse_default3(m3).isPlural);
-      return res.getNth(n3);
-    }
-    adjectives(n3) {
-      let res = this.update([]);
-      this.forEach((m3) => {
-        let adj = parse_default3(m3).adjectives;
-        if (adj.found) {
-          res = res.concat(adj);
-        }
-      });
-      return res.getNth(n3);
-    }
-    toPlural(n3) {
-      return this.getNth(n3).map((m3) => {
-        return toPlural_default2(m3, parse_default3(m3));
-      });
-    }
-    toSingular(n3) {
-      return this.getNth(n3).map((m3) => {
-        let res = parse_default3(m3);
-        return toSingular_default2(m3, res);
-      });
-    }
-    update(pointer) {
-      let m3 = new Nouns(this.document, pointer);
-      m3._cache = this._cache;
-      return m3;
-    }
-  }
-  View2.prototype.nouns = function(n3) {
-    let m3 = find_default(this);
-    m3 = m3.getNth(n3);
-    return new Nouns(this.document, m3.pointer);
-  };
-};
-var api_default14 = api12;
-
-// node_modules/compromise/src/3-three/nouns/plugin.js
-var plugin_default21 = {
-  api: api_default14
-};
-
-// node_modules/compromise/src/3-three/numbers/fractions/find.js
-var findFractions = function(doc, n3) {
-  let m3 = doc.match("#Fraction+");
-  m3 = m3.filter((r2) => {
-    return !r2.lookBehind("#Value and$").found;
-  });
-  m3 = m3.notIf("#Value seconds");
-  if (typeof n3 === "number") {
-    m3 = m3.eq(n3);
-  }
-  return m3;
-};
-var find_default2 = findFractions;
-
-// node_modules/compromise/src/3-three/numbers/numbers/parse/toNumber/findModifiers.js
-var findModifiers = (str) => {
-  const mults = [
-    {
-      reg: /^(minus|negative)[\s-]/i,
-      mult: -1
-    },
-    {
-      reg: /^(a\s)?half[\s-](of\s)?/i,
-      mult: 0.5
-    }
-  ];
-  for (let i3 = 0; i3 < mults.length; i3++) {
-    if (mults[i3].reg.test(str) === true) {
-      return {
-        amount: mults[i3].mult,
-        str: str.replace(mults[i3].reg, "")
-      };
-    }
-  }
-  return {
-    amount: 1,
-    str
-  };
-};
-var findModifiers_default = findModifiers;
-
-// node_modules/compromise/src/3-three/numbers/numbers/parse/toNumber/data.js
-var data_default3 = {
-  ones: {
-    zeroth: 0,
-    first: 1,
-    second: 2,
-    third: 3,
-    fourth: 4,
-    fifth: 5,
-    sixth: 6,
-    seventh: 7,
-    eighth: 8,
-    ninth: 9,
-    zero: 0,
-    one: 1,
-    two: 2,
-    three: 3,
-    four: 4,
-    five: 5,
-    six: 6,
-    seven: 7,
-    eight: 8,
-    nine: 9
-  },
-  teens: {
-    tenth: 10,
-    eleventh: 11,
-    twelfth: 12,
-    thirteenth: 13,
-    fourteenth: 14,
-    fifteenth: 15,
-    sixteenth: 16,
-    seventeenth: 17,
-    eighteenth: 18,
-    nineteenth: 19,
-    ten: 10,
-    eleven: 11,
-    twelve: 12,
-    thirteen: 13,
-    fourteen: 14,
-    fifteen: 15,
-    sixteen: 16,
-    seventeen: 17,
-    eighteen: 18,
-    nineteen: 19
-  },
-  tens: {
-    twentieth: 20,
-    thirtieth: 30,
-    fortieth: 40,
-    fourtieth: 40,
-    fiftieth: 50,
-    sixtieth: 60,
-    seventieth: 70,
-    eightieth: 80,
-    ninetieth: 90,
-    twenty: 20,
-    thirty: 30,
-    forty: 40,
-    fourty: 40,
-    fifty: 50,
-    sixty: 60,
-    seventy: 70,
-    eighty: 80,
-    ninety: 90
-  },
-  multiples: {
-    hundredth: 100,
-    thousandth: 1e3,
-    millionth: 1e6,
-    billionth: 1e9,
-    trillionth: 1e12,
-    quadrillionth: 1e15,
-    quintillionth: 1e18,
-    sextillionth: 1e21,
-    septillionth: 1e24,
-    hundred: 100,
-    thousand: 1e3,
-    million: 1e6,
-    billion: 1e9,
-    trillion: 1e12,
-    quadrillion: 1e15,
-    quintillion: 1e18,
-    sextillion: 1e21,
-    septillion: 1e24,
-    grand: 1e3
-  }
-};
-
-// node_modules/compromise/src/3-three/numbers/numbers/parse/toNumber/validate.js
-var isValid = (w, has2) => {
-  if (data_default3.ones.hasOwnProperty(w)) {
-    if (has2.ones || has2.teens) {
-      return false;
-    }
-  } else if (data_default3.teens.hasOwnProperty(w)) {
-    if (has2.ones || has2.teens || has2.tens) {
-      return false;
-    }
-  } else if (data_default3.tens.hasOwnProperty(w)) {
-    if (has2.ones || has2.teens || has2.tens) {
-      return false;
-    }
-  }
-  return true;
-};
-var validate_default2 = isValid;
-
-// node_modules/compromise/src/3-three/numbers/numbers/parse/toNumber/parseDecimals.js
-var parseDecimals = function(arr) {
-  let str = "0.";
-  for (let i3 = 0; i3 < arr.length; i3++) {
-    let w = arr[i3];
-    if (data_default3.ones.hasOwnProperty(w) === true) {
-      str += data_default3.ones[w];
-    } else if (data_default3.teens.hasOwnProperty(w) === true) {
-      str += data_default3.teens[w];
-    } else if (data_default3.tens.hasOwnProperty(w) === true) {
-      str += data_default3.tens[w];
-    } else if (/^[0-9]$/.test(w) === true) {
-      str += w;
-    } else {
-      return 0;
-    }
-  }
-  return parseFloat(str);
-};
-var parseDecimals_default = parseDecimals;
-
-// node_modules/compromise/src/3-three/numbers/numbers/parse/toNumber/parseNumeric.js
-var parseNumeric = (str) => {
-  str = str.replace(/1st$/, "1");
-  str = str.replace(/2nd$/, "2");
-  str = str.replace(/3rd$/, "3");
-  str = str.replace(/([4567890])r?th$/, "$1");
-  str = str.replace(/^[$€¥£¢]/, "");
-  str = str.replace(/[%$€¥£¢]$/, "");
-  str = str.replace(/,/g, "");
-  str = str.replace(/([0-9])([a-z\u00C0-\u00FF]{1,2})$/, "$1");
-  return str;
-};
-var parseNumeric_default = parseNumeric;
-
-// node_modules/compromise/src/3-three/numbers/numbers/parse/toNumber/index.js
-var improperFraction = /^([0-9,. ]+)\/([0-9,. ]+)$/;
-var casualForms = {
-  "a few": 3,
-  "a couple": 2,
-  "a dozen": 12,
-  "two dozen": 24,
-  zero: 0
-};
-var section_sum = (obj) => {
-  return Object.keys(obj).reduce((sum, k2) => {
-    sum += obj[k2];
-    return sum;
-  }, 0);
-};
-var parse4 = function(str) {
-  if (casualForms.hasOwnProperty(str) === true) {
-    return casualForms[str];
-  }
-  if (str === "a" || str === "an") {
-    return 1;
-  }
-  const modifier = findModifiers_default(str);
-  str = modifier.str;
-  let last_mult = null;
-  let has2 = {};
-  let sum = 0;
-  let isNegative = false;
-  const terms = str.split(/[ -]/);
-  for (let i3 = 0; i3 < terms.length; i3++) {
-    let w = terms[i3];
-    w = parseNumeric_default(w);
-    if (!w || w === "and") {
-      continue;
-    }
-    if (w === "-" || w === "negative") {
-      isNegative = true;
-      continue;
-    }
-    if (w.charAt(0) === "-") {
-      isNegative = true;
-      w = w.substring(1);
-    }
-    if (w === "point") {
-      sum += section_sum(has2);
-      sum += parseDecimals_default(terms.slice(i3 + 1, terms.length));
-      sum *= modifier.amount;
-      return sum;
-    }
-    const fm = w.match(improperFraction);
-    if (fm) {
-      const num = parseFloat(fm[1].replace(/[, ]/g, ""));
-      const denom = parseFloat(fm[2].replace(/[, ]/g, ""));
-      if (denom) {
-        sum += num / denom || 0;
-      }
-      continue;
-    }
-    if (data_default3.tens.hasOwnProperty(w)) {
-      if (has2.ones && Object.keys(has2).length === 1) {
-        sum = has2.ones * 100;
-        has2 = {};
-      }
-    }
-    if (validate_default2(w, has2) === false) {
-      return null;
-    }
-    if (/^[0-9.]+$/.test(w)) {
-      has2.ones = parseFloat(w);
-    } else if (data_default3.ones.hasOwnProperty(w) === true) {
-      has2.ones = data_default3.ones[w];
-    } else if (data_default3.teens.hasOwnProperty(w) === true) {
-      has2.teens = data_default3.teens[w];
-    } else if (data_default3.tens.hasOwnProperty(w) === true) {
-      has2.tens = data_default3.tens[w];
-    } else if (data_default3.multiples.hasOwnProperty(w) === true) {
-      let mult = data_default3.multiples[w];
-      if (mult === last_mult) {
-        return null;
-      }
-      if (mult === 100 && terms[i3 + 1] !== void 0) {
-        const w2 = terms[i3 + 1];
-        if (data_default3.multiples[w2]) {
-          mult *= data_default3.multiples[w2];
-          i3 += 1;
-        }
-      }
-      if (last_mult === null || mult < last_mult) {
-        sum += (section_sum(has2) || 1) * mult;
-        last_mult = mult;
-        has2 = {};
-      } else {
-        sum += section_sum(has2);
-        last_mult = mult;
-        sum = (sum || 1) * mult;
-        has2 = {};
-      }
-    }
-  }
-  sum += section_sum(has2);
-  sum *= modifier.amount;
-  sum *= isNegative ? -1 : 1;
-  if (sum === 0 && Object.keys(has2).length === 0) {
-    return null;
-  }
-  return sum;
-};
-var toNumber_default = parse4;
-
-// node_modules/compromise/src/3-three/numbers/fractions/parse.js
-var endS = /s$/;
-var parseNumber = function(m3) {
-  let str = m3.text("reduced");
-  return toNumber_default(str);
-};
-var mapping2 = {
-  half: 2,
-  halve: 2,
-  quarter: 4
-};
-var slashForm = function(m3) {
-  let str = m3.text("reduced");
-  let found = str.match(/^([-+]?[0-9]+)\/([-+]?[0-9]+)(st|nd|rd|th)?s?$/);
-  if (found && found[1] && found[0]) {
-    return {
-      numerator: Number(found[1]),
-      denominator: Number(found[2])
-    };
-  }
-  return null;
-};
-var nOutOfN = function(m3) {
-  let found = m3.match("[<num>#Value+] out of every? [<den>#Value+]");
-  if (found.found !== true) {
-    return null;
-  }
-  let { num, den } = found.groups();
-  if (!num || !den) {
-    return null;
-  }
-  num = parseNumber(num);
-  den = parseNumber(den);
-  if (!num || !den) {
-    return null;
-  }
-  if (typeof num === "number" && typeof den === "number") {
-    return {
-      numerator: num,
-      denominator: den
-    };
-  }
-  return null;
-};
-var nOrinalth = function(m3) {
-  let found = m3.match("[<num>(#Cardinal|a)+] [<den>#Fraction+]");
-  if (found.found !== true) {
-    return null;
-  }
-  let { num, den } = found.groups();
-  if (num.has("a")) {
-    num = 1;
-  } else {
-    num = parseNumber(num);
-  }
-  let str = den.text("reduced");
-  if (endS.test(str)) {
-    str = str.replace(endS, "");
-    den = den.replaceWith(str);
-  }
-  if (mapping2.hasOwnProperty(str)) {
-    den = mapping2[str];
-  } else {
-    den = parseNumber(den);
-  }
-  if (typeof num === "number" && typeof den === "number") {
-    return {
-      numerator: num,
-      denominator: den
-    };
-  }
-  return null;
-};
-var oneNth = function(m3) {
-  let found = m3.match("^#Ordinal$");
-  if (found.found !== true) {
-    return null;
-  }
-  if (m3.lookAhead("^of .")) {
-    let num = parseNumber(found);
-    return {
-      numerator: 1,
-      denominator: num
-    };
-  }
-  return null;
-};
-var named = function(m3) {
-  let str = m3.text("reduced");
-  if (mapping2.hasOwnProperty(str)) {
-    return { numerator: 1, denominator: mapping2[str] };
-  }
-  return null;
-};
-var round2 = (n3) => {
-  let rounded = Math.round(n3 * 1e3) / 1e3;
-  if (rounded === 0 && n3 !== 0) {
-    return n3;
-  }
-  return rounded;
-};
-var parseFraction = function(m3) {
-  m3 = m3.clone();
-  let res = named(m3) || slashForm(m3) || nOutOfN(m3) || nOrinalth(m3) || oneNth(m3) || null;
-  if (res !== null) {
-    if (res.numerator && res.denominator) {
-      res.decimal = res.numerator / res.denominator;
-      res.decimal = round2(res.decimal);
-    }
-  }
-  return res;
-};
-var parse_default4 = parseFraction;
-
-// node_modules/compromise/src/3-three/numbers/numbers/_toString.js
-var numToString = function(n3) {
-  if (n3 < 1e6) {
-    return String(n3);
-  }
-  let str;
-  if (typeof n3 === "number") {
-    str = n3.toFixed(0);
-  } else {
-    str = n3;
-  }
-  if (str.indexOf("e+") === -1) {
-    return str;
-  }
-  return str.replace(".", "").split("e+").reduce(function(p4, b) {
-    return p4 + Array(b - p4.length + 2).join(0);
-  });
-};
-var toString_default = numToString;
-
-// node_modules/compromise/src/3-three/numbers/numbers/format/toText/data.js
-var tens_mapping = [
-  ["ninety", 90],
-  ["eighty", 80],
-  ["seventy", 70],
-  ["sixty", 60],
-  ["fifty", 50],
-  ["forty", 40],
-  ["thirty", 30],
-  ["twenty", 20]
-];
-var ones_mapping = [
-  "",
-  "one",
-  "two",
-  "three",
-  "four",
-  "five",
-  "six",
-  "seven",
-  "eight",
-  "nine",
-  "ten",
-  "eleven",
-  "twelve",
-  "thirteen",
-  "fourteen",
-  "fifteen",
-  "sixteen",
-  "seventeen",
-  "eighteen",
-  "nineteen"
-];
-var sequence = [
-  [1e24, "septillion"],
-  [1e20, "hundred sextillion"],
-  [1e21, "sextillion"],
-  [1e20, "hundred quintillion"],
-  [1e18, "quintillion"],
-  [1e17, "hundred quadrillion"],
-  [1e15, "quadrillion"],
-  [1e14, "hundred trillion"],
-  [1e12, "trillion"],
-  [1e11, "hundred billion"],
-  [1e9, "billion"],
-  [1e8, "hundred million"],
-  [1e6, "million"],
-  [1e5, "hundred thousand"],
-  [1e3, "thousand"],
-  [100, "hundred"],
-  [1, "one"]
-];
-
-// node_modules/compromise/src/3-three/numbers/numbers/format/toText/index.js
-var breakdown_magnitudes = function(num) {
-  let working = num;
-  let have = [];
-  sequence.forEach((a2) => {
-    if (num >= a2[0]) {
-      let howmany = Math.floor(working / a2[0]);
-      working -= howmany * a2[0];
-      if (howmany) {
-        have.push({
-          unit: a2[1],
-          count: howmany
-        });
-      }
-    }
-  });
-  return have;
-};
-var breakdown_hundred = function(num) {
-  let arr = [];
-  if (num > 100) {
-    return arr;
-  }
-  for (let i3 = 0; i3 < tens_mapping.length; i3++) {
-    if (num >= tens_mapping[i3][1]) {
-      num -= tens_mapping[i3][1];
-      arr.push(tens_mapping[i3][0]);
-    }
-  }
-  if (ones_mapping[num]) {
-    arr.push(ones_mapping[num]);
-  }
-  return arr;
-};
-var handle_decimal = (num) => {
-  const names = ["zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"];
-  let arr = [];
-  let str = toString_default(num);
-  let decimal = str.match(/\.([0-9]+)/);
-  if (!decimal || !decimal[0]) {
-    return arr;
-  }
-  arr.push("point");
-  let decimals = decimal[0].split("");
-  for (let i3 = 0; i3 < decimals.length; i3++) {
-    arr.push(names[decimals[i3]]);
-  }
-  return arr;
-};
-var toText3 = function(obj) {
-  let num = obj.num;
-  if (num === 0 || num === "0") {
-    return "zero";
-  }
-  if (num > 1e21) {
-    num = toString_default(num);
-  }
-  let arr = [];
-  if (num < 0) {
-    arr.push("minus");
-    num = Math.abs(num);
-  }
-  let units = breakdown_magnitudes(num);
-  for (let i3 = 0; i3 < units.length; i3++) {
-    let unit_name = units[i3].unit;
-    if (unit_name === "one") {
-      unit_name = "";
-      if (arr.length > 1) {
-        arr.push("and");
-      }
-    }
-    arr = arr.concat(breakdown_hundred(units[i3].count));
-    arr.push(unit_name);
-  }
-  arr = arr.concat(handle_decimal(num));
-  arr = arr.filter((s3) => s3);
-  if (arr.length === 0) {
-    arr[0] = "";
-  }
-  return arr.join(" ");
-};
-var toText_default = toText3;
-
-// node_modules/compromise/src/3-three/numbers/fractions/convert/toCardinal.js
-var toCardinal = function(obj) {
-  if (!obj.numerator || !obj.denominator) {
-    return "";
-  }
-  let a2 = toText_default({ num: obj.numerator });
-  let b = toText_default({ num: obj.denominator });
-  return `${a2} out of ${b}`;
-};
-var toCardinal_default = toCardinal;
-
-// node_modules/compromise/src/3-three/numbers/numbers/format/toOrdinal/textOrdinal.js
-var irregulars = {
-  one: "first",
-  two: "second",
-  three: "third",
-  five: "fifth",
-  eight: "eighth",
-  nine: "ninth",
-  twelve: "twelfth",
-  twenty: "twentieth",
-  thirty: "thirtieth",
-  forty: "fortieth",
-  fourty: "fourtieth",
-  fifty: "fiftieth",
-  sixty: "sixtieth",
-  seventy: "seventieth",
-  eighty: "eightieth",
-  ninety: "ninetieth"
-};
-var textOrdinal = (obj) => {
-  let words = toText_default(obj).split(" ");
-  let last = words[words.length - 1];
-  if (irregulars.hasOwnProperty(last)) {
-    words[words.length - 1] = irregulars[last];
-  } else {
-    words[words.length - 1] = last.replace(/y$/, "i") + "th";
-  }
-  return words.join(" ");
-};
-var textOrdinal_default = textOrdinal;
-
-// node_modules/compromise/src/3-three/numbers/fractions/convert/toOrdinal.js
-var toOrdinal = function(obj) {
-  if (!obj.numerator || !obj.denominator) {
-    return "";
-  }
-  let start2 = toText_default({ num: obj.numerator });
-  let end2 = textOrdinal_default({ num: obj.denominator });
-  if (obj.denominator === 2) {
-    end2 = "half";
-  }
-  if (start2 && end2) {
-    if (obj.numerator !== 1) {
-      end2 += "s";
-    }
-    return `${start2} ${end2}`;
-  }
-  return "";
-};
-var toOrdinal_default = toOrdinal;
-
-// node_modules/compromise/src/3-three/numbers/fractions/api.js
-var plugin3 = function(View2) {
-  class Fractions extends View2 {
-    constructor(document2, pointer, groups) {
-      super(document2, pointer, groups);
-      this.viewType = "Fractions";
-    }
-    parse(n3) {
-      return this.getNth(n3).map(parse_default4);
-    }
-    get(n3) {
-      return this.getNth(n3).map(parse_default4);
-    }
-    json(n3) {
-      return this.getNth(n3).map((p4) => {
-        let json = p4.toView().json(n3)[0];
-        let parsed = parse_default4(p4);
-        json.fraction = parsed;
-        return json;
-      }, []);
-    }
-    toDecimal(n3) {
-      this.getNth(n3).forEach((m3) => {
-        let { decimal } = parse_default4(m3);
-        m3 = m3.replaceWith(String(decimal), true);
-        m3.tag("NumericValue");
-        m3.unTag("Fraction");
-      });
-      return this;
-    }
-    toFraction(n3) {
-      this.getNth(n3).forEach((m3) => {
-        let obj = parse_default4(m3);
-        if (obj && typeof obj.numerator === "number" && typeof obj.denominator === "number") {
-          let str = `${obj.numerator}/${obj.denominator}`;
-          this.replace(m3, str);
-        }
-      });
-      return this;
-    }
-    toOrdinal(n3) {
-      this.getNth(n3).forEach((m3) => {
-        let obj = parse_default4(m3);
-        let str = toOrdinal_default(obj);
-        if (m3.after("^#Noun").found) {
-          str += " of";
-        }
-        m3.replaceWith(str);
-      });
-      return this;
-    }
-    toCardinal(n3) {
-      this.getNth(n3).forEach((m3) => {
-        let obj = parse_default4(m3);
-        let str = toCardinal_default(obj);
-        m3.replaceWith(str);
-      });
-      return this;
-    }
-    toPercentage(n3) {
-      this.getNth(n3).forEach((m3) => {
-        let { decimal } = parse_default4(m3);
-        let percent = decimal * 100;
-        percent = Math.round(percent * 100) / 100;
-        m3.replaceWith(`${percent}%`);
-      });
-      return this;
-    }
-  }
-  View2.prototype.fractions = function(n3) {
-    let m3 = find_default2(this);
-    m3 = m3.getNth(n3);
-    return new Fractions(this.document, m3.pointer);
-  };
-};
-var api_default15 = plugin3;
-
-// node_modules/compromise/src/3-three/numbers/numbers/find.js
-var ones = "one|two|three|four|five|six|seven|eight|nine";
-var tens = "twenty|thirty|forty|fifty|sixty|seventy|eighty|ninety|fourty";
-var teens = "eleven|twelve|thirteen|fourteen|fifteen|sixteen|seventeen|eighteen|nineteen";
-var findNumbers = function(doc) {
-  let m3 = doc.match("#Value+");
-  if (m3.has("#NumericValue #NumericValue")) {
-    if (m3.has("#Value @hasComma #Value")) {
-      m3.splitAfter("@hasComma");
-    } else if (m3.has("#NumericValue #Fraction")) {
-      m3.splitAfter("#NumericValue #Fraction");
-    } else {
-      m3 = m3.splitAfter("#NumericValue");
-    }
-  }
-  if (m3.has("#Value #Value #Value") && !m3.has("#Multiple")) {
-    if (m3.has("(" + tens + ") #Cardinal #Cardinal")) {
-      m3 = m3.splitAfter("(" + tens + ") #Cardinal");
-    }
-  }
-  if (m3.has("#Value #Value")) {
-    if (m3.has("#NumericValue #NumericValue")) {
-      m3 = m3.splitOn("#Year");
-    }
-    if (m3.has("(" + tens + ") (" + teens + ")")) {
-      m3 = m3.splitAfter("(" + tens + ")");
-    }
-    let double = m3.match("#Cardinal #Cardinal");
-    if (double.found && !m3.has("(point|decimal|#Fraction)")) {
-      if (!double.has("#Cardinal (#Multiple|point|decimal)")) {
-        let noMultiple = m3.has(`(${ones}) (${tens})`);
-        let tensVal = double.has("(" + tens + ") #Cardinal");
-        let multVal = double.has("#Multiple #Value");
-        if (!noMultiple && !tensVal && !multVal) {
-          double.terms().forEach((d2) => {
-            m3 = m3.splitOn(d2);
-          });
-        }
-      }
-    }
-    if (m3.match("#Ordinal #Ordinal").match("#TextValue").found && !m3.has("#Multiple")) {
-      if (!m3.has("(" + tens + ") #Ordinal")) {
-        m3 = m3.splitAfter("#Ordinal");
-      }
-    }
-    m3 = m3.splitBefore("#Ordinal [#Cardinal]", 0);
-    if (m3.has("#TextValue #NumericValue") && !m3.has("(" + tens + "|#Multiple)")) {
-      m3 = m3.splitBefore("#TextValue #NumericValue");
-    }
-  }
-  m3 = m3.splitAfter("#NumberRange");
-  m3 = m3.splitBefore("#Year");
-  return m3;
-};
-var find_default3 = findNumbers;
-
-// node_modules/compromise/src/3-three/numbers/numbers/parse/index.js
-var parseNumeric2 = function(str, m3) {
-  str = str.replace(/,/g, "");
-  let arr = str.split(/([0-9.,]*)/);
-  let [prefix6, num] = arr;
-  let suffix = arr.slice(2).join("");
-  if (num !== "" && m3.length < 2) {
-    num = Number(num || str);
-    if (typeof num !== "number") {
-      num = null;
-    }
-    suffix = suffix || "";
-    if (suffix === "st" || suffix === "nd" || suffix === "rd" || suffix === "th") {
-      suffix = "";
-    }
-    return {
-      prefix: prefix6 || "",
-      num,
-      suffix
-    };
-  }
-  return null;
-};
-var parseNumber2 = function(m3) {
-  if (typeof m3 === "string") {
-    return { num: toNumber_default(m3) };
-  }
-  let str = m3.text("reduced");
-  let unit = m3.growRight("#Unit").match("#Unit$").text("machine");
-  let hasComma = /[0-9],[0-9]/.test(m3.text("text"));
-  if (m3.terms().length === 1 && !m3.has("#Multiple")) {
-    let res = parseNumeric2(str, m3);
-    if (res !== null) {
-      res.hasComma = hasComma;
-      res.unit = unit;
-      return res;
-    }
-  }
-  let frPart = m3.match("#Fraction{2,}$");
-  frPart = frPart.found === false ? m3.match("^#Fraction$") : frPart;
-  let fraction = null;
-  if (frPart.found) {
-    if (frPart.has("#Value and #Value #Fraction")) {
-      frPart = frPart.match("and #Value #Fraction");
-    }
-    fraction = parse_default4(frPart);
-    m3 = m3.not(frPart);
-    m3 = m3.not("and$");
-    str = m3.text("reduced");
-  }
-  let num = 0;
-  if (str) {
-    num = toNumber_default(str) || 0;
-  }
-  if (fraction && fraction.decimal) {
-    num += fraction.decimal;
-  }
-  return {
-    hasComma,
-    prefix: "",
-    num,
-    suffix: "",
-    isOrdinal: m3.has("#Ordinal"),
-    isText: m3.has("#TextValue"),
-    isFraction: m3.has("#Fraction"),
-    isMoney: m3.has("#Money"),
-    unit
-  };
-};
-var parse_default5 = parseNumber2;
-
-// node_modules/compromise/src/3-three/numbers/numbers/format/toOrdinal/numOrdinal.js
-var numOrdinal = function(obj) {
-  let num = obj.num;
-  if (!num && num !== 0) {
-    return null;
-  }
-  let tens2 = num % 100;
-  if (tens2 > 10 && tens2 < 20) {
-    return String(num) + "th";
-  }
-  const mapping3 = {
-    0: "th",
-    1: "st",
-    2: "nd",
-    3: "rd"
-  };
-  let str = toString_default(num);
-  let last = str.slice(str.length - 1, str.length);
-  if (mapping3[last]) {
-    str += mapping3[last];
-  } else {
-    str += "th";
-  }
-  return str;
-};
-var numOrdinal_default = numOrdinal;
-
-// node_modules/compromise/src/3-three/numbers/numbers/format/suffix.js
-var prefixes = {
-  "\xA2": "cents",
-  $: "dollars",
-  "\xA3": "pounds",
-  "\xA5": "yen",
-  "\u20AC": "euros",
-  "\u20A1": "col\xF3n",
-  "\u0E3F": "baht",
-  "\u20AD": "kip",
-  "\u20A9": "won",
-  "\u20B9": "rupees",
-  "\u20BD": "ruble",
-  "\u20BA": "liras"
-};
-var suffixes5 = {
-  "%": "percent",
-  "\xB0": "degrees"
-};
-var addSuffix = function(obj) {
-  let res = {
-    suffix: "",
-    prefix: obj.prefix
-  };
-  if (prefixes.hasOwnProperty(obj.prefix)) {
-    res.suffix += " " + prefixes[obj.prefix];
-    res.prefix = "";
-  }
-  if (suffixes5.hasOwnProperty(obj.suffix)) {
-    res.suffix += " " + suffixes5[obj.suffix];
-  }
-  if (res.suffix && obj.num === 1) {
-    res.suffix = res.suffix.replace(/s$/, "");
-  }
-  if (!res.suffix && obj.suffix) {
-    res.suffix += " " + obj.suffix;
-  }
-  return res;
-};
-var suffix_default2 = addSuffix;
-
-// node_modules/compromise/src/3-three/numbers/numbers/format/index.js
-var format = function(obj, fmt2) {
-  if (fmt2 === "TextOrdinal") {
-    let { prefix: prefix6, suffix } = suffix_default2(obj);
-    return prefix6 + textOrdinal_default(obj) + suffix;
-  }
-  if (fmt2 === "Ordinal") {
-    return obj.prefix + numOrdinal_default(obj) + obj.suffix;
-  }
-  if (fmt2 === "TextCardinal") {
-    let { prefix: prefix6, suffix } = suffix_default2(obj);
-    return prefix6 + toText_default(obj) + suffix;
-  }
-  let num = obj.num;
-  if (obj.hasComma) {
-    num = num.toLocaleString();
-  }
-  return obj.prefix + String(num) + obj.suffix;
-};
-var format_default = format;
-
-// node_modules/compromise/src/3-three/numbers/numbers/api.js
-var addMethod = function(View2) {
-  class Numbers extends View2 {
-    constructor(document2, pointer, groups) {
-      super(document2, pointer, groups);
-      this.viewType = "Numbers";
-    }
-    parse(n3) {
-      return this.getNth(n3).map(parse_default5);
-    }
-    get(n3) {
-      return this.getNth(n3).map(parse_default5).map((o2) => o2.num);
-    }
-    json(n3) {
-      let opts2 = typeof n3 === "object" ? n3 : {};
-      return this.getNth(n3).map((p4) => {
-        let json = p4.toView().json(opts2)[0];
-        let parsed = parse_default5(p4);
-        json.number = {
-          prefix: parsed.prefix,
-          num: parsed.num,
-          suffix: parsed.suffix,
-          hasComma: parsed.hasComma,
-          unit: parsed.unit
-        };
-        return json;
-      }, []);
-    }
-    units() {
-      return this.growRight("#Unit").match("#Unit$");
-    }
-    isOrdinal() {
-      return this.if("#Ordinal");
-    }
-    isCardinal() {
-      return this.if("#Cardinal");
-    }
-    toNumber() {
-      let m3 = this.if("#TextValue");
-      m3.forEach((val) => {
-        let obj = parse_default5(val);
-        if (obj.num === null) {
-          return;
-        }
-        let fmt2 = val.has("#Ordinal") ? "Ordinal" : "Cardinal";
-        let str = format_default(obj, fmt2);
-        val.replaceWith(str, { tags: true });
-        val.tag("NumericValue");
-      });
-      return this;
-    }
-    toLocaleString() {
-      let m3 = this;
-      m3.forEach((val) => {
-        let obj = parse_default5(val);
-        if (obj.num === null) {
-          return;
-        }
-        let num = obj.num.toLocaleString();
-        if (val.has("#Ordinal")) {
-          let str = format_default(obj, "Ordinal");
-          let end2 = str.match(/[a-z]+$/);
-          if (end2) {
-            num += end2[0] || "";
-          }
-        }
-        val.replaceWith(num, { tags: true });
-      });
-      return this;
-    }
-    toText() {
-      let m3 = this;
-      let res = m3.map((val) => {
-        if (val.has("#TextValue")) {
-          return val;
-        }
-        let obj = parse_default5(val);
-        if (obj.num === null) {
-          return val;
-        }
-        let fmt2 = val.has("#Ordinal") ? "TextOrdinal" : "TextCardinal";
-        let str = format_default(obj, fmt2);
-        val.replaceWith(str, { tags: true });
-        val.tag("TextValue");
-        return val;
-      });
-      return new Numbers(res.document, res.pointer);
-    }
-    toCardinal() {
-      let m3 = this;
-      let res = m3.map((val) => {
-        if (!val.has("#Ordinal")) {
-          return val;
-        }
-        let obj = parse_default5(val);
-        if (obj.num === null) {
-          return val;
-        }
-        let fmt2 = val.has("#TextValue") ? "TextCardinal" : "Cardinal";
-        let str = format_default(obj, fmt2);
-        val.replaceWith(str, { tags: true });
-        val.tag("Cardinal");
-        return val;
-      });
-      return new Numbers(res.document, res.pointer);
-    }
-    toOrdinal() {
-      let m3 = this;
-      let res = m3.map((val) => {
-        if (val.has("#Ordinal")) {
-          return val;
-        }
-        let obj = parse_default5(val);
-        if (obj.num === null) {
-          return val;
-        }
-        let fmt2 = val.has("#TextValue") ? "TextOrdinal" : "Ordinal";
-        let str = format_default(obj, fmt2);
-        val.replaceWith(str, { tags: true });
-        val.tag("Ordinal");
-        return val;
-      });
-      return new Numbers(res.document, res.pointer);
-    }
-    isEqual(n3) {
-      return this.filter((val) => {
-        let num = parse_default5(val).num;
-        return num === n3;
-      });
-    }
-    greaterThan(n3) {
-      return this.filter((val) => {
-        let num = parse_default5(val).num;
-        return num > n3;
-      });
-    }
-    lessThan(n3) {
-      return this.filter((val) => {
-        let num = parse_default5(val).num;
-        return num < n3;
-      });
-    }
-    between(min2, max3) {
-      return this.filter((val) => {
-        let num = parse_default5(val).num;
-        return num > min2 && num < max3;
-      });
-    }
-    set(n3) {
-      if (n3 === void 0) {
-        return this;
-      }
-      if (typeof n3 === "string") {
-        n3 = parse_default5(n3).num;
-      }
-      let m3 = this;
-      let res = m3.map((val) => {
-        let obj = parse_default5(val);
-        obj.num = n3;
-        if (obj.num === null) {
-          return val;
-        }
-        let fmt2 = val.has("#Ordinal") ? "Ordinal" : "Cardinal";
-        if (val.has("#TextValue")) {
-          fmt2 = val.has("#Ordinal") ? "TextOrdinal" : "TextCardinal";
-        }
-        let str = format_default(obj, fmt2);
-        if (obj.hasComma && fmt2 === "Cardinal") {
-          str = Number(str).toLocaleString();
-        }
-        val = val.not("#Currency");
-        val.replaceWith(str, { tags: true });
-        return val;
-      });
-      return new Numbers(res.document, res.pointer);
-    }
-    add(n3) {
-      if (!n3) {
-        return this;
-      }
-      if (typeof n3 === "string") {
-        n3 = parse_default5(n3).num;
-      }
-      let m3 = this;
-      let res = m3.map((val) => {
-        let obj = parse_default5(val);
-        if (obj.num === null) {
-          return val;
-        }
-        obj.num += n3;
-        let fmt2 = val.has("#Ordinal") ? "Ordinal" : "Cardinal";
-        if (obj.isText) {
-          fmt2 = val.has("#Ordinal") ? "TextOrdinal" : "TextCardinal";
-        }
-        let str = format_default(obj, fmt2);
-        val.replaceWith(str, { tags: true });
-        return val;
-      });
-      return new Numbers(res.document, res.pointer);
-    }
-    subtract(n3, agree) {
-      return this.add(n3 * -1, agree);
-    }
-    increment(agree) {
-      return this.add(1, agree);
-    }
-    decrement(agree) {
-      return this.add(-1, agree);
-    }
-    update(pointer) {
-      let m3 = new Numbers(this.document, pointer);
-      m3._cache = this._cache;
-      return m3;
-    }
-  }
-  Numbers.prototype.toNice = Numbers.prototype.toLocaleString;
-  Numbers.prototype.isBetween = Numbers.prototype.between;
-  Numbers.prototype.minus = Numbers.prototype.subtract;
-  Numbers.prototype.plus = Numbers.prototype.add;
-  Numbers.prototype.equals = Numbers.prototype.isEqual;
-  View2.prototype.numbers = function(n3) {
-    let m3 = find_default3(this);
-    m3 = m3.getNth(n3);
-    return new Numbers(this.document, m3.pointer);
-  };
-  View2.prototype.percentages = function(n3) {
-    let m3 = find_default3(this);
-    m3 = m3.filter((v2) => v2.has("#Percent") || v2.after("^percent"));
-    m3 = m3.getNth(n3);
-    return new Numbers(this.document, m3.pointer);
-  };
-  View2.prototype.money = function(n3) {
-    let m3 = find_default3(this);
-    m3 = m3.filter((v2) => v2.has("#Money") || v2.after("^#Currency"));
-    m3 = m3.getNth(n3);
-    return new Numbers(this.document, m3.pointer);
-  };
-  View2.prototype.values = View2.prototype.numbers;
-};
-var api_default16 = addMethod;
-
-// node_modules/compromise/src/3-three/numbers/plugin.js
-var api13 = function(View2) {
-  api_default15(View2);
-  api_default16(View2);
-};
-var plugin_default22 = {
-  api: api13
-};
-
-// node_modules/compromise/src/3-three/redact/plugin.js
-var defaults3 = {
-  people: true,
-  emails: true,
-  phoneNumbers: true,
-  places: true
-};
-var redact = function(opts2 = {}) {
-  opts2 = Object.assign({}, defaults3, opts2);
-  if (opts2.people !== false) {
-    this.people().replaceWith("\u2588\u2588\u2588\u2588\u2588\u2588\u2588\u2588\u2588\u2588");
-  }
-  if (opts2.emails !== false) {
-    this.emails().replaceWith("\u2588\u2588\u2588\u2588\u2588\u2588\u2588\u2588\u2588\u2588");
-  }
-  if (opts2.places !== false) {
-    this.places().replaceWith("\u2588\u2588\u2588\u2588\u2588\u2588\u2588\u2588\u2588\u2588");
-  }
-  if (opts2.phoneNumbers !== false) {
-    this.phoneNumbers().replaceWith("\u2588\u2588\u2588\u2588\u2588\u2588\u2588");
-  }
-  return this;
-};
-var plugin4 = {
-  api: function(View2) {
-    View2.prototype.redact = redact;
-  }
-};
-var plugin_default23 = plugin4;
-
-// node_modules/compromise/src/3-three/sentences/questions.js
-var isQuestion = function(doc) {
-  let clauses2 = doc.clauses();
-  if (/\.\.$/.test(doc.out("text"))) {
-    return false;
-  }
-  if (doc.has("^#QuestionWord") && doc.has("@hasComma")) {
-    return false;
-  }
-  if (doc.has("or not$")) {
-    return true;
-  }
-  if (doc.has("^#QuestionWord")) {
-    return true;
-  }
-  if (doc.has("^(do|does|did|is|was|can|could|will|would|may) #Noun")) {
-    return true;
-  }
-  if (doc.has("^(have|must) you")) {
-    return true;
-  }
-  if (clauses2.has("(do|does|is|was) #Noun+ #Adverb? (#Adjective|#Infinitive)$")) {
-    return true;
-  }
-  return false;
-};
-var findQuestions = function(view) {
-  const hasQ = /\?/;
-  const { document: document2 } = view;
-  return view.filter((m3) => {
-    let terms = m3.docs[0] || [];
-    let lastTerm = terms[terms.length - 1];
-    if (!lastTerm || document2[lastTerm.index[0]].length !== terms.length) {
-      return false;
-    }
-    if (hasQ.test(lastTerm.post)) {
-      return true;
-    }
-    return isQuestion(m3);
-  });
-};
-var questions_default = findQuestions;
-
-// node_modules/compromise/src/3-three/sentences/parse/mainClause.js
-var subordinate = `(after|although|as|because|before|if|since|than|that|though|when|whenever|where|whereas|wherever|whether|while|why|unless|until|once)`;
-var relative = `(that|which|whichever|who|whoever|whom|whose|whomever)`;
-var mainClause = function(s3) {
-  let m3 = s3;
-  if (m3.length === 1) {
-    return m3;
-  }
-  m3 = m3.if("#Verb");
-  if (m3.length === 1) {
-    return m3;
-  }
-  m3 = m3.ifNo(subordinate);
-  m3 = m3.ifNo("^even (if|though)");
-  m3 = m3.ifNo("^so that");
-  m3 = m3.ifNo("^rather than");
-  m3 = m3.ifNo("^provided that");
-  if (m3.length === 1) {
-    return m3;
-  }
-  m3 = m3.ifNo(relative);
-  if (m3.length === 1) {
-    return m3;
-  }
-  m3 = m3.ifNo("(despite|during|before|through|throughout)");
-  if (m3.length === 1) {
-    return m3;
-  }
-  if (m3.length === 0) {
-    m3 = s3;
-  }
-  return m3.eq(0);
-};
-var mainClause_default = mainClause;
-
-// node_modules/compromise/src/3-three/sentences/parse/index.js
-var grammar = function(vb3) {
-  let tense = null;
-  if (vb3.has("#PastTense")) {
-    tense = "PastTense";
-  } else if (vb3.has("#FutureTense")) {
-    tense = "FutureTense";
-  } else if (vb3.has("#PresentTense")) {
-    tense = "PresentTense";
-  }
-  return {
-    tense
-  };
-};
-var parse5 = function(s3) {
-  let clauses2 = s3.clauses();
-  let main = mainClause_default(clauses2);
-  let chunks2 = main.chunks();
-  let subj = s3.none();
-  let verb = s3.none();
-  let pred = s3.none();
-  chunks2.forEach((ch, i3) => {
-    if (i3 === 0 && !ch.has("<Verb>")) {
-      subj = ch;
-      return;
-    }
-    if (!verb.found && ch.has("<Verb>")) {
-      verb = ch;
-      return;
-    }
-    if (verb.found) {
-      pred = pred.concat(ch);
-    }
-  });
-  if (verb.found && !subj.found) {
-    subj = verb.before("<Noun>+").first();
-  }
-  return {
-    subj,
-    verb,
-    pred,
-    grammar: grammar(verb)
-  };
-};
-var parse_default6 = parse5;
-
-// node_modules/compromise/src/3-three/sentences/conjugate/toPast.js
-var toPast2 = function(s3) {
-  let verbs = s3.verbs();
-  let first = verbs.eq(0);
-  if (first.has("#PastTense")) {
-    return s3;
-  }
-  first.toPastTense();
-  if (verbs.length > 1) {
-    verbs = verbs.slice(1);
-    verbs = verbs.filter((v2) => !v2.lookBehind("to$").found);
-    verbs = verbs.if("#PresentTense");
-    verbs = verbs.notIf("#Gerund");
-    let list4 = s3.match("to #Verb+ #Conjunction #Verb").terms();
-    verbs = verbs.not(list4);
-    if (verbs.found) {
-      verbs.verbs().toPastTense();
-    }
-  }
-  return s3;
-};
-var toPast_default = toPast2;
-
-// node_modules/compromise/src/3-three/sentences/conjugate/toPresent.js
-var toPresent2 = function(s3) {
-  let verbs = s3.verbs();
-  let first = verbs.eq(0);
-  first.toPresentTense();
-  if (verbs.length > 1) {
-    verbs = verbs.slice(1);
-    verbs = verbs.filter((v2) => !v2.lookBehind("to$").found);
-    verbs = verbs.notIf("#Gerund");
-    if (verbs.found) {
-      verbs.verbs().toPresentTense();
-    }
-  }
-  return s3;
-};
-var toPresent_default = toPresent2;
-
-// node_modules/compromise/src/3-three/sentences/conjugate/toFuture.js
-var toFuture = function(s3) {
-  let verbs = s3.verbs();
-  let first = verbs.eq(0);
-  first.toFutureTense();
-  s3 = s3.fullSentence();
-  verbs = s3.verbs();
-  if (verbs.length > 1) {
-    verbs = verbs.slice(1);
-    let toChange = verbs.filter((vb3) => {
-      if (vb3.lookBehind("to$").found) {
-        return false;
-      }
-      if (vb3.has("#Copula #Gerund")) {
-        return true;
-      }
-      if (vb3.has("#Gerund")) {
-        return false;
-      }
-      if (vb3.has("#Copula")) {
-        return true;
-      }
-      if (vb3.has("#PresentTense") && !vb3.has("#Infinitive") && vb3.lookBefore("(he|she|it|that|which)$").found) {
-        return false;
-      }
-      return true;
-    });
-    if (toChange.found) {
-      toChange.forEach((m3) => {
-        if (m3.has("#Copula")) {
-          m3.match("was").replaceWith("is");
-          m3.match("is").replaceWith("will be");
-          return;
-        }
-        m3.toInfinitive();
-      });
-    }
-  }
-  return s3;
-};
-var toFuture_default = toFuture;
-
-// node_modules/compromise/src/3-three/sentences/conjugate/toNegative.js
-var toNegative = function(s3) {
-  s3.verbs().first().toNegative().compute("chunks");
-  return s3;
-};
-var toPositive = function(s3) {
-  s3.verbs().first().toPositive().compute("chunks");
-  return s3;
-};
-
-// node_modules/compromise/src/3-three/sentences/conjugate/toInfinitive.js
-var toInfinitive2 = function(s3) {
-  s3.verbs().toInfinitive();
-  return s3;
-};
-var toInfinitive_default2 = toInfinitive2;
-
-// node_modules/compromise/src/3-three/sentences/api.js
-var api14 = function(View2) {
-  class Sentences extends View2 {
-    constructor(document2, pointer, groups) {
-      super(document2, pointer, groups);
-      this.viewType = "Sentences";
-    }
-    json(opts2 = {}) {
-      return this.map((m3) => {
-        let json = m3.toView().json(opts2)[0] || {};
-        let { subj, verb, pred, grammar: grammar2 } = parse_default6(m3);
-        json.sentence = {
-          subject: subj.text("normal"),
-          verb: verb.text("normal"),
-          predicate: pred.text("normal"),
-          grammar: grammar2
-        };
-        return json;
-      }, []);
-    }
-    toPastTense(n3) {
-      return this.getNth(n3).map((s3) => {
-        let parsed = parse_default6(s3);
-        return toPast_default(s3, parsed);
-      });
-    }
-    toPresentTense(n3) {
-      return this.getNth(n3).map((s3) => {
-        let parsed = parse_default6(s3);
-        return toPresent_default(s3, parsed);
-      });
-    }
-    toFutureTense(n3) {
-      return this.getNth(n3).map((s3) => {
-        let parsed = parse_default6(s3);
-        s3 = toFuture_default(s3, parsed);
-        return s3;
-      });
-    }
-    toInfinitive(n3) {
-      return this.getNth(n3).map((s3) => {
-        let parsed = parse_default6(s3);
-        return toInfinitive_default2(s3, parsed);
-      });
-    }
-    toNegative(n3) {
-      return this.getNth(n3).map((vb3) => {
-        let parsed = parse_default6(vb3);
-        return toNegative(vb3, parsed);
-      });
-    }
-    toPositive(n3) {
-      return this.getNth(n3).map((vb3) => {
-        let parsed = parse_default6(vb3);
-        return toPositive(vb3, parsed);
-      });
-    }
-    isQuestion(n3) {
-      return this.questions(n3);
-    }
-    isExclamation(n3) {
-      let res = this.filter((s3) => s3.lastTerm().has("@hasExclamation"));
-      return res.getNth(n3);
-    }
-    isStatement(n3) {
-      let res = this.filter((s3) => !s3.isExclamation().found && !s3.isQuestion().found);
-      return res.getNth(n3);
-    }
-    update(pointer) {
-      let m3 = new Sentences(this.document, pointer);
-      m3._cache = this._cache;
-      return m3;
-    }
-  }
-  Sentences.prototype.toPresent = Sentences.prototype.toPresentTense;
-  Sentences.prototype.toPast = Sentences.prototype.toPastTense;
-  Sentences.prototype.toFuture = Sentences.prototype.toFutureTense;
-  const methods16 = {
-    sentences: function(n3) {
-      let m3 = this.map((s3) => s3.fullSentence());
-      m3 = m3.getNth(n3);
-      return new Sentences(this.document, m3.pointer);
-    },
-    questions: function(n3) {
-      let m3 = questions_default(this);
-      return m3.getNth(n3);
-    }
-  };
-  Object.assign(View2.prototype, methods16);
-};
-var api_default17 = api14;
-
-// node_modules/compromise/src/3-three/sentences/plugin.js
-var plugin_default24 = { api: api_default17 };
-
-// node_modules/compromise/src/3-three/topics/people/find.js
-var find5 = function(doc) {
-  let m3 = doc.match("#Honorific+? #Person+");
-  return m3;
-};
-var find_default4 = find5;
-
-// node_modules/compromise/src/3-three/topics/people/parse.js
-var parse6 = function(m3) {
-  let res = {};
-  res.firstName = m3.match("#FirstName+");
-  res.lastName = m3.match("#LastName+");
-  res.honorific = m3.match("#Honorific+");
-  let last = res.lastName;
-  let first = res.firstName;
-  if (!first.found || !last.found) {
-    if (!first.found && !last.found && m3.has("^#Honorific .$")) {
-      res.lastName = m3.match(".$");
-      return res;
-    }
-  }
-  return res;
-};
-var parse_default7 = parse6;
-
-// node_modules/compromise/src/3-three/topics/people/gender.js
-var m2 = "male";
-var f2 = "female";
-var honorifics = {
-  mr: m2,
-  mrs: f2,
-  miss: f2,
-  madam: f2,
-  king: m2,
-  queen: f2,
-  duke: m2,
-  duchess: f2,
-  baron: m2,
-  baroness: f2,
-  count: m2,
-  countess: f2,
-  prince: m2,
-  princess: f2,
-  sire: m2,
-  dame: f2,
-  lady: f2,
-  ayatullah: m2,
-  congressman: m2,
-  congresswoman: f2,
-  "first lady": f2,
-  mx: null
-};
-var predictGender = function(parsed, person) {
-  let { firstName, honorific } = parsed;
-  if (firstName.has("#FemaleName")) {
-    return f2;
-  }
-  if (firstName.has("#MaleName")) {
-    return m2;
-  }
-  if (honorific.found) {
-    let hon = honorific.text("normal");
-    hon = hon.replace(/\./g, "");
-    if (honorifics.hasOwnProperty(hon)) {
-      return honorifics[hon];
-    }
-    if (/^her /.test(hon)) {
-      return f2;
-    }
-    if (/^his /.test(hon)) {
-      return m2;
-    }
-  }
-  let after2 = person.after();
-  if (!after2.has("#Person") && after2.has("#Pronoun")) {
-    let pro = after2.match("#Pronoun");
-    if (pro.has("(they|their)")) {
-      return null;
-    }
-    let hasMasc = pro.has("(he|his)");
-    let hasFem = pro.has("(she|her|hers)");
-    if (hasMasc && !hasFem) {
-      return m2;
-    }
-    if (hasFem && !hasMasc) {
-      return f2;
-    }
-  }
-  return null;
-};
-var gender_default = predictGender;
-
-// node_modules/compromise/src/3-three/topics/people/api.js
-var addMethod2 = function(View2) {
-  class People extends View2 {
-    constructor(document2, pointer, groups) {
-      super(document2, pointer, groups);
-      this.viewType = "People";
-    }
-    parse(n3) {
-      return this.getNth(n3).map(parse_default7);
-    }
-    json(n3) {
-      let opts2 = typeof n3 === "object" ? n3 : {};
-      return this.getNth(n3).map((p4) => {
-        let json = p4.toView().json(opts2)[0];
-        let parsed = parse_default7(p4);
-        json.person = {
-          firstName: parsed.firstName.text("normal"),
-          lastName: parsed.lastName.text("normal"),
-          honorific: parsed.honorific.text("normal"),
-          presumed_gender: gender_default(parsed, p4)
-        };
-        return json;
-      }, []);
-    }
-    presumedMale() {
-      return this.filter((m3) => {
-        return m3.has("(#MaleName|mr|mister|sr|jr|king|pope|prince|sir)");
-      });
-    }
-    presumedFemale() {
-      return this.filter((m3) => {
-        return m3.has("(#FemaleName|mrs|miss|queen|princess|madam)");
-      });
-    }
-    update(pointer) {
-      let m3 = new People(this.document, pointer);
-      m3._cache = this._cache;
-      return m3;
-    }
-  }
-  View2.prototype.people = function(n3) {
-    let m3 = find_default4(this);
-    m3 = m3.getNth(n3);
-    return new People(this.document, m3.pointer);
-  };
-};
-var api_default18 = addMethod2;
-
-// node_modules/compromise/src/3-three/topics/places/find.js
-var find6 = function(doc) {
-  let m3 = doc.match("(#Place|#Address)+");
-  let splits = m3.match("@hasComma");
-  splits = splits.filter((c2) => {
-    if (c2.has("(asia|africa|europe|america)$")) {
-      return true;
-    }
-    if (c2.has("(#City|#Region|#ProperNoun)$") && c2.after("^(#Country|#Region)").found) {
-      return false;
-    }
-    return true;
-  });
-  m3 = m3.splitAfter(splits);
-  return m3;
-};
-var find_default5 = find6;
-
-// node_modules/compromise/src/3-three/topics/places/api.js
-var addMethod3 = function(View2) {
-  View2.prototype.places = function(n3) {
-    let m3 = find_default5(this);
-    m3 = m3.getNth(n3);
-    return new View2(this.document, m3.pointer);
-  };
-};
-var api_default19 = addMethod3;
-
-// node_modules/compromise/src/3-three/topics/orgs/api.js
-var api15 = function(View2) {
-  View2.prototype.organizations = function(n3) {
-    let m3 = this.match("#Organization+");
-    return m3.getNth(n3);
-  };
-};
-var api_default20 = api15;
-
-// node_modules/compromise/src/3-three/topics/topics.js
-var find7 = function(n3) {
-  let r2 = this.clauses();
-  let m3 = r2.people();
-  m3 = m3.concat(r2.places());
-  m3 = m3.concat(r2.organizations());
-  m3 = m3.not("(someone|man|woman|mother|brother|sister|father)");
-  m3 = m3.sort("seq");
-  m3 = m3.getNth(n3);
-  return m3;
-};
-var api16 = function(View2) {
-  View2.prototype.topics = find7;
-};
-var topics_default = api16;
-
-// node_modules/compromise/src/3-three/topics/plugin.js
-var api17 = function(View2) {
-  api_default18(View2);
-  api_default19(View2);
-  api_default20(View2);
-  topics_default(View2);
-};
-var plugin_default25 = { api: api17 };
-
-// node_modules/compromise/src/3-three/verbs/find.js
-var findVerbs = function(doc) {
-  let m3 = doc.match("<Verb>");
-  m3 = m3.not("(#Conjunction && !to)");
-  m3 = m3.not("#Preposition");
-  m3 = m3.splitAfter("@hasComma");
-  m3 = m3.splitAfter("[(do|did|am|was|is|will)] (is|was)", 0);
-  m3 = m3.splitBefore("(#Verb && !#Copula) [being] #Verb", 0);
-  m3 = m3.splitBefore("#Verb [to be] #Verb", 0);
-  m3 = m3.splitAfter("[help] #PresentTense", 0);
-  m3 = m3.splitBefore("(#PresentTense|#PastTense) [#Copula]$", 0);
-  m3 = m3.splitBefore("(#PresentTense|#PastTense) [will be]$", 0);
-  m3 = m3.not("#Reflexive$");
-  m3 = m3.splitAfter("[#PastTense] #PastTense", 0);
-  m3 = m3.splitAfter("[#PastTense] #Auxiliary+ #PastTense", 0);
-  m3 = m3.splitAfter("#Copula [#Gerund] #PastTense", 0);
-  m3 = m3.if("#Verb");
-  if (m3.has("(#Verb && !#Auxiliary) #Adverb+? #Copula")) {
-    m3 = m3.splitBefore("#Copula");
-  }
-  return m3;
-};
-var find_default6 = findVerbs;
-
-// node_modules/compromise/src/3-three/verbs/api/parse/root.js
-var getMain = function(vb3) {
-  let root = vb3;
-  if (vb3.wordCount() > 1) {
-    root = vb3.not("(#Negative|#Auxiliary|#Modal|#Adverb|#Prefix)");
-  }
-  if (root.length > 1 && !root.has("#Phrasal #Particle")) {
-    root = root.last();
-  }
-  root = root.not("(want|wants|wanted) to");
-  if (!root.found) {
-    root = vb3.not("#Negative");
-    return root;
-  }
-  return root;
-};
-var root_default2 = getMain;
-
-// node_modules/compromise/src/3-three/verbs/api/parse/adverbs.js
-var getAdverbs = function(vb3, root) {
-  let res = {
-    pre: vb3.none(),
-    post: vb3.none()
-  };
-  if (!vb3.has("#Adverb")) {
-    return res;
-  }
-  let parts = vb3.splitOn(root);
-  if (parts.length === 3) {
-    return {
-      pre: parts.eq(0).adverbs(),
-      post: parts.eq(2).adverbs()
-    };
-  }
-  if (parts.eq(0).isDoc(root)) {
-    res.post = parts.eq(1).adverbs();
-    return res;
-  }
-  res.pre = parts.eq(0).adverbs();
-  return res;
-};
-var adverbs_default2 = getAdverbs;
-
-// node_modules/compromise/src/3-three/verbs/api/parse/index.js
-var getAuxiliary = function(vb3, root) {
-  let parts = vb3.splitBefore(root);
-  if (parts.length <= 1) {
-    return vb3.none();
-  }
-  let aux = parts.eq(0);
-  aux = aux.not("(#Adverb|#Negative|#Prefix)");
-  return aux;
-};
-var getNegative = function(vb3) {
-  return vb3.match("#Negative");
-};
-var getPhrasal = function(root) {
-  if (!root.has("(#Particle|#PhrasalVerb)")) {
-    return {
-      verb: root.none(),
-      particle: root.none()
-    };
-  }
-  let particle = root.match("#Particle$");
-  return {
-    verb: root.not(particle),
-    particle
-  };
-};
-var parseVerb = function(view) {
-  let vb3 = view.clone();
-  vb3.contractions().expand();
-  const root = root_default2(vb3);
-  let res = {
-    root,
-    prefix: vb3.match("#Prefix"),
-    adverbs: adverbs_default2(vb3, root),
-    auxiliary: getAuxiliary(vb3, root),
-    negative: getNegative(vb3),
-    phrasal: getPhrasal(root)
-  };
-  return res;
-};
-var parse_default8 = parseVerb;
-
-// node_modules/compromise/src/3-three/verbs/api/parse/grammar/forms.js
-var present = { tense: "PresentTense" };
-var conditional = { conditional: true };
-var future = { tense: "FutureTense" };
-var prog = { progressive: true };
-var past2 = { tense: "PastTense" };
-var complete = { complete: true, progressive: false };
-var passive = { passive: true };
-var plural = { plural: true };
-var singular = { plural: false };
-var getData = function(tags) {
-  let data = {};
-  tags.forEach((o2) => {
-    Object.assign(data, o2);
-  });
-  return data;
-};
-var verbForms = {
-  "imperative": [
-    ["#Imperative", []]
-  ],
-  "want-infinitive": [
-    ["^(want|wants|wanted) to #Infinitive$", [present]],
-    ["^wanted to #Infinitive$", [past2]],
-    ["^will want to #Infinitive$", [future]]
-  ],
-  "gerund-phrase": [
-    ["^#PastTense #Gerund$", [past2]],
-    ["^#PresentTense #Gerund$", [present]],
-    ["^#Infinitive #Gerund$", [present]],
-    ["^will #Infinitive #Gerund$", [future]],
-    ["^have #PastTense #Gerund$", [past2]],
-    ["^will have #PastTense #Gerund$", [past2]]
-  ],
-  "simple-present": [
-    ["^#PresentTense$", [present]],
-    ["^#Infinitive$", [present]]
-  ],
-  "simple-past": [
-    ["^#PastTense$", [past2]]
-  ],
-  "simple-future": [
-    ["^will #Adverb? #Infinitive", [future]]
-  ],
-  "present-progressive": [
-    ["^(is|are|am) #Gerund$", [present, prog]]
-  ],
-  "past-progressive": [
-    ["^(was|were) #Gerund$", [past2, prog]]
-  ],
-  "future-progressive": [
-    ["^will be #Gerund$", [future, prog]]
-  ],
-  "present-perfect": [
-    ["^(has|have) #PastTense$", [past2, complete]]
-  ],
-  "past-perfect": [
-    ["^had #PastTense$", [past2, complete]],
-    ["^had #PastTense to #Infinitive", [past2, complete]]
-  ],
-  "future-perfect": [
-    ["^will have #PastTense$", [future, complete]]
-  ],
-  "present-perfect-progressive": [
-    ["^(has|have) been #Gerund$", [past2, prog]]
-  ],
-  "past-perfect-progressive": [
-    ["^had been #Gerund$", [past2, prog]]
-  ],
-  "future-perfect-progressive": [
-    ["^will have been #Gerund$", [future, prog]]
-  ],
-  "passive-past": [
-    ["(got|were|was) #Passive", [past2, passive]],
-    ["^(was|were) being #Passive", [past2, passive]],
-    ["^(had|have) been #Passive", [past2, passive]]
-  ],
-  "passive-present": [
-    ["^(is|are|am) #Passive", [present, passive]],
-    ["^(is|are|am) being #Passive", [present, passive]],
-    ["^has been #Passive", [present, passive]]
-  ],
-  "passive-future": [
-    ["will have been #Passive", [future, passive, conditional]],
-    ["will be being? #Passive", [future, passive, conditional]]
-  ],
-  "present-conditional": [
-    ["would be #PastTense", [present, conditional]]
-  ],
-  "past-conditional": [
-    ["would have been #PastTense", [past2, conditional]]
-  ],
-  "auxiliary-future": [
-    ["(is|are|am|was) going to (#Infinitive|#PresentTense)", [future]]
-  ],
-  "auxiliary-past": [
-    ["^did #Infinitive$", [past2, singular]],
-    ["^used to #Infinitive$", [past2, complete]]
-  ],
-  "auxiliary-present": [
-    ["^(does|do) #Infinitive$", [present, complete, plural]]
-  ],
-  "modal-past": [
-    ["^(could|must|should|shall) have #PastTense$", [past2]]
-  ],
-  "modal-infinitive": [
-    ["^#Modal #Infinitive$", []]
-  ],
-  "infinitive": [
-    ["^#Infinitive$", []]
-  ]
-};
-var list3 = [];
-Object.keys(verbForms).map((k2) => {
-  verbForms[k2].forEach((a2) => {
-    list3.push({
-      name: k2,
-      match: a2[0],
-      data: getData(a2[1])
-    });
-  });
-});
-var forms_default = list3;
-
-// node_modules/compromise/src/3-three/verbs/api/parse/grammar/index.js
-var cleanUp2 = function(vb3, res) {
-  vb3 = vb3.clone();
-  if (res.adverbs.post && res.adverbs.post.found) {
-    vb3.remove(res.adverbs.post);
-  }
-  if (res.adverbs.pre && res.adverbs.pre.found) {
-    vb3.remove(res.adverbs.pre);
-  }
-  if (vb3.has("#Negative")) {
-    vb3 = vb3.remove("#Negative");
-  }
-  if (vb3.has("#Prefix")) {
-    vb3 = vb3.remove("#Prefix");
-  }
-  if (res.root.has("#PhrasalVerb #Particle")) {
-    vb3.remove("#Particle$");
-  }
-  vb3 = vb3.not("#Adverb");
-  return vb3;
-};
-var getGrammar = function(vb3, res) {
-  let grammar2 = {};
-  vb3 = cleanUp2(vb3, res);
-  for (let i3 = 0; i3 < forms_default.length; i3 += 1) {
-    let todo = forms_default[i3];
-    if (vb3.has(todo.match) === true) {
-      grammar2.form = todo.name;
-      Object.assign(grammar2, todo.data);
-      break;
-    }
-  }
-  if (!grammar2.form) {
-    if (vb3.has("^#Verb$")) {
-      grammar2.form = "infinitive";
-    }
-  }
-  if (!grammar2.tense) {
-    grammar2.tense = res.root.has("#PastTense") ? "PastTense" : "PresentTense";
-  }
-  grammar2.copula = res.root.has("#Copula");
-  return grammar2;
-};
-var grammar_default = getGrammar;
-
-// node_modules/compromise/src/3-three/verbs/api/parse/getSubject.js
-var shouldSkip = function(last) {
-  if (last.length <= 1) {
-    return false;
-  }
-  let obj = last.parse()[0] || {};
-  return obj.isSubordinate;
-};
-var noSubClause = function(before2) {
-  let parts = before2.clauses();
-  parts = parts.filter((m3, i3) => {
-    if (m3.has("^(if|unless|while|but|for|per|at|by|that|which|who|from)")) {
-      return false;
-    }
-    if (i3 > 0 && m3.has("^#Verb . #Noun+$")) {
-      return false;
-    }
-    if (i3 > 0 && m3.has("^#Adverb")) {
-      return false;
-    }
-    return true;
-  });
-  if (parts.length === 0) {
-    return before2;
-  }
-  return parts;
-};
-var lastNoun2 = function(vb3) {
-  let before2 = vb3.before();
-  before2 = noSubClause(before2);
-  let nouns = before2.nouns();
-  let last = nouns.last();
-  let pronoun = last.match("(i|he|she|we|you|they)");
-  if (pronoun.found) {
-    return pronoun.nouns();
-  }
-  let det = nouns.if("^(that|this|those)");
-  if (det.found) {
-    return det;
-  }
-  if (nouns.found === false) {
-    det = before2.match("^(that|this|those)");
-    if (det.found) {
-      return det;
-    }
-  }
-  last = nouns.last();
-  if (shouldSkip(last)) {
-    nouns.remove(last);
-    last = nouns.last();
-  }
-  if (shouldSkip(last)) {
-    nouns.remove(last);
-    last = nouns.last();
-  }
-  return last;
-};
-var isPlural3 = function(subj, vb3) {
-  if (vb3.has("(are|were|does)")) {
-    return true;
-  }
-  if (subj.has("(those|they|we)")) {
-    return true;
-  }
-  if (subj.found && subj.isPlural) {
-    return subj.isPlural().found;
-  }
-  return false;
-};
-var getSubject = function(vb3) {
-  let subj = lastNoun2(vb3);
-  return {
-    subject: subj,
-    plural: isPlural3(subj, vb3)
-  };
-};
-var getSubject_default = getSubject;
-
-// node_modules/compromise/src/3-three/verbs/api/lib.js
-var noop = (vb3) => vb3;
-var isPlural4 = (vb3, parsed) => {
-  let subj = getSubject_default(vb3, parsed);
-  let m3 = subj.subject;
-  if (m3.has("i") || m3.has("we")) {
-    return true;
-  }
-  return subj.plural;
-};
-var wasWere = (vb3, parsed) => {
-  let { subject, plural: plural2 } = getSubject_default(vb3, parsed);
-  if (plural2 || subject.has("we")) {
-    return "were";
-  }
-  return "was";
-};
-var isAreAm = function(vb3, parsed) {
-  if (vb3.has("were")) {
-    return "are";
-  }
-  let { subject, plural: plural2 } = getSubject_default(vb3, parsed);
-  if (subject.has("i")) {
-    return "am";
-  }
-  if (subject.has("we") || plural2) {
-    return "are";
-  }
-  return "is";
-};
-var doDoes = function(vb3, parsed) {
-  let subj = getSubject_default(vb3, parsed);
-  let m3 = subj.subject;
-  if (m3.has("i") || m3.has("we")) {
-    return "do";
-  }
-  if (subj.plural) {
-    return "do";
-  }
-  return "does";
-};
-var getTense2 = function(m3) {
-  if (m3.has("#Infinitive")) {
-    return "Infinitive";
-  }
-  if (m3.has("#Participle")) {
-    return "Participle";
-  }
-  if (m3.has("#PastTense")) {
-    return "PastTense";
-  }
-  if (m3.has("#Gerund")) {
-    return "Gerund";
-  }
-  if (m3.has("#PresentTense")) {
-    return "PresentTense";
-  }
-  return void 0;
-};
-var toInf = function(vb3, parsed) {
-  const { toInfinitive: toInfinitive3 } = vb3.methods.two.transform.verb;
-  let str = parsed.root.text({ keepPunct: false });
-  str = toInfinitive3(str, vb3.model, getTense2(vb3));
-  if (str) {
-    vb3.replace(parsed.root, str);
-  }
-  return vb3;
-};
-var noWill = (vb3) => {
-  if (vb3.has("will not")) {
-    return vb3.replace("will not", "have not");
-  }
-  return vb3.remove("will");
-};
-
-// node_modules/compromise/src/3-three/verbs/api/toJSON.js
-var toArray4 = function(m3) {
-  if (!m3 || !m3.isView) {
-    return [];
-  }
-  const opts2 = { normal: true, terms: false, text: false };
-  return m3.json(opts2).map((s3) => s3.normal);
-};
-var toText4 = function(m3) {
-  if (!m3 || !m3.isView) {
-    return "";
-  }
-  return m3.text("normal");
-};
-var toInf2 = function(root) {
-  const { toInfinitive: toInfinitive3 } = root.methods.two.transform.verb;
-  let str = root.text("normal");
-  return toInfinitive3(str, root.model, getTense2(root));
-};
-var toJSON3 = function(vb3) {
-  let parsed = parse_default8(vb3);
-  vb3 = vb3.clone().toView();
-  const info = grammar_default(vb3, parsed);
-  return {
-    root: parsed.root.text(),
-    preAdverbs: toArray4(parsed.adverbs.pre),
-    postAdverbs: toArray4(parsed.adverbs.post),
-    auxiliary: toText4(parsed.auxiliary),
-    negative: parsed.negative.found,
-    prefix: toText4(parsed.prefix),
-    infinitive: toInf2(parsed.root),
-    grammar: info
-  };
-};
-var toJSON_default2 = toJSON3;
-
-// node_modules/compromise/src/3-three/verbs/api/conjugate/toInfinitive.js
-var keep3 = { tags: true };
-var toInf3 = function(vb3, parsed) {
-  const { toInfinitive: toInfinitive3 } = vb3.methods.two.transform.verb;
-  const { root, auxiliary } = parsed;
-  let aux = auxiliary.terms().harden();
-  let str = root.text("normal");
-  str = toInfinitive3(str, vb3.model, getTense2(root));
-  if (str) {
-    vb3.replace(root, str, keep3).tag("Verb").firstTerm().tag("Infinitive");
-  }
-  if (aux.found) {
-    vb3.remove(aux);
-  }
-  if (parsed.negative.found) {
-    if (!vb3.has("not")) {
-      vb3.prepend("not");
-    }
-    let does = doDoes(vb3, parsed);
-    vb3.prepend(does);
-  }
-  vb3.fullSentence().compute(["lexicon", "preTagger", "postTagger", "chunks"]);
-  return vb3;
-};
-var toInfinitive_default3 = toInf3;
-
-// node_modules/compromise/src/3-three/verbs/api/conjugate/toPast.js
-var keep4 = { tags: true };
-var fns6 = {
-  noAux: (vb3, parsed) => {
-    if (parsed.auxiliary.found) {
-      vb3 = vb3.remove(parsed.auxiliary);
-    }
-    return vb3;
-  },
-  simple: (vb3, parsed) => {
-    const { conjugate: conjugate2, toInfinitive: toInfinitive3 } = vb3.methods.two.transform.verb;
-    const root = parsed.root;
-    if (root.has("#Modal")) {
-      return vb3;
-    }
-    let str = root.text({ keepPunct: false });
-    str = toInfinitive3(str, vb3.model, getTense2(root));
-    let all4 = conjugate2(str, vb3.model);
-    str = all4.PastTense;
-    str = str === "been" ? "was" : str;
-    if (str === "was") {
-      str = wasWere(vb3, parsed);
-    }
-    if (str) {
-      vb3.replace(root, str, keep4);
-    }
-    return vb3;
-  },
-  both: function(vb3, parsed) {
-    if (parsed.negative.found) {
-      vb3.replace("will", "did");
-      return vb3;
-    }
-    vb3 = fns6.simple(vb3, parsed);
-    vb3 = fns6.noAux(vb3, parsed);
-    return vb3;
-  },
-  hasHad: (vb3) => {
-    vb3.replace("has", "had", keep4);
-    return vb3;
-  },
-  hasParticiple: (vb3, parsed) => {
-    const { conjugate: conjugate2, toInfinitive: toInfinitive3 } = vb3.methods.two.transform.verb;
-    const root = parsed.root;
-    let str = root.text("normal");
-    str = toInfinitive3(str, vb3.model, getTense2(root));
-    return conjugate2(str, vb3.model).Participle;
-  }
-};
-var forms = {
-  "infinitive": fns6.simple,
-  "simple-present": fns6.simple,
-  "simple-past": noop,
-  "simple-future": fns6.both,
-  "present-progressive": (vb3) => {
-    vb3.replace("are", "were", keep4);
-    vb3.replace("(is|are|am)", "was", keep4);
-    return vb3;
-  },
-  "past-progressive": noop,
-  "future-progressive": (vb3, parsed) => {
-    vb3.match(parsed.root).insertBefore("was");
-    vb3.remove("(will|be)");
-    return vb3;
-  },
-  "present-perfect": fns6.hasHad,
-  "past-perfect": noop,
-  "future-perfect": (vb3, parsed) => {
-    vb3.match(parsed.root).insertBefore("had");
-    if (vb3.has("will")) {
-      vb3 = noWill(vb3);
-    }
-    vb3.remove("have");
-    return vb3;
-  },
-  "present-perfect-progressive": fns6.hasHad,
-  "past-perfect-progressive": noop,
-  "future-perfect-progressive": (vb3) => {
-    vb3.remove("will");
-    vb3.replace("have", "had", keep4);
-    return vb3;
-  },
-  "passive-past": (vb3) => {
-    vb3.replace("have", "had", keep4);
-    return vb3;
-  },
-  "passive-present": (vb3) => {
-    vb3.replace("(is|are)", "was", keep4);
-    return vb3;
-  },
-  "passive-future": (vb3, parsed) => {
-    if (parsed.auxiliary.has("will be")) {
-      vb3.match(parsed.root).insertBefore("had been");
-      vb3.remove("(will|be)");
-    }
-    if (parsed.auxiliary.has("will have been")) {
-      vb3.replace("have", "had", keep4);
-      vb3.remove("will");
-    }
-    return vb3;
-  },
-  "present-conditional": (vb3) => {
-    vb3.replace("be", "have been");
-    return vb3;
-  },
-  "past-conditional": noop,
-  "auxiliary-future": (vb3) => {
-    vb3.replace("(is|are|am)", "was", keep4);
-    return vb3;
-  },
-  "auxiliary-past": noop,
-  "auxiliary-present": (vb3) => {
-    vb3.replace("(do|does)", "did", keep4);
-    return vb3;
-  },
-  "modal-infinitive": (vb3, parsed) => {
-    if (vb3.has("can")) {
-      vb3.replace("can", "could", keep4);
-    } else {
-      fns6.simple(vb3, parsed);
-      vb3.match("#Modal").insertAfter("have").tag("Auxiliary");
-    }
-    return vb3;
-  },
-  "modal-past": noop,
-  "want-infinitive": (vb3) => {
-    vb3.replace("(want|wants)", "wanted", keep4);
-    vb3.remove("will");
-    return vb3;
-  },
-  "gerund-phrase": (vb3, parsed) => {
-    parsed.root = parsed.root.not("#Gerund$");
-    fns6.simple(vb3, parsed);
-    noWill(vb3);
-    return vb3;
-  }
-};
-var toPast3 = function(vb3, parsed, form) {
-  if (forms.hasOwnProperty(form)) {
-    vb3 = forms[form](vb3, parsed);
-    vb3.fullSentence().compute(["tagger", "chunks"]);
-    return vb3;
-  }
-  return vb3;
-};
-var toPast_default2 = toPast3;
-
-// node_modules/compromise/src/3-three/verbs/api/conjugate/toPresent.js
-var keep5 = { tags: true };
-var simple = (vb3, parsed) => {
-  const { conjugate: conjugate2, toInfinitive: toInfinitive3 } = vb3.methods.two.transform.verb;
-  const root = parsed.root;
-  let str = root.text("normal");
-  str = toInfinitive3(str, vb3.model, getTense2(root));
-  if (isPlural4(vb3, parsed) === false) {
-    str = conjugate2(str, vb3.model).PresentTense;
-  }
-  if (root.has("#Copula")) {
-    str = isAreAm(vb3, parsed);
-  }
-  if (str) {
-    vb3 = vb3.replace(root, str, keep5);
-    vb3.not("#Particle").tag("PresentTense");
-  }
-  return vb3;
-};
-var toGerund2 = (vb3, parsed) => {
-  const { conjugate: conjugate2, toInfinitive: toInfinitive3 } = vb3.methods.two.transform.verb;
-  const root = parsed.root;
-  let str = root.text("normal");
-  str = toInfinitive3(str, vb3.model, getTense2(root));
-  if (isPlural4(vb3, parsed) === false) {
-    str = conjugate2(str, vb3.model).Gerund;
-  }
-  if (str) {
-    vb3 = vb3.replace(root, str, keep5);
-    vb3.not("#Particle").tag("Gerund");
-  }
-  return vb3;
-};
-var vbToInf = (vb3, parsed) => {
-  const { toInfinitive: toInfinitive3 } = vb3.methods.two.transform.verb;
-  const root = parsed.root;
-  let str = parsed.root.text("normal");
-  str = toInfinitive3(str, vb3.model, getTense2(root));
-  if (str) {
-    vb3 = vb3.replace(parsed.root, str, keep5);
-  }
-  return vb3;
-};
-var forms2 = {
-  "infinitive": simple,
-  "simple-present": (vb3, parsed) => {
-    const { conjugate: conjugate2 } = vb3.methods.two.transform.verb;
-    let { root } = parsed;
-    if (root.has("#Infinitive")) {
-      let subj = getSubject_default(vb3, parsed);
-      let m3 = subj.subject;
-      if (isPlural4(vb3, parsed) || m3.has("i")) {
-        return vb3;
-      }
-      let str = root.text("normal");
-      let pres = conjugate2(str, vb3.model).PresentTense;
-      if (str !== pres) {
-        vb3.replace(root, pres, keep5);
-      }
-    } else {
-      return simple(vb3, parsed);
-    }
-    return vb3;
-  },
-  "simple-past": simple,
-  "simple-future": (vb3, parsed) => {
-    const { root, auxiliary } = parsed;
-    if (auxiliary.has("will") && root.has("be")) {
-      let str = isAreAm(vb3, parsed);
-      vb3.replace(root, str);
-      vb3 = vb3.remove("will");
-      vb3.replace("not " + str, str + " not");
-    } else {
-      simple(vb3, parsed);
-      vb3 = vb3.remove("will");
-    }
-    return vb3;
-  },
-  "present-progressive": noop,
-  "past-progressive": (vb3, parsed) => {
-    let str = isAreAm(vb3, parsed);
-    return vb3.replace("(were|was)", str, keep5);
-  },
-  "future-progressive": (vb3) => {
-    vb3.match("will").insertBefore("is");
-    vb3.remove("be");
-    return vb3.remove("will");
-  },
-  "present-perfect": (vb3, parsed) => {
-    simple(vb3, parsed);
-    vb3 = vb3.remove("(have|had|has)");
-    return vb3;
-  },
-  "past-perfect": (vb3, parsed) => {
-    let subj = getSubject_default(vb3, parsed);
-    let m3 = subj.subject;
-    if (isPlural4(vb3, parsed) || m3.has("i")) {
-      vb3 = toInf(vb3, parsed);
-      vb3.remove("had");
-      return vb3;
-    }
-    vb3.replace("had", "has", keep5);
-    return vb3;
-  },
-  "future-perfect": (vb3) => {
-    vb3.match("will").insertBefore("has");
-    return vb3.remove("have").remove("will");
-  },
-  "present-perfect-progressive": noop,
-  "past-perfect-progressive": (vb3) => vb3.replace("had", "has", keep5),
-  "future-perfect-progressive": (vb3) => {
-    vb3.match("will").insertBefore("has");
-    return vb3.remove("have").remove("will");
-  },
-  "passive-past": (vb3, parsed) => {
-    let str = isAreAm(vb3, parsed);
-    if (vb3.has("(had|have|has)") && vb3.has("been")) {
-      vb3.replace("(had|have|has)", str, keep5);
-      vb3.replace("been", "being");
-      return vb3;
-    }
-    return vb3.replace("(got|was|were)", str);
-  },
-  "passive-present": noop,
-  "passive-future": (vb3) => {
-    vb3.replace("will", "is");
-    return vb3.replace("be", "being");
-  },
-  "present-conditional": noop,
-  "past-conditional": (vb3) => {
-    vb3.replace("been", "be");
-    return vb3.remove("have");
-  },
-  "auxiliary-future": (vb3, parsed) => {
-    toGerund2(vb3, parsed);
-    vb3.remove("(going|to)");
-    return vb3;
-  },
-  "auxiliary-past": (vb3, parsed) => {
-    if (parsed.auxiliary.has("did")) {
-      let str = doDoes(vb3, parsed);
-      vb3.replace(parsed.auxiliary, str);
-      return vb3;
-    }
-    toGerund2(vb3, parsed);
-    vb3.replace(parsed.auxiliary, "is");
-    return vb3;
-  },
-  "auxiliary-present": noop,
-  "modal-infinitive": noop,
-  "modal-past": (vb3, parsed) => {
-    vbToInf(vb3, parsed);
-    return vb3.remove("have");
-  },
-  "gerund-phrase": (vb3, parsed) => {
-    parsed.root = parsed.root.not("#Gerund$");
-    simple(vb3, parsed);
-    return vb3.remove("(will|have)");
-  },
-  "want-infinitive": (vb3, parsed) => {
-    let str = "wants";
-    if (isPlural4(vb3, parsed)) {
-      str = "want";
-    }
-    vb3.replace("(want|wanted|wants)", str, keep5);
-    vb3.remove("will");
-    return vb3;
-  }
-};
-var toPresent3 = function(vb3, parsed, form) {
-  if (forms2.hasOwnProperty(form)) {
-    vb3 = forms2[form](vb3, parsed);
-    vb3.fullSentence().compute(["tagger", "chunks"]);
-    return vb3;
-  }
-  return vb3;
-};
-var toPresent_default2 = toPresent3;
-
-// node_modules/compromise/src/3-three/verbs/api/conjugate/toFuture.js
-var keep6 = { tags: true };
-var simple2 = (vb3, parsed) => {
-  const { toInfinitive: toInfinitive3 } = vb3.methods.two.transform.verb;
-  const { root, auxiliary } = parsed;
-  if (root.has("#Modal")) {
-    return vb3;
-  }
-  let str = root.text("normal");
-  str = toInfinitive3(str, vb3.model, getTense2(root));
-  if (str) {
-    vb3 = vb3.replace(root, str, keep6);
-    vb3.not("#Particle").tag("Verb");
-  }
-  vb3.prepend("will").match("will").tag("Auxiliary");
-  vb3.remove(auxiliary);
-  return vb3;
-};
-var progressive = (vb3, parsed) => {
-  const { conjugate: conjugate2, toInfinitive: toInfinitive3 } = vb3.methods.two.transform.verb;
-  const { root, auxiliary } = parsed;
-  let str = root.text("normal");
-  str = toInfinitive3(str, vb3.model, getTense2(root));
-  if (str) {
-    str = conjugate2(str, vb3.model).Gerund;
-    vb3.replace(root, str, keep6);
-    vb3.not("#Particle").tag("PresentTense");
-  }
-  vb3.remove(auxiliary);
-  vb3.prepend("will be").match("will be").tag("Auxiliary");
-  return vb3;
-};
-var forms3 = {
-  "infinitive": simple2,
-  "simple-present": simple2,
-  "simple-past": simple2,
-  "simple-future": noop,
-  "present-progressive": progressive,
-  "past-progressive": progressive,
-  "future-progressive": noop,
-  "present-perfect": (vb3) => {
-    vb3.match("(have|has)").replaceWith("will have");
-    return vb3;
-  },
-  "past-perfect": (vb3) => vb3.replace("(had|has)", "will have"),
-  "future-perfect": noop,
-  "present-perfect-progressive": (vb3) => vb3.replace("has", "will have"),
-  "past-perfect-progressive": (vb3) => vb3.replace("had", "will have"),
-  "future-perfect-progressive": noop,
-  "passive-past": (vb3) => {
-    if (vb3.has("got")) {
-      return vb3.replace("got", "will get");
-    }
-    if (vb3.has("(was|were)")) {
-      vb3.replace("(was|were)", "will be");
-      return vb3.remove("being");
-    }
-    if (vb3.has("(have|has|had) been")) {
-      return vb3.replace("(have|has|had) been", "will be");
-    }
-    return vb3;
-  },
-  "passive-present": (vb3) => {
-    vb3.replace("being", "will be");
-    vb3.remove("(is|are|am)");
-    return vb3;
-  },
-  "passive-future": noop,
-  "present-conditional": (vb3) => vb3.replace("would", "will"),
-  "past-conditional": (vb3) => vb3.replace("would", "will"),
-  "auxiliary-future": noop,
-  "auxiliary-past": (vb3) => {
-    if (vb3.has("used") && vb3.has("to")) {
-      vb3.replace("used", "will");
-      return vb3.remove("to");
-    }
-    vb3.replace("did", "will");
-    return vb3;
-  },
-  "auxiliary-present": (vb3) => {
-    return vb3.replace("(do|does)", "will");
-  },
-  "modal-infinitive": noop,
-  "modal-past": noop,
-  "gerund-phrase": (vb3, parsed) => {
-    parsed.root = parsed.root.not("#Gerund$");
-    simple2(vb3, parsed);
-    return vb3.remove("(had|have)");
-  },
-  "want-infinitive": (vb3) => {
-    vb3.replace("(want|wants|wanted)", "will want");
-    return vb3;
-  }
-};
-var toFuture2 = function(vb3, parsed, form) {
-  if (vb3.has("will") || vb3.has("going to")) {
-    return vb3;
-  }
-  if (forms3.hasOwnProperty(form)) {
-    vb3 = forms3[form](vb3, parsed);
-    vb3.fullSentence().compute(["tagger", "chunks"]);
-    return vb3;
-  }
-  return vb3;
-};
-var toFuture_default2 = toFuture2;
-
-// node_modules/compromise/src/3-three/verbs/api/conjugate/toGerund.js
-var keep7 = { tags: true };
-var toGerund3 = function(vb3, parsed) {
-  const { toInfinitive: toInfinitive3, conjugate: conjugate2 } = vb3.methods.two.transform.verb;
-  const { root, auxiliary } = parsed;
-  if (vb3.has("#Gerund")) {
-    return vb3;
-  }
-  let str = root.text("normal");
-  str = toInfinitive3(str, vb3.model, getTense2(root));
-  let gerund = conjugate2(str, vb3.model).Gerund;
-  if (gerund) {
-    gerund = `${isAreAm(vb3, parsed)} ${gerund}`;
-    vb3.replace(root, gerund, keep7);
-  }
-  if (auxiliary.found) {
-    vb3.remove(auxiliary);
-  }
-  vb3.replace("not is", "is not");
-  vb3.replace("not are", "are not");
-  vb3.fullSentence().compute(["tagger", "chunks"]);
-  return vb3;
-};
-var toGerund_default = toGerund3;
-
-// node_modules/compromise/src/3-three/verbs/api/conjugate/toNegative.js
-var keep8 = { tags: true };
-var doesNot = function(vb3, parsed) {
-  let does = doDoes(vb3, parsed);
-  vb3.prepend(does + " not");
-  return vb3;
-};
-var isWas = function(vb3) {
-  let m3 = vb3.match("be");
-  if (m3.found) {
-    m3.prepend("not");
-    return vb3;
-  }
-  m3 = vb3.match("(is|was|am|are|will|were)");
-  if (m3.found) {
-    m3.append("not");
-    return vb3;
-  }
-  return vb3;
-};
-var hasCopula = (vb3) => vb3.has("(is|was|am|are|will|were|be)");
-var forms4 = {
-  "simple-present": (vb3, parsed) => {
-    if (hasCopula(vb3) === true) {
-      return isWas(vb3, parsed);
-    }
-    vb3 = toInf(vb3, parsed);
-    vb3 = doesNot(vb3, parsed);
-    return vb3;
-  },
-  "simple-past": (vb3, parsed) => {
-    if (hasCopula(vb3) === true) {
-      return isWas(vb3, parsed);
-    }
-    vb3 = toInf(vb3, parsed);
-    vb3.prepend("did not");
-    return vb3;
-  },
-  "imperative": (vb3) => {
-    vb3.prepend("do not");
-    return vb3;
-  },
-  "infinitive": (vb3, parsed) => {
-    if (hasCopula(vb3) === true) {
-      return isWas(vb3, parsed);
-    }
-    return doesNot(vb3, parsed);
-  },
-  "passive-past": (vb3) => {
-    if (vb3.has("got")) {
-      vb3.replace("got", "get", keep8);
-      vb3.prepend("did not");
-      return vb3;
-    }
-    let m3 = vb3.match("(was|were|had|have)");
-    if (m3.found) {
-      m3.append("not");
-    }
-    return vb3;
-  },
-  "auxiliary-past": (vb3) => {
-    if (vb3.has("used")) {
-      vb3.prepend("did not");
-      return vb3;
-    }
-    let m3 = vb3.match("(did|does|do)");
-    if (m3.found) {
-      m3.append("not");
-    }
-    return vb3;
-  },
-  "want-infinitive": (vb3, parsed) => {
-    vb3 = doesNot(vb3, parsed);
-    vb3 = vb3.replace("wants", "want", keep8);
-    return vb3;
-  }
-};
-var toNegative2 = function(vb3, parsed, form) {
-  if (vb3.has("#Negative")) {
-    return vb3;
-  }
-  if (forms4.hasOwnProperty(form)) {
-    vb3 = forms4[form](vb3, parsed);
-    return vb3;
-  }
-  let m3 = vb3.matchOne("be");
-  if (m3.found) {
-    m3.prepend("not");
-    return vb3;
-  }
-  if (hasCopula(vb3) === true) {
-    return isWas(vb3, parsed);
-  }
-  m3 = vb3.matchOne("(will|had|have|has|did|does|do|#Modal)");
-  if (m3.found) {
-    m3.append("not");
-    return vb3;
-  }
-  return vb3;
-};
-var toNegative_default = toNegative2;
-
-// node_modules/compromise/src/3-three/verbs/api/api.js
-var api18 = function(View2) {
-  class Verbs extends View2 {
-    constructor(document2, pointer, groups) {
-      super(document2, pointer, groups);
-      this.viewType = "Verbs";
-    }
-    parse(n3) {
-      return this.getNth(n3).map(parse_default8);
-    }
-    json(opts2, n3) {
-      let m3 = this.getNth(n3);
-      let arr = m3.map((vb3) => {
-        let json = vb3.toView().json(opts2)[0] || {};
-        json.verb = toJSON_default2(vb3);
-        return json;
-      }, []);
-      return arr;
-    }
-    subjects(n3) {
-      return this.getNth(n3).map((vb3) => {
-        let parsed = parse_default8(vb3);
-        return getSubject_default(vb3, parsed).subject;
-      });
-    }
-    adverbs(n3) {
-      return this.getNth(n3).map((vb3) => vb3.match("#Adverb"));
-    }
-    isSingular(n3) {
-      return this.getNth(n3).filter((vb3) => {
-        return getSubject_default(vb3).plural !== true;
-      });
-    }
-    isPlural(n3) {
-      return this.getNth(n3).filter((vb3) => {
-        return getSubject_default(vb3).plural === true;
-      });
-    }
-    isImperative(n3) {
-      return this.getNth(n3).filter((vb3) => vb3.has("#Imperative"));
-    }
-    toInfinitive(n3) {
-      return this.getNth(n3).map((vb3) => {
-        let parsed = parse_default8(vb3);
-        let info = grammar_default(vb3, parsed);
-        return toInfinitive_default3(vb3, parsed, info.form);
-      });
-    }
-    toPresentTense(n3) {
-      return this.getNth(n3).map((vb3) => {
-        let parsed = parse_default8(vb3);
-        let info = grammar_default(vb3, parsed);
-        return toPresent_default2(vb3, parsed, info.form);
-      });
-    }
-    toPastTense(n3) {
-      return this.getNth(n3).map((vb3) => {
-        let parsed = parse_default8(vb3);
-        let info = grammar_default(vb3, parsed);
-        return toPast_default2(vb3, parsed, info.form);
-      });
-    }
-    toFutureTense(n3) {
-      return this.getNth(n3).map((vb3) => {
-        let parsed = parse_default8(vb3);
-        let info = grammar_default(vb3, parsed);
-        return toFuture_default2(vb3, parsed, info.form);
-      });
-    }
-    toGerund(n3) {
-      return this.getNth(n3).map((vb3) => {
-        let parsed = parse_default8(vb3);
-        let info = grammar_default(vb3, parsed);
-        return toGerund_default(vb3, parsed, info.form);
-      });
-    }
-    conjugate(n3) {
-      return this.getNth(n3).map((vb3) => {
-        let parsed = parse_default8(vb3);
-        let info = grammar_default(vb3, parsed);
-        if (info.form === "imperative") {
-          info.form = "simple-present";
-        }
-        return {
-          Infinitive: toInfinitive_default3(vb3.clone(), parsed, info.form).text("normal"),
-          PastTense: toPast_default2(vb3.clone(), parsed, info.form).text("normal"),
-          PresentTense: toPresent_default2(vb3.clone(), parsed, info.form).text("normal"),
-          FutureTense: toFuture_default2(vb3.clone(), parsed, info.form).text("normal")
-        };
-      }, []);
-    }
-    isNegative() {
-      return this.if("#Negative");
-    }
-    isPositive() {
-      return this.ifNo("#Negative");
-    }
-    toPositive() {
-      let m3 = this.match("do not #Verb");
-      if (m3.found) {
-        m3.remove("do not");
-      }
-      return this.remove("#Negative");
-    }
-    toNegative(n3) {
-      return this.getNth(n3).map((vb3) => {
-        let parsed = parse_default8(vb3);
-        let info = grammar_default(vb3, parsed);
-        return toNegative_default(vb3, parsed, info.form);
-      });
-    }
-    update(pointer) {
-      let m3 = new Verbs(this.document, pointer);
-      m3._cache = this._cache;
-      return m3;
-    }
-  }
-  Verbs.prototype.toPast = Verbs.prototype.toPastTense;
-  Verbs.prototype.toPresent = Verbs.prototype.toPresentTense;
-  Verbs.prototype.toFuture = Verbs.prototype.toFutureTense;
-  View2.prototype.verbs = function(n3) {
-    let vb3 = find_default6(this);
-    vb3 = vb3.getNth(n3);
-    return new Verbs(this.document, vb3.pointer);
-  };
-};
-var api_default21 = api18;
-
-// node_modules/compromise/src/3-three/verbs/plugin.js
-var plugin_default26 = {
-  api: api_default21
-};
-
-// node_modules/compromise/src/3-three/coreference/compute/lib.js
-var findChained = function(want, s3) {
-  let m3 = s3.match(want);
-  if (m3.found) {
-    let ref = m3.pronouns().refersTo();
-    if (ref.found) {
-      return ref;
-    }
-  }
-  return s3.none();
-};
-var prevSentence = function(m3) {
-  if (!m3.found) {
-    return m3;
-  }
-  let [n3] = m3.fullPointer[0];
-  if (n3 && n3 > 0) {
-    return m3.update([[n3 - 1]]);
-  }
-  return m3.none();
-};
-
-// node_modules/compromise/src/3-three/coreference/compute/findPerson.js
-var byGender = function(ppl, gender) {
-  if (gender === "m") {
-    return ppl.filter((m3) => !m3.presumedFemale().found);
-  } else if (gender === "f") {
-    return ppl.filter((m3) => !m3.presumedMale().found);
-  }
-  return ppl;
-};
-var getPerson = function(s3, gender) {
-  let people = s3.people();
-  people = byGender(people, gender);
-  if (people.found) {
-    return people.last();
-  }
-  people = s3.nouns("#Actor+");
-  if (people.found) {
-    return people.last();
-  }
-  if (gender === "f") {
-    return findChained("(she|her|hers)", s3);
-  }
-  if (gender === "m") {
-    return findChained("(he|him|his)", s3);
-  }
-  return s3.none();
-};
-var findPerson_default = getPerson;
-
-// node_modules/compromise/src/3-three/coreference/compute/findThey.js
-var getThey = function(s3) {
-  let things = s3.nouns().isPlural();
-  if (things.found) {
-    return things.last();
-  }
-  let chain = findChained("(they|their|theirs)", s3);
-  if (chain.found) {
-    return chain;
-  }
-  return s3.none();
-};
-var findThey_default = getThey;
-
-// node_modules/compromise/src/3-three/coreference/compute/index.js
-var addReference = function(pron, m3) {
-  if (m3 && m3.found) {
-    let term = pron.docs[0][0];
-    term.reference = m3.ptrs[0];
-  }
-};
-var stepBack = function(m3, cb) {
-  let s3 = m3.before();
-  let res = cb(s3);
-  if (res.found) {
-    return res;
-  }
-  s3 = prevSentence(m3);
-  res = cb(s3);
-  if (res.found) {
-    return res;
-  }
-  s3 = prevSentence(s3);
-  res = cb(s3);
-  if (res.found) {
-    return res;
-  }
-  return m3.none();
-};
-var coreference = function(view) {
-  let pronouns = view.match("(he|him|his|she|her|hers|they|their|theirs|it|its)");
-  pronouns.forEach((pron) => {
-    let res = null;
-    if (pron.has("(he|him|his)")) {
-      res = stepBack(pron, (m3) => findPerson_default(m3, "m"));
-    } else if (pron.has("(she|her|hers)")) {
-      res = stepBack(pron, (m3) => findPerson_default(m3, "f"));
-    } else if (pron.has("(they|their|theirs)")) {
-      res = stepBack(pron, findThey_default);
-    }
-    if (res && res.found) {
-      addReference(pron, res);
-    }
-  });
-};
-var compute_default12 = coreference;
-
-// node_modules/compromise/src/3-three/coreference/api/pronouns.js
-var api19 = function(View2) {
-  class Pronouns extends View2 {
-    constructor(document2, pointer, groups) {
-      super(document2, pointer, groups);
-      this.viewType = "Pronouns";
-    }
-    refersTo() {
-      return this.map((m3) => {
-        if (!m3.found) {
-          return m3.none();
-        }
-        let term = m3.docs[0][0];
-        if (term.reference) {
-          return m3.update([term.reference]);
-        }
-        return m3.none();
-      });
-    }
-    update(pointer) {
-      let m3 = new Pronouns(this.document, pointer);
-      m3._cache = this._cache;
-      return m3;
-    }
-  }
-  View2.prototype.pronouns = function(n3) {
-    let m3 = this.match("#Pronoun");
-    m3 = m3.getNth(n3);
-    return new Pronouns(m3.document, m3.pointer);
-  };
-};
-var pronouns_default = api19;
-
-// node_modules/compromise/src/3-three/coreference/plugin.js
-var plugin_default27 = {
-  compute: { coreference: compute_default12 },
-  api: pronouns_default
-};
-
-// node_modules/compromise/src/three.js
-two_default.plugin(plugin_default18);
-two_default.plugin(plugin_default27);
-two_default.plugin(plugin_default19);
-two_default.plugin(plugin_default20);
-two_default.plugin(plugin_default21);
-two_default.plugin(plugin_default22);
-two_default.plugin(plugin_default23);
-two_default.plugin(plugin_default24);
-two_default.plugin(plugin_default25);
-two_default.plugin(plugin_default26);
-var three_default = two_default;
-
-// syntaxHighlight.ts
-function getAllDecosByLine(view) {
-  const widgets = {};
-  for (const visibleRange of view.visibleRanges) {
-    const startLine = view.state.doc.lineAt(visibleRange.from).number;
-    const endLine = view.state.doc.lineAt(visibleRange.to).number;
-    for (let i3 = startLine; i3 <= endLine; i3++) {
-      widgets[i3] = getDecosOnLine(view, i3);
-    }
-  }
-  return widgets;
-}
-function getDecosOnLine(view, lineNumber) {
-  const widgets = [];
-  const line = view.state.doc.line(lineNumber);
-  const docText = view.state.sliceDoc(line.from, line.to);
-  const doc = three_default(docText);
-  const wordsToHighlight = {};
-  const adjectives = doc.adjectives();
-  const nouns = doc.match("#Noun").not("#Pronoun").not("#Possessive");
-  const adverbs = doc.adverbs();
-  const verbs = doc.match("#Verb");
-  const conjunctions = doc.conjunctions();
-  wordsToHighlight["adjective"] = adjectives;
-  wordsToHighlight["noun"] = nouns;
-  wordsToHighlight["adverb"] = adverbs;
-  wordsToHighlight["verb"] = verbs;
-  wordsToHighlight["conjunction"] = conjunctions;
-  const plugin5 = window.app.plugins.plugins["nl-syntax-highlighting"];
-  for (const partOfSpeech of Object.keys(wordsToHighlight)) {
-    const words = wordsToHighlight[partOfSpeech];
-    for (const word of words.out("offset")) {
-      const offset2 = word.offset;
-      const start2 = offset2.start;
-      const end2 = start2 + word.terms[0].offset.length;
-      if (start2 === end2)
-        continue;
-      const truePartOfSpeech = word.text in plugin5.wordsToOverrideDict ? plugin5.wordsToOverrideDict[word.text] : partOfSpeech;
-      widgets.push({ partOfSpeech: truePartOfSpeech, start: start2, end: end2 });
-    }
-  }
-  return widgets;
-}
-function decosByLineToDecorationSet(view, decorationsByLine) {
-  const allWidgets = [];
-  for (const lineNumberStr of Object.keys(decorationsByLine)) {
-    const lineNumber = parseInt(lineNumberStr);
-    const widgets = decorationsByLine[lineNumber];
-    const lineStart = view.state.doc.line(lineNumber).from;
-    const offsetWidgets = widgets.map((decoSpec) => {
-      return import_view.Decoration.mark({
-        inclusive: true,
-        attributes: {},
-        class: decoSpec.partOfSpeech
-      }).range(decoSpec.start + lineStart, decoSpec.end + lineStart);
-    });
-    allWidgets.push(...offsetWidgets);
-  }
-  return import_view.Decoration.set(allWidgets, true);
-}
-var NLSyntaxHighlightViewPlugin = import_view.ViewPlugin.fromClass(class {
-  constructor(view) {
-    this.decorationsByLine = getAllDecosByLine(view);
-    this.decorations = decosByLineToDecorationSet(view, this.decorationsByLine);
-  }
-  update(update) {
-    let shouldRegenerateAllDecorations = false;
-    if (update.docChanged) {
-      if (update.startState.doc.lines === update.state.doc.lines) {
-        let changeCount = 0;
-        let lineChangedNumber = 0;
-        let singleCharacterInserted = true;
-        update.changes.iterChangedRanges((fromA, toA, fromB, toB) => {
-          changeCount += 1;
-          if (changeCount > 1)
-            singleCharacterInserted = false;
-          if (!(fromA === toA && toB === fromB + 1))
-            singleCharacterInserted = false;
-          lineChangedNumber = update.view.state.doc.lineAt(toB).number;
-        });
-        if (singleCharacterInserted) {
-          this.decorationsByLine[lineChangedNumber] = getDecosOnLine(update.view, lineChangedNumber);
-        } else {
-          shouldRegenerateAllDecorations = true;
-        }
-      } else {
-        shouldRegenerateAllDecorations = true;
-      }
-    } else if (update.viewportChanged) {
-      shouldRegenerateAllDecorations = true;
-    }
-    if (shouldRegenerateAllDecorations)
-      this.decorationsByLine = getAllDecosByLine(update.view);
-    this.decorations = decosByLineToDecorationSet(update.view, this.decorationsByLine);
-  }
-}, { decorations: (v2) => v2.decorations });
-
-// settings.ts
-var import_obsidian = require("obsidian");
-var DEFAULT_SETTINGS = {
-  adjectiveEnabled: true,
-  adjectiveColor: "#b97a0a",
-  nounEnabled: true,
-  nounColor: "#ce4924",
-  adverbEnabled: true,
-  adverbColor: "#c333a7",
-  verbEnabled: true,
-  verbColor: "#177eB8",
-  conjunctionEnabled: true,
-  conjunctionColor: "#01934e",
-  classToApplyHighlightingTo: "",
-  wordsToOverride: ""
-};
-var NLSyntaxHighlightSettingTab = class extends import_obsidian.PluginSettingTab {
-  constructor(app, plugin5) {
-    super(app, plugin5);
-    this.plugin = plugin5;
-  }
-  display() {
-    const { containerEl } = this;
-    containerEl.empty();
-    const adjectives = new import_obsidian.Setting(containerEl).setName("Adjectives");
-    let adjectiveToggle;
-    adjectives.addToggle((toggle) => {
-      var _a, _b;
-      adjectiveToggle = toggle.toggleEl;
-      (_b = (_a = adjectiveToggle.parentElement) == null ? void 0 : _a.parentElement) == null ? void 0 : _b.prepend(adjectiveToggle);
-      toggle.setValue(this.plugin.settings.adjectiveEnabled).onChange(async (value) => {
-        this.plugin.settings.adjectiveEnabled = value;
-        await this.plugin.saveSettings();
-        this.plugin.reloadStyle();
-      });
-    });
-    adjectives.addColorPicker((component) => component.setValue(this.plugin.settings.adjectiveColor).onChange(async (value) => {
-      this.plugin.settings.adjectiveColor = value;
-      await this.plugin.saveSettings();
-      this.plugin.reloadStyle();
-    }));
-    const nouns = new import_obsidian.Setting(containerEl).setName("Nouns");
-    let nounToggle;
-    nouns.addToggle((toggle) => {
-      var _a, _b;
-      nounToggle = toggle.toggleEl;
-      (_b = (_a = nounToggle.parentElement) == null ? void 0 : _a.parentElement) == null ? void 0 : _b.prepend(nounToggle);
-      toggle.setValue(this.plugin.settings.nounEnabled).onChange(async (value) => {
-        this.plugin.settings.nounEnabled = value;
-        await this.plugin.saveSettings();
-        this.plugin.reloadStyle();
-      });
-    });
-    nouns.addColorPicker((component) => component.setValue(this.plugin.settings.nounColor).onChange(async (value) => {
-      this.plugin.settings.nounColor = value;
-      await this.plugin.saveSettings();
-      this.plugin.reloadStyle();
-    }));
-    const adverbs = new import_obsidian.Setting(containerEl).setName("Adverbs");
-    let adverbToggle;
-    adverbs.addToggle((toggle) => {
-      var _a, _b;
-      adverbToggle = toggle.toggleEl;
-      (_b = (_a = adverbToggle.parentElement) == null ? void 0 : _a.parentElement) == null ? void 0 : _b.prepend(adverbToggle);
-      toggle.setValue(this.plugin.settings.adverbEnabled).onChange(async (value) => {
-        this.plugin.settings.adverbEnabled = value;
-        await this.plugin.saveSettings();
-        this.plugin.reloadStyle();
-      });
-    });
-    adverbs.addColorPicker((component) => component.setValue(this.plugin.settings.adverbColor).onChange(async (value) => {
-      this.plugin.settings.adverbColor = value;
-      await this.plugin.saveSettings();
-      this.plugin.reloadStyle();
-    }));
-    const verbs = new import_obsidian.Setting(containerEl).setName("Verbs");
-    let verbToggle;
-    verbs.addToggle((toggle) => {
-      var _a, _b;
-      verbToggle = toggle.toggleEl;
-      (_b = (_a = verbToggle.parentElement) == null ? void 0 : _a.parentElement) == null ? void 0 : _b.prepend(verbToggle);
-      toggle.setValue(this.plugin.settings.verbEnabled).onChange(async (value) => {
-        this.plugin.settings.verbEnabled = value;
-        await this.plugin.saveSettings();
-        this.plugin.reloadStyle();
-      });
-    });
-    verbs.addColorPicker((component) => component.setValue(this.plugin.settings.verbColor).onChange(async (value) => {
-      this.plugin.settings.verbColor = value;
-      await this.plugin.saveSettings();
-      this.plugin.reloadStyle();
-    }));
-    const conjunctions = new import_obsidian.Setting(containerEl).setName("Conjunctions");
-    let conjunctionToggle;
-    conjunctions.addToggle((toggle) => {
-      var _a, _b;
-      conjunctionToggle = toggle.toggleEl;
-      (_b = (_a = conjunctionToggle.parentElement) == null ? void 0 : _a.parentElement) == null ? void 0 : _b.prepend(conjunctionToggle);
-      toggle.setValue(this.plugin.settings.conjunctionEnabled).onChange(async (value) => {
-        this.plugin.settings.conjunctionEnabled = value;
-        await this.plugin.saveSettings();
-        this.plugin.reloadStyle();
-      });
-    });
-    conjunctions.addColorPicker((component) => component.setValue(this.plugin.settings.conjunctionColor).onChange(async (value) => {
-      this.plugin.settings.conjunctionColor = value;
-      await this.plugin.saveSettings();
-      this.plugin.reloadStyle();
-    }));
-    new import_obsidian.Setting(containerEl).setName("Words to override").setDesc("Occasionally, words may be misclassfied. Type words here to override their classification. Use the format word: part-of-speech, with each word separated by a new line. e.g. snowy: adjective").addTextArea((text) => text.setValue(this.plugin.settings.wordsToOverride).setPlaceholder(`snowy: adjective
-cloud: noun`).onChange(async (value) => {
-      this.plugin.settings.wordsToOverride = value;
-      this.plugin.loadWordsToOverrideDict();
-      this.plugin.reloadEditorExtensions();
-      (0, import_obsidian.debounce)(() => {
-        this.plugin.reloadEditorExtensions();
-      }, 1e3);
-      await this.plugin.saveSettings();
-    }));
-    new import_obsidian.Setting(containerEl).setName("CSS class to apply syntax highlighting to").setDesc('If specified, the syntax highlighting will only be applied to notes with the "cssclass" property in their YAML equal to the specified value.').addText((text) => text.setValue(this.plugin.settings.classToApplyHighlightingTo).onChange(async (value) => {
-      this.plugin.settings.classToApplyHighlightingTo = value;
-      await this.plugin.saveSettings();
-      this.plugin.reloadStyle();
-    }));
-  }
-};
-
-// main.ts
-var NLSyntaxHighlightPlugin = class extends import_obsidian2.Plugin {
-  async onload() {
-    await this.loadSettings();
-    this.addSettingTab(new NLSyntaxHighlightSettingTab(this.app, this));
-    this.loadWordsToOverrideDict();
-    this.extensions = [NLSyntaxHighlightViewPlugin.extension];
-    this.registerEditorExtension(this.extensions);
-    this.styleEl = document.head.createEl("style");
-    this.reloadStyle();
-  }
-  onunload() {
-    this.styleEl.remove();
-  }
-  async loadSettings() {
-    this.settings = Object.assign({}, DEFAULT_SETTINGS, await this.loadData());
-  }
-  async saveSettings() {
-    await this.saveData(this.settings);
-  }
-  convertSettingsToStyle(settings) {
-    let style = "";
-    const partsOfSpeech = ["adjective", "noun", "adverb", "verb", "conjunction"];
-    const enabled = [settings.adjectiveEnabled, settings.nounEnabled, settings.adverbEnabled, settings.verbEnabled, settings.conjunctionEnabled];
-    const colors2 = [settings.adjectiveColor, settings.nounColor, settings.adverbColor, settings.verbColor, settings.conjunctionColor];
-    for (let i3 = 0; i3 < partsOfSpeech.length; i3++) {
-      if (enabled[i3]) {
-        if (settings.classToApplyHighlightingTo.length > 0) {
-          style = style.concat(`.${settings.classToApplyHighlightingTo} .${partsOfSpeech[i3]} { color: ${colors2[i3]} }
-`);
-        } else {
-          style = style.concat(`.${partsOfSpeech[i3]} { color: ${colors2[i3]} }
-`);
-        }
-      }
-    }
-    return style;
-  }
-  reloadStyle() {
-    this.styleEl.textContent = this.convertSettingsToStyle(this.settings);
-  }
-  loadWordsToOverrideDict() {
-    const dict = {};
-    const lines = this.settings.wordsToOverride.split("\n");
-    lines.forEach((val) => {
-      const line = val.replaceAll(" ", "").split(":");
-      if (line[1])
-        dict[line[0]] = line[1];
-    });
-    this.wordsToOverrideDict = dict;
-  }
-  reloadEditorExtensions() {
-    this.extensions.pop();
-    this.app.workspace.updateOptions();
-    this.extensions.push(NLSyntaxHighlightViewPlugin.extension);
-    this.app.workspace.updateOptions();
-  }
-};
diff --git a/.obsidian/plugins/nl-syntax-highlighting/manifest.json b/.obsidian/plugins/nl-syntax-highlighting/manifest.json
deleted file mode 100644
index b75ee960f..000000000
--- a/.obsidian/plugins/nl-syntax-highlighting/manifest.json
+++ /dev/null
@@ -1,11 +0,0 @@
-{
-	"id": "nl-syntax-highlighting",
-	"name": "Natural Language Syntax Highlighting",
-	"version": "0.3.0",
-	"minAppVersion": "0.15.0",
-	"description": "Highlight adjectives, nouns, adverbs, verbs, and conjunctions in the editor",
-	"author": "artisticat",
-	"authorUrl": "https://github.com/artisticat1",
-	"fundingUrl": "https://ko-fi.com/artisticat",
-	"isDesktopOnly": false
-}
diff --git a/.obsidian/plugins/nl-syntax-highlighting/styles.css b/.obsidian/plugins/nl-syntax-highlighting/styles.css
deleted file mode 100644
index bb7f70bbf..000000000
--- a/.obsidian/plugins/nl-syntax-highlighting/styles.css
+++ /dev/null
@@ -1,19 +0,0 @@
-/* .adjective {
-    color: #b97a0a;
-}
-
-.noun {
-    color: #ce4924;
-}
-
-.adverb {
-    color: #c333a7;
-}
-
-.verb {
-    color: #177eB8;
-}
-
-.conjunction {
-    color: #01934e;
-} */
\ No newline at end of file
diff --git a/.obsidian/plugins/obsidian-enhancing-export/main.js b/.obsidian/plugins/obsidian-enhancing-export/main.js
new file mode 100644
index 000000000..c48d73074
--- /dev/null
+++ b/.obsidian/plugins/obsidian-enhancing-export/main.js
@@ -0,0 +1,30 @@
+"use strict";var dl=e=>{throw TypeError(e)};var gl=(e,l,t)=>l.has(e)||dl("Cannot "+t);var bl=(e,l,t)=>(gl(e,l,"read from private field"),t?t.call(e):l.get(e)),Zl=(e,l,t)=>l.has(e)?dl("Cannot add the same private member more than once"):l instanceof WeakSet?l.add(e):l.set(e,t),ml=(e,l,t,n)=>(gl(e,l,"write to private field"),n?n.call(e,t):l.set(e,t),t);/*!
+THIS IS A GENERATED/BUNDLED FILE BY ESBUILD
+if you want to view the source, please visit the github repository https://github.com/mokeyish/obsidian-enhancing-export .
+*/Object.defineProperties(exports,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}});const Ie=require("obsidian"),Sn=require("child_process"),pt=require("process"),Pl=require("electron"),Dl=require("fs"),ae=require("path"),wn=require("util");function Dt(e){const l=Object.create(null,{[Symbol.toStringTag]:{value:"Module"}});if(e){for(const t in e)if(t!=="default"){const n=Object.getOwnPropertyDescriptor(e,t);Object.defineProperty(l,t,n.get?n:{enumerable:!0,get:()=>e[t]})}}return l.default=e,Object.freeze(l)}const En=Dt(Ie),Be=Dt(Pl),yt=Dt(Dl),dt={Markdown:{name:"Markdown",type:"pandoc",arguments:'-f ${fromFormat} --resource-path="${currentDir}" --resource-path="${attachmentFolderPath}" --lua-filter="${luaDir}/markdown.lua" -s -o "${outputPath}" -t commonmark_x-attributes',extension:".md"},"Markdown (Hugo)":{name:"Markdown (Hugo)",type:"pandoc",arguments:'-f ${fromFormat} --resource-path="${currentDir}" --resource-path="${attachmentFolderPath}" --lua-filter="${luaDir}/markdown+hugo.lua" -s -o "${outputPath}" -t commonmark_x-attributes',extension:".md"},Html:{name:"Html",type:"pandoc",arguments:'-f ${fromFormat} --resource-path="${currentDir}" --resource-path="${attachmentFolderPath}" --lua-filter="${luaDir}/math_block.lua" --embed-resources --standalone --metadata title="${currentFileName}" -s -o "${outputPath}" -t html',customArguments:'--mathjax="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-svg-full.js"',extension:".html"},TextBundle:{name:"TextBundle",type:"pandoc",arguments:'-f ${fromFormat} --resource-path="${currentDir}" --resource-path="${attachmentFolderPath}" --lua-filter="${luaDir}/markdown.lua" -V media_dir="${outputDir}/${outputFileName}.textbundle/assets" -s -o "${outputDir}/${outputFileName}.textbundle/text.md" -t commonmark_x-attributes',extension:".md"},Typst:{name:"Typst",type:"pandoc",arguments:'-f ${fromFormat} --resource-path="${currentDir}" --resource-path="${attachmentFolderPath}" --lua-filter="${luaDir}/markdown.lua" -s -o "${outputPath}" -t typst',extension:".typ"},PDF:{name:"PDF",type:"pandoc",arguments:'-f ${fromFormat} --resource-path="${currentDir}" --resource-path="${attachmentFolderPath}" --lua-filter="${luaDir}/pdf.lua" ${ options.textemplate ? `--resource-path="${pluginDir}/textemplate" --template="${options.textemplate}"` : ` ` } -o "${outputPath}" -t pdf',customArguments:"--pdf-engine=pdflatex",optionsMeta:{textemplate:"preset:textemplate"},extension:".pdf"},"Word (.docx)":{name:"Word (.docx)",type:"pandoc",arguments:'-f ${fromFormat} --resource-path="${currentDir}" --resource-path="${attachmentFolderPath}" -o "${outputPath}" -t docx',extension:".docx"},OpenOffice:{name:"OpenOffice",type:"pandoc",arguments:'-f ${fromFormat} --resource-path="${currentDir}" --resource-path="${attachmentFolderPath}" -o "${outputPath}" -t odt',extension:".odt"},RTF:{name:"RTF",type:"pandoc",arguments:'-f ${fromFormat} --resource-path="${currentDir}" --resource-path="${attachmentFolderPath}" -s -o "${outputPath}" -t rtf',extension:".rtf"},Epub:{name:"Epub",type:"pandoc",arguments:'-f ${fromFormat} --resource-path="${currentDir}" --resource-path="${attachmentFolderPath}" -o "${outputPath}" -t epub',extension:".epub"},Latex:{name:"Latex",type:"pandoc",arguments:'-f ${fromFormat} --resource-path="${currentDir}" --resource-path="${attachmentFolderPath}" ${ options.textemplate ? `--resource-path="${pluginDir}/textemplate" --template="${options.textemplate}"` : ` ` } --extract-media="${outputDir}" -s -o "${outputPath}" -t latex',optionsMeta:{textemplate:"preset:textemplate"},extension:".tex"},"Media Wiki":{name:"Media Wiki",type:"pandoc",arguments:'-f ${fromFormat} --resource-path="${currentDir}" --resource-path="${attachmentFolderPath}" -s -o "${outputPath}" -t mediawiki',extension:".mediawiki"},reStructuredText:{name:"reStructuredText",type:"pandoc",arguments:'-f ${fromFormat} --resource-path="${currentDir}" --resource-path="${attachmentFolderPath}" -s -o "${outputPath}" -t rst',extension:".rst"},Textile:{name:"Textile",type:"pandoc",arguments:'-f ${fromFormat} --resource-path="${currentDir}" --resource-path="${attachmentFolderPath}" -s -o "${outputPath}" -t textile',extension:".textile"},OPML:{name:"OPML",type:"pandoc",arguments:'-f ${fromFormat} --resource-path="${currentDir}" --resource-path="${attachmentFolderPath}" -s -o "${outputPath}" -t opml',extension:".opml"},"Bibliography (.bib)":{name:"Bibliography",type:"pandoc",arguments:'-f ${fromFormat} --resource-path="${currentDir}" --resource-path="${attachmentFolderPath}" --lua-filter="${luaDir}/citefilter.lua" -o "${outputPath}" --to=bibtex "${currentPath}"',extension:".bib"},Custom:{name:"Custom",type:"custom",command:"your command",targetFileExtensions:".ext"}};function Ae(e,l,t){return typeof l=="string"&&l.trim()===""&&(l=void 0),t instanceof Array?t.reduce((n,c)=>Ae(n,l,c),e):(t??(t=pt.platform),{...e??{},[t]:l})}function de(e,l){e??(e={});const t=e[l??pt.platform],n=e["*"];return n&&typeof n=="object"?Object.assign({},n,t):t??n}function $(e,...l){return function(...t){const n=t[t.length-1]||{},c=[e[0]];return l.forEach(function(i,o){const s=Number.isInteger(i)?t[i]:n[i];c.push(s,e[o+1])}),c.join("")}}function zt(e,l){return l=l??{},new Promise((t,n)=>{Sn.exec(e,l,(c,i,o)=>{if(c){n(c),console.error(i,c);return}if(o&&o!==""){n(o),console.error(i,c);return}(i==null?void 0:i.trim().length)===0&&localStorage.getItem("debug-plugin")==="1"&&console.log(i),t(i)})})}function Kn(e){return e.startsWith('"')&&e.endsWith('"')||e.startsWith("'")&&e.endsWith("'")?e.substring(1,e.length-1):e}function Ut(e,l={}){for(;;)try{const t=Object.keys(l).filter(Qn),n=t.map(c=>l[c]);return new Function(...t,`{ return \`${e.replaceAll("\\","\\\\")}\` }`).bind(l)(...n)}catch(t){if(t instanceof ReferenceError&&t.message.endsWith("is not defined")){const n=t.message.substring(0,t.message.indexOf(" ")),c=Object.keys(l).filter(i=>i.toLowerCase()===n.toLowerCase()).map(i=>l[i])[0]??`\${${n}}`;l[n]=c}else throw t}}const Qn=e=>{if(typeof e!="string"||e.trim()!==e)return!1;try{new Function(e,"var "+e)}catch{return!1}return!0},zn={textemplate:{title:"Latex Template",type:"dropdown",options:[{name:"None",value:null},{name:"Dissertation",value:"dissertation.tex"},{name:"Academic Paper",value:"neurips.tex"}]}},De=(()=>{let e={};return e=Ae(e,{HOME:"${HOME}",PATH:"${PATH}",TEXINPUTS:"${pluginDir}/textemplate/:"},"*"),e=Ae(e,{TEXINPUTS:"${pluginDir}/textemplate/;",PATH:"${HOME}\\AppData\\Local\\Pandoc;${PATH}"},"win32"),e=Ae(e,{PATH:"/opt/homebrew/bin:/usr/local/bin:/Library/TeX/texbin:${PATH}"},"darwin"),e})(),Le={items:Object.values(dt).filter(e=>e.type!=="custom"),pandocPath:void 0,defaultExportDirectoryMode:"Auto",openExportedFile:!0,env:De,showExportProgressBar:!0};function _l(e){var l;return e.type==="pandoc"?e.extension:e.type==="custom"?(l=e.targetFileExtensions)==null?void 0:l.split(",")[0]:""}function ql(e,l){return e=Object.assign({},de(De),e),l=Object.assign({HOME:process.env.HOME??process.env.USERPROFILE},process.env,l??{}),Object.fromEntries(Object.entries(e).map(([t,n])=>[t,Ut(n,l)]))}function Un(e){return e?Object.fromEntries(Object.entries(e).map(([l,t])=>[l,typeof t=="string"?zn[t.startsWith("preset:")?t.substring(7):""]:t])):{}}const jn=(e,l)=>e===l,pe=Symbol("solid-proxy"),jt=Symbol("solid-track"),mt={equals:jn};let en=on;const Fe=1,ut=2,tn={owned:null,cleanups:null,context:null,owner:null};var T=null;let Bt=null,Ln=null,O=null,le=null,Je=null,Xt=0;function Se(e,l){const t=O,n=T,c=e.length===0,i=n,o=c?tn:{owned:null,cleanups:null,context:i?i.context:null,owner:i},s=c?e:()=>e(()=>P(()=>ft(o)));T=o,O=null;try{return Ue(s,!0)}finally{O=t,T=n}}function oe(e,l){l=l?Object.assign({},mt,l):mt;const t={value:e,observers:null,observerSlots:null,comparator:l.equals||void 0},n=c=>(typeof c=="function"&&(c=c(t.value)),sn(t,c));return[cn.bind(t),n]}function te(e,l,t){const n=_t(e,l,!1,Fe);tt(n)}function Ye(e,l,t){en=Pn;const n=_t(e,l,!1,Fe);n.user=!0,Je?Je.push(n):tt(n)}function ee(e,l,t){t=t?Object.assign({},mt,t):mt;const n=_t(e,l,!0,0);return n.observers=null,n.observerSlots=null,n.comparator=t.equals||void 0,tt(n),cn.bind(n)}function gt(e){return Ue(e,!1)}function P(e){if(O===null)return e();const l=O;O=null;try{return e()}finally{O=l}}function ln(e){Ye(()=>P(e))}function ze(e){return T===null||(T.cleanups===null?T.cleanups=[e]:T.cleanups.push(e)),e}function Lt(){return O}function $n(e,l){const t=Symbol("context");return{id:t,Provider:_n(t),defaultValue:e}}function Tn(e){return T&&T.context&&T.context[e.id]!==void 0?T.context[e.id]:e.defaultValue}function nn(e){const l=ee(e),t=ee(()=>$t(l()));return t.toArray=()=>{const n=t();return Array.isArray(n)?n:n!=null?[n]:[]},t}function cn(){if(this.sources&&this.state)if(this.state===Fe)tt(this);else{const e=le;le=null,Ue(()=>It(this),!1),le=e}if(O){const e=this.observers?this.observers.length:0;O.sources?(O.sources.push(this),O.sourceSlots.push(e)):(O.sources=[this],O.sourceSlots=[e]),this.observers?(this.observers.push(O),this.observerSlots.push(O.sources.length-1)):(this.observers=[O],this.observerSlots=[O.sources.length-1])}return this.value}function sn(e,l,t){let n=e.value;return(!e.comparator||!e.comparator(n,l))&&(e.value=l,e.observers&&e.observers.length&&Ue(()=>{for(let c=0;c<e.observers.length;c+=1){const i=e.observers[c],o=Bt&&Bt.running;o&&Bt.disposed.has(i),(o?!i.tState:!i.state)&&(i.pure?le.push(i):Je.push(i),i.observers&&an(i)),o||(i.state=Fe)}if(le.length>1e6)throw le=[],new Error},!1)),l}function tt(e){if(!e.fn)return;ft(e);const l=Xt;Mn(e,e.value,l)}function Mn(e,l,t){let n;const c=T,i=O;O=T=e;try{n=e.fn(l)}catch(o){return e.pure&&(e.state=Fe,e.owned&&e.owned.forEach(ft),e.owned=null),e.updatedAt=t+1,rn(o)}finally{O=i,T=c}(!e.updatedAt||e.updatedAt<=t)&&(e.updatedAt!=null&&"observers"in e?sn(e,n):e.value=n,e.updatedAt=t)}function _t(e,l,t,n=Fe,c){const i={fn:e,state:n,updatedAt:null,owned:null,sources:null,sourceSlots:null,cleanups:null,value:l,owner:T,context:T?T.context:null,pure:t};return T===null||T!==tn&&(T.owned?T.owned.push(i):T.owned=[i]),i}function Gt(e){if(e.state===0)return;if(e.state===ut)return It(e);if(e.suspense&&P(e.suspense.inFallback))return e.suspense.effects.push(e);const l=[e];for(;(e=e.owner)&&(!e.updatedAt||e.updatedAt<Xt);)e.state&&l.push(e);for(let t=l.length-1;t>=0;t--)if(e=l[t],e.state===Fe)tt(e);else if(e.state===ut){const n=le;le=null,Ue(()=>It(e,l[0]),!1),le=n}}function Ue(e,l){if(le)return e();let t=!1;l||(le=[]),Je?t=!0:Je=[],Xt++;try{const n=e();return On(t),n}catch(n){t||(Je=null),le=null,rn(n)}}function On(e){if(le&&(on(le),le=null),e)return;const l=Je;Je=null,l.length&&Ue(()=>en(l),!1)}function on(e){for(let l=0;l<e.length;l++)Gt(e[l])}function Pn(e){let l,t=0;for(l=0;l<e.length;l++){const n=e[l];n.user?e[t++]=n:Gt(n)}for(l=0;l<t;l++)Gt(e[l])}function It(e,l){e.state=0;for(let t=0;t<e.sources.length;t+=1){const n=e.sources[t];if(n.sources){const c=n.state;c===Fe?n!==l&&(!n.updatedAt||n.updatedAt<Xt)&&Gt(n):c===ut&&It(n,l)}}}function an(e){for(let l=0;l<e.observers.length;l+=1){const t=e.observers[l];t.state||(t.state=ut,t.pure?le.push(t):Je.push(t),t.observers&&an(t))}}function ft(e){let l;if(e.sources)for(;e.sources.length;){const t=e.sources.pop(),n=e.sourceSlots.pop(),c=t.observers;if(c&&c.length){const i=c.pop(),o=t.observerSlots.pop();n<c.length&&(i.sourceSlots[o]=n,c[n]=i,t.observerSlots[n]=o)}}if(e.owned){for(l=e.owned.length-1;l>=0;l--)ft(e.owned[l]);e.owned=null}if(e.cleanups){for(l=e.cleanups.length-1;l>=0;l--)e.cleanups[l]();e.cleanups=null}e.state=0}function Dn(e){return e instanceof Error?e:new Error(typeof e=="string"?e:"Unknown error",{cause:e})}function rn(e,l=T){throw Dn(e)}function $t(e){if(typeof e=="function"&&!e.length)return $t(e());if(Array.isArray(e)){const l=[];for(let t=0;t<e.length;t++){const n=$t(e[t]);Array.isArray(n)?l.push.apply(l,n):l.push(n)}return l}return e}function _n(e,l){return function(n){let c;return te(()=>c=P(()=>(T.context={...T.context,[e]:n.value},nn(()=>n.children))),void 0),c}}const qn=Symbol("fallback");function ul(e){for(let l=0;l<e.length;l++)e[l]()}function ec(e,l,t={}){let n=[],c=[],i=[],o=0,s=l.length>1?[]:null;return ze(()=>ul(i)),()=>{let a=e()||[],Z,g;return a[jt],P(()=>{let x=a.length,p,Y,L,m,K,w,E,M,Q;if(x===0)o!==0&&(ul(i),i=[],n=[],c=[],o=0,s&&(s=[])),t.fallback&&(n=[qn],c[0]=Se(ge=>(i[0]=ge,t.fallback())),o=1);else if(o===0){for(c=new Array(x),g=0;g<x;g++)n[g]=a[g],c[g]=Se(I);o=x}else{for(L=new Array(x),m=new Array(x),s&&(K=new Array(x)),w=0,E=Math.min(o,x);w<E&&n[w]===a[w];w++);for(E=o-1,M=x-1;E>=w&&M>=w&&n[E]===a[M];E--,M--)L[M]=c[E],m[M]=i[E],s&&(K[M]=s[E]);for(p=new Map,Y=new Array(M+1),g=M;g>=w;g--)Q=a[g],Z=p.get(Q),Y[g]=Z===void 0?-1:Z,p.set(Q,g);for(Z=w;Z<=E;Z++)Q=n[Z],g=p.get(Q),g!==void 0&&g!==-1?(L[g]=c[Z],m[g]=i[Z],s&&(K[g]=s[Z]),g=Y[g],p.set(Q,g)):i[Z]();for(g=w;g<x;g++)g in L?(c[g]=L[g],i[g]=m[g],s&&(s[g]=K[g],s[g](g))):c[g]=Se(I);c=c.slice(0,o=x),n=a.slice(0)}return c});function I(x){if(i[g]=x,s){const[p,Y]=oe(g);return s[g]=Y,l(a[g],p)}return l(a[g])}}}function G(e,l){return P(()=>e(l||{}))}function ct(){return!0}const Gl={get(e,l,t){return l===pe?t:e.get(l)},has(e,l){return l===pe?!0:e.has(l)},set:ct,deleteProperty:ct,getOwnPropertyDescriptor(e,l){return{configurable:!0,enumerable:!0,get(){return e.get(l)},set:ct,deleteProperty:ct}},ownKeys(e){return e.keys()}};function tc(e,...l){if(pe in e){const c=new Set(l.length>1?l.flat():l[0]),i=l.map(o=>new Proxy({get(s){return o.includes(s)?e[s]:void 0},has(s){return o.includes(s)&&s in e},keys(){return o.filter(s=>s in e)}},Gl));return i.push(new Proxy({get(o){return c.has(o)?void 0:e[o]},has(o){return c.has(o)?!1:o in e},keys(){return Object.keys(e).filter(o=>!c.has(o))}},Gl)),i}const t={},n=l.map(()=>({}));for(const c of Object.getOwnPropertyNames(e)){const i=Object.getOwnPropertyDescriptor(e,c),o=!i.get&&!i.set&&i.enumerable&&i.writable&&i.configurable;let s=!1,a=0;for(const Z of l)Z.includes(c)&&(s=!0,o?n[a][c]=i.value:Object.defineProperty(n[a],c,i)),++a;s||(o?t[c]=i.value:Object.defineProperty(t,c,i))}return[...n,t]}const dn=e=>`Stale read from <${e}>.`;function gn(e){const l="fallback"in e&&{fallback:()=>e.fallback};return ee(ec(()=>e.each,e.children,l||void 0))}function bt(e){const l=e.keyed,t=ee(()=>e.when,void 0,{equals:(n,c)=>l?n===c:!n==!c});return ee(()=>{const n=t();if(n){const c=e.children;return typeof c=="function"&&c.length>0?P(()=>c(l?n:()=>{if(!P(t))throw dn("Show");return e.when})):c}return e.fallback},void 0,void 0)}function lc(e){let l=!1;const t=(i,o)=>(l?i[1]===o[1]:!i[1]==!o[1])&&i[2]===o[2],n=nn(()=>e.children),c=ee(()=>{let i=n();Array.isArray(i)||(i=[i]);for(let o=0;o<i.length;o++){const s=i[o].when;if(s)return l=!!i[o].keyed,[o,s,i[o]]}return[-1]},void 0,{equals:t});return ee(()=>{const[i,o,s]=c();if(i<0)return e.fallback;const a=s.children;return typeof a=="function"&&a.length>0?P(()=>a(l?o:()=>{if(P(c)[0]!==i)throw dn("Match");return s.when})):a},void 0,void 0)}function Il(e){return e}const nc=["allowfullscreen","async","autofocus","autoplay","checked","controls","default","disabled","formnovalidate","hidden","indeterminate","inert","ismap","loop","multiple","muted","nomodule","novalidate","open","playsinline","readonly","required","reversed","seamless","selected"],cc=new Set(["className","value","readOnly","formNoValidate","isMap","noModule","playsInline",...nc]),ic=new Set(["innerHTML","textContent","innerText","children"]),sc=Object.assign(Object.create(null),{className:"class",htmlFor:"for"}),oc=Object.assign(Object.create(null),{class:"className",formnovalidate:{$:"formNoValidate",BUTTON:1,INPUT:1},ismap:{$:"isMap",IMG:1},nomodule:{$:"noModule",SCRIPT:1},playsinline:{$:"playsInline",VIDEO:1},readonly:{$:"readOnly",INPUT:1,TEXTAREA:1}});function ac(e,l){const t=oc[e];return typeof t=="object"?t[l]?t.$:void 0:t}const rc=new Set(["beforeinput","click","dblclick","contextmenu","focusin","focusout","input","keydown","keyup","mousedown","mousemove","mouseout","mouseover","mouseup","pointerdown","pointermove","pointerout","pointerover","pointerup","touchend","touchmove","touchstart"]),dc=new Set(["altGlyph","altGlyphDef","altGlyphItem","animate","animateColor","animateMotion","animateTransform","circle","clipPath","color-profile","cursor","defs","desc","ellipse","feBlend","feColorMatrix","feComponentTransfer","feComposite","feConvolveMatrix","feDiffuseLighting","feDisplacementMap","feDistantLight","feDropShadow","feFlood","feFuncA","feFuncB","feFuncG","feFuncR","feGaussianBlur","feImage","feMerge","feMergeNode","feMorphology","feOffset","fePointLight","feSpecularLighting","feSpotLight","feTile","feTurbulence","filter","font","font-face","font-face-format","font-face-name","font-face-src","font-face-uri","foreignObject","g","glyph","glyphRef","hkern","image","line","linearGradient","marker","mask","metadata","missing-glyph","mpath","path","pattern","polygon","polyline","radialGradient","rect","set","stop","svg","switch","symbol","text","textPath","tref","tspan","use","view","vkern"]),gc={xlink:"http://www.w3.org/1999/xlink",xml:"http://www.w3.org/XML/1998/namespace"};function bc(e,l,t){let n=t.length,c=l.length,i=n,o=0,s=0,a=l[c-1].nextSibling,Z=null;for(;o<c||s<i;){if(l[o]===t[s]){o++,s++;continue}for(;l[c-1]===t[i-1];)c--,i--;if(c===o){const g=i<n?s?t[s-1].nextSibling:t[i-s]:a;for(;s<i;)e.insertBefore(t[s++],g)}else if(i===s)for(;o<c;)(!Z||!Z.has(l[o]))&&l[o].remove(),o++;else if(l[o]===t[i-1]&&t[s]===l[c-1]){const g=l[--c].nextSibling;e.insertBefore(t[s++],l[o++].nextSibling),e.insertBefore(t[--i],g),l[c]=t[i]}else{if(!Z){Z=new Map;let I=s;for(;I<i;)Z.set(t[I],I++)}const g=Z.get(l[o]);if(g!=null)if(s<g&&g<i){let I=o,x=1,p;for(;++I<c&&I<i&&!((p=Z.get(l[I]))==null||p!==g+x);)x++;if(x>g-s){const Y=l[o];for(;s<g;)e.insertBefore(t[s++],Y)}else e.replaceChild(t[s++],l[o++])}else o++;else l[o++].remove()}}}const Cl="_$DX_DELEGATE";function Ze(e,l,t){let n;const c=()=>{const o=document.createElement("template");return o.innerHTML=e,o.content.firstChild},i=()=>(n||(n=c())).cloneNode(!0);return i.cloneNode=i,i}function qt(e,l=window.document){const t=l[Cl]||(l[Cl]=new Set);for(let n=0,c=e.length;n<c;n++){const i=e[n];t.has(i)||(t.add(i),l.addEventListener(i,Cc))}}function xe(e,l,t){t==null?e.removeAttribute(l):e.setAttribute(l,t)}function Zc(e,l,t,n){n==null?e.removeAttributeNS(l,t):e.setAttributeNS(l,t,n)}function bn(e,l){l==null?e.removeAttribute("class"):e.className=l}function el(e,l,t,n){if(n)Array.isArray(t)?(e[`$$${l}`]=t[0],e[`$$${l}Data`]=t[1]):e[`$$${l}`]=t;else if(Array.isArray(t)){const c=t[0];e.addEventListener(l,t[0]=i=>c.call(e,t[1],i))}else e.addEventListener(l,t)}function mc(e,l,t={}){const n=Object.keys(l||{}),c=Object.keys(t);let i,o;for(i=0,o=c.length;i<o;i++){const s=c[i];!s||s==="undefined"||l[s]||(Wl(e,s,!1),delete t[s])}for(i=0,o=n.length;i<o;i++){const s=n[i],a=!!l[s];!s||s==="undefined"||t[s]===a||!a||(Wl(e,s,!0),t[s]=a)}return t}function tl(e,l,t){if(!l)return t?xe(e,"style"):l;const n=e.style;if(typeof l=="string")return n.cssText=l;typeof t=="string"&&(n.cssText=t=void 0),t||(t={}),l||(l={});let c,i;for(i in t)l[i]==null&&n.removeProperty(i),delete t[i];for(i in l)c=l[i],c!==t[i]&&(n.setProperty(i,c),t[i]=c);return t}function uc(e,l={},t,n){const c={};return te(()=>c.children=_e(e,l.children,c.children)),te(()=>typeof l.ref=="function"?Rt(l.ref,e):l.ref=e),te(()=>Gc(e,l,t,!0,c,!0)),c}function Rt(e,l,t){return P(()=>e(l,t))}function ne(e,l,t,n){if(t!==void 0&&!n&&(n=[]),typeof l!="function")return _e(e,l,n,t);te(c=>_e(e,l(),c,t),n)}function Gc(e,l,t,n,c={},i=!1){l||(l={});for(const o in c)if(!(o in l)){if(o==="children")continue;c[o]=hl(e,o,null,c[o],t,i)}for(const o in l){if(o==="children")continue;const s=l[o];c[o]=hl(e,o,s,c[o],t,i)}}function Ic(e){return e.toLowerCase().replace(/-([a-z])/g,(l,t)=>t.toUpperCase())}function Wl(e,l,t){const n=l.trim().split(/\s+/);for(let c=0,i=n.length;c<i;c++)e.classList.toggle(n[c],t)}function hl(e,l,t,n,c,i){let o,s,a,Z,g;if(l==="style")return tl(e,t,n);if(l==="classList")return mc(e,t,n);if(t===n)return n;if(l==="ref")i||t(e);else if(l.slice(0,3)==="on:"){const I=l.slice(3);n&&e.removeEventListener(I,n),t&&e.addEventListener(I,t)}else if(l.slice(0,10)==="oncapture:"){const I=l.slice(10);n&&e.removeEventListener(I,n,!0),t&&e.addEventListener(I,t,!0)}else if(l.slice(0,2)==="on"){const I=l.slice(2).toLowerCase(),x=rc.has(I);if(!x&&n){const p=Array.isArray(n)?n[0]:n;e.removeEventListener(I,p)}(x||t)&&(el(e,I,t,x),x&&qt([I]))}else if(l.slice(0,5)==="attr:")xe(e,l.slice(5),t);else if((g=l.slice(0,5)==="prop:")||(a=ic.has(l))||!c&&((Z=ac(l,e.tagName))||(s=cc.has(l)))||(o=e.nodeName.includes("-")))g&&(l=l.slice(5),s=!0),l==="class"||l==="className"?bn(e,t):o&&!s&&!a?e[Ic(l)]=t:e[Z||l]=t;else{const I=c&&l.indexOf(":")>-1&&gc[l.split(":")[0]];I?Zc(e,I,l,t):xe(e,sc[l]||l,t)}return t}function Cc(e){const l=`$$${e.type}`;let t=e.composedPath&&e.composedPath()[0]||e.target;for(e.target!==t&&Object.defineProperty(e,"target",{configurable:!0,value:t}),Object.defineProperty(e,"currentTarget",{configurable:!0,get(){return t||document}});t;){const n=t[l];if(n&&!t.disabled){const c=t[`${l}Data`];if(c!==void 0?n.call(t,c,e):n.call(t,e),e.cancelBubble)return}t=t._$host||t.parentNode||t.host}}function _e(e,l,t,n,c){for(;typeof t=="function";)t=t();if(l===t)return t;const i=typeof l,o=n!==void 0;if(e=o&&t[0]&&t[0].parentNode||e,i==="string"||i==="number"){if(i==="number"&&(l=l.toString(),l===t))return t;if(o){let s=t[0];s&&s.nodeType===3?s.data!==l&&(s.data=l):s=document.createTextNode(l),t=ve(e,t,n,s)}else t!==""&&typeof t=="string"?t=e.firstChild.data=l:t=e.textContent=l}else if(l==null||i==="boolean")t=ve(e,t,n);else{if(i==="function")return te(()=>{let s=l();for(;typeof s=="function";)s=s();t=_e(e,s,t,n)}),()=>t;if(Array.isArray(l)){const s=[],a=t&&Array.isArray(t);if(Tt(s,l,t,c))return te(()=>t=_e(e,s,t,n,!0)),()=>t;if(s.length===0){if(t=ve(e,t,n),o)return t}else a?t.length===0?pl(e,s,n):bc(e,t,s):(t&&ve(e),pl(e,s));t=s}else if(l.nodeType){if(Array.isArray(t)){if(o)return t=ve(e,t,n,l);ve(e,t,null,l)}else t==null||t===""||!e.firstChild?e.appendChild(l):e.replaceChild(l,e.firstChild);t=l}}return t}function Tt(e,l,t,n){let c=!1;for(let i=0,o=l.length;i<o;i++){let s=l[i],a=t&&t[e.length],Z;if(!(s==null||s===!0||s===!1))if((Z=typeof s)=="object"&&s.nodeType)e.push(s);else if(Array.isArray(s))c=Tt(e,s,a)||c;else if(Z==="function")if(n){for(;typeof s=="function";)s=s();c=Tt(e,Array.isArray(s)?s:[s],Array.isArray(a)?a:[a])||c}else e.push(s),c=!0;else{const g=String(s);a&&a.nodeType===3&&a.data===g?e.push(a):e.push(document.createTextNode(g))}}return c}function pl(e,l,t=null){for(let n=0,c=l.length;n<c;n++)e.insertBefore(l[n],t)}function ve(e,l,t,n){if(t===void 0)return e.textContent="";const c=n||document.createTextNode("");if(l.length){let i=!1;for(let o=l.length-1;o>=0;o--){const s=l[o];if(c!==s){const a=s.parentNode===e;!i&&!o?a?e.replaceChild(c,s):e.insertBefore(c,t):a&&s.remove()}else i=!0}}else e.insertBefore(c,t);return[c]}const Wc="http://www.w3.org/2000/svg";function hc(e,l=!1){return l?document.createElementNS(Wc,e):document.createElement(e)}function pc(e){const[l,t]=tc(e,["component"]),n=ee(()=>l.component);return ee(()=>{const c=n();switch(typeof c){case"function":return P(()=>c(t));case"string":const i=dc.has(c),o=hc(c,i);return uc(o,t,i),o}})}/**
+ * @license
+ * Copyright (c) 2016, Contributors
+ * SPDX-License-Identifier: ISC
+ */function Te(e){if(e!==e.toLowerCase()&&e!==e.toUpperCase()||(e=e.toLowerCase()),e.indexOf("-")===-1&&e.indexOf("_")===-1)return e;{let t="",n=!1;const c=e.match(/^-+/);for(let i=c?c[0].length:0;i<e.length;i++){let o=e.charAt(i);n&&(n=!1,o=o.toUpperCase()),i!==0&&(o==="-"||o==="_")?n=!0:o!=="-"&&o!=="_"&&(t+=o)}return t}}function Zn(e,l){const t=e.toLowerCase();l=l||"-";let n="";for(let c=0;c<e.length;c++){const i=t.charAt(c),o=e.charAt(c);i!==o&&c>0?n+=`${l}${t.charAt(c)}`:n+=o}return n}function mn(e){return e==null?!1:typeof e=="number"||/^0x[0-9a-f]+$/i.test(e)?!0:/^0[^.]/.test(e)?!1:/^[-]?(?:\d+(?:\.\d*)?|\.\d+)(e[-+]?\d+)?$/.test(e)}/**
+ * @license
+ * Copyright (c) 2016, Contributors
+ * SPDX-License-Identifier: ISC
+ */function Xc(e){if(Array.isArray(e))return e.map(o=>typeof o!="string"?o+"":o);e=e.trim();let l=0,t=null,n=null,c=null;const i=[];for(let o=0;o<e.length;o++){if(t=n,n=e.charAt(o),n===" "&&!c){t!==" "&&l++;continue}n===c?c=null:(n==="'"||n==='"')&&!c&&(c=n),i[l]||(i[l]=""),i[l]+=n}return i}/**
+ * @license
+ * Copyright (c) 2016, Contributors
+ * SPDX-License-Identifier: ISC
+ */var ue;(function(e){e.BOOLEAN="boolean",e.STRING="string",e.NUMBER="number",e.ARRAY="array"})(ue||(ue={}));/**
+ * @license
+ * Copyright (c) 2016, Contributors
+ * SPDX-License-Identifier: ISC
+ */let Re;class fc{constructor(l){Re=l}parse(l,t){const n=Object.assign({alias:void 0,array:void 0,boolean:void 0,config:void 0,configObjects:void 0,configuration:void 0,coerce:void 0,count:void 0,default:void 0,envPrefix:void 0,narg:void 0,normalize:void 0,string:void 0,number:void 0,__:void 0,key:void 0},t),c=Xc(l),i=typeof l=="string",o=Rc(Object.assign(Object.create(null),n.alias)),s=Object.assign({"boolean-negation":!0,"camel-case-expansion":!0,"combine-arrays":!1,"dot-notation":!0,"duplicate-arguments-array":!0,"flatten-duplicate-arrays":!0,"greedy-arrays":!0,"halt-at-non-option":!1,"nargs-eats-options":!1,"negation-prefix":"no-","parse-numbers":!0,"parse-positional-numbers":!0,"populate--":!1,"set-placeholder-key":!1,"short-option-groups":!0,"strip-aliased":!1,"strip-dashed":!1,"unknown-options-as-args":!1},n.configuration),a=Object.assign(Object.create(null),n.default),Z=n.configObjects||[],g=n.envPrefix,I=s["populate--"],x=I?"--":"_",p=Object.create(null),Y=Object.create(null),L=n.__||Re.format,m={aliases:Object.create(null),arrays:Object.create(null),bools:Object.create(null),strings:Object.create(null),numbers:Object.create(null),counts:Object.create(null),normalize:Object.create(null),configs:Object.create(null),nargs:Object.create(null),coercions:Object.create(null),keys:[]},K=/^-([0-9]+(\.[0-9]+)?|\.[0-9]+)$/,w=new RegExp("^--"+s["negation-prefix"]+"(.+)");[].concat(n.array||[]).filter(Boolean).forEach(function(r){const b=typeof r=="object"?r.key:r,h=Object.keys(r).map(function(u){return{boolean:"bools",string:"strings",number:"numbers"}[u]}).filter(Boolean).pop();h&&(m[h][b]=!0),m.arrays[b]=!0,m.keys.push(b)}),[].concat(n.boolean||[]).filter(Boolean).forEach(function(r){m.bools[r]=!0,m.keys.push(r)}),[].concat(n.string||[]).filter(Boolean).forEach(function(r){m.strings[r]=!0,m.keys.push(r)}),[].concat(n.number||[]).filter(Boolean).forEach(function(r){m.numbers[r]=!0,m.keys.push(r)}),[].concat(n.count||[]).filter(Boolean).forEach(function(r){m.counts[r]=!0,m.keys.push(r)}),[].concat(n.normalize||[]).filter(Boolean).forEach(function(r){m.normalize[r]=!0,m.keys.push(r)}),typeof n.narg=="object"&&Object.entries(n.narg).forEach(([r,b])=>{typeof b=="number"&&(m.nargs[r]=b,m.keys.push(r))}),typeof n.coerce=="object"&&Object.entries(n.coerce).forEach(([r,b])=>{typeof b=="function"&&(m.coercions[r]=b,m.keys.push(r))}),typeof n.config<"u"&&(Array.isArray(n.config)||typeof n.config=="string"?[].concat(n.config).filter(Boolean).forEach(function(r){m.configs[r]=!0}):typeof n.config=="object"&&Object.entries(n.config).forEach(([r,b])=>{(typeof b=="boolean"||typeof b=="function")&&(m.configs[r]=b)})),q(n.key,o,n.default,m.arrays),Object.keys(a).forEach(function(r){(m.aliases[r]||[]).forEach(function(b){a[b]=a[r]})});let E=null;kn();let M=[];const Q=Object.assign(Object.create(null),{_:[]}),ge={};for(let r=0;r<c.length;r++){const b=c[r],h=b.replace(/^-{3,}/,"---");let u,d,y,A,B,_;if(b!=="--"&&/^-/.test(b)&&He(b))be(b);else if(h.match(/^---+(=|$)/)){be(b);continue}else if(b.match(/^--.+=/)||!s["short-option-groups"]&&b.match(/^-.+=/))A=b.match(/^--?([^=]+)=([\s\S]*)$/),A!==null&&Array.isArray(A)&&A.length>=3&&(V(A[1],m.arrays)?r=f(r,A[1],c,A[2]):V(A[1],m.nargs)!==!1?r=X(r,A[1],c,A[2]):R(A[1],A[2],!0));else if(b.match(w)&&s["boolean-negation"])A=b.match(w),A!==null&&Array.isArray(A)&&A.length>=2&&(d=A[1],R(d,V(d,m.arrays)?[!1]:!1));else if(b.match(/^--.+/)||!s["short-option-groups"]&&b.match(/^-[^-]+/))A=b.match(/^--?(.+)/),A!==null&&Array.isArray(A)&&A.length>=2&&(d=A[1],V(d,m.arrays)?r=f(r,d,c):V(d,m.nargs)!==!1?r=X(r,d,c):(B=c[r+1],B!==void 0&&(!B.match(/^-/)||B.match(K))&&!V(d,m.bools)&&!V(d,m.counts)||/^(true|false)$/.test(B)?(R(d,B),r++):R(d,Ne(d))));else if(b.match(/^-.\..+=/))A=b.match(/^-([^=]+)=([\s\S]*)$/),A!==null&&Array.isArray(A)&&A.length>=3&&R(A[1],A[2]);else if(b.match(/^-.\..+/)&&!b.match(K))B=c[r+1],A=b.match(/^-(.\..+)/),A!==null&&Array.isArray(A)&&A.length>=2&&(d=A[1],B!==void 0&&!B.match(/^-/)&&!V(d,m.bools)&&!V(d,m.counts)?(R(d,B),r++):R(d,Ne(d)));else if(b.match(/^-[^-]+/)&&!b.match(K)){y=b.slice(1,-1).split(""),u=!1;for(let ie=0;ie<y.length;ie++){if(B=b.slice(ie+2),y[ie+1]&&y[ie+1]==="="){_=b.slice(ie+3),d=y[ie],V(d,m.arrays)?r=f(r,d,c,_):V(d,m.nargs)!==!1?r=X(r,d,c,_):R(d,_),u=!0;break}if(B==="-"){R(y[ie],B);continue}if(/[A-Za-z]/.test(y[ie])&&/^-?\d+(\.\d*)?(e-?\d+)?$/.test(B)&&V(B,m.bools)===!1){R(y[ie],B),u=!0;break}if(y[ie+1]&&y[ie+1].match(/\W/)){R(y[ie],B),u=!0;break}else R(y[ie],Ne(y[ie]))}d=b.slice(-1)[0],!u&&d!=="-"&&(V(d,m.arrays)?r=f(r,d,c):V(d,m.nargs)!==!1?r=X(r,d,c):(B=c[r+1],B!==void 0&&(!/^(-|--)[^-]/.test(B)||B.match(K))&&!V(d,m.bools)&&!V(d,m.counts)||/^(true|false)$/.test(B)?(R(d,B),r++):R(d,Ne(d))))}else if(b.match(/^-[0-9]$/)&&b.match(K)&&V(b.slice(1),m.bools))d=b.slice(1),R(d,Ne(d));else if(b==="--"){M=c.slice(r+1);break}else if(s["halt-at-non-option"]){M=c.slice(r);break}else be(b)}H(Q,!0),H(Q,!1),C(Q),F(),z(Q,m.aliases,a,!0),J(Q),s["set-placeholder-key"]&&k(Q),Object.keys(m.counts).forEach(function(r){S(Q,r.split("."))||R(r,0)}),I&&M.length&&(Q[x]=[]),M.forEach(function(r){Q[x].push(r)}),s["camel-case-expansion"]&&s["strip-dashed"]&&Object.keys(Q).filter(r=>r!=="--"&&r.includes("-")).forEach(r=>{delete Q[r]}),s["strip-aliased"]&&[].concat(...Object.keys(o).map(r=>o[r])).forEach(r=>{s["camel-case-expansion"]&&r.includes("-")&&delete Q[r.split(".").map(b=>Te(b)).join(".")],delete Q[r]});function be(r){const b=W("_",r);(typeof b=="string"||typeof b=="number")&&Q._.push(b)}function X(r,b,h,u){let d,y=V(b,m.nargs);if(y=typeof y!="number"||isNaN(y)?1:y,y===0)return fe(u)||(E=Error(L("Argument unexpected for: %s",b))),R(b,Ne(b)),r;let A=fe(u)?0:1;if(s["nargs-eats-options"])h.length-(r+1)+A<y&&(E=Error(L("Not enough arguments following: %s",b))),A=y;else{for(d=r+1;d<h.length&&(!h[d].match(/^-[^0-9]/)||h[d].match(K)||He(h[d]));d++)A++;A<y&&(E=Error(L("Not enough arguments following: %s",b)))}let B=Math.min(A,y);for(!fe(u)&&B>0&&(R(b,u),B--),d=r+1;d<B+r+1;d++)R(b,h[d]);return r+B}function f(r,b,h,u){let d=[],y=u||h[r+1];const A=V(b,m.nargs);if(V(b,m.bools)&&!/^(true|false)$/.test(y))d.push(!0);else if(fe(y)||fe(u)&&/^-/.test(y)&&!K.test(y)&&!He(y)){if(a[b]!==void 0){const B=a[b];d=Array.isArray(B)?B:[B]}}else{fe(u)||d.push(D(b,u,!0));for(let B=r+1;B<h.length&&!(!s["greedy-arrays"]&&d.length>0||A&&typeof A=="number"&&d.length>=A||(y=h[B],/^-/.test(y)&&!K.test(y)&&!He(y)));B++)r=B,d.push(D(b,y,i))}return typeof A=="number"&&(A&&d.length<A||isNaN(A)&&d.length===0)&&(E=Error(L("Not enough arguments following: %s",b))),R(b,d),r}function R(r,b,h=i){if(/-/.test(r)&&s["camel-case-expansion"]){const y=r.split(".").map(function(A){return Te(A)}).join(".");v(r,y)}const u=D(r,b,h),d=r.split(".");U(Q,d,u),m.aliases[r]&&m.aliases[r].forEach(function(y){const A=y.split(".");U(Q,A,u)}),d.length>1&&s["dot-notation"]&&(m.aliases[d[0]]||[]).forEach(function(y){let A=y.split(".");const B=[].concat(d);B.shift(),A=A.concat(B),(m.aliases[r]||[]).includes(A.join("."))||U(Q,A,u)}),V(r,m.normalize)&&!V(r,m.arrays)&&[r].concat(m.aliases[r]||[]).forEach(function(A){Object.defineProperty(ge,A,{enumerable:!0,get(){return b},set(B){b=typeof B=="string"?Re.normalize(B):B}})})}function v(r,b){m.aliases[r]&&m.aliases[r].length||(m.aliases[r]=[b],p[b]=!0),m.aliases[b]&&m.aliases[b].length||v(b,r)}function D(r,b,h){h&&(b=Vc(b)),(V(r,m.bools)||V(r,m.counts))&&typeof b=="string"&&(b=b==="true");let u=Array.isArray(b)?b.map(function(d){return W(r,d)}):W(r,b);return V(r,m.counts)&&(fe(u)||typeof u=="boolean")&&(u=Ft()),V(r,m.normalize)&&V(r,m.arrays)&&(Array.isArray(b)?u=b.map(d=>Re.normalize(d)):u=Re.normalize(b)),u}function W(r,b){return!s["parse-positional-numbers"]&&r==="_"||!V(r,m.strings)&&!V(r,m.bools)&&!Array.isArray(b)&&(mn(b)&&s["parse-numbers"]&&Number.isSafeInteger(Math.floor(parseFloat(`${b}`)))||!fe(b)&&V(r,m.numbers))&&(b=Number(b)),b}function C(r){const b=Object.create(null);z(b,m.aliases,a),Object.keys(m.configs).forEach(function(h){const u=r[h]||b[h];if(u)try{let d=null;const y=Re.resolve(Re.cwd(),u),A=m.configs[h];if(typeof A=="function"){try{d=A(y)}catch(B){d=B}if(d instanceof Error){E=d;return}}else d=Re.require(y);N(d)}catch(d){d.name==="PermissionDenied"?E=d:r[h]&&(E=Error(L("Invalid JSON config file: %s",u)))}})}function N(r,b){Object.keys(r).forEach(function(h){const u=r[h],d=b?b+"."+h:h;typeof u=="object"&&u!==null&&!Array.isArray(u)&&s["dot-notation"]?N(u,d):(!S(Q,d.split("."))||V(d,m.arrays)&&s["combine-arrays"])&&R(d,u)})}function F(){typeof Z<"u"&&Z.forEach(function(r){N(r)})}function H(r,b){if(typeof g>"u")return;const h=typeof g=="string"?g:"",u=Re.env();Object.keys(u).forEach(function(d){if(h===""||d.lastIndexOf(h,0)===0){const y=d.split("__").map(function(A,B){return B===0&&(A=A.substring(h.length)),Te(A)});(b&&m.configs[y.join(".")]||!b)&&!S(r,y)&&R(y.join("."),u[d])}})}function J(r){let b;const h=new Set;Object.keys(r).forEach(function(u){if(!h.has(u)&&(b=V(u,m.coercions),typeof b=="function"))try{const d=W(u,b(r[u]));[].concat(m.aliases[u]||[],u).forEach(y=>{h.add(y),r[y]=d})}catch(d){E=d}})}function k(r){return m.keys.forEach(b=>{~b.indexOf(".")||typeof r[b]>"u"&&(r[b]=void 0)}),r}function z(r,b,h,u=!1){Object.keys(h).forEach(function(d){S(r,d.split("."))||(U(r,d.split("."),h[d]),u&&(Y[d]=!0),(b[d]||[]).forEach(function(y){S(r,y.split("."))||U(r,y.split("."),h[d])}))})}function S(r,b){let h=r;s["dot-notation"]||(b=[b.join(".")]),b.slice(0,-1).forEach(function(d){h=h[d]||{}});const u=b[b.length-1];return typeof h!="object"?!1:u in h}function U(r,b,h){let u=r;s["dot-notation"]||(b=[b.join(".")]),b.slice(0,-1).forEach(function(_){_=Xl(_),typeof u=="object"&&u[_]===void 0&&(u[_]={}),typeof u[_]!="object"||Array.isArray(u[_])?(Array.isArray(u[_])?u[_].push({}):u[_]=[u[_],{}],u=u[_][u[_].length-1]):u=u[_]});const d=Xl(b[b.length-1]),y=V(b.join("."),m.arrays),A=Array.isArray(h);let B=s["duplicate-arguments-array"];!B&&V(d,m.nargs)&&(B=!0,(!fe(u[d])&&m.nargs[d]===1||Array.isArray(u[d])&&u[d].length===m.nargs[d])&&(u[d]=void 0)),h===Ft()?u[d]=Ft(u[d]):Array.isArray(u[d])?B&&y&&A?u[d]=s["flatten-duplicate-arrays"]?u[d].concat(h):(Array.isArray(u[d][0])?u[d]:[u[d]]).concat([h]):!B&&!!y==!!A?u[d]=h:u[d]=u[d].concat([h]):u[d]===void 0&&y?u[d]=A?h:[h]:B&&!(u[d]===void 0||V(d,m.counts)||V(d,m.bools))?u[d]=[u[d],h]:u[d]=h}function q(...r){r.forEach(function(b){Object.keys(b||{}).forEach(function(h){m.aliases[h]||(m.aliases[h]=[].concat(o[h]||[]),m.aliases[h].concat(h).forEach(function(u){if(/-/.test(u)&&s["camel-case-expansion"]){const d=Te(u);d!==h&&m.aliases[h].indexOf(d)===-1&&(m.aliases[h].push(d),p[d]=!0)}}),m.aliases[h].concat(h).forEach(function(u){if(u.length>1&&/[A-Z]/.test(u)&&s["camel-case-expansion"]){const d=Zn(u,"-");d!==h&&m.aliases[h].indexOf(d)===-1&&(m.aliases[h].push(d),p[d]=!0)}}),m.aliases[h].forEach(function(u){m.aliases[u]=[h].concat(m.aliases[h].filter(function(d){return u!==d}))}))})})}function V(r,b){const h=[].concat(m.aliases[r]||[],r),u=Object.keys(b),d=h.find(y=>u.includes(y));return d?b[d]:!1}function me(r){const b=Object.keys(m);return[].concat(b.map(u=>m[u])).some(function(u){return Array.isArray(u)?u.includes(r):u[r]})}function ce(r,...b){return[].concat(...b).some(function(u){const d=r.match(u);return d&&me(d[1])})}function Xe(r){if(r.match(K)||!r.match(/^-[^-]+/))return!1;let b=!0,h;const u=r.slice(1).split("");for(let d=0;d<u.length;d++){if(h=r.slice(d+2),!me(u[d])){b=!1;break}if(u[d+1]&&u[d+1]==="="||h==="-"||/[A-Za-z]/.test(u[d])&&/^-?\d+(\.\d*)?(e-?\d+)?$/.test(h)||u[d+1]&&u[d+1].match(/\W/))break}return b}function He(r){return s["unknown-options-as-args"]&&Hn(r)}function Hn(r){return r=r.replace(/^-{3,}/,"--"),r.match(K)||Xe(r)?!1:!ce(r,/^-+([^=]+?)=[\s\S]*$/,w,/^-+([^=]+?)$/,/^-+([^=]+?)-$/,/^-+([^=]+?\d+)$/,/^-+([^=]+?)\W+.*$/)}function Ne(r){return!V(r,m.bools)&&!V(r,m.counts)&&`${r}`in a?a[r]:Nn(vn(r))}function Nn(r){return{[ue.BOOLEAN]:!0,[ue.STRING]:"",[ue.NUMBER]:void 0,[ue.ARRAY]:[]}[r]}function vn(r){let b=ue.BOOLEAN;return V(r,m.strings)?b=ue.STRING:V(r,m.numbers)?b=ue.NUMBER:V(r,m.bools)?b=ue.BOOLEAN:V(r,m.arrays)&&(b=ue.ARRAY),b}function fe(r){return r===void 0}function kn(){Object.keys(m.counts).find(r=>V(r,m.arrays)?(E=Error(L("Invalid configuration: %s, opts.count excludes opts.array.",r)),!0):V(r,m.nargs)?(E=Error(L("Invalid configuration: %s, opts.count excludes opts.narg.",r)),!0):!1)}return{aliases:Object.assign({},m.aliases),argv:Object.assign(ge,Q),configuration:s,defaulted:Object.assign({},Y),error:E,newAliases:Object.assign({},p)}}}function Rc(e){const l=[],t=Object.create(null);let n=!0;for(Object.keys(e).forEach(function(c){l.push([].concat(e[c],c))});n;){n=!1;for(let c=0;c<l.length;c++)for(let i=c+1;i<l.length;i++)if(l[c].filter(function(s){return l[i].indexOf(s)!==-1}).length){l[c]=l[c].concat(l[i]),l.splice(i,1),n=!0;break}}return l.forEach(function(c){c=c.filter(function(o,s,a){return a.indexOf(o)===s});const i=c.pop();i!==void 0&&typeof i=="string"&&(t[i]=c)}),t}function Ft(e){return e!==void 0?e+1:1}function Xl(e){return e==="__proto__"?"___proto___":e}function Vc(e){return typeof e=="string"&&(e[0]==="'"||e[0]==='"')&&e[e.length-1]===e[0]?e.substring(1,e.length-1):e}/**
+ * @fileoverview Main entrypoint for libraries using yargs-parser in Node.js
+ * CJS and ESM environments.
+ *
+ * @license
+ * Copyright (c) 2016, Contributors
+ * SPDX-License-Identifier: ISC
+ */var Ht,Nt,vt;const fl=process&&process.env&&process.env.YARGS_MIN_NODE_VERSION?Number(process.env.YARGS_MIN_NODE_VERSION):12,Rl=(Nt=(Ht=process==null?void 0:process.versions)===null||Ht===void 0?void 0:Ht.node)!==null&&Nt!==void 0?Nt:(vt=process==null?void 0:process.version)===null||vt===void 0?void 0:vt.slice(1);if(Rl&&Number(Rl.match(/^([^.]+)/)[1])<fl)throw Error(`yargs parser supports a minimum Node.js version of ${fl}. Read our version support policy: https://github.com/yargs/yargs-parser#supported-nodejs-versions`);const Ac=process?process.env:{},un=new fc({cwd:process.cwd,env:()=>Ac,format:wn.format,normalize:ae.normalize,resolve:ae.resolve,require:e=>{if(typeof require<"u")return require(e);if(e.match(/\.json$/))return JSON.parse(Dl.readFileSync(e,"utf8"));throw Error("only .json config files are supported in ESM")}}),lt=function(l,t){return un.parse(l.slice(),t).argv};lt.detailed=function(e,l){return un.parse(e.slice(),l)};lt.camelCase=Te;lt.decamelize=Zn;lt.looksLikeNumber=mn;const Yc={exportToOo:"导出为......",exportWithPrevious:"使用上一次设置导出",exportSuccessNotice:$`导出文件 ${0} 成功！`,exportCommandOutputMessage:$`命令：${0}`,exportErrorOutputMessage:$`命令 ${0}，错误：${1}`,pleaseOpenFile:"请打开一个文件先。",preparing:$`正在生成 "${0}" ......`,exportDialog:{fileName:"文件名",type:"类型",exportTo:"导出到",title:$`导出为 ${0}`,export:"导出",selectExportFolder:"请选择导出文件夹",overwriteConfirmation:"覆盖提示"},messageBox:{yes:"是",no:"否",ok:"确认",cancel:"取消"},overwriteConfirmationDialog:{replace:"替换",title:$`"${0}" 已经存在。您要替换它吗？`,message:$`"${0}" 文件夹中已有相同的文件或文件夹，若替换，则会覆盖其当前内容。`},settingTab:{title:"导出设置",general:"通用",name:"名称",customLocation:"自定义",pandocVersion:$`版本: ${0}`,pandocVersionWithWarning:$`Version: ${0}, 请升级版本到 ${1}`,pandocNotFound:"找不到 Pandoc，请填写 Pandoc 文件路径，或者将其添加到系统环境变量中。",pandocPath:"Pandoc 路径",defaultFolderForExportedFile:"默认的导出文件夹",openExportedFileLocation:"打开导出文件所在目录",sameFolderWithCurrentFile:"与原文件同一目录下",openExportedFile:"打开导出文件",pandocPathPlaceholder:"（自动检测）",editCommandTemplate:"编辑命令模板",chooseCommandTemplate:"选择模板",afterExport:"导出后",command:"命令",arguments:"参数",auto:"自动",reset:"重置",add:"添加",remove:"移除",rename:"重命名",targetFileExtensions:"目标文件扩展名",targetFileExtensionsTip:"（用空格分开）",showCommandOutput:"显示命令行输出",runCommand:"运行自定义命令",extraArguments:"自定义参数",save:"保存",new:"新建",template:"模板",advanced:"高级",environmentVariables:"环境变量",environmentVariablesDesc:"定义导出的环境变量.",ShowExportProgressBar:"显示导出进度条"}},Jc={exportToOo:"Export to...",exportSuccessNotice:$`Export file ${0} success!`,exportCommandOutputMessage:$`Command: ${0}`,exportErrorOutputMessage:$`Command: ${0}，Error:${1}`,exportWithPrevious:"Export with Previous",pleaseOpenFile:"Please open a file first.",preparing:$`generating "${0}"...`,exportDialog:{exportTo:"Export to",fileName:"File Name",title:$`Export to ${0}`,export:"Export",selectExportFolder:"Please select an export folder.",overwriteConfirmation:"Overwrite confirmation",type:"Type"},messageBox:{yes:"Yes",no:"No",ok:"Ok",cancel:"Cancel"},overwriteConfirmationDialog:{replace:"Replace",title:$`"${0}" already exists. Do you want to replace it?`,message:$`A file or folder with the same name already exists in the folder "${0}". Replacing it will overwrite its current contents.`},settingTab:{general:"General",name:"Name",title:"Export Settings",pandocVersion:$`Version: ${0}`,pandocVersionWithWarning:$`Version: ${0}, please upgrade version to ${1}`,pandocNotFound:"Pandoc not found, please fill in the Pandoc file path, or add it to the system environment variables.",defaultFolderForExportedFile:"Default Folder for Exported File",openExportedFileLocation:"Open exported file location",ShowExportProgressBar:"Show export progress bar",openExportedFile:"Open exported file",pandocPath:"Pandoc path",pandocPathPlaceholder:"(Auto Detect)",editCommandTemplate:"Edit Command Template",chooseCommandTemplate:"Choose template",customLocation:"Custom location",template:"Template",command:"Command",reset:"Reset",auto:"Auto",add:"Add",remove:"Remove",rename:"Rename",sameFolderWithCurrentFile:"Same folder with current file",afterExport:"After Export",targetFileExtensions:"Target file extensions",targetFileExtensionsTip:"(Separated by whitespace)",showCommandOutput:"Show command output",runCommand:"Run command",extraArguments:"Extra arguments",save:"Save",new:"New",arguments:"Arguments",advanced:"Advanced",environmentVariables:"Environment Variables",environmentVariablesDesc:"Define the Environment Variables for exporting."}},xc={exportToOo:"Export to...",exportSuccessNotice:$`Export der Datei ${0} erfolgreich!`,exportCommandOutputMessage:$`Command: ${0}`,exportErrorOutputMessage:$`Command: ${0}，Fehler:${1}`,exportWithPrevious:"Exportiere mit Vorherigem",pleaseOpenFile:"Bitte öffne zunächst eine Datei.",preparing:$`generating "${0}"...`,exportDialog:{exportTo:"Exportiere nach",fileName:"Dateiname",title:$`Export to ${0}`,export:"Export",selectExportFolder:"Zielordner auswählen",overwriteConfirmation:"Überschreibe den Zielordner",type:"Typ"},messageBox:{yes:"Ja",no:"Nein",ok:"Ok",cancel:"Abbrechen"},overwriteConfirmationDialog:{replace:"Ersetze",title:$`"${0}" existiert bereits. Soll er ersetzt werden?`,message:$`Eine Datei oder ein Ordner mit dem gleichen Namen existiert bereits im Ordner "${0}". Das Ersetzen wird die jetzigen Inhalte überschreiben.`},settingTab:{general:"Allgemein",name:"Name",title:"Export-Einstellungen",pandocVersion:$`Version: ${0}`,pandocVersionWithWarning:$`Version: ${0}, please upgrade version to ${1}`,pandocNotFound:"Pandoc.exe wurde nicht gefunden. Bitte geben Sie den Pfad zur Pandoc.exe ein oder fügen Sie ihn den Window Systemumgebungsvariablen hinzu.",defaultFolderForExportedFile:"Standardordner für exportierte Dateien",openExportedFileLocation:"Speicherort der exportierten Datei öffnen",openExportedFile:"Exportierte Datei öffnen",pandocPath:"Pfad zur Datei Pandoc.exe",pandocPathPlaceholder:"(Automatische Erkennung)",editCommandTemplate:"‘Befehlsvorlage bearbeiten",chooseCommandTemplate:"Vorlage auswählen",customLocation:"Benutzerdefinierter Speicherort",template:"Vorlage",command:"Befehl",reset:"Zurücksetzen",auto:"Auto",add:"Hinzufügen",remove:"Entfernen",rename:"Umbenennen",sameFolderWithCurrentFile:"Der gleiche Ordner mit der aktuellen Datei",afterExport:"Nach dem Export",targetFileExtensions:"Dateinamenserweiterung der Zieldatei",targetFileExtensionsTip:"(Mit Leerzeichen getrennt)",showCommandOutput:"Zeige die Ausgabe des Befehls",runCommand:"Starte den Befehl",extraArguments:"Zusätzliche Parameter",save:"Speichern",new:"Neu",arguments:"Parameter",advanced:"Advanced",environmentVariables:"Environment Variables",environmentVariablesDesc:"Define the Environment Variables for exporting.",ShowExportProgressBar:"Show export progressBar"}},Gn={"de-DE":xc,"en-US":Jc,"zh-CN":Yc,get current(){const e=Object.keys(this),l=Ie.moment.locale().toLowerCase();let t=e.find(c=>c.toLowerCase()===l.toLowerCase());if(t)return this[t];const n=l.split("-")[0];return t=e.find(c=>c.toLowerCase().startsWith(n)),t?this[t]:this["en-US"]}};class Vl extends Ie.Modal{constructor(l,t,n){super(l),this.options=typeof t=="string"?{message:t,buttons:"Ok",title:n}:t,this.lang=Gn.current}onOpen(){const{titleEl:l,contentEl:t,lang:n,options:{message:c,title:i,buttons:o,callback:s,buttonsLabel:a,buttonsClass:Z}}=this;switch(i&&l.setText(i),t.createDiv({text:c}),o){case"Yes":t.createEl("div",{cls:["modal-button-container"],parent:t},g=>{g.createEl("button",{text:(a==null?void 0:a.yes)??n.messageBox.yes,cls:["mod-cta",Z==null?void 0:Z.yes],parent:g}).onclick=()=>this.call(s==null?void 0:s.yes)});break;case"YesNo":t.createEl("div",{cls:["modal-button-container"],parent:t},g=>{g.createEl("button",{text:(a==null?void 0:a.yes)??n.messageBox.yes,cls:["mod-cta",Z==null?void 0:Z.yes],parent:g}).onclick=()=>this.call(s==null?void 0:s.yes),g.createEl("button",{text:(a==null?void 0:a.no)??n.messageBox.no,cls:["mod-cta",Z==null?void 0:Z.no],parent:g}).onclick=()=>this.call(s==null?void 0:s.no)});break;case"Ok":t.createEl("div",{cls:["modal-button-container"],parent:t},g=>{g.createEl("button",{text:(a==null?void 0:a.ok)??n.messageBox.ok,cls:["mod-cta",Z==null?void 0:Z.no],parent:g}).onclick=()=>this.call(s==null?void 0:s.ok)});break;case"OkCancel":t.createEl("div",{cls:["modal-button-container"],parent:t},g=>{g.createEl("button",{text:(a==null?void 0:a.ok)??n.messageBox.ok,cls:["mod-cta",Z==null?void 0:Z.ok],parent:g}).onclick=()=>this.call(s==null?void 0:s.ok),g.createEl("button",{text:(a==null?void 0:a.cancel)??n.messageBox.cancel,cls:["mod-cta",Z==null?void 0:Z.cancel],parent:g}).onclick=()=>this.call(s==null?void 0:s.cancel)});break}}call(l){l&&l(),this.close()}onClose(){const{contentEl:l}=this;l.empty()}}var yc=Ze('<div class=progress-bar><div class="progress-bar-message u-center-text"></div><div class=progress-bar-indicator><div class=progress-bar-line></div><div class=progress-bar-subline style=display:none;></div><div class="progress-bar-subline mod-increase"></div><div class="progress-bar-subline mod-decrease">');const Bc=e=>(()=>{var l=yc(),t=l.firstChild,n=e.ref;return typeof n=="function"?Rt(n,l):e.ref=l,ne(t,()=>e.message),l})(),Fc=e=>Se(l=>{let t=!1;const n=()=>{t||(t=!0,l())};let c;return ne(document.body,()=>G(Bc,{ref(i){var o=c;typeof o=="function"?o(i):c=i},message:e})),ze(()=>{c instanceof Node&&document.body.contains(c)&&document.body.removeChild(c)}),n}),Hc={show:Fc};function Nc(e){return e&&e.__esModule&&Object.prototype.hasOwnProperty.call(e,"default")?e.default:e}var Mt={exports:{}};const vc="2.0.0",In=256,kc=Number.MAX_SAFE_INTEGER||9007199254740991,Sc=16,wc=In-6,Ec=["major","premajor","minor","preminor","patch","prepatch","prerelease"];var Vt={MAX_LENGTH:In,MAX_SAFE_COMPONENT_LENGTH:Sc,MAX_SAFE_BUILD_LENGTH:wc,MAX_SAFE_INTEGER:kc,RELEASE_TYPES:Ec,SEMVER_SPEC_VERSION:vc,FLAG_INCLUDE_PRERELEASE:1,FLAG_LOOSE:2};const Kc=typeof process=="object"&&process.env&&process.env.NODE_DEBUG&&/\bsemver\b/i.test(process.env.NODE_DEBUG)?(...e)=>console.error("SEMVER",...e):()=>{};var At=Kc;(function(e,l){const{MAX_SAFE_COMPONENT_LENGTH:t,MAX_SAFE_BUILD_LENGTH:n,MAX_LENGTH:c}=Vt,i=At;l=e.exports={};const o=l.re=[],s=l.safeRe=[],a=l.src=[],Z=l.t={};let g=0;const I="[a-zA-Z0-9-]",x=[["\\s",1],["\\d",c],[I,n]],p=L=>{for(const[m,K]of x)L=L.split(`${m}*`).join(`${m}{0,${K}}`).split(`${m}+`).join(`${m}{1,${K}}`);return L},Y=(L,m,K)=>{const w=p(m),E=g++;i(L,E,m),Z[L]=E,a[E]=m,o[E]=new RegExp(m,K?"g":void 0),s[E]=new RegExp(w,K?"g":void 0)};Y("NUMERICIDENTIFIER","0|[1-9]\\d*"),Y("NUMERICIDENTIFIERLOOSE","\\d+"),Y("NONNUMERICIDENTIFIER",`\\d*[a-zA-Z-]${I}*`),Y("MAINVERSION",`(${a[Z.NUMERICIDENTIFIER]})\\.(${a[Z.NUMERICIDENTIFIER]})\\.(${a[Z.NUMERICIDENTIFIER]})`),Y("MAINVERSIONLOOSE",`(${a[Z.NUMERICIDENTIFIERLOOSE]})\\.(${a[Z.NUMERICIDENTIFIERLOOSE]})\\.(${a[Z.NUMERICIDENTIFIERLOOSE]})`),Y("PRERELEASEIDENTIFIER",`(?:${a[Z.NUMERICIDENTIFIER]}|${a[Z.NONNUMERICIDENTIFIER]})`),Y("PRERELEASEIDENTIFIERLOOSE",`(?:${a[Z.NUMERICIDENTIFIERLOOSE]}|${a[Z.NONNUMERICIDENTIFIER]})`),Y("PRERELEASE",`(?:-(${a[Z.PRERELEASEIDENTIFIER]}(?:\\.${a[Z.PRERELEASEIDENTIFIER]})*))`),Y("PRERELEASELOOSE",`(?:-?(${a[Z.PRERELEASEIDENTIFIERLOOSE]}(?:\\.${a[Z.PRERELEASEIDENTIFIERLOOSE]})*))`),Y("BUILDIDENTIFIER",`${I}+`),Y("BUILD",`(?:\\+(${a[Z.BUILDIDENTIFIER]}(?:\\.${a[Z.BUILDIDENTIFIER]})*))`),Y("FULLPLAIN",`v?${a[Z.MAINVERSION]}${a[Z.PRERELEASE]}?${a[Z.BUILD]}?`),Y("FULL",`^${a[Z.FULLPLAIN]}$`),Y("LOOSEPLAIN",`[v=\\s]*${a[Z.MAINVERSIONLOOSE]}${a[Z.PRERELEASELOOSE]}?${a[Z.BUILD]}?`),Y("LOOSE",`^${a[Z.LOOSEPLAIN]}$`),Y("GTLT","((?:<|>)?=?)"),Y("XRANGEIDENTIFIERLOOSE",`${a[Z.NUMERICIDENTIFIERLOOSE]}|x|X|\\*`),Y("XRANGEIDENTIFIER",`${a[Z.NUMERICIDENTIFIER]}|x|X|\\*`),Y("XRANGEPLAIN",`[v=\\s]*(${a[Z.XRANGEIDENTIFIER]})(?:\\.(${a[Z.XRANGEIDENTIFIER]})(?:\\.(${a[Z.XRANGEIDENTIFIER]})(?:${a[Z.PRERELEASE]})?${a[Z.BUILD]}?)?)?`),Y("XRANGEPLAINLOOSE",`[v=\\s]*(${a[Z.XRANGEIDENTIFIERLOOSE]})(?:\\.(${a[Z.XRANGEIDENTIFIERLOOSE]})(?:\\.(${a[Z.XRANGEIDENTIFIERLOOSE]})(?:${a[Z.PRERELEASELOOSE]})?${a[Z.BUILD]}?)?)?`),Y("XRANGE",`^${a[Z.GTLT]}\\s*${a[Z.XRANGEPLAIN]}$`),Y("XRANGELOOSE",`^${a[Z.GTLT]}\\s*${a[Z.XRANGEPLAINLOOSE]}$`),Y("COERCEPLAIN",`(^|[^\\d])(\\d{1,${t}})(?:\\.(\\d{1,${t}}))?(?:\\.(\\d{1,${t}}))?`),Y("COERCE",`${a[Z.COERCEPLAIN]}(?:$|[^\\d])`),Y("COERCEFULL",a[Z.COERCEPLAIN]+`(?:${a[Z.PRERELEASE]})?(?:${a[Z.BUILD]})?(?:$|[^\\d])`),Y("COERCERTL",a[Z.COERCE],!0),Y("COERCERTLFULL",a[Z.COERCEFULL],!0),Y("LONETILDE","(?:~>?)"),Y("TILDETRIM",`(\\s*)${a[Z.LONETILDE]}\\s+`,!0),l.tildeTrimReplace="$1~",Y("TILDE",`^${a[Z.LONETILDE]}${a[Z.XRANGEPLAIN]}$`),Y("TILDELOOSE",`^${a[Z.LONETILDE]}${a[Z.XRANGEPLAINLOOSE]}$`),Y("LONECARET","(?:\\^)"),Y("CARETTRIM",`(\\s*)${a[Z.LONECARET]}\\s+`,!0),l.caretTrimReplace="$1^",Y("CARET",`^${a[Z.LONECARET]}${a[Z.XRANGEPLAIN]}$`),Y("CARETLOOSE",`^${a[Z.LONECARET]}${a[Z.XRANGEPLAINLOOSE]}$`),Y("COMPARATORLOOSE",`^${a[Z.GTLT]}\\s*(${a[Z.LOOSEPLAIN]})$|^$`),Y("COMPARATOR",`^${a[Z.GTLT]}\\s*(${a[Z.FULLPLAIN]})$|^$`),Y("COMPARATORTRIM",`(\\s*)${a[Z.GTLT]}\\s*(${a[Z.LOOSEPLAIN]}|${a[Z.XRANGEPLAIN]})`,!0),l.comparatorTrimReplace="$1$2$3",Y("HYPHENRANGE",`^\\s*(${a[Z.XRANGEPLAIN]})\\s+-\\s+(${a[Z.XRANGEPLAIN]})\\s*$`),Y("HYPHENRANGELOOSE",`^\\s*(${a[Z.XRANGEPLAINLOOSE]})\\s+-\\s+(${a[Z.XRANGEPLAINLOOSE]})\\s*$`),Y("STAR","(<|>)?=?\\s*\\*"),Y("GTE0","^\\s*>=\\s*0\\.0\\.0\\s*$"),Y("GTE0PRE","^\\s*>=\\s*0\\.0\\.0-0\\s*$")})(Mt,Mt.exports);var nt=Mt.exports;const Qc=Object.freeze({loose:!0}),zc=Object.freeze({}),Uc=e=>e?typeof e!="object"?Qc:e:zc;var ll=Uc;const Al=/^[0-9]+$/,Cn=(e,l)=>{const t=Al.test(e),n=Al.test(l);return t&&n&&(e=+e,l=+l),e===l?0:t&&!n?-1:n&&!t?1:e<l?-1:1},jc=(e,l)=>Cn(l,e);var Wn={compareIdentifiers:Cn,rcompareIdentifiers:jc};const it=At,{MAX_LENGTH:Yl,MAX_SAFE_INTEGER:st}=Vt,{safeRe:Jl,t:xl}=nt,Lc=ll,{compareIdentifiers:ke}=Wn;let $c=class he{constructor(l,t){if(t=Lc(t),l instanceof he){if(l.loose===!!t.loose&&l.includePrerelease===!!t.includePrerelease)return l;l=l.version}else if(typeof l!="string")throw new TypeError(`Invalid version. Must be a string. Got type "${typeof l}".`);if(l.length>Yl)throw new TypeError(`version is longer than ${Yl} characters`);it("SemVer",l,t),this.options=t,this.loose=!!t.loose,this.includePrerelease=!!t.includePrerelease;const n=l.trim().match(t.loose?Jl[xl.LOOSE]:Jl[xl.FULL]);if(!n)throw new TypeError(`Invalid Version: ${l}`);if(this.raw=l,this.major=+n[1],this.minor=+n[2],this.patch=+n[3],this.major>st||this.major<0)throw new TypeError("Invalid major version");if(this.minor>st||this.minor<0)throw new TypeError("Invalid minor version");if(this.patch>st||this.patch<0)throw new TypeError("Invalid patch version");n[4]?this.prerelease=n[4].split(".").map(c=>{if(/^[0-9]+$/.test(c)){const i=+c;if(i>=0&&i<st)return i}return c}):this.prerelease=[],this.build=n[5]?n[5].split("."):[],this.format()}format(){return this.version=`${this.major}.${this.minor}.${this.patch}`,this.prerelease.length&&(this.version+=`-${this.prerelease.join(".")}`),this.version}toString(){return this.version}compare(l){if(it("SemVer.compare",this.version,this.options,l),!(l instanceof he)){if(typeof l=="string"&&l===this.version)return 0;l=new he(l,this.options)}return l.version===this.version?0:this.compareMain(l)||this.comparePre(l)}compareMain(l){return l instanceof he||(l=new he(l,this.options)),ke(this.major,l.major)||ke(this.minor,l.minor)||ke(this.patch,l.patch)}comparePre(l){if(l instanceof he||(l=new he(l,this.options)),this.prerelease.length&&!l.prerelease.length)return-1;if(!this.prerelease.length&&l.prerelease.length)return 1;if(!this.prerelease.length&&!l.prerelease.length)return 0;let t=0;do{const n=this.prerelease[t],c=l.prerelease[t];if(it("prerelease compare",t,n,c),n===void 0&&c===void 0)return 0;if(c===void 0)return 1;if(n===void 0)return-1;if(n===c)continue;return ke(n,c)}while(++t)}compareBuild(l){l instanceof he||(l=new he(l,this.options));let t=0;do{const n=this.build[t],c=l.build[t];if(it("build compare",t,n,c),n===void 0&&c===void 0)return 0;if(c===void 0)return 1;if(n===void 0)return-1;if(n===c)continue;return ke(n,c)}while(++t)}inc(l,t,n){switch(l){case"premajor":this.prerelease.length=0,this.patch=0,this.minor=0,this.major++,this.inc("pre",t,n);break;case"preminor":this.prerelease.length=0,this.patch=0,this.minor++,this.inc("pre",t,n);break;case"prepatch":this.prerelease.length=0,this.inc("patch",t,n),this.inc("pre",t,n);break;case"prerelease":this.prerelease.length===0&&this.inc("patch",t,n),this.inc("pre",t,n);break;case"major":(this.minor!==0||this.patch!==0||this.prerelease.length===0)&&this.major++,this.minor=0,this.patch=0,this.prerelease=[];break;case"minor":(this.patch!==0||this.prerelease.length===0)&&this.minor++,this.patch=0,this.prerelease=[];break;case"patch":this.prerelease.length===0&&this.patch++,this.prerelease=[];break;case"pre":{const c=Number(n)?1:0;if(!t&&n===!1)throw new Error("invalid increment argument: identifier is empty");if(this.prerelease.length===0)this.prerelease=[c];else{let i=this.prerelease.length;for(;--i>=0;)typeof this.prerelease[i]=="number"&&(this.prerelease[i]++,i=-2);if(i===-1){if(t===this.prerelease.join(".")&&n===!1)throw new Error("invalid increment argument: identifier already exists");this.prerelease.push(c)}}if(t){let i=[t,c];n===!1&&(i=[t]),ke(this.prerelease[0],t)===0?isNaN(this.prerelease[1])&&(this.prerelease=i):this.prerelease=i}break}default:throw new Error(`invalid increment argument: ${l}`)}return this.raw=this.format(),this.build.length&&(this.raw+=`+${this.build.join(".")}`),this}};var se=$c;const yl=se,Tc=(e,l,t=!1)=>{if(e instanceof yl)return e;try{return new yl(e,l)}catch(n){if(!t)return null;throw n}};var je=Tc;const Mc=je,Oc=(e,l)=>{const t=Mc(e,l);return t?t.version:null};var Pc=Oc;const Dc=je,_c=(e,l)=>{const t=Dc(e.trim().replace(/^[=v]+/,""),l);return t?t.version:null};var qc=_c;const Bl=se,ei=(e,l,t,n,c)=>{typeof t=="string"&&(c=n,n=t,t=void 0);try{return new Bl(e instanceof Bl?e.version:e,t).inc(l,n,c).version}catch{return null}};var ti=ei;const Fl=je,li=(e,l)=>{const t=Fl(e,null,!0),n=Fl(l,null,!0),c=t.compare(n);if(c===0)return null;const i=c>0,o=i?t:n,s=i?n:t,a=!!o.prerelease.length;if(!!s.prerelease.length&&!a)return!s.patch&&!s.minor?"major":o.patch?"patch":o.minor?"minor":"major";const g=a?"pre":"";return t.major!==n.major?g+"major":t.minor!==n.minor?g+"minor":t.patch!==n.patch?g+"patch":"prerelease"};var ni=li;const ci=se,ii=(e,l)=>new ci(e,l).major;var si=ii;const oi=se,ai=(e,l)=>new oi(e,l).minor;var ri=ai;const di=se,gi=(e,l)=>new di(e,l).patch;var bi=gi;const Zi=je,mi=(e,l)=>{const t=Zi(e,l);return t&&t.prerelease.length?t.prerelease:null};var ui=mi;const Hl=se,Gi=(e,l,t)=>new Hl(e,t).compare(new Hl(l,t));var Ce=Gi;const Ii=Ce,Ci=(e,l,t)=>Ii(l,e,t);var Wi=Ci;const hi=Ce,pi=(e,l)=>hi(e,l,!0);var Xi=pi;const Nl=se,fi=(e,l,t)=>{const n=new Nl(e,t),c=new Nl(l,t);return n.compare(c)||n.compareBuild(c)};var nl=fi;const Ri=nl,Vi=(e,l)=>e.sort((t,n)=>Ri(t,n,l));var Ai=Vi;const Yi=nl,Ji=(e,l)=>e.sort((t,n)=>Yi(n,t,l));var xi=Ji;const yi=Ce,Bi=(e,l,t)=>yi(e,l,t)>0;var Yt=Bi;const Fi=Ce,Hi=(e,l,t)=>Fi(e,l,t)<0;var cl=Hi;const Ni=Ce,vi=(e,l,t)=>Ni(e,l,t)===0;var hn=vi;const ki=Ce,Si=(e,l,t)=>ki(e,l,t)!==0;var pn=Si;const wi=Ce,Ei=(e,l,t)=>wi(e,l,t)>=0;var il=Ei;const Ki=Ce,Qi=(e,l,t)=>Ki(e,l,t)<=0;var sl=Qi;const zi=hn,Ui=pn,ji=Yt,Li=il,$i=cl,Ti=sl,Mi=(e,l,t,n)=>{switch(l){case"===":return typeof e=="object"&&(e=e.version),typeof t=="object"&&(t=t.version),e===t;case"!==":return typeof e=="object"&&(e=e.version),typeof t=="object"&&(t=t.version),e!==t;case"":case"=":case"==":return zi(e,t,n);case"!=":return Ui(e,t,n);case">":return ji(e,t,n);case">=":return Li(e,t,n);case"<":return $i(e,t,n);case"<=":return Ti(e,t,n);default:throw new TypeError(`Invalid operator: ${l}`)}};var Xn=Mi;const Oi=se,Pi=je,{safeRe:ot,t:at}=nt,Di=(e,l)=>{if(e instanceof Oi)return e;if(typeof e=="number"&&(e=String(e)),typeof e!="string")return null;l=l||{};let t=null;if(!l.rtl)t=e.match(l.includePrerelease?ot[at.COERCEFULL]:ot[at.COERCE]);else{const a=l.includePrerelease?ot[at.COERCERTLFULL]:ot[at.COERCERTL];let Z;for(;(Z=a.exec(e))&&(!t||t.index+t[0].length!==e.length);)(!t||Z.index+Z[0].length!==t.index+t[0].length)&&(t=Z),a.lastIndex=Z.index+Z[1].length+Z[2].length;a.lastIndex=-1}if(t===null)return null;const n=t[2],c=t[3]||"0",i=t[4]||"0",o=l.includePrerelease&&t[5]?`-${t[5]}`:"",s=l.includePrerelease&&t[6]?`+${t[6]}`:"";return Pi(`${n}.${c}.${i}${o}${s}`,l)};var _i=Di;class qi{constructor(){this.max=1e3,this.map=new Map}get(l){const t=this.map.get(l);if(t!==void 0)return this.map.delete(l),this.map.set(l,t),t}delete(l){return this.map.delete(l)}set(l,t){if(!this.delete(l)&&t!==void 0){if(this.map.size>=this.max){const c=this.map.keys().next().value;this.delete(c)}this.map.set(l,t)}return this}}var es=qi,kt,vl;function We(){if(vl)return kt;vl=1;class e{constructor(C,N){if(N=n(N),C instanceof e)return C.loose===!!N.loose&&C.includePrerelease===!!N.includePrerelease?C:new e(C.raw,N);if(C instanceof c)return this.raw=C.value,this.set=[[C]],this.format(),this;if(this.options=N,this.loose=!!N.loose,this.includePrerelease=!!N.includePrerelease,this.raw=C.trim().split(/\s+/).join(" "),this.set=this.raw.split("||").map(F=>this.parseRange(F.trim())).filter(F=>F.length),!this.set.length)throw new TypeError(`Invalid SemVer Range: ${this.raw}`);if(this.set.length>1){const F=this.set[0];if(this.set=this.set.filter(H=>!Y(H[0])),this.set.length===0)this.set=[F];else if(this.set.length>1){for(const H of this.set)if(H.length===1&&L(H[0])){this.set=[H];break}}}this.format()}format(){return this.range=this.set.map(C=>C.join(" ").trim()).join("||").trim(),this.range}toString(){return this.range}parseRange(C){const F=((this.options.includePrerelease&&x)|(this.options.loose&&p))+":"+C,H=t.get(F);if(H)return H;const J=this.options.loose,k=J?s[a.HYPHENRANGELOOSE]:s[a.HYPHENRANGE];C=C.replace(k,v(this.options.includePrerelease)),i("hyphen replace",C),C=C.replace(s[a.COMPARATORTRIM],Z),i("comparator trim",C),C=C.replace(s[a.TILDETRIM],g),i("tilde trim",C),C=C.replace(s[a.CARETTRIM],I),i("caret trim",C);let z=C.split(" ").map(V=>K(V,this.options)).join(" ").split(/\s+/).map(V=>R(V,this.options));J&&(z=z.filter(V=>(i("loose invalid filter",V,this.options),!!V.match(s[a.COMPARATORLOOSE])))),i("range list",z);const S=new Map,U=z.map(V=>new c(V,this.options));for(const V of U){if(Y(V))return[V];S.set(V.value,V)}S.size>1&&S.has("")&&S.delete("");const q=[...S.values()];return t.set(F,q),q}intersects(C,N){if(!(C instanceof e))throw new TypeError("a Range is required");return this.set.some(F=>m(F,N)&&C.set.some(H=>m(H,N)&&F.every(J=>H.every(k=>J.intersects(k,N)))))}test(C){if(!C)return!1;if(typeof C=="string")try{C=new o(C,this.options)}catch{return!1}for(let N=0;N<this.set.length;N++)if(D(this.set[N],C,this.options))return!0;return!1}}kt=e;const l=es,t=new l,n=ll,c=Jt(),i=At,o=se,{safeRe:s,t:a,comparatorTrimReplace:Z,tildeTrimReplace:g,caretTrimReplace:I}=nt,{FLAG_INCLUDE_PRERELEASE:x,FLAG_LOOSE:p}=Vt,Y=W=>W.value==="<0.0.0-0",L=W=>W.value==="",m=(W,C)=>{let N=!0;const F=W.slice();let H=F.pop();for(;N&&F.length;)N=F.every(J=>H.intersects(J,C)),H=F.pop();return N},K=(W,C)=>(i("comp",W,C),W=Q(W,C),i("caret",W),W=E(W,C),i("tildes",W),W=be(W,C),i("xrange",W),W=f(W,C),i("stars",W),W),w=W=>!W||W.toLowerCase()==="x"||W==="*",E=(W,C)=>W.trim().split(/\s+/).map(N=>M(N,C)).join(" "),M=(W,C)=>{const N=C.loose?s[a.TILDELOOSE]:s[a.TILDE];return W.replace(N,(F,H,J,k,z)=>{i("tilde",W,F,H,J,k,z);let S;return w(H)?S="":w(J)?S=`>=${H}.0.0 <${+H+1}.0.0-0`:w(k)?S=`>=${H}.${J}.0 <${H}.${+J+1}.0-0`:z?(i("replaceTilde pr",z),S=`>=${H}.${J}.${k}-${z} <${H}.${+J+1}.0-0`):S=`>=${H}.${J}.${k} <${H}.${+J+1}.0-0`,i("tilde return",S),S})},Q=(W,C)=>W.trim().split(/\s+/).map(N=>ge(N,C)).join(" "),ge=(W,C)=>{i("caret",W,C);const N=C.loose?s[a.CARETLOOSE]:s[a.CARET],F=C.includePrerelease?"-0":"";return W.replace(N,(H,J,k,z,S)=>{i("caret",W,H,J,k,z,S);let U;return w(J)?U="":w(k)?U=`>=${J}.0.0${F} <${+J+1}.0.0-0`:w(z)?J==="0"?U=`>=${J}.${k}.0${F} <${J}.${+k+1}.0-0`:U=`>=${J}.${k}.0${F} <${+J+1}.0.0-0`:S?(i("replaceCaret pr",S),J==="0"?k==="0"?U=`>=${J}.${k}.${z}-${S} <${J}.${k}.${+z+1}-0`:U=`>=${J}.${k}.${z}-${S} <${J}.${+k+1}.0-0`:U=`>=${J}.${k}.${z}-${S} <${+J+1}.0.0-0`):(i("no pr"),J==="0"?k==="0"?U=`>=${J}.${k}.${z}${F} <${J}.${k}.${+z+1}-0`:U=`>=${J}.${k}.${z}${F} <${J}.${+k+1}.0-0`:U=`>=${J}.${k}.${z} <${+J+1}.0.0-0`),i("caret return",U),U})},be=(W,C)=>(i("replaceXRanges",W,C),W.split(/\s+/).map(N=>X(N,C)).join(" ")),X=(W,C)=>{W=W.trim();const N=C.loose?s[a.XRANGELOOSE]:s[a.XRANGE];return W.replace(N,(F,H,J,k,z,S)=>{i("xRange",W,F,H,J,k,z,S);const U=w(J),q=U||w(k),V=q||w(z),me=V;return H==="="&&me&&(H=""),S=C.includePrerelease?"-0":"",U?H===">"||H==="<"?F="<0.0.0-0":F="*":H&&me?(q&&(k=0),z=0,H===">"?(H=">=",q?(J=+J+1,k=0,z=0):(k=+k+1,z=0)):H==="<="&&(H="<",q?J=+J+1:k=+k+1),H==="<"&&(S="-0"),F=`${H+J}.${k}.${z}${S}`):q?F=`>=${J}.0.0${S} <${+J+1}.0.0-0`:V&&(F=`>=${J}.${k}.0${S} <${J}.${+k+1}.0-0`),i("xRange return",F),F})},f=(W,C)=>(i("replaceStars",W,C),W.trim().replace(s[a.STAR],"")),R=(W,C)=>(i("replaceGTE0",W,C),W.trim().replace(s[C.includePrerelease?a.GTE0PRE:a.GTE0],"")),v=W=>(C,N,F,H,J,k,z,S,U,q,V,me)=>(w(F)?N="":w(H)?N=`>=${F}.0.0${W?"-0":""}`:w(J)?N=`>=${F}.${H}.0${W?"-0":""}`:k?N=`>=${N}`:N=`>=${N}${W?"-0":""}`,w(U)?S="":w(q)?S=`<${+U+1}.0.0-0`:w(V)?S=`<${U}.${+q+1}.0-0`:me?S=`<=${U}.${q}.${V}-${me}`:W?S=`<${U}.${q}.${+V+1}-0`:S=`<=${S}`,`${N} ${S}`.trim()),D=(W,C,N)=>{for(let F=0;F<W.length;F++)if(!W[F].test(C))return!1;if(C.prerelease.length&&!N.includePrerelease){for(let F=0;F<W.length;F++)if(i(W[F].semver),W[F].semver!==c.ANY&&W[F].semver.prerelease.length>0){const H=W[F].semver;if(H.major===C.major&&H.minor===C.minor&&H.patch===C.patch)return!0}return!1}return!0};return kt}var St,kl;function Jt(){if(kl)return St;kl=1;const e=Symbol("SemVer ANY");class l{static get ANY(){return e}constructor(g,I){if(I=t(I),g instanceof l){if(g.loose===!!I.loose)return g;g=g.value}g=g.trim().split(/\s+/).join(" "),o("comparator",g,I),this.options=I,this.loose=!!I.loose,this.parse(g),this.semver===e?this.value="":this.value=this.operator+this.semver.version,o("comp",this)}parse(g){const I=this.options.loose?n[c.COMPARATORLOOSE]:n[c.COMPARATOR],x=g.match(I);if(!x)throw new TypeError(`Invalid comparator: ${g}`);this.operator=x[1]!==void 0?x[1]:"",this.operator==="="&&(this.operator=""),x[2]?this.semver=new s(x[2],this.options.loose):this.semver=e}toString(){return this.value}test(g){if(o("Comparator.test",g,this.options.loose),this.semver===e||g===e)return!0;if(typeof g=="string")try{g=new s(g,this.options)}catch{return!1}return i(g,this.operator,this.semver,this.options)}intersects(g,I){if(!(g instanceof l))throw new TypeError("a Comparator is required");return this.operator===""?this.value===""?!0:new a(g.value,I).test(this.value):g.operator===""?g.value===""?!0:new a(this.value,I).test(g.semver):(I=t(I),I.includePrerelease&&(this.value==="<0.0.0-0"||g.value==="<0.0.0-0")||!I.includePrerelease&&(this.value.startsWith("<0.0.0")||g.value.startsWith("<0.0.0"))?!1:!!(this.operator.startsWith(">")&&g.operator.startsWith(">")||this.operator.startsWith("<")&&g.operator.startsWith("<")||this.semver.version===g.semver.version&&this.operator.includes("=")&&g.operator.includes("=")||i(this.semver,"<",g.semver,I)&&this.operator.startsWith(">")&&g.operator.startsWith("<")||i(this.semver,">",g.semver,I)&&this.operator.startsWith("<")&&g.operator.startsWith(">")))}}St=l;const t=ll,{safeRe:n,t:c}=nt,i=Xn,o=At,s=se,a=We();return St}const ts=We(),ls=(e,l,t)=>{try{l=new ts(l,t)}catch{return!1}return l.test(e)};var xt=ls;const ns=We(),cs=(e,l)=>new ns(e,l).set.map(t=>t.map(n=>n.value).join(" ").trim().split(" "));var is=cs;const ss=se,os=We(),as=(e,l,t)=>{let n=null,c=null,i=null;try{i=new os(l,t)}catch{return null}return e.forEach(o=>{i.test(o)&&(!n||c.compare(o)===-1)&&(n=o,c=new ss(n,t))}),n};var rs=as;const ds=se,gs=We(),bs=(e,l,t)=>{let n=null,c=null,i=null;try{i=new gs(l,t)}catch{return null}return e.forEach(o=>{i.test(o)&&(!n||c.compare(o)===1)&&(n=o,c=new ds(n,t))}),n};var Zs=bs;const wt=se,ms=We(),Sl=Yt,us=(e,l)=>{e=new ms(e,l);let t=new wt("0.0.0");if(e.test(t)||(t=new wt("0.0.0-0"),e.test(t)))return t;t=null;for(let n=0;n<e.set.length;++n){const c=e.set[n];let i=null;c.forEach(o=>{const s=new wt(o.semver.version);switch(o.operator){case">":s.prerelease.length===0?s.patch++:s.prerelease.push(0),s.raw=s.format();case"":case">=":(!i||Sl(s,i))&&(i=s);break;case"<":case"<=":break;default:throw new Error(`Unexpected operation: ${o.operator}`)}}),i&&(!t||Sl(t,i))&&(t=i)}return t&&e.test(t)?t:null};var Gs=us;const Is=We(),Cs=(e,l)=>{try{return new Is(e,l).range||"*"}catch{return null}};var Ws=Cs;const hs=se,fn=Jt(),{ANY:ps}=fn,Xs=We(),fs=xt,wl=Yt,El=cl,Rs=sl,Vs=il,As=(e,l,t,n)=>{e=new hs(e,n),l=new Xs(l,n);let c,i,o,s,a;switch(t){case">":c=wl,i=Rs,o=El,s=">",a=">=";break;case"<":c=El,i=Vs,o=wl,s="<",a="<=";break;default:throw new TypeError('Must provide a hilo val of "<" or ">"')}if(fs(e,l,n))return!1;for(let Z=0;Z<l.set.length;++Z){const g=l.set[Z];let I=null,x=null;if(g.forEach(p=>{p.semver===ps&&(p=new fn(">=0.0.0")),I=I||p,x=x||p,c(p.semver,I.semver,n)?I=p:o(p.semver,x.semver,n)&&(x=p)}),I.operator===s||I.operator===a||(!x.operator||x.operator===s)&&i(e,x.semver))return!1;if(x.operator===a&&o(e,x.semver))return!1}return!0};var ol=As;const Ys=ol,Js=(e,l,t)=>Ys(e,l,">",t);var xs=Js;const ys=ol,Bs=(e,l,t)=>ys(e,l,"<",t);var Fs=Bs;const Kl=We(),Hs=(e,l,t)=>(e=new Kl(e,t),l=new Kl(l,t),e.intersects(l,t));var Ns=Hs;const vs=xt,ks=Ce;var Ss=(e,l,t)=>{const n=[];let c=null,i=null;const o=e.sort((g,I)=>ks(g,I,t));for(const g of o)vs(g,l,t)?(i=g,c||(c=g)):(i&&n.push([c,i]),i=null,c=null);c&&n.push([c,null]);const s=[];for(const[g,I]of n)g===I?s.push(g):!I&&g===o[0]?s.push("*"):I?g===o[0]?s.push(`<=${I}`):s.push(`${g} - ${I}`):s.push(`>=${g}`);const a=s.join(" || "),Z=typeof l.raw=="string"?l.raw:String(l);return a.length<Z.length?a:l};const Ql=We(),al=Jt(),{ANY:Et}=al,$e=xt,rl=Ce,ws=(e,l,t={})=>{if(e===l)return!0;e=new Ql(e,t),l=new Ql(l,t);let n=!1;e:for(const c of e.set){for(const i of l.set){const o=Ks(c,i,t);if(n=n||o!==null,o)continue e}if(n)return!1}return!0},Es=[new al(">=0.0.0-0")],zl=[new al(">=0.0.0")],Ks=(e,l,t)=>{if(e===l)return!0;if(e.length===1&&e[0].semver===Et){if(l.length===1&&l[0].semver===Et)return!0;t.includePrerelease?e=Es:e=zl}if(l.length===1&&l[0].semver===Et){if(t.includePrerelease)return!0;l=zl}const n=new Set;let c,i;for(const p of e)p.operator===">"||p.operator===">="?c=Ul(c,p,t):p.operator==="<"||p.operator==="<="?i=jl(i,p,t):n.add(p.semver);if(n.size>1)return null;let o;if(c&&i){if(o=rl(c.semver,i.semver,t),o>0)return null;if(o===0&&(c.operator!==">="||i.operator!=="<="))return null}for(const p of n){if(c&&!$e(p,String(c),t)||i&&!$e(p,String(i),t))return null;for(const Y of l)if(!$e(p,String(Y),t))return!1;return!0}let s,a,Z,g,I=i&&!t.includePrerelease&&i.semver.prerelease.length?i.semver:!1,x=c&&!t.includePrerelease&&c.semver.prerelease.length?c.semver:!1;I&&I.prerelease.length===1&&i.operator==="<"&&I.prerelease[0]===0&&(I=!1);for(const p of l){if(g=g||p.operator===">"||p.operator===">=",Z=Z||p.operator==="<"||p.operator==="<=",c){if(x&&p.semver.prerelease&&p.semver.prerelease.length&&p.semver.major===x.major&&p.semver.minor===x.minor&&p.semver.patch===x.patch&&(x=!1),p.operator===">"||p.operator===">="){if(s=Ul(c,p,t),s===p&&s!==c)return!1}else if(c.operator===">="&&!$e(c.semver,String(p),t))return!1}if(i){if(I&&p.semver.prerelease&&p.semver.prerelease.length&&p.semver.major===I.major&&p.semver.minor===I.minor&&p.semver.patch===I.patch&&(I=!1),p.operator==="<"||p.operator==="<="){if(a=jl(i,p,t),a===p&&a!==i)return!1}else if(i.operator==="<="&&!$e(i.semver,String(p),t))return!1}if(!p.operator&&(i||c)&&o!==0)return!1}return!(c&&Z&&!i&&o!==0||i&&g&&!c&&o!==0||x||I)},Ul=(e,l,t)=>{if(!e)return l;const n=rl(e.semver,l.semver,t);return n>0?e:n<0||l.operator===">"&&e.operator===">="?l:e},jl=(e,l,t)=>{if(!e)return l;const n=rl(e.semver,l.semver,t);return n<0?e:n>0||l.operator==="<"&&e.operator==="<="?l:e};var Qs=ws;const Kt=nt,Ll=Vt,zs=se,$l=Wn,Us=je,js=Pc,Ls=qc,$s=ti,Ts=ni,Ms=si,Os=ri,Ps=bi,Ds=ui,_s=Ce,qs=Wi,eo=Xi,to=nl,lo=Ai,no=xi,co=Yt,io=cl,so=hn,oo=pn,ao=il,ro=sl,go=Xn,bo=_i,Zo=Jt(),mo=We(),uo=xt,Go=is,Io=rs,Co=Zs,Wo=Gs,ho=Ws,po=ol,Xo=xs,fo=Fs,Ro=Ns,Vo=Ss,Ao=Qs;var Yo={parse:Us,valid:js,clean:Ls,inc:$s,diff:Ts,major:Ms,minor:Os,patch:Ps,prerelease:Ds,compare:_s,rcompare:qs,compareLoose:eo,compareBuild:to,sort:lo,rsort:no,gt:co,lt:io,eq:so,neq:oo,gte:ao,lte:ro,cmp:go,coerce:bo,Comparator:Zo,Range:mo,satisfies:uo,toComparators:Go,maxSatisfying:Io,minSatisfying:Co,minVersion:Wo,validRange:ho,outside:po,gtr:Xo,ltr:fo,intersects:Ro,simplifyRange:Vo,subset:Ao,SemVer:zs,re:Kt.re,src:Kt.src,tokens:Kt.t,SEMVER_SPEC_VERSION:Ll.SEMVER_SPEC_VERSION,RELEASE_TYPES:Ll.RELEASE_TYPES,compareIdentifiers:$l.compareIdentifiers,rcompareIdentifiers:$l.rcompareIdentifiers},Jo=Yo;const xo=Nc(Jo),Rn=e=>e!=null&&e.includes(" ")?`"${e}"`:`${e??"pandoc"}`;async function yo(e,l){e=Rn(e);let t=await zt(`${e} --version`,{env:l});t=t.substring(0,t.indexOf(`
+`)).replace("pandoc.exe","").replace("pandoc","").trim();let n=[...t].filter(c=>c===".").length;if(n===1)t=`${t}.0`;else for(;n>2;)t=t.substring(0,t.lastIndexOf(".")),n-=1;return xo.parse(t,!0)}const Bo="3.1.7",Zt={normalizePath:Rn,getVersion:yo,requiredVersion:Bo};async function Vn(e,l,t,n,c,i,o,s,a,Z){const{settings:g,lang:I,manifest:x,app:{vault:{adapter:p,config:Y},metadataCache:L}}=e;if(!n){const ce=_l(c);n=`${l.basename}${ce}`}i==null&&(i=g.showOverwriteConfirmation);const m=g.showExportProgressBar,K=p.getBasePath(),w=`${K}/${x.dir}`,E=`${w}/lua`,M=t,Q=`${M}/${n}`,ge=n.substring(0,n.lastIndexOf(".")),be=n,X=p.getFullPath(l.path),f=ae.dirname(X),R=l.basename,v=l.name;let D=Y.attachmentFolderPath??"/";D==="/"?D=K:D.startsWith(".")?D=ae.join(f,D.substring(1)):D=ae.join(K,D);let W=null;try{W=L.getCache(l.path).frontmatter}catch(ce){console.error(ce)}const C={pluginDir:w,luaDir:E,outputDir:M,outputPath:Q,outputFileName:ge,outputFileFullName:be,currentDir:f,currentPath:X,currentFileName:R,currentFileFullName:v,attachmentFolderPath:D,vaultDir:K,metadata:W,options:o,fromFormat:app.vault.config.useMarkdownLinks?"markdown":"markdown+wikilinks_title_after_pipe"},N=c.type==="custom"&&c.showCommandOutput,F=c.openExportedFileLocation??g.openExportedFileLocation,H=c.openExportedFile??g.openExportedFile;if(i&&yt.existsSync(Q)){const ce=await Be.remote.dialog.showSaveDialog({title:I.overwriteConfirmationDialog.title(be),defaultPath:Q,properties:["showOverwriteConfirmation","createDirectory"]});if(ce.canceled)return;C.outputPath=ce.filePath,C.outputDir=ae.dirname(C.outputPath),C.outputFileFullName=ae.basename(C.outputPath),C.outputFileName=ae.basename(C.outputFileFullName,ae.extname(C.outputFileFullName))}let J;m&&(J=Hc.show(I.preparing(C.outputFileFullName)));const k=C.env=ql(de(g.env)??{},C);let z=Zt.normalizePath(de(g.pandocPath));if(pt.platform==="win32"){z=z.replaceAll("\\","/");const ce=["pluginDir","luaDir","outputDir","outputPath","currentDir","currentPath","attachmentFolderPath","vaultDir"];for(const Xe of ce){const He=C[Xe];C[Xe]=He.replaceAll("\\","/")}}const S=c.type==="pandoc"?`${z} "\${currentPath}" ${c.arguments??""} ${c.customArguments??""}`:c.command,U=Ut(S,C),q=lt(U.match(/(?:[^\s"]+|"[^"]*")+/g),{alias:{output:["o"]}}),V=ae.normalize(Kn(q.output)),me=ae.dirname(V);yt.existsSync(me)||yt.mkdirSync(me);try{console.log(`[${e.manifest.name}]: export command and options:`,{cmd:U,options:{cwd:C.currentDir,env:k}}),await zt(U,{cwd:C.currentDir,env:k}),J==null||J();const ce=async()=>{if(F&&setTimeout(()=>{Be.remote.shell.showItemInFolder(V)},1e3),H&&await Be.remote.shell.openPath(V),c.type==="pandoc"&&c.runCommand===!0&&c.command){const Xe=Ut(c.command,C);await zt(Xe,{cwd:C.currentDir,env:k})}s&&s()};if(N){const Xe=new Vl(app,I.exportCommandOutputMessage(U));Xe.onClose=ce,Xe.open()}else new Ie.Notice(I.exportSuccessNotice(C.outputFileFullName),1500),await ce()}catch(ce){J==null||J(),new Vl(app,I.exportErrorOutputMessage(U,ce)).open(),a&&a()}}const Ot=e=>{const l=new Ie.Modal(e.app);let t=[],n=!1;return Ye(()=>{ne(l.titleEl,()=>e.title)}),Ye(()=>{ne(l.contentEl,()=>e.children)}),Ye(()=>{const c=Object.entries(e.classList??{}).filter(([,i])=>i).map(([i])=>i);t.length>0&&l.containerEl.removeClasses(t),c.length>0&&l.containerEl.addClasses(c),t=c}),Ye(()=>{l.containerEl.style.display=e.hidden?"None":""}),l.onClose=()=>{n||(n=!0,e.onClose())},ln(()=>l.open()),ze(()=>{n||l.close()}),document.createTextNode("")};var Fo=Ze("<button>");const Pt=e=>(()=>{var l=Fo();return el(l,"click",e.onClick,!0),ne(l,()=>e.children),te(()=>l.classList.toggle("mod-cta",!!e.cta)),l})();qt(["click"]);var Ho=Ze("<div><div class=setting-item-info><div class=setting-item-name></div><div class=setting-item-description></div></div><div class=setting-item-control>"),No=Ze("<div class=checkbox-container><input type=checkbox>"),vo=Ze("<div class=setting-editor-extra-setting-button>"),ko=Ze("<input type=text>"),So=Ze("<textarea>"),wo=Ze("<select class=dropdown>"),Eo=Ze("<option>");const An=$n(),Ko=()=>Tn(An),j=e=>{const l={settingEl:null};return G(An.Provider,{value:l,get children(){var t=Ho(),n=t.firstChild,c=n.firstChild,i=c.nextSibling,o=n.nextSibling;return Rt(s=>l.settingEl=s,t),ne(c,()=>e.name),ne(i,()=>e.description),ne(o,()=>e.children),te(s=>{var a=`setting-item ${e.class??""}`.trimEnd(),Z=!!e.heading,g=!!e.disabled;return a!==s.e&&bn(t,s.e=a),Z!==s.t&&t.classList.toggle("setting-item-heading",s.t=Z),g!==s.a&&t.classList.toggle("is-disable",s.a=g),s},{e:void 0,t:void 0,a:void 0}),t}})},Ge=e=>{const l=Ko();return ln(()=>{l.settingEl.addClass("mod-toggle")}),ze(()=>{l.settingEl.removeClass("mod-toggle")}),(()=>{var t=No();return t.$$click=()=>e.onChange&&e.onChange(!e.checked),te(()=>t.classList.toggle("is-enabled",!!e.checked)),t})()},ye=e=>(()=>{var l=vo();return el(l,"click",e.onClick,!0),Rt(t=>e.icon&&En.setIcon(t,e.icon),l),te(t=>{var n=!!(e.icon&&e.onClick),c=e.tooltip;return n!==t.e&&l.classList.toggle("clickable-icon",t.e=n),c!==t.t&&xe(l,"aria-label",t.t=c),t},{e:void 0,t:void 0}),l})(),re=e=>(()=>{var l=ko();return l.addEventListener("change",t=>{var n;return(n=e.onChange)==null?void 0:n.call(e,t.target.value)}),te(t=>{var n=e.title,c=e.readOnly,i=e.placeholder,o=e.spellcheck??!1,s=e.style,a=e.disabled;return n!==t.e&&xe(l,"title",t.e=n),c!==t.t&&(l.readOnly=t.t=c),i!==t.a&&xe(l,"placeholder",t.a=i),o!==t.o&&xe(l,"spellcheck",t.o=o),t.i=tl(l,s,t.i),a!==t.n&&(l.disabled=t.n=a),t},{e:void 0,t:void 0,a:void 0,o:void 0,i:void 0,n:void 0}),te(()=>l.value=e.value),l})(),Qo=e=>(()=>{var l=So();return l.addEventListener("change",t=>{var n;return(n=e.onChange)==null?void 0:n.call(e,t.target.value)}),te(t=>{var n=e.placeholder,c=e.spellcheck??!1,i=e.style,o=e.disabled;return n!==t.e&&xe(l,"placeholder",t.e=n),c!==t.t&&xe(l,"spellcheck",t.t=c),t.a=tl(l,i,t.a),o!==t.o&&(l.disabled=t.o=o),t},{e:void 0,t:void 0,a:void 0,o:void 0}),te(()=>l.value=e.value),l})(),Pe=e=>(()=>{var l=wo();return l.addEventListener("change",t=>{var n;return(n=e.onChange)==null?void 0:n.call(e,t.target.value,t.target.selectedIndex)}),l.autofocus=!0,ne(l,G(gn,{get each(){return e.options},children:t=>(()=>{var n=Eo();return ne(n,()=>t.name??t.value),te(()=>n.selected=t.value===e.selected),te(()=>n.value=t.value),n})()})),l})();qt(["click"]);var zo=Ze("<div>Unsupported <!> ");const rt={checkbox:e=>G(j,{get name(){return e.meta.title},get description(){return e.meta.description},get children(){return G(Ge,{get checked(){return Me(e.meta)},get onChange(){return e.onChange}})}}),textInput:e=>G(j,{get name(){return e.meta.title},get description(){return e.meta.description},get children(){return G(re,{get value(){return Me(e.meta)},get onChange(){return e.onChange}})}}),dropdown:e=>G(j,{get name(){return e.meta.title},get description(){return e.meta.description},get children(){return G(Pe,{get selected(){return Me(e.meta)},get options(){return e.meta.options},onChange:l=>e.onChange(l)})}}),fileSelectDialog:e=>{const[l,t]=oe(Me(e.meta)),n=async()=>{const c=await Pl.remote.dialog.showOpenDialog({properties:["openFile"],filters:e.meta.filters});!c.canceled&&c.filePaths.length>0&&(t(c.filePaths[0]),e.onChange&&e.onChange(P(l)))};return G(j,{get name(){return e.meta.title},get description(){return e.meta.description},get children(){return[G(re,{get value(){return l()??""},readOnly:!0}),G(ye,{icon:"folder",onClick:n})]}})}},Uo=(e,l)=>{switch(e.type){case"checkbox":{const t=rt[e.type];return G(t,{meta:e,onChange:l})}case"dropdown":{const t=rt[e.type];return G(t,{meta:e,onChange:l})}case"textInput":{const t=rt[e.type];return G(t,{meta:e,onChange:l})}case"fileSelectDialog":{const t=rt[e.type];return G(t,{meta:e,onChange:l})}default:return(()=>{var t=zo(),n=t.firstChild,c=n.nextSibling;return c.nextSibling,ne(t,()=>JSON.stringify(e),c),t})()}},jo=e=>{let l={};Ye(()=>l=e.value??Yn(e.meta));const t=(c,i)=>{l[c]=i,e.onChange&&e.onChange(l,c)},n=(c,i)=>{const o=a=>t(c,a);let s;return e.customEditor&&(s=e.customEditor(i,o),s)?s:Uo(i,o)};return G(gn,{get each(){return Object.entries(e.meta)},children:([c,i])=>n(c,i)})},Yn=e=>Object.fromEntries(Object.entries(e).map(([l,t])=>[l,Me(t)])),Me=e=>{if(e.default)return e.default instanceof Function?e.default():e.default};var Lo=Ze("<div class=modal-button-container>");const $o=e=>{var X;const{plugin:{app:l,settings:t,lang:n},currentFile:c}=e,[i,o]=oe(!1),[s,a]=oe(t.showOverwriteConfirmation),[Z,g]=oe(t.lastExportType??((X=t.items.first())==null?void 0:X.name)),[I,x]=oe({}),p=ee(()=>t.items.find(f=>f.name===Z())),Y=ee(()=>_l(p())),L=ee(()=>n.exportDialog.title(p().name)),m=ee(()=>Un(p().optionsMeta)),[K,w]=oe(`${de(t.lastExportDirectory)??Be.remote.app.getPath("documents")}`),[E,M]=oe(`${c.basename}${Y()}`);Ye(()=>{const f=m();x(f?Yn(f):{})}),Ye(()=>{let f=P(E);f=f.includes(".")?f.substring(0,f.lastIndexOf(".")):f,M(`${f}${Y()}`)});const Q=t.items.map(f=>({name:f.name,value:f.name}));if(t.defaultExportDirectoryMode==="Same"){const f=c.vault.adapter.getBasePath()+"/"+c.parent.path;w(f)}else t.defaultExportDirectoryMode==="Custom"&&w(de(t.customDefaultExportDirectory));const ge=async()=>{var R;const f=await Be.remote.dialog.showOpenDialog({title:n.exportDialog.selectExportFolder,defaultPath:K(),properties:["createDirectory","openDirectory"]});!f.canceled&&((R=f.filePaths)==null?void 0:R.length)>0&&w(f.filePaths[0])},be=async()=>{const f=e.plugin;o(!0),await Vn(f,c,P(K),P(E),P(p),P(s),I(),async()=>{t.showOverwriteConfirmation=P(s),t.lastExportDirectory=Ae(t.lastExportDirectory,P(K)),t.lastExportType=P(p).name,await f.saveSettings(),e.onClose&&e.onClose()},()=>{o(!1)})};return G(Ot,{app:l,get title(){return L()},get hidden(){return i()},get onClose(){return e.onClose},get children(){return[G(j,{get name(){return n.exportDialog.type},get children(){return G(Pe,{options:Q,onChange:f=>g(f),get selected(){return Z()}})}}),G(j,{get name(){return n.exportDialog.fileName},get children(){return G(re,{get title(){return E()},get value(){return E()},onChange:f=>M(f)})}}),G(bt,{get when(){return m()},get children(){return G(jo,{get meta(){return m()},get value(){return I()},onChange:f=>x(f)})}}),G(j,{get name(){return n.exportDialog.exportTo},get children(){return[G(re,{get title(){return K()},get value(){return K()},disabled:!0}),G(ye,{icon:"folder",onClick:ge})]}}),G(j,{get name(){return n.exportDialog.overwriteConfirmation},class:"mod-toggle",get children(){return G(Ge,{get checked(){return s()},onChange:a})}}),(()=>{var f=Lo();return ne(f,G(Pt,{cta:!0,onClick:be,get children(){return n.exportDialog.export}})),f})()]}})},To=(e,l)=>Se(t=>{let n=!1;const c=()=>{n||(n=!0,t())},i=ne(document.body,()=>G($o,{onClose:c,plugin:e,currentFile:l}));return ze(()=>{i instanceof Node&&document.body.contains(i)&&document.body.removeChild(i)}),c}),Qt={show:To},Ct=Symbol("store-raw"),we=Symbol("store-node"),Ve=Symbol("store-has"),Jn=Symbol("store-self");function xn(e){let l=e[pe];if(!l&&(Object.defineProperty(e,pe,{value:l=new Proxy(e,Po)}),!Array.isArray(e))){const t=Object.keys(e),n=Object.getOwnPropertyDescriptors(e);for(let c=0,i=t.length;c<i;c++){const o=t[c];n[o].get&&Object.defineProperty(e,o,{enumerable:n[o].enumerable,get:n[o].get.bind(l)})}}return l}function Ee(e){let l;return e!=null&&typeof e=="object"&&(e[pe]||!(l=Object.getPrototypeOf(e))||l===Object.prototype||Array.isArray(e))}function Ke(e,l=new Set){let t,n,c,i;if(t=e!=null&&e[Ct])return t;if(!Ee(e)||l.has(e))return e;if(Array.isArray(e)){Object.isFrozen(e)?e=e.slice(0):l.add(e);for(let o=0,s=e.length;o<s;o++)c=e[o],(n=Ke(c,l))!==c&&(e[o]=n)}else{Object.isFrozen(e)?e=Object.assign({},e):l.add(e);const o=Object.keys(e),s=Object.getOwnPropertyDescriptors(e);for(let a=0,Z=o.length;a<Z;a++)i=o[a],!s[i].get&&(c=e[i],(n=Ke(c,l))!==c&&(e[i]=n))}return e}function Wt(e,l){let t=e[l];return t||Object.defineProperty(e,l,{value:t=Object.create(null)}),t}function qe(e,l,t){if(e[l])return e[l];const[n,c]=oe(t,{equals:!1,internal:!0});return n.$=c,e[l]=n}function Mo(e,l){const t=Reflect.getOwnPropertyDescriptor(e,l);return!t||t.get||!t.configurable||l===pe||l===we||(delete t.value,delete t.writable,t.get=()=>e[pe][l]),t}function yn(e){Lt()&&qe(Wt(e,we),Jn)()}function Oo(e){return yn(e),Reflect.ownKeys(e)}const Po={get(e,l,t){if(l===Ct)return e;if(l===pe)return t;if(l===jt)return yn(e),t;const n=Wt(e,we),c=n[l];let i=c?c():e[l];if(l===we||l===Ve||l==="__proto__")return i;if(!c){const o=Object.getOwnPropertyDescriptor(e,l);Lt()&&(typeof i!="function"||e.hasOwnProperty(l))&&!(o&&o.get)&&(i=qe(n,l,i)())}return Ee(i)?xn(i):i},has(e,l){return l===Ct||l===pe||l===jt||l===we||l===Ve||l==="__proto__"?!0:(Lt()&&qe(Wt(e,Ve),l)(),l in e)},set(){return!0},deleteProperty(){return!0},ownKeys:Oo,getOwnPropertyDescriptor:Mo};function Qe(e,l,t,n=!1){if(!n&&e[l]===t)return;const c=e[l],i=e.length;t===void 0?(delete e[l],e[Ve]&&e[Ve][l]&&c!==void 0&&e[Ve][l].$()):(e[l]=t,e[Ve]&&e[Ve][l]&&c===void 0&&e[Ve][l].$());let o=Wt(e,we),s;if((s=qe(o,l,c))&&s.$(()=>t),Array.isArray(e)&&e.length!==i){for(let a=e.length;a<i;a++)(s=o[a])&&s.$();(s=qe(o,"length",i))&&s.$(e.length)}(s=o[Jn])&&s.$()}function Bn(e,l){const t=Object.keys(l);for(let n=0;n<t.length;n+=1){const c=t[n];Qe(e,c,l[c])}}function Do(e,l){if(typeof l=="function"&&(l=l(e)),l=Ke(l),Array.isArray(l)){if(e===l)return;let t=0,n=l.length;for(;t<n;t++){const c=l[t];e[t]!==c&&Qe(e,t,c)}Qe(e,"length",n)}else Bn(e,l)}function Oe(e,l,t=[]){let n,c=e;if(l.length>1){n=l.shift();const o=typeof n,s=Array.isArray(e);if(Array.isArray(n)){for(let a=0;a<n.length;a++)Oe(e,[n[a]].concat(l),t);return}else if(s&&o==="function"){for(let a=0;a<e.length;a++)n(e[a],a)&&Oe(e,[a].concat(l),t);return}else if(s&&o==="object"){const{from:a=0,to:Z=e.length-1,by:g=1}=n;for(let I=a;I<=Z;I+=g)Oe(e,[I].concat(l),t);return}else if(l.length>1){Oe(e[n],l,[n].concat(t));return}c=e[n],t=[n].concat(t)}let i=l[0];typeof i=="function"&&(i=i(c,t),i===c)||n===void 0&&i==null||(i=Ke(i),n===void 0||Ee(c)&&Ee(i)&&!Array.isArray(i)?Bn(c,i):Qe(e,n,i))}function _o(...[e,l]){const t=Ke(e||{}),n=Array.isArray(t),c=xn(t);function i(...o){gt(()=>{n&&o.length===1?Do(t,o[0]):Oe(t,o)})}return[c,i]}const ht=new WeakMap,Fn={get(e,l){if(l===Ct)return e;const t=e[l];let n;return Ee(t)?ht.get(t)||(ht.set(t,n=new Proxy(t,Fn)),n):t},set(e,l,t){return Qe(e,l,Ke(t)),!0},deleteProperty(e,l){return Qe(e,l,void 0,!0),!0}};function qo(e){return l=>{if(Ee(l)){let t;(t=ht.get(l))||ht.set(l,t=new Proxy(l,Fn)),e(t)}return l}}var Tl=Ze("<div class=modal-button-container>");const ea=e=>{const{plugin:l,lang:t}=e,[n,c]=_o(l.settings),[i,o]=oe(),s=ee(()=>Object.entries(Object.assign({},de(De),de(n.env)??{})).map(([X,f])=>`${X}="${f}"`).join(`
+`)),a=(...X)=>{c(...X),l.saveSettings()},Z=X=>{try{const f={};for(let R of X.split(`
+`)){R=R.trim();const v=R.indexOf("=");if(v>0){const D=R.substring(0,v);let W=R.substring(v+1).trim();W.startsWith('"')&&W.endsWith('"')&&(W=W.substring(1,W.length-1)),f[D]=W}}a("env",Ae(n.env??{},f))}catch(f){alert(f)}},g=ee(()=>n.items.find(X=>X.name===n.lastEditName)??n.items.first()),I=X=>{const f=g();return X===void 0||X===f.type?f:void 0},x=ee(()=>de(n.customDefaultExportDirectory)),p=X=>{const f=n.items.findIndex(R=>R.name===n.lastEditName);a("items",f===-1?0:f,qo(R=>(X(R),R)))},Y=ee(()=>{const X=i();return X?app.vault.config.useMarkdownLinks&&X.compare(Zt.requiredVersion)===-1?t.settingTab.pandocVersionWithWarning(Zt.requiredVersion):t.settingTab.pandocVersion(X):t.settingTab.pandocNotFound}),[L,m]=oe(),K=()=>{const[X,f]=oe(Object.keys(dt)[0]),[R,v]=oe(),D=()=>{const W=JSON.parse(JSON.stringify(dt[X()]));W.name=R(),gt(()=>{a("items",C=>[...C,W]),a("lastEditName",W.name)}),m(void 0)};return G(Ot,{app,get title(){return t.settingTab.new},onClose:()=>m(void 0),get children(){return[G(j,{get name(){return t.settingTab.template},get children(){return G(Pe,{get options(){return Object.entries(dt).map(([W,C])=>({name:C.name,value:W}))},get selected(){return R()??X()},onChange:W=>f(W)})}}),G(j,{get name(){return t.settingTab.name},get children(){return G(re,{get value(){return R()??""},onChange:W=>v(W)})}}),(()=>{var W=Tl();return ne(W,G(Pt,{cta:!0,onClick:D,get children(){return t.settingTab.save}})),W})()]}})},w=()=>{const[X,f]=oe(I().name),R=()=>{gt(()=>{p(v=>v.name=X()),a("lastEditName",X())}),m(void 0)};return G(Ot,{app,get title(){return t.settingTab.rename},onClose:()=>m(void 0),get children(){return[G(j,{get name(){return t.settingTab.name},get children(){return G(re,{get value(){return X()??""},onChange:v=>f(v)})}}),(()=>{var v=Tl();return ne(v,G(Pt,{cta:!0,onClick:R,get children(){return t.settingTab.add}})),v})()]}})},E=()=>{const X=()=>I("pandoc"),f=R=>{p(v=>v.type==="pandoc"?R(v):void 0)};return[G(j,{get name(){return t.settingTab.arguments},get children(){return G(re,{style:"width: 100%",get value(){return X().arguments??""},onChange:R=>f(v=>v.arguments=R)})}}),G(j,{get name(){return t.settingTab.extraArguments},get children(){return G(re,{style:"width: 100%",get value(){return X().customArguments??""},get title(){return X().customArguments},onChange:R=>f(v=>v.customArguments=R)})}}),G(j,{get name(){return t.settingTab.afterExport},heading:!0}),G(j,{get name(){return t.settingTab.openExportedFileLocation},get children(){return G(Ge,{get checked(){return X().openExportedFileLocation??!1},onChange:R=>f(v=>v.openExportedFileLocation=R)})}}),G(j,{get name(){return t.settingTab.openExportedFile},get children(){return G(Ge,{get checked(){return X().openExportedFile??!1},onChange:R=>f(v=>v.openExportedFile=R)})}}),G(j,{get name(){return t.settingTab.runCommand},get children(){return G(Ge,{get checked(){return X().runCommand},onChange:R=>f(v=>v.runCommand=R)})}}),G(bt,{get when(){return X().runCommand},get children(){return G(j,{get children(){return G(re,{style:"width: 100%",get value(){return X().command??""},onChange:R=>f(v=>v.command=R)})}})}})]},M=()=>{const X=()=>I("custom"),f=R=>{p(v=>v.type==="custom"?R(v):void 0)};return[G(j,{get name(){return t.settingTab.command},get children(){return G(re,{style:"width: 100%",get value(){return X().command},onChange:R=>f(v=>v.command=R)})}}),G(j,{get name(){return t.settingTab.targetFileExtensions},get children(){return G(re,{get value(){return X().targetFileExtensions??""},onChange:R=>f(v=>v.targetFileExtensions=R)})}}),G(j,{get name(){return t.settingTab.afterExport},heading:!0}),G(j,{get name(){return t.settingTab.showCommandOutput},get children(){return G(Ge,{get checked(){return X().showCommandOutput??!1},onChange:R=>f(v=>v.showCommandOutput=R)})}}),G(j,{get name(){return t.settingTab.openExportedFileLocation},get children(){return G(Ge,{get checked(){return X().openExportedFileLocation??!1},onChange:R=>f(v=>v.openExportedFileLocation=R)})}}),G(j,{get name(){return t.settingTab.openExportedFile},get children(){return G(Ge,{get checked(){return X().openExportedFile??!1},onChange:R=>f(v=>v.openExportedFile=R)})}})]},Q=async()=>{await l.resetSettings(),a(l.settings)},ge=async()=>{const X=await Be.remote.dialog.showOpenDialog({defaultPath:x()??Be.remote.app.getPath("documents"),properties:["createDirectory","openDirectory"]});!X.canceled&&X.filePaths.length>0&&a("customDefaultExportDirectory",f=>Ae(f,X.filePaths[0]))},be=async()=>{const X=await Be.remote.dialog.showOpenDialog({filters:pt.platform=="win32"?[{extensions:["exe"],name:"pandoc"}]:void 0,properties:["openFile"]});!X.canceled&&X.filePaths.length>0&&a("pandocPath",f=>Ae(f,X.filePaths[0]))};return Ye(async()=>{try{const X=ql(de(n.env)??{});o(await Zt.getVersion(de(n.pandocPath),X))}catch{o(void 0)}}),[G(j,{get name(){return t.settingTab.general},heading:!0,get children(){return G(ye,{icon:"reset",onClick:Q})}}),G(j,{get name(){return t.settingTab.pandocPath},get description(){return Y()},get children(){return[G(re,{get placeholder(){return t.settingTab.pandocPathPlaceholder},get value(){return de(n.pandocPath)??""},onChange:X=>a("pandocPath",f=>Ae(f,X))}),G(ye,{icon:"folder",onClick:be})]}}),G(j,{get name(){return t.settingTab.defaultFolderForExportedFile},get children(){return G(Pe,{get options(){return[{name:t.settingTab.auto,value:"Auto"},{name:t.settingTab.sameFolderWithCurrentFile,value:"Same"},{name:t.settingTab.customLocation,value:"Custom"}]},get selected(){return n.defaultExportDirectoryMode},onChange:X=>a("defaultExportDirectoryMode",X)})}}),G(bt,{get when(){return n.defaultExportDirectoryMode==="Custom"},get children(){return G(j,{get children(){return[G(re,{get value(){return x()??""},get title(){return x()}}),G(ye,{icon:"folder",onClick:ge})]}})}}),G(j,{get name(){return t.settingTab.openExportedFileLocation},get children(){return G(Ge,{get checked(){return n.openExportedFileLocation},onChange:X=>a("openExportedFileLocation",X)})}}),G(j,{get name(){return t.settingTab.openExportedFile},get children(){return G(Ge,{get checked(){return n.openExportedFile},onChange:X=>a("openExportedFile",X)})}}),G(j,{get name(){return t.settingTab.ShowExportProgressBar},get children(){return G(Ge,{get checked(){return n.showExportProgressBar},onChange:X=>a("showExportProgressBar",X)})}}),G(j,{get name(){return t.settingTab.editCommandTemplate},heading:!0}),G(j,{get name(){return t.settingTab.chooseCommandTemplate},get children(){return[G(Pe,{get options(){return n.items.map(X=>({name:X.name,value:X.name}))},get selected(){return n.lastEditName},onChange:X=>a("lastEditName",X)}),G(ye,{icon:"plus",get tooltip(){return t.settingTab.add},onClick:()=>m(()=>K)}),G(ye,{icon:"pencil",get tooltip(){return t.settingTab.rename},onClick:()=>m(()=>w)}),G(ye,{icon:"trash",get tooltip(){return t.settingTab.remove},onClick:()=>gt(()=>{var X;a("items",f=>f.filter(R=>{var v;return R.name!==((v=I())==null?void 0:v.name)})),a("lastEditName",(X=n.items.first())==null?void 0:X.name)})})]}}),G(lc,{get children(){return[G(Il,{get when(){return I("pandoc")},get children(){return G(E,{})}}),G(Il,{get when(){return I("custom")},get children(){return G(M,{})}})]}}),G(j,{get name(){return t.settingTab.advanced},heading:!0}),G(j,{get name(){return t.settingTab.environmentVariables},get description(){return t.settingTab.environmentVariablesDesc},get children(){return G(Qo,{style:"width: 100%;height: 5em",get value(){return s()},onChange:Z})}}),G(bt,{get when(){return L()},get children(){return G(pc,{get component(){return L()},ref:X=>document.body.appendChild(X)})}})]};var et;class ta extends Ie.PluginSettingTab{constructor(t){super(t.app,t);Zl(this,et);this.plugin=t,this.name=this.plugin.lang.settingTab.title}get lang(){return this.plugin.lang}display(){ml(this,et,Se(t=>{const n=this;return ne(this.containerEl,G(ea,{get plugin(){return n.plugin},get lang(){return n.lang}})),ze(()=>{this.containerEl.empty()}),t}))}hide(){bl(this,et).call(this)}}et=new WeakMap;const la=Uint8Array.from(atob("LS0gY3JlZGl0cyB0byB0YXJsZWIg4oCUIFN0YWNrRXhjaGFuZ2U6IGh0dHBzOi8vdGV4LnN0YWNrZXhjaGFuZ2UuY29tL3F1ZXN0aW9ucy8zOTIwNzAvcGFuZG9jLW1hcmtkb3duLWNyZWF0ZS1zZWxmLWNvbnRhaW5lZC1iaWItZmlsZS1mcm9tLWNpdGVkLXJlZmVyZW5jZXMKZnVuY3Rpb24gUGFuZG9jKGQpCiAgZC5tZXRhLnJlZmVyZW5jZXMgPSBwYW5kb2MudXRpbHMucmVmZXJlbmNlcyhkKQogIGQubWV0YS5iaWJsaW9ncmFwaHkgPSBuaWwKICByZXR1cm4gZAplbmQK"),e=>e.charCodeAt(0)),na=Object.freeze(Object.defineProperty({__proto__:null,default:la},Symbol.toStringTag,{value:"Module"})),ca=Uint8Array.from(atob("cGFja2FnZS5wYXRoPXBhY2thZ2UucGF0aC4uIjsiIC4uZGVidWcuZ2V0aW5mbygxKS5zb3VyY2U6bWF0Y2goIiguKlsvXFxdKSIpOnN1YigyKSAuLiAiPy5sdWEiCgpNb2RlPSdodWdvJwoKcmVxdWlyZSgnbWFya2Rvd24nKQ=="),e=>e.charCodeAt(0)),ia=Object.freeze(Object.defineProperty({__proto__:null,default:ca},Symbol.toStringTag,{value:"Module"})),sa=Uint8Array.from(atob("cGFja2FnZS5wYXRoPWRlYnVnLmdldGluZm8oMSkuc291cmNlOmdzdWIoJ0AnLCcnKTpzdWIoMCk6bWF0Y2goJyguKlsvXFxdKScpOnN1YigwKSAuLiAnPy5sdWEnIC4uICc7JyAuLiBwYWNrYWdlLnBhdGgKCnJlcXVpcmUoInBvbHlmaWxsIikKbG9jYWwgdXJsID0gcmVxdWlyZSgndXJsJykKCmxvY2FsIHBhbmRvYz1wYW5kb2MKbG9jYWwgUEFORE9DX1NUQVRFPVBBTkRPQ19TVEFURQoKUEFORE9DX1ZFUlNJT046bXVzdF9iZV9hdF9sZWFzdCAnMy4xLjcnCgpvcy50ZXh0ID0gcGFuZG9jLnRleHQKCmxvY2FsIFBBVEggPSBwYW5kb2MucGF0aApsb2NhbCBkb2NfZGlyID0gbmlsCmxvY2FsIG1lZGlhX2RpciA9IG5pbAoKaWYgTW9kZSA9PSBuaWwgdGhlbgogIE1vZGUgPSAnZGVmYXVsdCcKZW5kCgotLSBwcmludCgiTW9kZTogIi4uTW9kZSkKCmlmIFBBTkRPQ19TVEFURS5vdXRwdXRfZmlsZSB0aGVuCiAgbG9jYWwgb3V0cHV0X2ZpbGUgPSBQQU5ET0NfU1RBVEUub3V0cHV0X2ZpbGUKICBkb2NfZGlyID0gUEFUSC5kaXJlY3Rvcnkob3V0cHV0X2ZpbGUpCiAgaWYgUEFORE9DX1dSSVRFUl9PUFRJT05TLnZhcmlhYmxlc1sibWVkaWFfZGlyIl0gdGhlbgogICAgbWVkaWFfZGlyID0gdG9zdHJpbmcoUEFORE9DX1dSSVRFUl9PUFRJT05TLnZhcmlhYmxlc1sibWVkaWFfZGlyIl0pCiAgZWxzZQogICAgbWVkaWFfZGlyID0gUEFUSC5zcGxpdF9leHRlbnNpb24ob3V0cHV0X2ZpbGUpCiAgICBpZiBNb2RlIH49ICdodWdvJyB0aGVuCiAgICAgIG1lZGlhX2RpciA9IG1lZGlhX2RpciAuLiAnLW1lZGlhJwogICAgZW5kCiAgZW5kCmVuZAphc3NlcnQoZG9jX2RpciwgImRvY19kaXIgaXMgbmlsIikKYXNzZXJ0KG1lZGlhX2RpciwgIm1lZGlhX2RpciBpcyBuaWwiKQoKCmxvY2FsIGZ1bmN0aW9uIGdldF9hYnNvbHV0ZV9wYXRoKGZpbGVfcGF0aCkKICBpZiBQQVRILmlzX2Fic29sdXRlKGZpbGVfcGF0aCkgdGhlbgogICAgcmV0dXJuIGZpbGVfcGF0aAogIGVuZAogIGZvciBfLCBkaXIgaW4gcGFpcnMoUEFORE9DX1NUQVRFLnJlc291cmNlX3BhdGgpIGRvCiAgICBsb2NhbCBmdWxsX3BhdGggPSBQQVRILmpvaW4oe2RpciwgZmlsZV9wYXRofSkKICAgIGlmIG9zLmV4aXN0cyhmdWxsX3BhdGgpIHRoZW4KICAgICAgcmV0dXJuIGZ1bGxfcGF0aAogICAgZW5kCiAgZW5kCiAgZm9yIF8sIGZpbGUgaW4gcGFpcnMoUEFORE9DX1NUQVRFLmlucHV0X2ZpbGVzKSBkbwogICAgaWYgbm90IFBBVEguaXNfYWJzb2x1dGUoZmlsZSkgdGhlbgogICAgICBmaWxlID0gUEFUSC5qb2luKHtwYW5kb2Muc3lzdGVtLmdldF93b3JraW5nX2RpcmVjdG9yeSgpLCBmaWxlX3BhdGh9KQogICAgZW5kCiAgICBsb2NhbCBkaXIgPSBQQVRILmRpcmVjdG9yeShmaWxlKQogICAgbG9jYWwgZnVsbF9wYXRoID0gUEFUSC5qb2luKHtkaXIsIGZpbGVfcGF0aH0pCiAgICBpZiBvcy5leGlzdHMoZnVsbF9wYXRoKSB0aGVuCiAgICAgIHJldHVybiBmdWxsX3BhdGgKICAgIGVuZAogIGVuZAogIHJldHVybiBuaWwKZW5kCgpsb2NhbCBmdW5jdGlvbiBnZXRfb3V0cHV0X2ZpbGUoZmlsZV9wYXRoKQogIGlmIG1lZGlhX2RpciB0aGVuCiAgICBsb2NhbCBuZXdfZmlsZV9uYW1lID0gcGFuZG9jLnV0aWxzLnNoYTEoZmlsZV9wYXRoKQogICAgbG9jYWwgXywgbmV3X2ZpbGVfZXh0ID0gUEFUSC5zcGxpdF9leHRlbnNpb24oZmlsZV9wYXRoKQogICAgZmlsZV9wYXRoID0gbmV3X2ZpbGVfbmFtZSAuLiBuZXdfZmlsZV9leHQKICAgIGxvY2FsIGZ1bGxfcGF0aCA9IFBBVEguam9pbih7bWVkaWFfZGlyLCBmaWxlX3BhdGh9KQogICAgcmV0dXJuIGZ1bGxfcGF0aAogIGVsc2UKICAgIHJldHVybiBuaWwKICBlbmQKZW5kCgpsb2NhbCBmdW5jdGlvbiBleHRyYWN0X21lZGlhKGZpbGVfcGF0aCkKICBvcy5ta2RpcihtZWRpYV9kaXIpCiAgZmlsZV9wYXRoID0gdXJsLmRlY29kZShmaWxlX3BhdGgpCiAgbG9jYWwgYWJzX3BhdGggPSBnZXRfYWJzb2x1dGVfcGF0aChmaWxlX3BhdGgpCiAgbG9jYWwgZmlsZSA9IGdldF9vdXRwdXRfZmlsZShmaWxlX3BhdGgpCiAgaWYgYWJzX3BhdGggYW5kIGZpbGUgdGhlbgogICAgaWYgbm90IG9zLmV4aXN0cyhmaWxlKSB0aGVuCiAgICAgIG9zLmNvcHkoYWJzX3BhdGgsIGZpbGUpCiAgICBlbmQKICAgIGxvY2FsIHJlbF9wYXRoID0gUEFUSC5tYWtlX3JlbGF0aXZlKGZpbGUsIGRvY19kaXIsIGZhbHNlKQogICAgbG9jYWwgcGFydHMgPSBQQVRILnNwbGl0KHJlbF9wYXRoKQogICAgZm9yIGksdiBpbiBpcGFpcnMocGFydHMpIGRvCiAgICAgIHBhcnRzW2ldID0gdXJsLmVuY29kZSh2KQogICAgZW5kCiAgICBsb2NhbCBlbmNvZGVkX3JlbF9wYXRoID0gdGFibGUuY29uY2F0KHBhcnRzLCAiLyIpCiAgICBpZiBNb2RlID09ICdodWdvJyB0aGVuCiAgICAgIGVuY29kZWRfcmVsX3BhdGggPSAnLi4vJyAuLiBlbmNvZGVkX3JlbF9wYXRoCiAgICBlbmQKICAgIHJldHVybiBlbmNvZGVkX3JlbF9wYXRoCiAgZW5kCmVuZAoKbG9jYWwgZnVuY3Rpb24gcmF3KHMpCiAgcmV0dXJuIHBhbmRvYy5SYXdJbmxpbmUoJ21hcmtkb3duJywgcykKZW5kCgpmdW5jdGlvbiBJbWFnZShlbCkKICBsb2NhbCBzcmMgPSBleHRyYWN0X21lZGlhKGVsLnNyYykKICBpZiBzcmMgdGhlbgogICAgZWwuc3JjID0gc3JjCiAgZW5kCiAgcmV0dXJuIGVsCmVuZAoKZnVuY3Rpb24gU3BhY2UoKQogIHJldHVybiByYXcoJyAnKQplbmQKCmZ1bmN0aW9uIFNvZnRCcmVhaygpCiAgcmV0dXJuIHJhdygnXG4nKQplbmQKCmZ1bmN0aW9uIFJhd0lubGluZShlbCkKICBpZiBlbC5mb3JtYXQgPT0gImh0bWwiIHRoZW4KICAgIGVsLmZvcm1hdCA9ICdtYXJrZG93bicKICAgIGVsLnRleHQgPSBzdHJpbmcuZ3N1YihlbC50ZXh0LCAnPGltZ1tePl0rPicsIGZ1bmN0aW9uKGltZykKICAgICAgcmV0dXJuIHN0cmluZy5nc3ViKGltZywgJ3NyYz0iKFteIl0rKSInLCBmdW5jdGlvbih1cmwpCiAgICAgICAgaWYgc3RyaW5nLmZpbmQodXJsLCAnXltIaF1bVHRdW1R0XVtQcF1bU3NdPzovLycpID09IG5pbCAgdGhlbgogICAgICAgICAgbG9jYWwgZXh0cmFjdF9tZWRpYV91cmwgPSBleHRyYWN0X21lZGlhKHVybCkKICAgICAgICAgIGlmIGV4dHJhY3RfbWVkaWFfdXJsIHRoZW4KICAgICAgICAgICAgcmV0dXJuICdzcmM9IicgLi4gZXh0cmFjdF9tZWRpYV91cmwgLi4gJyInCiAgICAgICAgICBlbmQKICAgICAgICAgIHJldHVybiAnMTIzJwogICAgICAgIGVuZAogICAgICAgIHJldHVybiAnc3JjPSInIC4uIHVybCAuLiAnIicKICAgICAgZW5kKQogICAgZW5kKQogIGVuZAogIHJldHVybiBlbAplbmQKCmZ1bmN0aW9uIFJhd0Jsb2NrKGVsKQogIGlmIGVsLmZvcm1hdCA9PSAiaHRtbCIgdGhlbgogICAgZWwuZm9ybWF0ID0gJ21hcmtkb3duJwogIGVuZAogIHJldHVybiBlbAplbmQKCmZ1bmN0aW9uIE1hdGgoZWwpCiAgaWYgTW9kZSA9PSAnaHVnbycgdGhlbgogICAgaWYgZWwubWF0aHR5cGUgPT0gJ0Rpc3BsYXlNYXRoJyB0aGVuCiAgICAgIHJldHVybiByYXcoJ3t7PCBtYXRoamF4ID59fVxuJCQnICAuLiBlbC50ZXh0IC4uICckJFxue3s8L21hdGhqYXggPn19JykKICAgIGVsc2UKICAgICAgZWwudGV4dCA9IHN0cmluZy5nc3ViKGVsLnRleHQsICdcXFtcXHtcXH1dJywgZnVuY3Rpb24gKHYpCiAgICAgICAgcmV0dXJuICdcXCcgLi4gdgogICAgICBlbmQpCiAgICAgIGVsLnRleHQgPSBzdHJpbmcuZ3N1YihlbC50ZXh0LCAnXycsIGZ1bmN0aW9uICh2KQogICAgICAgIHJldHVybiAnXFwnIC4uIHYKICAgICAgZW5kKQogICAgZW5kCiAgZW5kCiAgcmV0dXJuIGVsCmVuZAoKbG9jYWwgZnVuY3Rpb24gaGVhZGVyTGluayhpbnB1dCkKICAtLSBnaXRodWIgc3R5bGUgc2VjdGlvbiBsaW5rCiAgcmV0dXJuICIjIi4uaW5wdXQ6Z3N1YignICcsICctJykKZW5kCgoKbG9jYWwgZnVuY3Rpb24gaW5zZXJ0TGluayhjb250ZW50LCBsaW5rRGVzY3JpcHRpb24pCiAgbG9jYWwgZGVzY3JpcHRpb25UZXh0ID0gdGFibGUuY29uY2F0KGxpbmtEZXNjcmlwdGlvbiwgIiIpCgogIGlmIHN0cmluZy5maW5kKGRlc2NyaXB0aW9uVGV4dCwgJ3wnKSB0aGVuCiAgICBsb2NhbCB0YXJnZXQsIGRlc2MgPSBkZXNjcmlwdGlvblRleHQ6bWF0Y2goIiguKil8KC4qKSIpCiAgICB0YWJsZS5pbnNlcnQoY29udGVudCwgcGFuZG9jLkxpbmsoZGVzYywgaGVhZGVyTGluayh0YXJnZXQpKSkKICBlbHNlCiAgICB0YWJsZS5pbnNlcnQoY29udGVudCwgcGFuZG9jLkxpbmsoZGVzY3JpcHRpb25UZXh0LCBoZWFkZXJMaW5rKGRlc2NyaXB0aW9uVGV4dCkpKQogIGVuZAplbmQKCmZ1bmN0aW9uIFBhcmEoZWwpCiAgbG9jYWwgY29udGVudCA9IGVsLmNvbnRlbnQKICBjb250ZW50ID0gUHJvY2Vzc01hdGgoY29udGVudCkKICBjb250ZW50ID0gUHJvY2Vzc0ludGVybmFsTGlua3MoY29udGVudCkKICBlbC5jb250ZW50ID0gY29udGVudAogIHJldHVybiBlbAplbmQKCmZ1bmN0aW9uIFByb2Nlc3NNYXRoKGVsZW1lbnRzKQogIGxvY2FsIGNvbnRlbnQgPSB7fQogIGxvY2FsIGluX2Rpc3BsYXlfbWF0aCA9IGZhbHNlCiAgZm9yIF8sIGl0ZW0gaW4gcGFpcnMoZWxlbWVudHMpIGRvCiAgICBpZiBpdGVtLnQgPT0gJ1N0cidhbmQgaXRlbS50ZXh0ID09ICIkJCIgdGhlbgogICAgICBpbl9kaXNwbGF5X21hdGggPSBub3QgaW5fZGlzcGxheV9tYXRoCiAgICBlbHNlCiAgICAgIGlmIGluX2Rpc3BsYXlfbWF0aCB0aGVuCiAgICAgICAgaWYgaXRlbS50ID09ICdSYXdJbmxpbmUnIGFuZCBpdGVtLmZvcm1hdCA9PSAndGV4JyB0aGVuCiAgICAgICAgICBsb2NhbCBuID0gcGFuZG9jLk1hdGgoJ0Rpc3BsYXlNYXRoJywgJ1xuJyAuLiBpdGVtLnRleHQgLi4gJ1xuJykKICAgICAgICAgIHRhYmxlLmluc2VydChjb250ZW50LCBNYXRoKG4pKQogICAgICAgIGVsc2UKICAgICAgICAgIHRhYmxlLmluc2VydChjb250ZW50LCBpdGVtKQogICAgICAgIGVuZAogICAgICBlbHNlCiAgICAgICAgdGFibGUuaW5zZXJ0KGNvbnRlbnQsIGl0ZW0pCiAgICAgIGVuZAogICAgZW5kCiAgZW5kCiAgcmV0dXJuIGNvbnRlbnQKZW5kCgpmdW5jdGlvbiBQcm9jZXNzSW50ZXJuYWxMaW5rcyhlbGVtZW50cykKICBsb2NhbCBjb250ZW50ID0ge30KICBsb2NhbCBpbl9zZWN0aW9uX2xpbmsgPSBmYWxzZQogIGxvY2FsIGxpbmtEZXNjcmlwdGlvbiA9IHt9CgogIGZvciBfLCBpdGVtIGluIHBhaXJzKGVsZW1lbnRzKSBkbwogICAgaWYgaXRlbS50ID09ICdTdHInIGFuZCBzdHJpbmcuc3RhcnRzX3dpdGgoaXRlbS50ZXh0LCAnW1sjJykgdGhlbgogICAgICBpbl9zZWN0aW9uX2xpbmsgPSB0cnVlCiAgICAgIHRhYmxlLmluc2VydChsaW5rRGVzY3JpcHRpb24sIHN0cmluZy5zdWIoaXRlbS50ZXh0LCA0KSkKICAgIGVsc2VpZiBpbl9zZWN0aW9uX2xpbmsgdGhlbgogICAgICBpZiBzdHJpbmcuZW5kc193aXRoKGl0ZW0udGV4dCwgJ11dJykgdGhlbgogICAgICAgIHRhYmxlLmluc2VydChsaW5rRGVzY3JpcHRpb24sIHN0cmluZy5zdWIoaXRlbS50ZXh0LCAxLCAtMykpCiAgICAgICAgaW5zZXJ0TGluayhjb250ZW50LCBsaW5rRGVzY3JpcHRpb24pCiAgICAgICAgaW5fc2VjdGlvbl9saW5rID0gZmFsc2UKICAgICAgICBsaW5rRGVzY3JpcHRpb24gPSB7fQogICAgICBlbHNlCiAgICAgICAgdGFibGUuaW5zZXJ0KGxpbmtEZXNjcmlwdGlvbiwgaXRlbS50ZXh0KQogICAgICBlbmQKICAgIGVsc2UKICAgICAgdGFibGUuaW5zZXJ0KGNvbnRlbnQsIGl0ZW0pCiAgICBlbmQKICBlbmQKICByZXR1cm4gY29udGVudAplbmQKCmZ1bmN0aW9uIFBsYWluKGVsKQogIGVsLmNvbnRlbnQgPSBQcm9jZXNzSW50ZXJuYWxMaW5rcyhlbC5jb250ZW50KQogIHJldHVybiBlbAplbmQKCmZ1bmN0aW9uIFBhbmRvYyhlbCkKICByZXR1cm4gZWwKZW5kCg=="),e=>e.charCodeAt(0)),oa=Object.freeze(Object.defineProperty({__proto__:null,default:sa},Symbol.toStringTag,{value:"Module"})),aa=Uint8Array.from(atob("dHJhdmVyc2UgPSAndG9wZG93bicKCm1hdGhfYmxvY2tfdGV4dCA9IG5pbApmdW5jdGlvbiBwcm9jZXNzKGVsKQoKICAgLS0gTWF0aEJsb2NrIHN0YXJ0IG9yIGVuZAogICBpZiBlbC50ID09ICdTdHInIGFuZCBlbC50ZXh0ID09ICckJCcgdGhlbgogICAgIGlmIG1hdGhfYmxvY2tfdGV4dCA9PSBuaWwgdGhlbiAgICAgICAgICAgIC0tIHN0YXJ0CiAgICAgICBtYXRoX2Jsb2NrX3RleHQgPSAnJwogICAgIGVsc2UgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgIC0tIGVuZAogICAgICAgbG9jYWwgbWF0aF9ibG9jayA9IHBhbmRvYy5NYXRoKCdEaXNwbGF5TWF0aCcsICdcbicgLi4gbWF0aF9ibG9ja190ZXh0IC4uICdcbicpCiAgICAgICBtYXRoX2Jsb2NrX3RleHQgPSBuaWwKICAgICAgIHJldHVybiBtYXRoX2Jsb2NrCiAgICAgZW5kCiAgICAgcmV0dXJuIHt9CiAgIGVuZAoKICBpZiBtYXRoX2Jsb2NrX3RleHQgdGhlbgogICAgaWYgKGVsLnQgPT0gJ1Jhd0lubGluZScgb3IgZWwudCA9PSAnUmF3QmxvY2snKSBhbmQgZWwuZm9ybWF0ID09ICd0ZXgnIHRoZW4KICAgICAgbWF0aF9ibG9ja190ZXh0ID0gbWF0aF9ibG9ja190ZXh0IC4uIGVsLnRleHQKICAgICAgcmV0dXJuIHt9CiAgICBlbHNlaWYgZWwudCA9PSAnU3RyJyB0aGVuCiAgICAgIG1hdGhfYmxvY2tfdGV4dCA9IG1hdGhfYmxvY2tfdGV4dCAuLiBlbC50ZXh0CiAgICAgIHJldHVybiB7fQogICAgZWxzZWlmIGVsLnQgPT0gJ1NvZnRCcmVhaycgb3IgZWwudCA9PSAnQnVsbGV0TGlzdCcgdGhlbgogICAgICByZXR1cm4ge30KICAgIGVuZAogIGVuZAogIHJldHVybiBlbAplbmQKCmZ1bmN0aW9uIFJhd0lubGluZShlbCkgCiAgcmV0dXJuIHByb2Nlc3MoZWwpCmVuZAoKZnVuY3Rpb24gUmF3QmxvY2soZWwpIAogIHJldHVybiBwcm9jZXNzKGVsKQplbmQKCmZ1bmN0aW9uIFN0cihlbCkKICByZXR1cm4gcHJvY2VzcyhlbCkKZW5kCgpmdW5jdGlvbiBTb2Z0QnJlYWsoZWwpCiAgcmV0dXJuIHByb2Nlc3MoZWwpCmVuZAoKZnVuY3Rpb24gSGVhZGVyKGVsKQogIHJldHVybiBwcm9jZXNzKGVsKQplbmQKCmZ1bmN0aW9uIFBhcmEoZWwpCiAgcmV0dXJuIHByb2Nlc3MoZWwpCmVuZAoKZnVuY3Rpb24gUGxhaW4oZWwpCiAgcmV0dXJuIHByb2Nlc3MoZWwpCmVuZAoKZnVuY3Rpb24gQnVsbGV0TGlzdChlbCkKICByZXR1cm4gcHJvY2VzcyhlbCkKZW5kCgoKCgoKCg=="),e=>e.charCodeAt(0)),ra=Object.freeze(Object.defineProperty({__proto__:null,default:aa},Symbol.toStringTag,{value:"Module"})),da=Uint8Array.from(atob("CnJldHVybiB7CiAgICB7CiAgICAgICAgTWF0aCA9IGZ1bmN0aW9uIChlbGVtKQogICAgICAgICAgICBpZiBlbGVtLnRleHQ6ZmluZCgiXiVzKlxcYmVnaW57Iikgfj0gbmlsIHRoZW4KICAgICAgICAgICAgICAgIHJldHVybiBwYW5kb2MuUmF3SW5saW5lKCd0ZXgnLCBlbGVtLnRleHQpCiAgICAgICAgICAgIGVsc2UKICAgICAgICAgICAgICAgIHJldHVybiBlbGVtCiAgICAgICAgICAgIGVuZAogICAgICAgIGVuZCwKICAgIH0KfQo="),e=>e.charCodeAt(0)),ga=Object.freeze(Object.defineProperty({__proto__:null,default:da},Symbol.toStringTag,{value:"Module"})),ba=Uint8Array.from(atob("b3MucGxhdGZvcm0gPSBuaWwKaWYgb3MucGxhdGZvcm0gPT0gbmlsIHRoZW4KICBsb2NhbCBsaWJFeHQgPSBwYWNrYWdlLmNwYXRoOm1hdGNoKCIlcFtcXHwvXT9cXC4lcCglYSspIikKICBpZiBsaWJFeHQgPT0gJ2RsbCcgdGhlbgogICAgb3MucGxhdGZvcm0gPSAiV2luZG93cyIKICBlbHNlaWYgbGliRXh0ID09ICdzbycgdGhlbgogICAgb3MucGxhdGZvcm0gPSAiTGludXgiCiAgZWxzZWlmIGxpYkV4dCA9PSAnZHlsaWInIHRoZW4KICAgIG9zLnBsYXRmb3JtID0gIk1hY09TIgogIGVuZAplbmQKCgpvcy5jb3B5ID0gZnVuY3Rpb24oc3JjLCBkZXN0KQogIGlmIG9zLnBsYXRmb3JtID09ICJXaW5kb3dzIiB0aGVuCiAgICBzcmMgPSBzdHJpbmcuZ3N1YihzcmMsICIvIiwgIlxcIikKICAgIHNyYyA9IG9zLnRleHQudG9lbmNvZGluZyhzcmMpCiAgICBkZXN0ID0gb3MudGV4dC50b2VuY29kaW5nKGRlc3QpCiAgICBvcy5leGVjdXRlKCdjb3B5ICInIC4uIHNyYyAuLiAnIiAiJyAuLiBkZXN0IC4uICciID5OVUwnKQogIGVsc2UKICAgIG9zLmV4ZWN1dGUoJ2NwICInIC4uIHNyYyAuLiAnIiAiJyAuLiBkZXN0IC4uICciJykKICBlbmQKZW5kCgpvcy5ta2RpciA9IGZ1bmN0aW9uKGRpcikKICBpZiBvcy5leGlzdHMoZGlyKSB0aGVuCiAgICByZXR1cm4KICBlbmQKICBpZiBvcy5wbGF0Zm9ybSA9PSAiV2luZG93cyIgdGhlbgogICAgZGlyID0gb3MudGV4dC50b2VuY29kaW5nKGRpcikKICAgIG9zLmV4ZWN1dGUoJ21rZGlyICInIC4uIGRpciAuLiAnIicpCiAgZWxzZQogICAgb3MuZXhlY3V0ZSgnbWtkaXIgLXAgIicgLi4gZGlyIC4uICciJykKICBlbmQKZW5kCgpvcy5leGlzdHMgPSBmdW5jdGlvbihwYXRoKQogIGlmIG9zLnBsYXRmb3JtID09ICJXaW5kb3dzIiB0aGVuCiAgICBwYXRoID0gc3RyaW5nLmdzdWIocGF0aCwgIi8iLCAiXFwiKQogICAgcGF0aCA9IG9zLnRleHQudG9lbmNvZGluZyhwYXRoKQogICAgbG9jYWwgXywgXywgY29kZSA9IG9zLmV4ZWN1dGUoJ2lmIGV4aXN0ICInIC4uIHBhdGggLi4gJyIgKGV4aXQgMCkgZWxzZSAoZXhpdCAxKScpCiAgICByZXR1cm4gY29kZSA9PSAwCiAgZWxzZQogICAgbG9jYWwgXywgXywgY29kZSA9IG9zLmV4ZWN1dGUoJ3Rlc3QgLWUgIicgLi4gcGF0aCAuLiAnIicpCiAgICByZXR1cm4gY29kZSA9PSAwCiAgZW5kCmVuZAoKc3RyaW5nLnN0YXJ0c193aXRoID0gZnVuY3Rpb24oc3RyLCBzdGFydCkKICAgcmV0dXJuIHN0cjpzdWIoMSwgI3N0YXJ0KSA9PSBzdGFydAplbmQKCnN0cmluZy5lbmRzX3dpdGggPSBmdW5jdGlvbihzdHIsIGVuZGluZykKICAgcmV0dXJuIGVuZGluZyA9PSAiIiBvciBzdHI6c3ViKC0jZW5kaW5nKSA9PSBlbmRpbmcKZW5kCgoKcmV0dXJuIHsKICBvcyA9IG9zLAogIHN0cmluZyA9IHN0cmluZwp9"),e=>e.charCodeAt(0)),Za=Object.freeze(Object.defineProperty({__proto__:null,default:ba},Symbol.toStringTag,{value:"Module"})),ma=Uint8Array.from(atob("bG9jYWwgZnVuY3Rpb24gZW5jb2RlIChzdHIpCiAgc3RyID0gc3RyaW5nLmdzdWIgKHN0ciwgIihbXjAtOWEtekEtWiAhJygpKi5ffi1dKSIsIC0tIGxvY2FsZSBpbmRlcGVuZGVudAogICAgZnVuY3Rpb24gKGMpIHJldHVybiBzdHJpbmcuZm9ybWF0ICgiJSUlMDJYIiwgc3RyaW5nLmJ5dGUoYykpIGVuZCkKICBzdHIgPSBzdHJpbmcuZ3N1YiAoc3RyLCAiICIsICIlJTIwIikKICByZXR1cm4gc3RyCiBlbmQKCgpsb2NhbCBmdW5jdGlvbiBkZWNvZGUgKHN0cikKICBzdHIgPSBzdHJpbmcuZ3N1YiAoc3RyLCAiJSUyMCIsICIgIikKICBzdHIgPSBzdHJpbmcuZ3N1YiAoc3RyLCAiJSUoJXgleCkiLCBmdW5jdGlvbihoKSByZXR1cm4gc3RyaW5nLmNoYXIodG9udW1iZXIoaCwxNikpIGVuZCkKICByZXR1cm4gc3RyCmVuZAoKcmV0dXJuIHsKICBlbmNvZGUgPSBlbmNvZGUsCiAgZGVjb2RlID0gZGVjb2RlCn0="),e=>e.charCodeAt(0)),ua=Object.freeze(Object.defineProperty({__proto__:null,default:ma},Symbol.toStringTag,{value:"Module"})),Ga=Uint8Array.from(atob("%%
% Copyright (c) 2017 - 2023, Pascal Wagler;
% Copyright (c) 2014 - 2023, John MacFarlane
%
% All rights reserved.
%
% Redistribution and use in source and binary forms, with or without
% modification, are permitted provided that the following conditions
% are met:
%
% - Redistributions of source code must retain the above copyright
% notice, this list of conditions and the following disclaimer.
%
% - Redistributions in binary form must reproduce the above copyright
% notice, this list of conditions and the following disclaimer in the
% documentation and/or other materials provided with the distribution.
%
% - Neither the name of John MacFarlane nor the names of other
% contributors may be used to endorse or promote products derived
% from this software without specific prior written permission.
%
% THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
% "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
% LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
% FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
% COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
% INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
% BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
% LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
% CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
% LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
% ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
% POSSIBILITY OF SUCH DAMAGE.
%%

%%
% This is the Eisvogel pandoc LaTeX template.
%
% For usage information and examples visit the official GitHub page:
% https://github.com/Wandmalfarbe/pandoc-latex-template
%%

% Options for packages loaded elsewhere
\PassOptionsToPackage{unicode$for(hyperrefoptions)$,$hyperrefoptions$$endfor$}{hyperref}
\PassOptionsToPackage{hyphens}{url}
\PassOptionsToPackage{dvipsnames,svgnames,x11names,table}{xcolor}
$if(CJKmainfont)$
\PassOptionsToPackage{space}{xeCJK}
\usepackage{datetime}

$endif$
%
\documentclass[
$if(fontsize)$
  $fontsize$,
$endif$
$if(papersize)$
  $papersize$paper,
$else$
  paper=a4,
$endif$
$if(beamer)$
  ignorenonframetext,
$if(handout)$
  handout,
$endif$
$if(aspectratio)$
  aspectratio=$aspectratio$,
$endif$
$endif$
$for(classoption)$
  $classoption$$sep$,
$endfor$
  ,captions=tableheading
]{$if(beamer)$$documentclass$$else$$if(book)$scrbook$else$scrartcl$endif$$endif$}
$if(beamer)$
$if(background-image)$
\usebackgroundtemplate{%
  \includegraphics[width=\paperwidth]{$background-image$}%
}
% In beamer background-image does not work well when other images are used, so this is the workaround
\pgfdeclareimage[width=\paperwidth,height=\paperheight]{background}{$background-image$}
\usebackgroundtemplate{\pgfuseimage{background}}
$endif$
\usepackage{pgfpages}
\setbeamertemplate{caption}[numbered]
\setbeamertemplate{caption label separator}{: }
\setbeamercolor{caption name}{fg=normal text.fg}
\beamertemplatenavigationsymbols$if(navigation)$$navigation$$else$empty$endif$
$for(beameroption)$
\setbeameroption{$beameroption$}
$endfor$
% Prevent slide breaks in the middle of a paragraph
\widowpenalties 1 10000
\raggedbottom
$if(section-titles)$
\setbeamertemplate{part page}{
  \centering
  \begin{beamercolorbox}[sep=16pt,center]{part title}
    \usebeamerfont{part title}\insertpart\par
  \end{beamercolorbox}
}
\setbeamertemplate{section page}{
  \centering
  \begin{beamercolorbox}[sep=12pt,center]{part title}
    \usebeamerfont{section title}\insertsection\par
  \end{beamercolorbox}
}
\setbeamertemplate{subsection page}{
  \centering
  \begin{beamercolorbox}[sep=8pt,center]{part title}
    \usebeamerfont{subsection title}\insertsubsection\par
  \end{beamercolorbox}
}
\AtBeginPart{
  \frame{\partpage}
}
\AtBeginSection{
  \ifbibliography
  \else
    \frame{\sectionpage}
  \fi
}
\AtBeginSubsection{
  \frame{\subsectionpage}
}
$endif$
$endif$
$if(beamerarticle)$
\usepackage{beamerarticle} % needs to be loaded first
$endif$
\usepackage{amsmath,amssymb}
$if(linestretch)$
\usepackage{setspace}
$else$
% Use setspace anyway because we change the default line spacing.
% The spacing is changed early to affect the titlepage and the TOC.
\usepackage{setspace}
\setstretch{1.2}
$endif$
\usepackage{iftex}
\ifPDFTeX
  \usepackage[$if(fontenc)$$fontenc$$else$T1$endif$]{fontenc}
  \usepackage[utf8]{inputenc}
  \usepackage{textcomp} % provide euro and other symbols
\else % if luatex or xetex
$if(mathspec)$
  \ifXeTeX
    \usepackage{mathspec} % this also loads fontspec
  \else
    \usepackage{unicode-math} % this also loads fontspec
  \fi
$else$
  \usepackage{unicode-math} % this also loads fontspec
$endif$
  \defaultfontfeatures{Scale=MatchLowercase}$-- must come before Beamer theme
  \defaultfontfeatures[\rmfamily]{Ligatures=TeX,Scale=1}
\fi
$if(fontfamily)$
$else$
$-- Set default font before Beamer theme so the theme can override it
\usepackage{lmodern}
$endif$
$-- Set Beamer theme before user font settings so they can override theme
$if(beamer)$
$if(theme)$
\usetheme[$for(themeoptions)$$themeoptions$$sep$,$endfor$]{$theme$}
$endif$
$if(colortheme)$
\usecolortheme{$colortheme$}
$endif$
$if(fonttheme)$
\usefonttheme{$fonttheme$}
$endif$
$if(mainfont)$
\usefonttheme{serif} % use mainfont rather than sansfont for slide text
$endif$
$if(innertheme)$
\useinnertheme{$innertheme$}
$endif$
$if(outertheme)$
\useoutertheme{$outertheme$}
$endif$
$endif$
$-- User font settings (must come after default font and Beamer theme)
$if(fontfamily)$
\usepackage[$for(fontfamilyoptions)$$fontfamilyoptions$$sep$,$endfor$]{$fontfamily$}
$endif$
\ifPDFTeX\else
  % xetex/luatex font selection
$if(mainfont)$
  \setmainfont[$for(mainfontoptions)$$mainfontoptions$$sep$,$endfor$]{$mainfont$}
$endif$
$if(sansfont)$
  \setsansfont[$for(sansfontoptions)$$sansfontoptions$$sep$,$endfor$]{$sansfont$}
$endif$
$if(monofont)$
  \setmonofont[$for(monofontoptions)$$monofontoptions$$sep$,$endfor$]{$monofont$}
$endif$
$for(fontfamilies)$
  \newfontfamily{$fontfamilies.name$}[$for(fontfamilies.options)$$fontfamilies.options$$sep$,$endfor$]{$fontfamilies.font$}
$endfor$
$if(mathfont)$
$if(mathspec)$
  \ifXeTeX
    \setmathfont(Digits,Latin,Greek)[$for(mathfontoptions)$$mathfontoptions$$sep$,$endfor$]{$mathfont$}
  \else
    \setmathfont[$for(mathfontoptions)$$mathfontoptions$$sep$,$endfor$]{$mathfont$}
  \fi
$else$
  \setmathfont[$for(mathfontoptions)$$mathfontoptions$$sep$,$endfor$]{$mathfont$}
$endif$
$endif$
$if(CJKmainfont)$
  \ifXeTeX
    \usepackage{xeCJK}
    \setCJKmainfont[$for(CJKoptions)$$CJKoptions$$sep$,$endfor$]{$CJKmainfont$}
    $if(CJKsansfont)$
      \setCJKsansfont[$for(CJKoptions)$$CJKoptions$$sep$,$endfor$]{$CJKsansfont$}
    $endif$
    $if(CJKmonofont)$
      \setCJKmonofont[$for(CJKoptions)$$CJKoptions$$sep$,$endfor$]{$CJKmonofont$}
    $endif$
  \fi
$endif$
$if(luatexjapresetoptions)$
  \ifLuaTeX
    \usepackage[$for(luatexjapresetoptions)$$luatexjapresetoptions$$sep$,$endfor$]{luatexja-preset}
  \fi
$endif$
$if(CJKmainfont)$
  \ifLuaTeX
    \usepackage[$for(luatexjafontspecoptions)$$luatexjafontspecoptions$$sep$,$endfor$]{luatexja-fontspec}
    \setmainjfont[$for(CJKoptions)$$CJKoptions$$sep$,$endfor$]{$CJKmainfont$}
  \fi
$endif$
\fi
$if(zero-width-non-joiner)$
%% Support for zero-width non-joiner characters.
\makeatletter
\def\zerowidthnonjoiner{%
  % Prevent ligatures and adjust kerning, but still support hyphenating.
  \texorpdfstring{%
    \TextOrMath{\nobreak\discretionary{-}{}{\kern.03em}%
      \ifvmode\else\nobreak\hskip\z@skip\fi}{}%
  }{}%
}
\makeatother
\ifPDFTeX
  \DeclareUnicodeCharacter{200C}{\zerowidthnonjoiner}
\else
  \catcode`^^^^200c=\active
  \protected\def ^^^^200c{\zerowidthnonjoiner}
\fi
%% End of ZWNJ support
$endif$
% Use upquote if available, for straight quotes in verbatim environments
\IfFileExists{upquote.sty}{\usepackage{upquote}}{}
\IfFileExists{microtype.sty}{% use microtype if available
  \usepackage[$for(microtypeoptions)$$microtypeoptions$$sep$,$endfor$]{microtype}
  \UseMicrotypeSet[protrusion]{basicmath} % disable protrusion for tt fonts
}{}
$if(indent)$
$else$

\usepackage{pgfpages} 
\usepackage[export]{adjustbox}
\usepackage{graphicx}
\usepackage{ragged2e}
\makeatletter
\@ifundefined{KOMAClassName}{% if non-KOMA class
  \IfFileExists{parskip.sty}{%
    \usepackage{parskip}
  }{% else
    \setlength{\parindent}{0pt}
    \setlength{\parskip}{6pt plus 2pt minus 1pt}}
}{% if KOMA class
  \KOMAoptions{parskip=half}}
\makeatother
$endif$
$if(verbatim-in-note)$
\usepackage{fancyvrb}
$endif$
\usepackage{xcolor}
\definecolor{default-linkcolor}{HTML}{A50000}
\definecolor{default-filecolor}{HTML}{A50000}
\definecolor{default-citecolor}{HTML}{4077C0}
\definecolor{default-urlcolor}{HTML}{4077C0}
$if(footnotes-pretty)$
% load footmisc in order to customize footnotes (footmisc has to be loaded before hyperref, cf. https://tex.stackexchange.com/a/169124/144087)
\usepackage[hang,flushmargin,bottom,multiple]{footmisc}
\setlength{\footnotemargin}{0.8em} % set space between footnote nr and text
\setlength{\footnotesep}{\baselineskip} % set space between multiple footnotes
\setlength{\skip\footins}{0.3cm} % set space between page content and footnote
\setlength{\footskip}{0.9cm} % set space between footnote and page bottom
$endif$
$if(geometry)$
$if(beamer)$
\geometry{$for(geometry)$$geometry$$sep$,$endfor$}
$else$
\usepackage[$for(geometry)$$geometry$$sep$,$endfor$]{geometry}
$endif$
$else$
$if(beamer)$
$else$
\usepackage[margin=2.5cm,includehead=true,includefoot=true,centering,$for(geometry)$$geometry$$sep$,$endfor$]{geometry}
$endif$
$endif$
$if(titlepage-logo)$
\usepackage[export]{adjustbox}
\usepackage{graphicx}
$endif$
$if(beamer)$
\newif\ifbibliography
$endif$
$if(listings)$
\usepackage{listings}
\newcommand{\passthrough}[1]{#1}
\lstset{defaultdialect=[5.3]Lua}
\lstset{defaultdialect=[x86masm]Assembler}
$endif$
$if(listings-no-page-break)$
\usepackage{etoolbox}
\BeforeBeginEnvironment{lstlisting}{\par\noindent\begin{minipage}{\linewidth}}
\AfterEndEnvironment{lstlisting}{\end{minipage}\par\addvspace{\topskip}}
$endif$
$if(lhs)$
\lstnewenvironment{code}{\lstset{language=Haskell,basicstyle=\small\ttfamily}}{}
$endif$
$if(highlighting-macros)$
$highlighting-macros$

% Workaround/bugfix from jannick0.
% See https://github.com/jgm/pandoc/issues/4302#issuecomment-360669013)
% or https://github.com/Wandmalfarbe/pandoc-latex-template/issues/2
%
% Redefine the verbatim environment 'Highlighting' to break long lines (with
% the help of fvextra). Redefinition is necessary because it is unlikely that
% pandoc includes fvextra in the default template.
\usepackage{fvextra}
\DefineVerbatimEnvironment{Highlighting}{Verbatim}{breaklines,fontsize=$if(code-block-font-size)$$code-block-font-size$$else$\small$endif$,commandchars=\\\{\}}

$endif$
$if(tables)$
\usepackage{longtable,booktabs,array}
$if(multirow)$
\usepackage{multirow}
$endif$
\usepackage{calc} % for calculating minipage widths
$if(beamer)$
\usepackage{caption}
% Make caption package work with longtable
\makeatletter
\def\fnum@table{\tablename~\thetable}
\makeatother
$else$
% Correct order of tables after \paragraph or \subparagraph
\usepackage{etoolbox}
\makeatletter
\patchcmd\longtable{\par}{\if@noskipsec\mbox{}\fi\par}{}{}
\makeatother
% Allow footnotes in longtable head/foot
\IfFileExists{footnotehyper.sty}{\usepackage{footnotehyper}}{\usepackage{footnote}}
\makesavenoteenv{longtable}
$endif$
$endif$
% add backlinks to footnote references, cf. https://tex.stackexchange.com/questions/302266/make-footnote-clickable-both-ways
$if(footnotes-disable-backlinks)$
$else$
\usepackage{footnotebackref}
$endif$
$if(graphics)$
\usepackage{graphicx}
\makeatletter
\newsavebox\pandoc@box
\newcommand*\pandocbounded[1]{% scales image to fit in text height/width
  \sbox\pandoc@box{#1}%
  \Gscale@div\@tempa{\textheight}{\dimexpr\ht\pandoc@box+\dp\pandoc@box\relax}%
  \Gscale@div\@tempb{\linewidth}{\wd\pandoc@box}%
  \ifdim\@tempb\p@<\@tempa\p@\let\@tempa\@tempb\fi% select the smaller of both
  \ifdim\@tempa\p@<\p@\scalebox{\@tempa}{\usebox\pandoc@box}%
  \else\usebox{\pandoc@box}%
  \fi%
}
% Set default figure placement to htbp
% Make use of float-package and set default placement for figures to H.
% The option H means 'PUT IT HERE' (as  opposed to the standard h option which means 'You may put it here if you like').
\usepackage{float}
\floatplacement{figure}{$if(float-placement-figure)$$float-placement-figure$$else$H$endif$}
\makeatother
$endif$
$if(svg)$
\usepackage{svg}
$endif$
$if(strikeout)$
$-- also used for underline
\ifLuaTeX
  \usepackage{luacolor}
  \usepackage[soul]{lua-ul}
\else
\usepackage{soul}
$if(CJKmainfont)$
  \ifXeTeX
    % soul's \st doesn't work for CJK:
    \usepackage{xeCJKfntef}
    \renewcommand{\st}[1]{\sout{#1}}
  \fi
$endif$
\fi
$endif$
\setlength{\emergencystretch}{3em} % prevent overfull lines
\providecommand{\tightlist}{%
  \setlength{\itemsep}{0pt}\setlength{\parskip}{0pt}}
$if(numbersections)$
\setcounter{secnumdepth}{$if(secnumdepth)$$secnumdepth$$else$5$endif$}
$else$
\setcounter{secnumdepth}{-\maxdimen} % remove section numbering
$endif$
$if(subfigure)$
\usepackage{subcaption}
$endif$
$if(beamer)$
$else$
$if(block-headings)$
% Make \paragraph and \subparagraph free-standing
\ifx\paragraph\undefined\else
  \let\oldparagraph\paragraph
  \renewcommand{\paragraph}[1]{\oldparagraph{#1}\mbox{}}
\fi
\ifx\subparagraph\undefined\else
  \let\oldsubparagraph\subparagraph
  \renewcommand{\subparagraph}[1]{\oldsubparagraph{#1}\mbox{}}
\fi
$endif$
$endif$
$if(pagestyle)$
\pagestyle{$pagestyle$}
$endif$
$if(csl-refs)$
% definitions for citeproc citations
\NewDocumentCommand\citeproctext{}{}
\NewDocumentCommand\citeproc{mm}{%
  \begingroup\def\citeproctext{#2}\cite{#1}\endgroup}
\makeatletter
 % allow citations to break across lines
 \let\@cite@ofmt\@firstofone
 % avoid brackets around text for \cite:
 \def\@biblabel#1{}
 \def\@cite#1#2{{#1\if@tempswa , #2\fi}}
\makeatother
\newlength{\cslhangindent}
\setlength{\cslhangindent}{1.5em}
\newlength{\csllabelwidth}
\setlength{\csllabelwidth}{3em}
\newenvironment{CSLReferences}[2] % #1 hanging-indent, #2 entry-spacing
  {\begin{list}{}{%
   \setlength{\itemindent}{0pt}
   \setlength{\leftmargin}{0pt}
   \setlength{\parsep}{0pt}
   % turn on hanging indent if param 1 is 1
   \ifodd #1
    \setlength{\leftmargin}{\cslhangindent}
    \setlength{\itemindent}{-1\cslhangindent}
   \fi
   % set entry spacing
   \setlength{\itemsep}{#2\baselineskip}}}
  {\end{list}}
\usepackage{calc}
\newcommand{\CSLBlock}[1]{\hfill\break\parbox[t]{\linewidth}{\strut\ignorespaces#1\strut}}
\newcommand{\CSLLeftMargin}[1]{\parbox[t]{\csllabelwidth}{\strut#1\strut}}
\newcommand{\CSLRightInline}[1]{\parbox[t]{\linewidth - \csllabelwidth}{\strut#1\strut}}
\newcommand{\CSLIndent}[1]{\hspace{\cslhangindent}#1}
$endif$
$if(lang)$
\ifLuaTeX
\usepackage[bidi=basic]{babel}
\else
\usepackage[bidi=default]{babel}
\fi
$if(babel-lang)$
\babelprovide[main,import]{$babel-lang$}
$if(mainfont)$
\ifPDFTeX
\else
\babelfont{rm}[$for(mainfontoptions)$$mainfontoptions$$sep$,$endfor$]{$mainfont$}
\fi
$endif$
$endif$
$for(babel-otherlangs)$
\babelprovide[import]{$babel-otherlangs$}
$endfor$
$for(babelfonts/pairs)$
\babelfont[$babelfonts.key$]{rm}{$babelfonts.value$}
$endfor$
% get rid of language-specific shorthands (see #6817):
\let\LanguageShortHands\languageshorthands
\def\languageshorthands#1{}
$endif$
$for(header-includes)$
$header-includes$
$endfor$
\ifLuaTeX
  \usepackage{selnolig}  % disable illegal ligatures
\fi
$if(dir)$
\ifPDFTeX
  \TeXXeTstate=1
  \newcommand{\RL}[1]{\beginR #1\endR}
  \newcommand{\LR}[1]{\beginL #1\endL}
  \newenvironment{RTL}{\beginR}{\endR}
  \newenvironment{LTR}{\beginL}{\endL}
\fi
$endif$
$if(natbib)$
\usepackage[$natbiboptions$]{natbib}
\bibliographystyle{$if(biblio-style)$$biblio-style$$else$plainnat$endif$}
$endif$
$if(biblatex)$
\usepackage[$if(biblio-style)$style=$biblio-style$,$endif$$for(biblatexoptions)$$biblatexoptions$$sep$,$endfor$]{biblatex}
$for(bibliography)$
\addbibresource{$bibliography$}
$endfor$
$endif$
$if(nocite-ids)$
\nocite{$for(nocite-ids)$$it$$sep$, $endfor$}
$endif$
$if(csquotes)$
\usepackage{csquotes}
$endif$
\IfFileExists{bookmark.sty}{\usepackage{bookmark}}{\usepackage{hyperref}}
\IfFileExists{xurl.sty}{\usepackage{xurl}}{} % add URL line breaks if available
\urlstyle{$if(urlstyle)$$urlstyle$$else$same$endif$}
$if(links-as-notes)$
% Make links footnotes instead of hotlinks:
\DeclareRobustCommand{\href}[2]{#2\footnote{\url{#1}}}
$endif$
$if(verbatim-in-note)$
\VerbatimFootnotes % allow verbatim text in footnotes
$endif$
\hypersetup{
$if(title-meta)$
  pdftitle={$title-meta$},
$endif$
$if(author-meta)$
  pdfauthor={$author-meta$},
$endif$
$if(lang)$
  pdflang={$lang$},
$endif$
$if(subject)$
  pdfsubject={$subject$},
$endif$
$if(keywords)$
  pdfkeywords={$for(keywords)$$keywords$$sep$, $endfor$},
$endif$
$if(colorlinks)$
  colorlinks=true,
  linkcolor={$if(linkcolor)$$linkcolor$$else$default-linkcolor$endif$},
  filecolor={$if(filecolor)$$filecolor$$else$default-filecolor$endif$},
  citecolor={$if(citecolor)$$citecolor$$else$default-citecolor$endif$},
  urlcolor={$if(urlcolor)$$urlcolor$$else$default-urlcolor$endif$},
$else$
  hidelinks,
$endif$
  breaklinks=true,
  pdfcreator={LaTeX via pandoc with the Eisvogel template}}
$if(title)$
\title{$if(title)$$title$$else$Set up Title in Frontmatter (see abstract)$endif$}
$endif$
$if(subtitle)$
$if(beamer)$
$else$
\usepackage{etoolbox}
\makeatletter
\providecommand{\subtitle}[1]{% add subtitle to \maketitle
  \apptocmd{\@title}{\par {\large #1 \par}}{}{}
}
\makeatother
$endif$
\subtitle{$subtitle$}
$endif$
\author{$for(author)$$author$$sep$ \and $endfor$}
$if(date)$
  \date{$date$}
$else$
  \date{\today}
$endif$

$if(beamer)$
$if(institute)$
\institute{$for(institute)$$institute$$sep$ \and $endfor$}
$endif$
$if(titlegraphic)$
\titlegraphic{\includegraphics{$titlegraphic$}}
$endif$
$if(logo)$
\logo{\includegraphics{$logo$}}
$endif$
$endif$



%%
%% added
%%

$if(page-background)$
\usepackage[pages=all]{background}
$endif$

%
% for the background color of the title page
%
$if(notitlepage)$

$else$
\usepackage{pagecolor}
\usepackage{afterpage}
$if(titlepage-background)$
\usepackage{tikz}
$endif$
$if(geometry)$
$else$
\usepackage[margin=2.5cm,includehead=true,includefoot=true,centering]{geometry}
$endif$
$endif$

%
% break urls
%
\PassOptionsToPackage{hyphens}{url}

%
% When using babel or polyglossia with biblatex, loading csquotes is recommended
% to ensure that quoted texts are typeset according to the rules of your main language.
%
\usepackage{csquotes}

%
% captions
%
\definecolor{caption-color}{HTML}{777777}
$if(beamer)$
$else$
\usepackage[font={stretch=1.2}, textfont={color=caption-color}, position=top, skip=4mm, labelfont=bf, singlelinecheck=false, justification=$if(caption-justification)$$caption-justification$$else$justified$endif$]{caption}
\setcapindent{0em}
$endif$

%
% blockquote
%
\definecolor{blockquote-border}{RGB}{221,221,221}
\definecolor{blockquote-text}{RGB}{119,119,119}
\usepackage{mdframed}
\newmdenv[rightline=false,bottomline=false,topline=false,linewidth=3pt,linecolor=blockquote-border,skipabove=\parskip]{customblockquote}
\renewenvironment{quote}{\begin{customblockquote}\list{}{\rightmargin=0em\leftmargin=0em}%
\item\relax\color{blockquote-text}\ignorespaces}{\unskip\unskip\endlist\end{customblockquote}}

%
% Source Sans Pro as the de­fault font fam­ily
% Source Code Pro for monospace text
%
% 'default' option sets the default
% font family to Source Sans Pro, not \sfdefault.
%
\ifnum 0\ifxetex 1\fi\ifluatex 1\fi=0 % if pdftex
  $if(fontfamily)$
  $else$
  \usepackage[default]{sourcesanspro}
  \usepackage{sourcecodepro}
  $endif$
\else % if not pdftex
  $if(mainfont)$
  $else$
  \usepackage[default]{sourcesanspro}
  \usepackage{sourcecodepro}

  % XeLaTeX specific adjustments for straight quotes: https://tex.stackexchange.com/a/354887
  % This issue is already fixed (see https://github.com/silkeh/latex-sourcecodepro/pull/5) but the
  % fix is still unreleased.
  % TODO: Remove this workaround when the new version of sourcecodepro is released on CTAN.
  \ifxetex
    \makeatletter
    \defaultfontfeatures[\ttfamily]
      { Numbers   = \sourcecodepro@figurestyle,
        Scale     = \SourceCodePro@scale,
        Extension = .otf }
    \setmonofont
      [ UprightFont    = *-\sourcecodepro@regstyle,
        ItalicFont     = *-\sourcecodepro@regstyle It,
        BoldFont       = *-\sourcecodepro@boldstyle,
        BoldItalicFont = *-\sourcecodepro@boldstyle It ]
      {SourceCodePro}
    \makeatother
  \fi
  $endif$
\fi

%
% heading color
%
\definecolor{heading-color}{RGB}{40,40,40}
$if(beamer)$
$else$
\addtokomafont{section}{\color{heading-color}}
$endif$
% When using the classes report, scrreprt, book,
% scrbook or memoir, uncomment the following line.
%\addtokomafont{chapter}{\color{heading-color}}

%
% variables for title, author and date
%
$if(beamer)$
$else$
\usepackage{titling}
\title{$title$}
\author{$for(author)$$author$$sep$, $endfor$}
\date{$date$}
$endif$

%
% tables
%
$if(tables)$

\definecolor{table-row-color}{HTML}{F5F5F5}
\definecolor{table-rule-color}{HTML}{999999}

%\arrayrulecolor{black!40}
\arrayrulecolor{table-rule-color}     % color of \toprule, \midrule, \bottomrule
\setlength\heavyrulewidth{0.3ex}      % thickness of \toprule, \bottomrule
\renewcommand{\arraystretch}{1.3}     % spacing (padding)

$if(table-use-row-colors)$
% TODO: This doesn't work anymore. I don't know why.
% Reset rownum counter so that each table
% starts with the same row colors.
% https://tex.stackexchange.com/questions/170637/restarting-rowcolors
%
% Unfortunately the colored cells extend beyond the edge of the
% table because pandoc uses @-expressions (@{}) like so:
%
% \begin{longtable}[]{@{}ll@{}}
% \end{longtable}
%
% https://en.wikibooks.org/wiki/LaTeX/Tables#.40-expressions
\usepackage{etoolbox}
\AtBeginEnvironment{longtable}{\rowcolors{2}{}{table-row-color!100}}
\preto{\toprule}{\hiderowcolors}{}{}
\appto{\endhead}{\showrowcolors}{}{}
\appto{\endfirsthead}{\showrowcolors}{}{}
$endif$
$endif$

%
% remove paragraph indentation
%
\setlength{\parindent}{0pt}
\setlength{\parskip}{6pt plus 2pt minus 1pt}
\setlength{\emergencystretch}{3em}  % prevent overfull lines

%
%
% Listings
%
%

$if(listings)$

%
% general listing colors
%
\definecolor{listing-background}{HTML}{F7F7F7}
\definecolor{listing-rule}{HTML}{B3B2B3}
\definecolor{listing-numbers}{HTML}{B3B2B3}
\definecolor{listing-text-color}{HTML}{000000}
\definecolor{listing-keyword}{HTML}{435489}
\definecolor{listing-keyword-2}{HTML}{1284CA} % additional keywords
\definecolor{listing-keyword-3}{HTML}{9137CB} % additional keywords
\definecolor{listing-identifier}{HTML}{435489}
\definecolor{listing-string}{HTML}{00999A}
\definecolor{listing-comment}{HTML}{8E8E8E}

\lstdefinestyle{eisvogel_listing_style}{
  language         = java,
$if(listings-disable-line-numbers)$
  xleftmargin      = 0.6em,
  framexleftmargin = 0.4em,
$else$
  numbers          = left,
  xleftmargin      = 2.7em,
  framexleftmargin = 2.5em,
$endif$
  backgroundcolor  = \color{listing-background},
  basicstyle       = \color{listing-text-color}\linespread{1.0}%
                      \lst@ifdisplaystyle%
                      $if(code-block-font-size)$$code-block-font-size$$else$\small$endif$%
                      \fi\ttfamily{},
  breaklines       = true,
  frame            = single,
  framesep         = 0.19em,
  rulecolor        = \color{listing-rule},
  frameround       = ffff,
  tabsize          = 4,
  numberstyle      = \color{listing-numbers},
  aboveskip        = 1.0em,
  belowskip        = 0.1em,
  abovecaptionskip = 0em,
  belowcaptionskip = 1.0em,
  keywordstyle     = {\color{listing-keyword}\bfseries},
  keywordstyle     = {[2]\color{listing-keyword-2}\bfseries},
  keywordstyle     = {[3]\color{listing-keyword-3}\bfseries\itshape},
  sensitive        = true,
  identifierstyle  = \color{listing-identifier},
  commentstyle     = \color{listing-comment},
  stringstyle      = \color{listing-string},
  showstringspaces = false,
  escapeinside     = {/*@}{@*/}, % Allow LaTeX inside these special comments
  literate         =
  {á}{{\'a}}1 {é}{{\'e}}1 {í}{{\'i}}1 {ó}{{\'o}}1 {ú}{{\'u}}1
  {Á}{{\'A}}1 {É}{{\'E}}1 {Í}{{\'I}}1 {Ó}{{\'O}}1 {Ú}{{\'U}}1
  {à}{{\`a}}1 {è}{{\`e}}1 {ì}{{\`i}}1 {ò}{{\`o}}1 {ù}{{\`u}}1
  {À}{{\`A}}1 {È}{{\`E}}1 {Ì}{{\`I}}1 {Ò}{{\`O}}1 {Ù}{{\`U}}1
  {ä}{{\"a}}1 {ë}{{\"e}}1 {ï}{{\"i}}1 {ö}{{\"o}}1 {ü}{{\"u}}1
  {Ä}{{\"A}}1 {Ë}{{\"E}}1 {Ï}{{\"I}}1 {Ö}{{\"O}}1 {Ü}{{\"U}}1
  {â}{{\^a}}1 {ê}{{\^e}}1 {î}{{\^i}}1 {ô}{{\^o}}1 {û}{{\^u}}1
  {Â}{{\^A}}1 {Ê}{{\^E}}1 {Î}{{\^I}}1 {Ô}{{\^O}}1 {Û}{{\^U}}1
  {œ}{{\oe}}1 {Œ}{{\OE}}1 {æ}{{\ae}}1 {Æ}{{\AE}}1 {ß}{{\ss}}1
  {ç}{{\c c}}1 {Ç}{{\c C}}1 {ø}{{\o}}1 {å}{{\r a}}1 {Å}{{\r A}}1
  {€}{{\EUR}}1 {£}{{\pounds}}1 {«}{{\guillemotleft}}1
  {»}{{\guillemotright}}1 {ñ}{{\~n}}1 {Ñ}{{\~N}}1 {¿}{{?`}}1
  {…}{{\ldots}}1 {≥}{{>=}}1 {≤}{{<=}}1 {„}{{\glqq}}1 {“}{{\grqq}}1
  {”}{{''}}1
}
\lstset{style=eisvogel_listing_style}

%
% Java (Java SE 12, 2019-06-22)
%
\lstdefinelanguage{Java}{
  morekeywords={
    % normal keywords (without data types)
    abstract,assert,break,case,catch,class,continue,default,
    do,else,enum,exports,extends,final,finally,for,if,implements,
    import,instanceof,interface,module,native,new,package,private,
    protected,public,requires,return,static,strictfp,super,switch,
    synchronized,this,throw,throws,transient,try,volatile,while,
    % var is an identifier
    var
  },
  morekeywords={[2] % data types
    % primitive data types
    boolean,byte,char,double,float,int,long,short,
    % String
    String,
    % primitive wrapper types
    Boolean,Byte,Character,Double,Float,Integer,Long,Short
    % number types
    Number,AtomicInteger,AtomicLong,BigDecimal,BigInteger,DoubleAccumulator,DoubleAdder,LongAccumulator,LongAdder,Short,
    % other
    Object,Void,void
  },
  morekeywords={[3] % literals
    % reserved words for literal values
    null,true,false,
  },
  sensitive,
  morecomment  = [l]//,
  morecomment  = [s]{/*}{*/},
  morecomment  = [s]{/**}{*/},
  morestring   = [b]",
  morestring   = [b]',
}

\lstdefinelanguage{XML}{
  morestring      = [b]",
  moredelim       = [s][\bfseries\color{listing-keyword}]{<}{\ },
  moredelim       = [s][\bfseries\color{listing-keyword}]{</}{>},
  moredelim       = [l][\bfseries\color{listing-keyword}]{/>},
  moredelim       = [l][\bfseries\color{listing-keyword}]{>},
  morecomment     = [s]{<?}{?>},
  morecomment     = [s]{<!--}{-->},
  commentstyle    = \color{listing-comment},
  stringstyle     = \color{listing-string},
  identifierstyle = \color{listing-identifier}
}
$endif$

%
% header and footer
%
$if(beamer)$
$else$
$if(disable-header-and-footer)$
$else$
\usepackage[headsepline,footsepline]{scrlayer-scrpage}

\newpairofpagestyles{eisvogel-header-footer}{
  \clearpairofpagestyles
  \ihead*{$if(header-left)$$header-left$$else$$title$$endif$}
  \chead*{$if(header-center)$$header-center$$else$$endif$}
  \ohead*{$if(header-right)$$header-right$$else$$date$$endif$}
  \ifoot*{$if(footer-left)$$footer-left$$else$$for(author)$$author$$sep$, $endfor$$endif$}
  \cfoot*{$if(footer-center)$$footer-center$$else$$endif$}
  \ofoot*{$if(footer-right)$$footer-right$$else$\thepage$endif$}
  \addtokomafont{pageheadfoot}{\upshape}
}
\pagestyle{eisvogel-header-footer}

$if(book)$
\deftripstyle{ChapterStyle}{}{}{}{}{\pagemark}{}
\renewcommand*{\chapterpagestyle}{ChapterStyle}
$endif$

$if(page-background)$
\backgroundsetup{
scale=1,
color=black,
opacity=$if(page-background-opacity)$$page-background-opacity$$else$0.2$endif$,
angle=0,
contents={%
  \includegraphics[width=\paperwidth,height=\paperheight]{$page-background$}
  }%
}
$endif$
$endif$
$endif$

%%
%% end added
%%
\usepackage{pgfpages}
\usepackage[export]{adjustbox}
\usepackage{graphicx}
\usepackage{ragged2e}


\begin{document}

%%
%% begin titlepage
%%
$if(beamer)$
$else$
$if(notitlepage)$
$else$
\begin{titlepage}
$if(titlepage-background)$
\newgeometry{top=2cm, right=4cm, bottom=3cm, left=4cm}
$else$
$endif$
$if(titlepage-color)$
\definecolor{titlepage-color}{HTML}{$titlepage-color$}
\newpagecolor{titlepage-color}\afterpage{\restorepagecolor}
$endif$
$if(titlepage-background)$
\tikz[remember picture,overlay] \node[inner sep=0pt] at (current page.center){\includegraphics[width=\paperwidth,height=\paperheight]{$titlepage-background$}};
$endif$
\newcommand{\colorRule}[3][black]{\textcolor[HTML]{#1}{\rule{#2}{#3}}}
\begin{flushleft}
\noindent
\\[-1em]
\color[HTML]{$if(titlepage-text-color)$$titlepage-text-color$$else$000000$endif$}
\makebox[0pt][l]{\colorRule[$if(titlepage-rule-color)$$titlepage-rule-color$$else$FFFFFF$endif$]{1.3\textwidth}{$if(titlepage-rule-height)$$titlepage-rule-height$$else$0$endif$pt}}
\par
\noindent

$if(titlepage-background)$
% The titlepage with a background image has other text spacing and text size
{
  \setstretch{2}
  \vfill
  \vskip -8em
  \noindent {\huge \textbf{\textsf{
  $if(title)$
    $title$
  $else$
    Set up Title in Frontmatter (see Abstract)
  $endif$
}}}
  $if(subtitle)$
  \vskip 1em
  {\Large \textsf{$subtitle$}}
  $endif$
  \vskip 2em
  \noindent {\Large \textit{$for(author)$$author$$sep$, $endfor$} \vskip 0.6em \textsf{$date$}}
  \vfill
}
$else$
{
  \begin{center}
  \setstretch{1.4}
  \vfill
  \noindent {\huge \textbf{\textsf{
  $if(title)$
    $title$
  $else$
    Set up Title in Frontmatter (see Abstract)
  $endif$
}}}
  $if(subtitle)$
  \vskip 1em
  {\Large \textsf{$subtitle$}}
  $endif$
  \vskip 2em
  \noindent {\Large \textit{$for(author)$$author$$sep$, $endfor$}}
  \vfill
  \end{center}
}
$endif$

$if(titlepage-logo)$
\noindent
\begin{center}
\includegraphics[width=$if(logo-width)$$logo-width$$else$35mm$endif$]{$titlepage-logo$}
\end{center}
$endif$
$if(text1)$
\begin{center}
{\large \textsf{$text1$}}
\end{center}
$endif$
$if(text2)$
\begin{center}
{\large \textsf{$text2$}}
\end{center}
$endif$
$if(text3)$
\begin{center}
{\large \textsf{$text3$}}
\end{center}
$endif$
$if(text4)$
\begin{center}
{\large \textsf{$text4$}}
\end{center}
$endif$
$if(titlepage-background)$
$else$
$endif$
\end{flushleft}
\end{titlepage}
\restoregeometry
\pagenumbering{arabic} 
$endif$
$endif$

%%
%% end titlepage
%%

$if(has-frontmatter)$
\frontmatter
\frame{\titlepage}
% don't generate the default title
% $else$
% \maketitle
\pagenumbering{Roman} % set the numbering style to lowercase letter

\begin{center}
 {\LARGE \textbf{\textsf{Abstract}}}
\end{center}

\begin{abstract}
\begin{justify}
  $if(abstract)$
  $abstract$
  $else$
  Add your abstract at the beginning of your markdown file like this 
  \begin{verbatim}
  ---
  title: "Your Title" 
  abstract: "your abstract here"
  author: Leonardo V. Castorina, Another 1, Another 2
  titlepage-logo: /absolute/path/to/logo.pdf
  acknowledgements: "I would like to thank my dog Data."
  declaration: "I declare that this thesis was composed by myself."
  ---
  \end{verbatim}
  This is called YAML frontmatter.  Make sure to set up a title! If you set your abstract correctly you should not see this message.

  Optionally you can set up \texttt{titlepage-logo} for a logo in the cover page, \texttt{acknowledgements} section, and  \texttt{declaration} section.

  $endif$
\end{justify}
\end{abstract}
\pagebreak


$if(acknowledgements)$
\begin{center}
 {\LARGE \textbf{\textsf{Acknowledgements}}}
\end{center}

\begin{abstract}
\begin{justify}
$acknowledgements$
\end{justify}
\end{abstract}
\pagebreak

$endif$

$if(declaration)$
\begin{center}
 {\LARGE \textbf{\textsf{Declaration}}}
\end{center}

\begin{abstract}
\begin{justify}
  $declaration$ \par
   \vspace{1in}\raggedleft({\em $author$\/})
\end{justify}
\end{abstract}
\pagebreak



$endif$
\pagenumbering{arabic} % set the numbering style to lowercase letter
\setcounter{page}{0} % Set the page counter to 3


$if(first-chapter)$
\setcounter{chapter}{$first-chapter$}
\addtocounter{chapter}{-1}
$endif$

$for(include-before)$
$include-before$

$endfor$
$if(no-toc)$
$else$
\renewcommand*\contentsname{$toc-title$}
\renewcommand*\contentsname{Table of Contents}
$endif$
$if(beamer)$
\begin{frame}[allowframebreaks]
$if(toc-title)$
  \frametitle{$toc-title$}
$endif$
  \tableofcontents[hideallsubsections]
\end{frame}
\newpage
$else$
{
$if(colorlinks)$
\hypersetup{linkcolor=$if(toccolor)$$toccolor$$else$$endif$}
$endif$
\setcounter{tocdepth}{$toc-depth$}
\tableofcontents
\newpage
}
$endif$
$endif$
$if(lof)$
\listoffigures
$endif$
$if(lot)$
\listoftables
$endif$
$if(linestretch)$
\setstretch{$linestretch$}
$endif$
$if(has-frontmatter)$
\mainmatter
$endif$
$body$

$if(has-frontmatter)$
\backmatter
$endif$
$if(natbib)$
$if(bibliography)$
$if(biblio-title)$
$if(has-chapters)$
\renewcommand\bibname{$biblio-title$}
$else$
\renewcommand\refname{$biblio-title$}
$endif$
$endif$
$if(beamer)$
\begin{frame}[allowframebreaks]{$biblio-title$}
  \bibliographytrue
$endif$
  \bibliography{$for(bibliography)$$bibliography$$sep$,$endfor$}
$if(beamer)$
\end{frame}
$endif$

$endif$
$endif$
$if(biblatex)$
$if(beamer)$
\begin{frame}[allowframebreaks]{$biblio-title$}
  \bibliographytrue
  \printbibliography[heading=none]
\end{frame}
$else$
\printbibliography$if(biblio-title)$[title=$biblio-title$]$endif$
$endif$

$endif$
$for(include-after)$
$include-after$

$endfor$
\end{document}"),e=>e.charCodeAt(0)),Ia=Object.freeze(Object.defineProperty({__proto__:null,default:Ga},Symbol.toStringTag,{value:"Module"})),Ca=Uint8Array.from(atob("% partial rewrite of the LaTeX2e package for submissions to the
% Conference on Neural Information Processing Systems (NeurIPS):
%
% - uses more LaTeX conventions
% - line numbers at submission time replaced with aligned numbers from
%   lineno package
% - \nipsfinalcopy replaced with [final] package option
% - automatically loads times package for authors
% - loads natbib automatically; this can be suppressed with the
%   [nonatbib] package option
% - adds foot line to first page identifying the conference
% - adds preprint option for submission to e.g. arXiv
% - conference acronym modified
%
% Roman Garnett (garnett@wustl.edu) and the many authors of
% nips15submit_e.sty, including MK and drstrip@sandia
%
% last revision: March 2023

\NeedsTeXFormat{LaTeX2e}
\ProvidesPackage{neurips}[2023/03/31 NeurIPS 2023 submission/camera-ready style file]

% declare final option, which creates camera-ready copy
\newif\if@neuripsfinal\@neuripsfinalfalse
\DeclareOption{final}{
  \@neuripsfinaltrue
}

% declare nonatbib option, which does not load natbib in case of
% package clash (users can pass options to natbib via
% \PassOptionsToPackage)
\newif\if@natbib\@natbibtrue
\DeclareOption{nonatbib}{
  \@natbibfalse
}

% declare preprint option, which creates a preprint version ready for
% upload to, e.g., arXiv
\newif\if@preprint\@preprintfalse
\DeclareOption{preprint}{
  \@preprinttrue
}

\ProcessOptions\relax

% determine whether this is an anonymized submission
\newif\if@submission\@submissiontrue
\if@neuripsfinal\@submissionfalse\fi
\if@preprint\@submissionfalse\fi

% fonts
\renewcommand{\rmdefault}{ptm}
\renewcommand{\sfdefault}{phv}

% change this every year for notice string at bottom
\newcommand{\@neuripsordinal}{}
\newcommand{\@neuripsyear}{\the\year}
\newcommand{\@neuripslocation}{}

% acknowledgments
\usepackage{environ}
\newcommand{\acksection}{\section*{Acknowledgments and Disclosure of Funding}}
\NewEnviron{ack}{%
  \acksection
  \BODY
}


% load natbib unless told otherwise
\if@natbib
  \RequirePackage{natbib}
\fi

% set page geometry
\usepackage[verbose=true,letterpaper]{geometry}
\AtBeginDocument{
  \newgeometry{
    textheight=9in,
    textwidth=5.5in,
    top=1in,
    headheight=12pt,
    headsep=25pt,
    footskip=30pt
  }
  \@ifpackageloaded{fullpage}
    {\PackageWarning{neurips_2023}{fullpage package not allowed! Overwriting formatting.}}
    {}
}

\widowpenalty=10000
\clubpenalty=10000
\flushbottom
\sloppy


% font sizes with reduced leading
\renewcommand{\normalsize}{%
  \@setfontsize\normalsize\@xpt\@xipt
  \abovedisplayskip      7\p@ \@plus 2\p@ \@minus 5\p@
  \abovedisplayshortskip \z@ \@plus 3\p@
  \belowdisplayskip      \abovedisplayskip
  \belowdisplayshortskip 4\p@ \@plus 3\p@ \@minus 3\p@
}
\normalsize
\renewcommand{\small}{%
  \@setfontsize\small\@ixpt\@xpt
  \abovedisplayskip      6\p@ \@plus 1.5\p@ \@minus 4\p@
  \abovedisplayshortskip \z@  \@plus 2\p@
  \belowdisplayskip      \abovedisplayskip
  \belowdisplayshortskip 3\p@ \@plus 2\p@   \@minus 2\p@
}
\renewcommand{\footnotesize}{\@setfontsize\footnotesize\@ixpt\@xpt}
\renewcommand{\scriptsize}{\@setfontsize\scriptsize\@viipt\@viiipt}
\renewcommand{\tiny}{\@setfontsize\tiny\@vipt\@viipt}
\renewcommand{\large}{\@setfontsize\large\@xiipt{14}}
\renewcommand{\Large}{\@setfontsize\Large\@xivpt{16}}
\renewcommand{\LARGE}{\@setfontsize\LARGE\@xviipt{20}}
\renewcommand{\huge}{\@setfontsize\huge\@xxpt{23}}
\renewcommand{\Huge}{\@setfontsize\Huge\@xxvpt{28}}

% sections with less space
\providecommand{\section}{}
\renewcommand{\section}{%
  \@startsection{section}{1}{\z@}%
                {-2.0ex \@plus -0.5ex \@minus -0.2ex}%
                { 1.5ex \@plus  0.3ex \@minus  0.2ex}%
                {\large\bf\raggedright}%
}
\providecommand{\subsection}{}
\renewcommand{\subsection}{%
  \@startsection{subsection}{2}{\z@}%
                {-1.8ex \@plus -0.5ex \@minus -0.2ex}%
                { 0.8ex \@plus  0.2ex}%
                {\normalsize\bf\raggedright}%
}
\providecommand{\subsubsection}{}
\renewcommand{\subsubsection}{%
  \@startsection{subsubsection}{3}{\z@}%
                {-1.5ex \@plus -0.5ex \@minus -0.2ex}%
                { 0.5ex \@plus  0.2ex}%
                {\normalsize\bf\raggedright}%
}
\providecommand{\paragraph}{}
\renewcommand{\paragraph}{%
  \@startsection{paragraph}{4}{\z@}%
                {1.5ex \@plus 0.5ex \@minus 0.2ex}%
                {-1em}%
                {\normalsize\bf}%
}
\providecommand{\subparagraph}{}
\renewcommand{\subparagraph}{%
  \@startsection{subparagraph}{5}{\z@}%
                {1.5ex \@plus 0.5ex \@minus 0.2ex}%
                {-1em}%
                {\normalsize\bf}%
}
\providecommand{\subsubsubsection}{}
\renewcommand{\subsubsubsection}{%
  \vskip5pt{\noindent\normalsize\rm\raggedright}%
}

% float placement
\renewcommand{\topfraction      }{0.85}
\renewcommand{\bottomfraction   }{0.4}
\renewcommand{\textfraction     }{0.1}
\renewcommand{\floatpagefraction}{0.7}

\newlength{\@neuripsabovecaptionskip}\setlength{\@neuripsabovecaptionskip}{7\p@}
\newlength{\@neuripsbelowcaptionskip}\setlength{\@neuripsbelowcaptionskip}{\z@}

\setlength{\abovecaptionskip}{\@neuripsabovecaptionskip}
\setlength{\belowcaptionskip}{\@neuripsbelowcaptionskip}

% swap above/belowcaptionskip lengths for tables
\renewenvironment{table}
  {\setlength{\abovecaptionskip}{\@neuripsbelowcaptionskip}%
   \setlength{\belowcaptionskip}{\@neuripsabovecaptionskip}%
   \@float{table}}
  {\end@float}

% footnote formatting
\setlength{\footnotesep }{6.65\p@}
\setlength{\skip\footins}{9\p@ \@plus 4\p@ \@minus 2\p@}
\renewcommand{\footnoterule}{\kern-3\p@ \hrule width 12pc \kern 2.6\p@}
\setcounter{footnote}{0}

% paragraph formatting
\setlength{\parindent}{\z@}
\setlength{\parskip  }{5.5\p@}

% list formatting
\setlength{\topsep       }{4\p@ \@plus 1\p@   \@minus 2\p@}
\setlength{\partopsep    }{1\p@ \@plus 0.5\p@ \@minus 0.5\p@}
\setlength{\itemsep      }{2\p@ \@plus 1\p@   \@minus 0.5\p@}
\setlength{\parsep       }{2\p@ \@plus 1\p@   \@minus 0.5\p@}
\setlength{\leftmargin   }{3pc}
\setlength{\leftmargini  }{\leftmargin}
\setlength{\leftmarginii }{2em}
\setlength{\leftmarginiii}{1.5em}
\setlength{\leftmarginiv }{1.0em}
\setlength{\leftmarginv  }{0.5em}
\def\@listi  {\leftmargin\leftmargini}
\def\@listii {\leftmargin\leftmarginii
              \labelwidth\leftmarginii
              \advance\labelwidth-\labelsep
              \topsep  2\p@ \@plus 1\p@    \@minus 0.5\p@
              \parsep  1\p@ \@plus 0.5\p@ \@minus 0.5\p@
              \itemsep \parsep}
\def\@listiii{\leftmargin\leftmarginiii
              \labelwidth\leftmarginiii
              \advance\labelwidth-\labelsep
              \topsep    1\p@ \@plus 0.5\p@ \@minus 0.5\p@
              \parsep    \z@
              \partopsep 0.5\p@ \@plus 0\p@ \@minus 0.5\p@
              \itemsep \topsep}
\def\@listiv {\leftmargin\leftmarginiv
              \labelwidth\leftmarginiv
              \advance\labelwidth-\labelsep}
\def\@listv  {\leftmargin\leftmarginv
              \labelwidth\leftmarginv
              \advance\labelwidth-\labelsep}
\def\@listvi {\leftmargin\leftmarginvi
              \labelwidth\leftmarginvi
              \advance\labelwidth-\labelsep}

% create title
\providecommand{\maketitle}{}
\renewcommand{\maketitle}{%
  \par
  \begingroup
    \renewcommand{\thefootnote}{\fnsymbol{footnote}}
    % for perfect author name centering
    \renewcommand{\@makefnmark}{\hbox to \z@{$^{\@thefnmark}$\hss}}
    % The footnote-mark was overlapping the footnote-text,
    % added the following to fix this problem               (MK)
    \long\def\@makefntext##1{%
      \parindent 1em\noindent
      \hbox to 1.8em{\hss $\m@th ^{\@thefnmark}$}##1
    }
    \thispagestyle{empty}
    \@maketitle
    \@thanks
    \@notice
  \endgroup
  \let\maketitle\relax
  \let\thanks\relax
}

% rules for title box at top of first page
\newcommand{\@toptitlebar}{
  \hrule height 4\p@
  \vskip 0.25in
  \vskip -\parskip%
}
\newcommand{\@bottomtitlebar}{
  \vskip 0.29in
  \vskip -\parskip
  \hrule height 1\p@
  \vskip 0.09in%
}

% create title (includes both anonymized and non-anonymized versions)
\providecommand{\@maketitle}{}
\renewcommand{\@maketitle}{%
  \vbox{%
    \hsize\textwidth
    \linewidth\hsize
    \vskip 0.1in
    \@toptitlebar
    \centering
    {\LARGE\bf \@title\par}
    \@bottomtitlebar
    \if@submission
      \begin{tabular}[t]{c}\bf\rule{\z@}{24\p@}
        Anonymous Author(s) \\
        Affiliation \\
        Address \\
        \texttt{email} \\
      \end{tabular}%
    \else
      \def\And{%
        \end{tabular}\hfil\linebreak[0]\hfil%
        \begin{tabular}[t]{c}\bf\rule{\z@}{24\p@}\ignorespaces%
      }
      \def\AND{%
        \end{tabular}\hfil\linebreak[4]\hfil%
        \begin{tabular}[t]{c}\bf\rule{\z@}{24\p@}\ignorespaces%
      }
      \begin{tabular}[t]{c}\bf\rule{\z@}{24\p@}\@author\end{tabular}%
    \fi
    \vskip 0.3in \@minus 0.1in
  }
}

% add conference notice to bottom of first page
\newcommand{\ftype@noticebox}{8}
\newcommand{\@notice}{%
  % give a bit of extra room back to authors on first page
  \enlargethispage{2\baselineskip}%
  \@float{noticebox}[b]%
    \footnotesize\@noticestring%
  \end@float%
}

% abstract styling
\renewenvironment{abstract}%
{%
  \vskip 0.075in%
  \centerline%
  {\large\bf Abstract}%
  \vspace{0.5ex}%
  \begin{quote}%
}
{
  \par%
  \end{quote}%
  \vskip 1ex%
}

% handle tweaks for camera-ready copy vs. submission copy
\if@preprint
  \newcommand{\@noticestring}{%
    Preprint. Under review.%
  }
\else
  \if@neuripsfinal
    \newcommand{\@noticestring}{%
      (\@neuripsyear) \@title 
    }
  \else
    \newcommand{\@noticestring}{%
     (\@neuripsyear) \@title %
    }

    % hide the acknowledgements
    \NewEnviron{hide}{}
    \let\ack\hide
    \let\endack\endhide

    % line numbers for submission
    \RequirePackage{lineno}
    \linenumbers

    % fix incompatibilities between lineno and amsmath, if required, by
    % transparently wrapping linenomath environments around amsmath
    % environments
    \AtBeginDocument{%
      \@ifpackageloaded{amsmath}{%
        \newcommand*\patchAmsMathEnvironmentForLineno[1]{%
          \expandafter\let\csname old#1\expandafter\endcsname\csname #1\endcsname
          \expandafter\let\csname oldend#1\expandafter\endcsname\csname end#1\endcsname
          \renewenvironment{#1}%
                          {\linenomath\csname old#1\endcsname}%
                          {\csname oldend#1\endcsname\endlinenomath}%
        }%
        \newcommand*\patchBothAmsMathEnvironmentsForLineno[1]{%
          \patchAmsMathEnvironmentForLineno{#1}%
          \patchAmsMathEnvironmentForLineno{#1*}%
        }%
        \patchBothAmsMathEnvironmentsForLineno{equation}%
        \patchBothAmsMathEnvironmentsForLineno{align}%
        \patchBothAmsMathEnvironmentsForLineno{flalign}%
        \patchBothAmsMathEnvironmentsForLineno{alignat}%
        \patchBothAmsMathEnvironmentsForLineno{gather}%
        \patchBothAmsMathEnvironmentsForLineno{multline}%
      }
      {}
    }
  \fi
\fi


\endinput
"),e=>e.charCodeAt(0)),Wa=Object.freeze(Object.defineProperty({__proto__:null,default:Ca},Symbol.toStringTag,{value:"Module"})),ha=Uint8Array.from(atob("XGRvY3VtZW50Y2xhc3N7YXJ0aWNsZX0KCgolIGlmIHlvdSBuZWVkIHRvIHBhc3Mgb3B0aW9ucyB0byBuYXRiaWIsIHVzZSwgZS5nLjoKJSAgICAgXFBhc3NPcHRpb25zVG9QYWNrYWdle251bWJlcnMsIGNvbXByZXNzfXtuYXRiaWJ9CiUgYmVmb3JlIGxvYWRpbmcgbmV1cmlwc18yMDIzCgoKJSByZWFkeSBmb3Igc3VibWlzc2lvbgpcdXNlcGFja2FnZVtmaW5hbF17bmV1cmlwc30KCgolIHRvIGNvbXBpbGUgYSBwcmVwcmludCB2ZXJzaW9uLCBlLmcuLCBmb3Igc3VibWlzc2lvbiB0byBhclhpdiwgYWRkIGFkZCB0aGUKJSBbcHJlcHJpbnRdIG9wdGlvbjoKJSAgICAgXHVzZXBhY2thZ2VbcHJlcHJpbnRde25ldXJpcHNfMjAyM30KCgolIHRvIGNvbXBpbGUgYSBjYW1lcmEtcmVhZHkgdmVyc2lvbiwgYWRkIHRoZSBbZmluYWxdIG9wdGlvbiwgZS5nLjoKJSAgICAgXHVzZXBhY2thZ2VbZmluYWxde25ldXJpcHNfMjAyM30KCgolIHRvIGF2b2lkIGxvYWRpbmcgdGhlIG5hdGJpYiBwYWNrYWdlLCBhZGQgb3B0aW9uIG5vbmF0YmliOgolICAgIFx1c2VwYWNrYWdlW25vbmF0YmliXXtuZXVyaXBzXzIwMjN9CgoKXHVzZXBhY2thZ2VbdXRmOF17aW5wdXRlbmN9ICUgYWxsb3cgdXRmLTggaW5wdXQKXHVzZXBhY2thZ2VbVDFde2ZvbnRlbmN9ICAgICUgdXNlIDgtYml0IFQxIGZvbnRzClx1c2VwYWNrYWdle2h5cGVycmVmfSAgICAgICAlIGh5cGVybGlua3MKXHVzZXBhY2thZ2V7dXJsfSAgICAgICAgICAgICUgc2ltcGxlIFVSTCB0eXBlc2V0dGluZwpcdXNlcGFja2FnZXtib29rdGFic30gICAgICAgJSBwcm9mZXNzaW9uYWwtcXVhbGl0eSB0YWJsZXMKXHVzZXBhY2thZ2V7YW1zZm9udHN9ICAgICAgICUgYmxhY2tib2FyZCBtYXRoIHN5bWJvbHMKXHVzZXBhY2thZ2V7bmljZWZyYWN9ICAgICAgICUgY29tcGFjdCBzeW1ib2xzIGZvciAxLzIsIGV0Yy4KXHVzZXBhY2thZ2V7bWljcm90eXBlfSAgICAgICUgbWljcm90eXBvZ3JhcGh5Clx1c2VwYWNrYWdle3hjb2xvcn0gICAgICAgICAlIGNvbG9ycwpcdXNlcGFja2FnZXtncmFwaGljeH0KClxtYWtlYXRsZXR0ZXIKXGRlZlxtYXh3aWR0aHtcaWZkaW1cR2luQG5hdEB3aWR0aD5cbGluZXdpZHRoXGxpbmV3aWR0aFxlbHNlXEdpbkBuYXRAd2lkdGhcZml9ClxkZWZcbWF4aGVpZ2h0e1xpZmRpbVxHaW5AbmF0QGhlaWdodD5cdGV4dGhlaWdodFx0ZXh0aGVpZ2h0XGVsc2VcR2luQG5hdEBoZWlnaHRcZml9ClxtYWtlYXRvdGhlcgolIFNjYWxlIGltYWdlcyBpZiBuZWNlc3NhcnksIHNvIHRoYXQgdGhleSB3aWxsIG5vdCBvdmVyZmxvdyB0aGUgcGFnZQolIG1hcmdpbnMgYnkgZGVmYXVsdCwgYW5kIGl0IGlzIHN0aWxsIHBvc3NpYmxlIHRvIG92ZXJ3cml0ZSB0aGUgZGVmYXVsdHMKJSB1c2luZyBleHBsaWNpdCBvcHRpb25zIGluIFxpbmNsdWRlZ3JhcGhpY3Nbd2lkdGgsIGhlaWdodCwgLi4uXXt9ClxzZXRrZXlze0dpbn17d2lkdGg9XG1heHdpZHRoLGhlaWdodD1cbWF4aGVpZ2h0LGtlZXBhc3BlY3RyYXRpb30KJSBTZXQgZGVmYXVsdCBmaWd1cmUgcGxhY2VtZW50IHRvIGh0YnAKXG1ha2VhdGxldHRlcgpcZGVmXGZwc0BmaWd1cmV7aHRicH0KXG1ha2VhdG90aGVyCgokaWYoY3NsLXJlZnMpJApcbmV3bGVuZ3Roe1xjc2xoYW5naW5kZW50fQpcc2V0bGVuZ3Roe1xjc2xoYW5naW5kZW50fXsxLjVlbX0KXG5ld2xlbmd0aHtcY3NsbGFiZWx3aWR0aH0KXHNldGxlbmd0aHtcY3NsbGFiZWx3aWR0aH17M2VtfQpcbmV3bGVuZ3Roe1xjc2xlbnRyeXNwYWNpbmd1bml0fSAlIHRpbWVzIGVudHJ5LXNwYWNpbmcKXHNldGxlbmd0aHtcY3NsZW50cnlzcGFjaW5ndW5pdH17XHBhcnNraXB9ClxuZXdlbnZpcm9ubWVudHtDU0xSZWZlcmVuY2VzfVsyXSAlICMxIGhhbmdpbmctaWRlbnQsICMyIGVudHJ5IHNwYWNpbmcKIHslIGRvbid0IGluZGVudCBwYXJhZ3JhcGhzCiAgXHNldGxlbmd0aHtccGFyaW5kZW50fXswcHR9CiAgJSB0dXJuIG9uIGhhbmdpbmcgaW5kZW50IGlmIHBhcmFtIDEgaXMgMQogIFxpZm9kZCAjMQogIFxsZXRcb2xkcGFyXHBhcgogIFxkZWZccGFye1xoYW5naW5kZW50PVxjc2xoYW5naW5kZW50XG9sZHBhcn0KICBcZmkKICAlIHNldCBlbnRyeSBzcGFjaW5nCiAgXHNldGxlbmd0aHtccGFyc2tpcH17IzJcY3NsZW50cnlzcGFjaW5ndW5pdH0KIH0lCiB7fQpcdXNlcGFja2FnZXtjYWxjfQpcbmV3Y29tbWFuZHtcQ1NMQmxvY2t9WzFdeyMxXGhmaWxsXGJyZWFrfQpcbmV3Y29tbWFuZHtcQ1NMTGVmdE1hcmdpbn1bMV17XHBhcmJveFt0XXtcY3NsbGFiZWx3aWR0aH17IzF9fQpcbmV3Y29tbWFuZHtcQ1NMUmlnaHRJbmxpbmV9WzFde1xwYXJib3hbdF17XGxpbmV3aWR0aCAtIFxjc2xsYWJlbHdpZHRofXsjMX1cYnJlYWt9ClxuZXdjb21tYW5ke1xDU0xJbmRlbnR9WzFde1xoc3BhY2V7XGNzbGhhbmdpbmRlbnR9IzF9CiRlbmRpZiQKXHByb3ZpZGVjb21tYW5ke1x0aWdodGxpc3R9eyUKICBcc2V0bGVuZ3Roe1xpdGVtc2VwfXswcHR9XHNldGxlbmd0aHtccGFyc2tpcH17MHB0fX0KXHRpdGxleyR0aXRsZSR9CgoKJSBJdGVyYXRlIHRocm91Z2ggdGhlIGF1dGhvcnMgZXhjZXB0IGxhc3QgdG8gYWRkIFxBbmQuIAoKXGF1dGhvcnslCiRmb3IoYXV0aG9ycy9hbGxidXRsYXN0KSQKICAkYXV0aG9ycy5uYW1lJFxcJGF1dGhvcnMuYWZmaWxpYXRpb24kXFwkYXV0aG9ycy5pbnN0aXR1dGlvbiRcXCRhdXRob3JzLmVtYWlsJFxcJGF1dGhvcnMuYWRkcmVzcyQgXEFuZAokZW5kZm9yJAokZm9yKGF1dGhvcnMvbGFzdCkkCiAgJGF1dGhvcnMubmFtZSRcXCRhdXRob3JzLmFmZmlsaWF0aW9uJFxcJGF1dGhvcnMuaW5zdGl0dXRpb24kXFwkYXV0aG9ycy5lbWFpbCRcXCRhdXRob3JzLmFkZHJlc3MkCiRlbmRmb3IkCn0KCiUgXGF1dGhvcnslCiUgICBEYXZpZCBTLn5IaXBwb2NhbXB1cyBcXAolICAgRGVwYXJ0bWVudCBvZiBDb21wdXRlciBTY2llbmNlXFwKJSAgIENyYW5iZXJyeS1MZW1vbiBVbml2ZXJzaXR5XFwKJSAgIFBpdHRzYnVyZ2gsIFBBIDE1MjEzIFxcCiUgICBcdGV4dHR0e2hpcHBvQGNzLmNyYW5iZXJyeS1sZW1vbi5lZHV9IFxcCiUgICAlIGV4YW1wbGVzIG9mIG1vcmUgYXV0aG9ycwolICAgJSBcQW5kCiUgICAlIENvYXV0aG9yIFxcCiUgICAlIEFmZmlsaWF0aW9uIFxcCiUgICAlIEFkZHJlc3MgXFwKJSAgICUgXHRleHR0dHtlbWFpbH0gXFwKJSAgICUgXEFORAolICAgJSBDb2F1dGhvciBcXAolICAgJSBBZmZpbGlhdGlvbiBcXAolICAgJSBBZGRyZXNzIFxcCiUgICAlIFx0ZXh0dHR7ZW1haWx9IFxcCiUgICAlIFxBbmQKJSAgICUgQ29hdXRob3IgXFwKJSAgICUgQWZmaWxpYXRpb24gXFwKJSAgICUgQWRkcmVzcyBcXAolICAgJSBcdGV4dHR0e2VtYWlsfSBcXAolICAgJSBcQW5kCiUgICAlIENvYXV0aG9yIFxcCiUgICAlIEFmZmlsaWF0aW9uIFxcCiUgICAlIEFkZHJlc3MgXFwKJSAgICUgXHRleHR0dHtlbWFpbH0gXFwKJSB9CgoKXGJlZ2lue2RvY3VtZW50fQoKClxtYWtldGl0bGUKCgpcYmVnaW57YWJzdHJhY3R9CiAgJGlmKGFic3RyYWN0KSQKICAkYWJzdHJhY3QkCiAgJGVsc2UkCiAgQWRkIHlvdXIgYWJzdHJhY3QgYXQgdGhlIGJlZ2lubmluZyBvZiB5b3VyIG1hcmtkb3duIGZpbGUgbGlrZSB0aGlzIAogIFxiZWdpbnt2ZXJiYXRpbX0KICAtLS0gCiAgdGl0bGU6ICJZb3VyIFRpdGxlIiAKICBhYnN0cmFjdDogInlvdXIgYWJzdHJhY3QgaGVyZSIKICBhdXRob3JzOgogIC0gbmFtZTogTGVvbmFyZG8gVi4gQ2FzdG9yaW5hCiAgICBhZmZpbGlhdGlvbjogU2Nob29sIG9mIEluZm9ybWF0aWNzCiAgICBpbnN0aXR1dGlvbjogVW5pdmVyc2l0eSBvZiBFZGluYnVyZ2gKICAgIGVtYWlsOiBqdXN0YW5lbWFpbEBkb21haW4uZXh0CiAgICBhZGRyZXNzOiBFZGluYnVyZ2gKICAtIG5hbWU6IENvYXV0aG9yCiAgICBhZmZpbGlhdGlvbjogQWZmaWxpYXRpb24KICAgIGluc3RpdHV0aW9uOiBJbnN0aXR1dGlvbgogICAgZW1haWw6IGNvYXV0aG9yQGV4YW1wbGUuY29tCiAgICBhZGRyZXNzOiBBZGRyZXNzCiAgLS0tCiAgXGVuZHt2ZXJiYXRpbX0KICBUaGlzIGlzIGNhbGxlZCBZQU1MIGZyb250bWF0dGVyLiBJZiB5b3Ugc2V0IHlvdXIgYWJzdHJhY3QgY29ycmVjdGx5IHlvdSBzaG91bGQgbm90IHNlZSB0aGlzIG1lc3NhZ2UuCiAgJGVuZGlmJApcZW5ke2Fic3RyYWN0fQoKCiRib2R5JAoKJSUlJSUlJSUlJSUlJSUlJSUlJSUlJSUlJSUlJSUlJSUlJSUlJSUlJSUlJSUlJSUlJSUlJSUlJSUlJSUlCgoKXGVuZHtkb2N1bWVudH0="),e=>e.charCodeAt(0)),pa=Object.freeze(Object.defineProperty({__proto__:null,default:ha},Symbol.toStringTag,{value:"Module"})),Ml=(e,l)=>[e,Object.entries(l).map(([t,n])=>[t.substring(e.length+3),n.default])],Ol=[Ml("lua",Object.assign({"../lua/citefilter.lua":na,"../lua/markdown+hugo.lua":ia,"../lua/markdown.lua":oa,"../lua/math_block.lua":ra,"../lua/pdf.lua":ga,"../lua/polyfill.lua":Za,"../lua/url.lua":ua})),Ml("textemplate",Object.assign({"../textemplate/dissertation.tex":Ia,"../textemplate/neurips.sty":Wa,"../textemplate/neurips.tex":pa}))];class Xa extends Ie.Plugin{constructor(l,t){super(l,t),this.lang=Gn.current,this.saveSettings=Ie.debounce(this.saveSettings.bind(this),1e3,!0)}async onload(){await this.releaseResources(),await this.loadSettings();const{lang:l}=this;this.addSettingTab(new ta(this)),this.addCommand({id:"obsidian-enhancing-export:export",name:l.exportToOo,icon:"document",callback:()=>{const t=this.app.workspace.getActiveFile();t?Qt.show(this,t):new Ie.Notice(l.pleaseOpenFile,2e3)}}),this.addCommand({id:"obsidian-enhancing-export:export-with-previous",name:l.exportWithPrevious,icon:"document",callback:async()=>{const t=this.app.workspace.getActiveFile();if(t){if(this.settings.lastExportType&&this.settings.lastExportDirectory){const n=this.settings.items.find(c=>c.name===this.settings.lastExportType);if(n){await Vn(this,t,de(this.settings.lastExportDirectory),void 0,n);return}}Qt.show(this,t)}else new Ie.Notice(l.pleaseOpenFile,2e3)}}),this.registerEvent(this.app.workspace.on("file-menu",(t,n)=>{n instanceof Ie.TFile&&t.addItem(c=>{c.setTitle(l.exportToOo).setIcon("document").onClick(()=>{Qt.show(this,n)})}).addSeparator()}))}async resetSettings(){this.settings={...JSON.parse(JSON.stringify(Le)),lastExportDirectory:this.settings.lastExportDirectory},await this.saveSettings()}async loadSettings(){const l=Object.assign({},Le,await this.loadData());l.items.forEach(t=>{Object.assign(t,Object.assign({},Le.items.find(n=>n.name===t.name)??{},t))});for(const t of Le.items)l.items.every(n=>n.name!==t.name)&&l.items.push(t);this.settings=l}async saveSettings(){console.log("[obsidian-enhancing-export] saveSettings",this.settings);const l=JSON.parse(JSON.stringify(this.settings));if(l.items.forEach(t=>{const n=Le.items.find(c=>c.name===t.name);n&&Object.keys(t).forEach(c=>{c!=="name"&&JSON.stringify(t[c])===JSON.stringify(n[c])&&delete t[c]})}),l.env)for(const t of Object.keys(l.env)){const n=l.env[t];if(JSON.stringify(n)===JSON.stringify(De[t])){delete l.env[t];continue}const c=de(De,t);for(const[i,o]of Object.entries(n))o===c[i]&&delete n[i];Object.keys(n).length===0&&delete l.env[t]}await this.saveData(l)}async releaseResources(){const{adapter:l}=this.app.vault;for(const[t,n]of Ol){const c=ae.join(this.manifest.dir,t);await l.mkdir(c);for(const[i,o]of n){const s=ae.join(c,i);await l.writeBinary(s,o)}}Ol.length=0}}exports.default=Xa;
diff --git a/.obsidian/plugins/obsidian-enhancing-export/manifest.json b/.obsidian/plugins/obsidian-enhancing-export/manifest.json
new file mode 100644
index 000000000..2266a54c7
--- /dev/null
+++ b/.obsidian/plugins/obsidian-enhancing-export/manifest.json
@@ -0,0 +1,10 @@
+{
+  "id": "obsidian-enhancing-export",
+  "name": "Enhancing Export",
+  "version": "1.10.7",
+  "minAppVersion": "1.6.3",
+  "description": "This is a enhancing export plugin for Obsidian. It allows to export to formats like Html, DOCX, ePub and PDF or Markdown(Hugo) etc.",
+  "author": "YISH",
+  "authorUrl": "https://github.com/mokeyish",
+  "isDesktopOnly": true
+}
\ No newline at end of file
diff --git a/.obsidian/plugins/obsidian-enhancing-export/styles.css b/.obsidian/plugins/obsidian-enhancing-export/styles.css
new file mode 100644
index 000000000..ff46f3269
--- /dev/null
+++ b/.obsidian/plugins/obsidian-enhancing-export/styles.css
@@ -0,0 +1 @@
+.setting-item.ex-setting-item{border-top:unset;padding-top:0}*[hidden]{display:none}
diff --git a/.obsidian/workspace.json b/.obsidian/workspace.json
index ab109d90a..83aa106f9 100755
--- a/.obsidian/workspace.json
+++ b/.obsidian/workspace.json
@@ -216,6 +216,7 @@
   },
   "active": "b7cb36aca2a5c90a",
   "lastOpenFiles": [
+    "200. Library Papers/My Library.bib",
     "200. Library Papers/maccaroneADVANCEDREACTORCYBER.md",
     "101. Current Writing/ARCADE Implementation at the University of Pittsburgh.md",
     "100. Managerial Pages/2. (SR-CIST) Workshop on Security and Resiliency of Critical Infrastructure and Space Technologies.md",
@@ -248,7 +249,6 @@
     "2. Cole Group Meeting Notes/Weekly Note 2024-08-21.md",
     "1. Daily Notes/2024/8. August/2024-08-23.md",
     "Zotero Web Sever.md",
-    "3-99 Research/7. BeagleBone/2. pymodbus On the BeagleBone.md",
     "3-99 Research",
     "300s School",
     "4. Qualifying Exam/2. Writing",
diff --git a/200. Library Papers/My Library.bib b/200. Library Papers/My Library.bib
new file mode 100644
index 000000000..f0a67b5e4
--- /dev/null
+++ b/200. Library Papers/My Library.bib	
@@ -0,0 +1,12633 @@
+@misc{20222023CriteriaAccrediting,
+  title = {2022-2023 {{Criteria}} for {{Accrediting Engineering Programs}}},
+  organization = {ABET Eningeering Accreditation Commission},
+  file = {/home/danesabo/Zotero/storage/GJ6JTCN3/2022-23-EAC-Criteria.pdf}
+}
+
+@online{2023NationalCybersecurity,
+  title = {2023 {{National Cybersecurity Education Colloquium}} | {{CAE Community}}},
+  url = {https://www.caecommunity.org/about-us/cae-cybersecurity-community/event-programs/2023-national-cybersecurity-education},
+  urldate = {2023-11-07},
+  file = {/home/danesabo/Zotero/storage/NKDJMYQZ/2023-national-cybersecurity-education.html}
+}
+
+@online{220900796Diffusion,
+  title = {[2209.00796] {{Diffusion Models}}: {{A Comprehensive Survey}} of {{Methods}} and {{Applications}}},
+  url = {https://arxiv.org/abs/2209.00796},
+  urldate = {2023-10-10},
+  file = {/home/danesabo/Zotero/storage/FWCR67DB/2209.html}
+}
+
+@article{abadiApproximateCalculationRoots2016,
+  title = {The {{Approximate Calculation}} of the {{Roots}} of {{Algebraic Equation Through Monte Carlo Method}}},
+  author = {Abadi, Vahid Mirzaei Mahmoud and Bahnamriri, Shila Banari},
+  date = {2016},
+  journaltitle = {International Journal of Mathematics and Computational Science},
+  volume = {2},
+  number = {3},
+  pages = {64--68},
+  abstract = {Finding the root of nonlinear algebraic equations is an issue usually found in engineering and sciences. This article presents a new method for the approximate calculation of the roots of a one-variable function through Monte Carlo Method. This method is actually based on the production of a random number in the target range of the root. Finally, some examples with acceptable error are provided to prove the efficiency of this method.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/VLGNUYZP/Abadi and Bahnamriri - The Approximate Calculation of the Roots of Algebr.pdf}
+}
+
+@book{abelsonStructureInterpretationComputer2022,
+  title = {Structure and Interpretation of Computer Programs},
+  author = {Abelson, Harold and Sussman, Gerald Jay and Sussman, Julie and Henz, Martin and Wrigstad, Tobias},
+  date = {2022},
+  series = {{{MIT}} Electrical Engineering and Computer Science Series},
+  edition = {JavaScript edition},
+  publisher = {The MIT Press},
+  location = {Cambridge, Massachusetts},
+  abstract = {"This classic text teaches fundamental principles of computer programming, including recursion, abstraction, modularity, and programming language design and implementation. The approach focuses on discovering general patterns for solving specific problems, and building software systems that make use of those patterns. This version uses JavaScript as the language of instruction"--},
+  isbn = {978-0-262-54323-1},
+  langid = {english},
+  pagetotal = {608},
+  file = {/home/danesabo/Zotero/storage/KZSJSUKD/Abelson et al. - 2022 - Structure and interpretation of computer programs.pdf}
+}
+
+@online{AbstractJulia,
+  title = {{{AbstractJulia}}},
+  url = {https://www.algebraicjulia.org/}
+}
+
+@online{adamsTypeTheoryProbabilistic2015,
+  title = {A {{Type Theory}} for {{Probabilistic}} and {{Bayesian Reasoning}}},
+  author = {Adams, Robin and Jacobs, Bart},
+  date = {2015-11-30},
+  eprint = {1511.09230},
+  eprinttype = {arXiv},
+  eprintclass = {cs, math},
+  doi = {10.48550/arXiv.1511.09230},
+  url = {http://arxiv.org/abs/1511.09230},
+  urldate = {2024-02-06},
+  abstract = {This paper introduces a novel type theory and logic for probabilistic reasoning. Its logic is quantitative, with fuzzy predicates. It includes normalisation and conditioning of states. This conditioning uses a key aspect that distinguishes our probabilistic type theory from quantum type theory, namely the bijective correspondence between predicates and side-effect free actions (called instrument, or assert, maps). The paper shows how suitable computation rules can be derived from this predicate-action correspondence, and uses these rules for calculating conditional probabilities in two well-known examples of Bayesian reasoning in (graphical) models. Our type theory may thus form the basis for a mechanisation of Bayesian inference.},
+  pubstate = {prepublished},
+  keywords = {Computer Science - Logic in Computer Science,F.3.1,F.4.1,G.3,Mathematics - Logic,Mathematics - Probability},
+  file = {/home/danesabo/Zotero/storage/UN44SM33/Adams and Jacobs - 2015 - A Type Theory for Probabilistic and Bayesian Reasoning.pdf}
+}
+
+@article{adiegoBringingAutomatedModel2014,
+  title = {Bringing {{Automated Model Checking}} to {{PLC Program Development}} — {{A CERN Case Study}} —},
+  author = {Adiego, Borja Fernández and Darvas, Dániel and Tournier, Jean-Charles and Viñuela, Enrique Blanco and Suárez, Víctor M. González},
+  date = {2014},
+  journaltitle = {IFAC Proceedings Volumes},
+  shortjournal = {IFAC Proceedings Volumes},
+  volume = {47},
+  number = {2},
+  pages = {394--399},
+  issn = {14746670},
+  doi = {10.3182/20140514-3-FR-4046.00051},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S1474667015374334},
+  urldate = {2023-10-10},
+  abstract = {Verification of critical software is a high priority but a challenging task for industrial control systems. Model checking appears to be an appropriate approach for this purpose. However, this technique is not widely used in industry yet, due to some obstacles. The main obstacles encountered when trying to apply formal verification techniques at industrial installations are the difficulty of creating models out of PLC programs and defining formally the specification requirements. In addition, models produced out of real-life programs have a huge state space, thus preventing the verification due to performance issues. Our work at CERN (European Organization for Nuclear Research) focuses on developing efficient automatic verification methods for industrial critical installations based on PLC (Programmable Logic Controller) control systems.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/6T7S8SNG/Adiego et al. - 2014 - Bringing Automated Model Checking to PLC Program D.pdf}
+}
+
+@report{agencyAssessmentManagementAgeing2007,
+  type = {Text},
+  title = {Assessment and {{Management}} of {{Ageing}} of {{Major Nuclear Power Plant Components Important}} to {{Safety}}: {{PWR Vessel Internals}}},
+  shorttitle = {Assessment and {{Management}} of {{Ageing}} of {{Major Nuclear Power Plant Components Important}} to {{Safety}}},
+  author = {Agency, International Atomic Energy},
+  date = {2007},
+  pages = {1--74},
+  institution = {International Atomic Energy Agency},
+  url = {https://www.iaea.org/publications/7740/assessment-and-management-of-ageing-of-major-nuclear-power-plant-components-important-to-safety-pwr-vessel-internals},
+  urldate = {2023-10-11},
+  isbn = {9789201051073},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/YGI9A6US/Agency - 2007 - Assessment and Management of Ageing of Major Nucle.pdf}
+}
+
+@article{ahmadi-javidPortfolioOptimizationEntropic2019,
+  title = {Portfolio Optimization with Entropic Value-at-Risk},
+  author = {Ahmadi-Javid, Amir and Fallah-Tafti, Malihe},
+  date = {2019-11},
+  journaltitle = {European Journal of Operational Research},
+  shortjournal = {European Journal of Operational Research},
+  volume = {279},
+  number = {1},
+  pages = {225--241},
+  issn = {03772217},
+  doi = {10.1016/j.ejor.2019.02.007},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0377221719301183},
+  urldate = {2024-01-26},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/RVPIQV5I/Ahmadi-Javid and Fallah-Tafti - 2019 - Portfolio optimization with entropic value-at-risk.pdf}
+}
+
+@article{ahmedTravelTimePrediction2021,
+  title = {Travel {{Time Prediction}} and {{Explanation}} with {{Spatio-Temporal Features}}: {{A Comparative Study}}},
+  shorttitle = {Travel {{Time Prediction}} and {{Explanation}} with {{Spatio-Temporal Features}}},
+  author = {Ahmed, Irfan and Kumara, Indika and Reshadat, Vahideh and Kayes, A. S. M. and Van Den Heuvel, Willem-Jan and Tamburri, Damian A.},
+  date = {2021-12-29},
+  journaltitle = {Electronics},
+  shortjournal = {Electronics},
+  volume = {11},
+  number = {1},
+  pages = {106},
+  issn = {2079-9292},
+  doi = {10.3390/electronics11010106},
+  url = {https://www.mdpi.com/2079-9292/11/1/106},
+  urldate = {2023-10-11},
+  abstract = {Travel time information is used as input or auxiliary data for tasks such as dynamic navigation, infrastructure planning, congestion control, and accident detection. Various data-driven Travel Time Prediction (TTP) methods have been proposed in recent years. One of the most challenging tasks in TTP is developing and selecting the most appropriate prediction algorithm. The existing studies that empirically compare different TTP models only use a few models with specific features. Moreover, there is a lack of research on explaining TTPs made by black-box models. Such explanations can help to tune and apply TTP methods successfully. To fill these gaps in the current TTP literature, using three data sets, we compare three types of TTP methods (ensemble tree-based learning, deep neural networks, and hybrid models) and ten different prediction algorithms overall. Furthermore, we apply XAI (Explainable Artificial Intelligence) methods (SHAP and LIME) to understand and interpret models’ predictions. The prediction accuracy and reliability for all models are evaluated and compared. We observed that the ensemble learning methods, i.e., XGBoost and LightGBM, are the best performing models over the three data sets, and XAI methods can adequately explain how various spatial and temporal features influence travel time.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/HJUMUC2Z/Ahmed et al. - 2021 - Travel Time Prediction and Explanation with Spatio.pdf}
+}
+
+@article{aldosariSecurityPrivacyChallenges2017,
+  title = {Security and {{Privacy Challenges}} in {{Cyber-Physical Systems}}},
+  author = {AlDosari, Fahd},
+  date = {2017-10-13},
+  journaltitle = {Journal of Information Security},
+  volume = {8},
+  number = {4},
+  pages = {285--295},
+  publisher = {Scientific Research Publishing},
+  doi = {10.4236/jis.2017.84019},
+  url = {https://www.scirp.org/journal/paperinformation.aspx?paperid=79607},
+  urldate = {2023-09-27},
+  abstract = {Cyber-Physical Systems, or Smart-Embedded Systems, are co-engineered for the integration of physical, computational and networking resources. These resources are used to develop an efficient base for enhancing the quality of services in all areas of life and achieving a classier lifestyle in terms of a required service’s functionality and timing. Cyber-Physical Systems (CPSs) complement the need to have smart products (e.g., homes, hospitals, airports, cities). In other words, regulate the three kinds of resources available: physical, computational, and networking. This regulation supports communication and interaction between the human word and digital word to find the required intelligence in all scopes of life, including Telecommunication, Power Generation and Distribution, and Manufacturing. Data Security is among the most important issues to be considered in recent technologies. Because Cyber-Physical Systems consist of interacting complex components and middle-ware, they face real challenges in being secure against cyber-attacks while functioning efficiently and without affecting or degrading their performance. This study gives a detailed description of CPSs, their challenges (including cyber-security attacks), characteristics, and related technologies. We also focus on the tradeoff between security and performance in CPS, and we present the most common Side Channel Attacks on the implementations of cryptographic algorithms (symmetric: AES and asymmetric: RSA) with the countermeasures against these attacks.},
+  issue = {4},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/F45KN94V/AlDosari - 2017 - Security and Privacy Challenges in Cyber-Physical .pdf}
+}
+
+@article{alguliyevCyberphysicalSystemsTheir2018,
+  title = {Cyber-Physical Systems and Their Security Issues},
+  author = {Alguliyev, Rasim and Imamverdiyev, Yadigar and Sukhostat, Lyudmila},
+  date = {2018-09},
+  journaltitle = {Computers in Industry},
+  shortjournal = {Computers in Industry},
+  volume = {100},
+  pages = {212--223},
+  issn = {01663615},
+  doi = {10.1016/j.compind.2018.04.017},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0166361517304244},
+  urldate = {2023-10-11},
+  abstract = {The creation of cyber-physical systems posed new challenges for people. Ensuring the information security of cyber-physical systems is one of the most complex problems in a wide range of defenses against cyber-attacks. The aim of this paper is to analyse and classify existing research papers on the security of cyber-physical systems. Philosophical issues of cyber-physical systems are raised. Their influence on the aspects of people's lives is investigated. The principle of cyber-physical system operation is described. The main difficulties and solutions in the estimation of the consequences of cyber-attacks, attacks modeling and detection and the development of security architecture are noted. The main types of attacks and threats against cyber-physical systems are analysed. A tree of attacks on cyber-physical systems is proposed. The future research directions are shown.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/H46P7GAA/Alguliyev et al. - 2018 - Cyber-physical systems and their security issues.pdf}
+}
+
+@article{allisonSpecialIssueArtificial2022,
+  title = {Special {{Issue}}: {{Artificial Intelligence}} and {{Engineering Design}}},
+  shorttitle = {Special {{Issue}}},
+  editor = {Allison, James T. and Cardin, Michel-Alexandre and McComb, Chris and Ren, Max Yi and Selva, Daniel and Tucker, Conrad and Witherell, Paul and Zhao, Yaoyao Fiona},
+  date = {2022-01-11},
+  journaltitle = {Journal of Mechanical Design},
+  shortjournal = {Journal of Mechanical Design},
+  volume = {144},
+  number = {2},
+  issn = {1050-0472},
+  doi = {10.1115/1.4053111},
+  url = {https://doi.org/10.1115/1.4053111},
+  urldate = {2022-05-02},
+  abstract = {Artificial intelligence (AI) has had a strong presence in engineering design for decades, and while theory, methods, and tools for engineering design have advanced significantly during this time, many grand challenges remain. Modern advancements in AI, including new strategies for capturing, storing, and analyzing data, have the potential to revolutionize engineering design processes in a variety of ways. The purpose of this special issue is to consolidate recent research activities that utilize existing or new AI methods to advance engineering design knowledge and capabilities.During the conception of this special issue, we identified three core interfaces between the research domains of engineering design and AI: (1) leveraging AI methods directly in engineering design methods, (2) creating new AI capabilities that are inspired by unique challenges that arise in engineering design, and (3) creating and analyzing design methods that are tailored for the design of engineering systems where the systems themselves utilize AI, such as autonomous vehicles. The diverse body of research articles that now comprise this special issue gravitate toward the first of these themes: advancing engineering design capability through the use of AI. While these articles are an exciting contribution to the design research literature, significant opportunities exist for more fully exploring the remaining two interfaces, ideally through more unified interdisciplinary efforts. During the process of synthesizing this editorial, we recognized a fourth interface between engineering design and AI: specifically, investigating how AI could be used as an increasingly powerful tool for conducting engineering design research, such as AI tools that are used directly in research activities (e.g., experiment planning or gathering information from human designers) and that are not necessarily part of the designed system or the design method.},
+  file = {/home/danesabo/Zotero/storage/89PHIVBR/Allison et al. - 2022 - Special Issue Artificial Intelligence and Enginee.pdf;/home/danesabo/Zotero/storage/JKNBDBFH/Special-Issue-Artificial-Intelligence-and.html}
+}
+
+@online{AllLeanBooks,
+  title = {All {{Lean Books And Where To Find Them}}},
+  url = {https://lakesare.brick.do/all-lean-books-and-where-to-find-them-x2nYwjM3AwBQ},
+  urldate = {2024-03-20},
+  abstract = {Respecting traditions of the city I\&\#39;m currently in This could have been a classic \&quot;Awesome Lean\&quot; repo (like this), however I\&\#39;d much prefer reading subjective o...},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/7SKQYER4/all-lean-books-and-where-to-find-them-x2nYwjM3AwBQ.html}
+}
+
+@online{AllLeanBooksa,
+  title = {All {{Lean Books And Where To Find Them}}},
+  url = {https://lakesare.brick.do/all-lean-books-and-where-to-find-them-x2nYwjM3AwBQ},
+  urldate = {2024-03-20},
+  abstract = {Respecting traditions of the city I\&\#39;m currently in This could have been a classic \&quot;Awesome Lean\&quot; repo (like this), however I\&\#39;d much prefer reading subjective o...},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/AAJTKRQW/all-lean-books-and-where-to-find-them-x2nYwjM3AwBQ.html}
+}
+
+@misc{altenkirchWhyDependentTypes2005,
+  title = {Why {{Dependent Types Matter}}},
+  author = {Altenkirch, Thorsten and McBride, Conor and McKinna, James},
+  date = {2005},
+  abstract = {We exhibit the rationale behind the design of Epigram, a dependently typed programming language and interactive program development system, using refinements of a well known program—merge sort—as a running example. We discuss its relationship with other proposals to introduce aspects of dependent types into functional programming languages and sketch some topics for further work in this area.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/7XZGH5HR/Altenkirch et al. - Why Dependent Types Matter.pdf}
+}
+
+@article{althoffARCHCOMP17CategoryReport,
+  title = {{{ARCH-COMP17 Category Report}}: {{Continuous}} and {{Hybrid Systems}} with {{Linear Continuous Dynamics}}},
+  author = {Althoff, Matthias and Bak, Stanley and Cattaruzza, Dario and Chen, Xin and Frehse, Goran and Ray, Rajarshi and Schupp, Stefan},
+  abstract = {This report presents the results of a friendly competition for formal verification of continuous and hybrid systems with linear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2017. In its first edition, seven tools have been applied to solve three different benchmark problems in the category for linear continuous dynamics (in alphabetical order): Axelerator, CORA, Flow*, HyDRA, Hylaa, SpaceEx, and XSpeed. The result is a snapshot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results probably provide the most complete assessment of tools for the safety verification of continuous and hybrid systems with linear continuous dynamics up to this date.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/W4V5JYRK/Althoff et al. - ARCH-COMP17 Category Report Continuous and Hybrid.pdf}
+}
+
+@article{althoffARCHCOMP19CategoryReport,
+  title = {{{ARCH-COMP19 Category Report}}: {{Continuous}} and {{Hybrid Systems}} with {{Linear Continuous Dynamics}}},
+  author = {Althoff, Matthias and Bak, Stanley and Forets, Marcelo and Frehse, Goran and Ray, Rajarshi and Schilling, Christian and Schupp, Stefan},
+  abstract = {This report presents the results of a friendly competition for formal verification of continuous and hybrid systems with linear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2019. In its third edition, seven tools have been applied to solve six different benchmark problems in the category for linear continuous dynamics (in alphabetical order): CORA, CORA/SX, HyDRA, Hylaa, JuliaReach, SpaceEx, and XSpeed. This report is a snapshot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results provide one of the most complete assessments of tools for the safety verification of continuous and hybrid systems with linear continuous dynamics up to this date.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/MPCEW5TU/Althoff et al. - ARCH-COMP19 Category Report Continuous and Hybrid.pdf}
+}
+
+@inproceedings{althoffIntroductionCORA2015,
+  title = {An {{Introduction}} to {{CORA}} 2015},
+  author = {Althoff, Matthias},
+  pages = {120--87},
+  doi = {10.29007/zbkv},
+  url = {https://easychair.org/publications/paper/xMm},
+  urldate = {2023-10-30},
+  abstract = {The philosophy, architecture, and capabilities of the COntinuous Reachability Analyzer (CORA) are presented. CORA is a toolbox that integrates various vector and matrix set representations and operations on them as well as reachability algorithms of various dynamic system classes. The software is designed such that set representations can be exchanged without having to modify the code for reachability analysis. CORA has a modular design, making it possible to use the capabilities of the various set representations for other purposes besides reachability analysis. The toolbox is designed using the object oriented paradigm, such that users can safely use methods without concerning themselves with detailed information hidden inside the object. Since the toolbox is written in MATLAB, the installation and use is platform independent.},
+  eventtitle = {{{ARCH14-15}}. 1st and 2nd {{International Workshop}} on {{Applied veRification}} for {{Continuous}} and {{Hybrid Systems}}},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/WHU9AQL8/Althoff - An Introduction to CORA 2015.pdf}
+}
+
+@inproceedings{althoffReachabilityAnalysisNonlinear2013,
+  title = {Reachability Analysis of Nonlinear Systems Using Conservative Polynomialization and Non-Convex Sets},
+  booktitle = {Proceedings of the 16th International Conference on {{Hybrid}} Systems: Computation and Control},
+  author = {Althoff, Matthias},
+  date = {2013-04-08},
+  series = {{{HSCC}} '13},
+  pages = {173--182},
+  publisher = {Association for Computing Machinery},
+  location = {New York, NY, USA},
+  doi = {10.1145/2461328.2461358},
+  url = {https://dl.acm.org/doi/10.1145/2461328.2461358},
+  urldate = {2023-11-01},
+  abstract = {A new technique for computing the reachable set of hybrid systems with nonlinear continuous dynamics is presented. Previous work showed that abstracting the nonlinear continuous dynamics to linear differential inclusions results in a scalable approach for reachability analysis. However, when the abstraction becomes inaccurate, linearization techniques require splitting of reachable sets, resulting in an exponential growth of required linearizations. In this work, the nonlinearity of the dynamics is more accurately abstracted to polynomial difference inclusions. As a consequence, it is no longer guaranteed that reachable sets of consecutive time steps are mapped to convex sets as typically used in previous works. Thus, a non-convex set representation is developed in order to better capture the nonlinear dynamics, requiring no or much less splitting. The new approach has polynomial complexity with respect to the number of continuous state variables when splitting can be avoided and is thus promising when a linearization technique requires splitting for the same problem. The benefits are presented by numerical examples.},
+  isbn = {978-1-4503-1567-8},
+  file = {/home/danesabo/Zotero/storage/5YDEK8AF/Althoff - 2013 - Reachability analysis of nonlinear systems using c.pdf}
+}
+
+@article{althoffSetPropagationTechniques2021,
+  title = {Set {{Propagation Techniques}} for {{Reachability Analysis}}},
+  author = {Althoff, Matthias and Frehse, Goran and Girard, Antoine},
+  date = {2021},
+  journaltitle = {Annual Review of Control, Robotics, and Autonomous Systems},
+  volume = {4},
+  number = {1},
+  pages = {369--395},
+  doi = {10.1146/annurev-control-071420-081941},
+  url = {https://doi.org/10.1146/annurev-control-071420-081941},
+  urldate = {2023-11-03},
+  abstract = {Reachability analysis consists in computing the set of states that are reachable by a dynamical system from all initial states and for all admissible inputs and parameters. It is a fundamental problem motivated by many applications in formal verification, controller synthesis, and estimation, to name only a few. This article focuses on a class of methods for computing a guaranteed overapproximation of the reachable set of continuous and hybrid systems, relying predominantly on set propagation; starting from the set of initial states, these techniques iteratively propagate a sequence of sets according to the system dynamics. After a review of set representation and computation, the article presents the state of the art of set propagation techniques for reachability analysis of linear, nonlinear, and hybrid systems. It ends with a discussion of successful applications of reachability analysis to real-world problems.},
+  file = {/home/danesabo/Zotero/storage/2JEKRTF9/Althoff et al. - 2021 - Set Propagation Techniques for Reachability Analys.pdf}
+}
+
+@article{alvarezComputationallyEfficientConvolved2011,
+  title = {Computationally {{Efficient Convolved Multiple Output Gaussian Processes}}},
+  author = {Alvarez, Mauricio A. and Lawrence, Neil D.},
+  date = {2011-05},
+  journaltitle = {Journal of Machine Learning Research},
+  shortjournal = {J. Mach. Learn. Res.},
+  volume = {12},
+  pages = {1459--1500},
+  publisher = {Microtome Publ},
+  location = {Brookline},
+  issn = {1532-4435},
+  url = {https://www.webofscience.com/wos/woscc/full-record/WOS:000292304000002},
+  urldate = {2022-04-18},
+  abstract = {Recently there has been an increasing interest in regression methods that deal with multiple outputs. This has been motivated partly by frameworks like multitask learning, multisensor networks or structured output data. From a Gaussian processes perspective, the problem reduces to specifying an appropriate covariance function that, whilst being positive semi-definite, captures the dependencies between all the data points and across all the outputs. One approach to account for non-trivial correlations between outputs employs convolution processes. Under a latent function interpretation of the convolution transform we establish dependencies between output variables. The main drawbacks of this approach are the associated computational and storage demands. In this paper we address these issues. We present different efficient approximations for dependent output Gaussian processes constructed through the convolution formalism. We exploit the conditional independencies present naturally in the model. This leads to a form of the covariance similar in spirit to the so called PITC and FITC approximations for a single output. We show experimental results with synthetic and real data, in particular, we show results in school exams score prediction, pollution prediction and gene expression data.},
+  langid = {english},
+  annotation = {WOS:000292304000002}
+}
+
+@thesis{alvarezConvolvedGaussianProcess2011,
+  type = {phdthesis},
+  title = {Convolved {{Gaussian}} Process Priors for Multivariate Regression with Applications to Dynamical Systems},
+  author = {Alvarez, Mauricio A.},
+  date = {2011},
+  institution = {The University of Manchester (United Kingdom)},
+  location = {England},
+  url = {https://www.proquest.com/docview/1782840564/abstract/9A1A9FA2918E4C98PQ/1},
+  urldate = {2022-04-18},
+  abstract = {In this thesis we address the problem of modeling correlated outputs using Gaussian process priors. Applications of modeling correlated outputs include the joint prediction of pollutant metals in geostatistics and multitask learning in machine learning. Defining a Gaussian process prior for correlated outputs translates into specifying a suitable covariance function that captures dependencies between the different output variables. Classical models for obtaining such a covariance function include the linear model of coregionalization and process convolutions. We propose a general framework for developing multiple output covariance functions by performing convolutions between smoothing kernels particular to each output and covariance functions that are common to all outputs. Both the linear model of coregionalization and the process convolutions turn out to be special cases of this framework. Practical aspects of the proposed methodology are studied in this thesis. They involve the use of domain-specific knowledge for defining relevant smoothing kernels, efficient approximations for reducing computational complexity and a novel method for establishing a general class of nonstationary covariances with applications in robotics and motion capture data.Reprints of the publications that appear at the end of this document, report case studies and experimental results in sensor networks, geostatistics and motion capture data that illustrate the performance of the different methods proposed.},
+  isbn = {9781073277582},
+  langid = {english},
+  pagetotal = {225},
+  file = {/home/danesabo/Zotero/storage/VUMQE42J/Alvarez - Convolved Gaussian process priors for multivariate.pdf}
+}
+
+@unpublished{alvarezKernelsVectorValuedFunctions2012,
+  title = {Kernels for {{Vector-Valued Functions}}: A {{Review}}},
+  shorttitle = {Kernels for {{Vector-Valued Functions}}},
+  author = {Alvarez, Mauricio A. and Rosasco, Lorenzo and Lawrence, Neil D.},
+  date = {2012-04-16},
+  eprint = {1106.6251},
+  eprinttype = {arXiv},
+  eprintclass = {cs, math, stat},
+  url = {http://arxiv.org/abs/1106.6251},
+  urldate = {2022-04-18},
+  abstract = {Kernel methods are among the most popular techniques in machine learning. From a frequentist/discriminative perspective they play a central role in regularization theory as they provide a natural choice for the hypotheses space and the regularization functional through the notion of reproducing kernel Hilbert spaces. From a Bayesian/generative perspective they are the key in the context of Gaussian processes, where the kernel function is also known as the covariance function. Traditionally, kernel methods have been used in supervised learning problem with scalar outputs and indeed there has been a considerable amount of work devoted to designing and learning kernels. More recently there has been an increasing interest in methods that deal with multiple outputs, motivated partly by frameworks like multitask learning. In this paper, we review different methods to design or learn valid kernel functions for multiple outputs, paying particular attention to the connection between probabilistic and functional methods.},
+  version = {2},
+  file = {/home/danesabo/Zotero/storage/BPTTELCZ/Alvarez et al. - 2012 - Kernels for Vector-Valued Functions a Review.pdf;/home/danesabo/Zotero/storage/FZWKD3F6/1106.html}
+}
+
+@inproceedings{alvarezLatentForceModels2009,
+  title = {Latent {{Force Models}}},
+  booktitle = {Proceedings of the {{Twelth International Conference}} on {{Artificial Intelligence}} and {{Statistics}}},
+  author = {Álvarez, Mauricio and Luengo, David and Lawrence, Neil D.},
+  date = {2009-04-15},
+  pages = {9--16},
+  publisher = {PMLR},
+  issn = {1938-7228},
+  url = {https://proceedings.mlr.press/v5/alvarez09a.html},
+  urldate = {2022-04-20},
+  abstract = {Purely data driven approaches for machine learning present difficulties when data is scarce relative to the complexity of the model or when the model is forced to extrapolate. On the other hand, purely mechanistic approaches  need to identify and specify all the interactions in the problem at hand (which  may not be feasible) and still leave the issue of how to parameterize the system. In this paper, we present a hybrid approach using Gaussian processes and differential equations to combine data driven modeling with a physical model of the system. We show how different, physically-inspired, kernel functions  can be developed through sensible, simple, mechanistic assumptions about the underlying system. The versatility of our approach is illustrated with three case studies from computational biology, motion capture and geostatistics.},
+  eventtitle = {Artificial {{Intelligence}} and {{Statistics}}},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/3R3NEMA9/Álvarez et al. - 2009 - Latent Force Models.pdf}
+}
+
+@book{alwanTheoryHybridSystems2018,
+  title = {Theory of {{Hybrid Systems}}: {{Deterministic}} and {{Stochastic}}},
+  shorttitle = {Theory of {{Hybrid Systems}}},
+  author = {Alwan, Mohamad S. and Liu, Xinzhi},
+  date = {2018},
+  series = {Nonlinear {{Physical Science}}},
+  edition = {1st ed. 2018},
+  publisher = {Springer Singapore : Imprint: Springer},
+  location = {Singapore},
+  doi = {10.1007/978-981-10-8046-3},
+  abstract = {This book is the first to present the application of the hybrid system theory to systems with EPCA (equations with piecewise continuous arguments). The hybrid system paradigm is a valuable modeling tool for describing a wide range of real-world applications. Moreover, although new technology has produced, and continues to produce highly hierarchical sophisticated machinery that cannot be analyzed as a whole system, hybrid system representation can be used to reduce the structural complexity of these systems. That is to say, hybrid systems have become a modeling priority, which in turn has led to the creation of a promising research field with several application areas. As such, the book explores recent developments in the area of deterministic and stochastic hybrid systems using the Lyapunov and Razumikhin-Lyapunov methods to investigate the systems' properties. It also describes properties such as stability, stabilization, reliable control, H-infinity optimal control, input-to-state stability (ISS)/stabilization, state estimation, and large-scale singularly perturbed systems},
+  isbn = {978-981-10-8046-3},
+  pagetotal = {1},
+  keywords = {Applications of Nonlinear Dynamics and Chaos Theory,Control and Systems Theory,Control engineering,Mathematical Methods in Physics,Mathematical physics,Mathematical Physics,Physics,Statistical physics,Statistical Physics and Dynamical Systems,System theory,Systems Theory Control},
+  note = {Introduction -- Analysis of Hybrid Systems -- Singularly Perturbed Systems (SPSs) -- Systems of Dierential Equations with Piecewise Continuous Arguments (EPCA): A Hybrid System Approach -- Reliable Control and State Estimation for Uncertain Impulsive Large-Scale Systems -- Stochastic Hybrid (Impulsive) Systems -- Stochastic Systems with EPCA -- Input-to-State Stability (ISS) for Stochastic Hybrid Systems -- Stability in Terms of Two Measures},
+  file = {/home/danesabo/Zotero/storage/EKCD8BZX/Alwan and Liu - 2018 - Theory of Hybrid Systems Deterministic and Stocha.pdf}
+}
+
+@article{aminiLearningRobustControl2020,
+  title = {Learning {{Robust Control Policies}} for {{End-to-End Autonomous Driving From Data-Driven Simulation}}},
+  author = {Amini, Alexander and Gilitschenski, Igor and Phillips, Jacob and Moseyko, Julia and Banerjee, Rohan and Karaman, Sertac and Rus, Daniela},
+  date = {2020-04},
+  journaltitle = {IEEE Robotics and Automation Letters},
+  volume = {5},
+  number = {2},
+  pages = {1143--1150},
+  issn = {2377-3766},
+  doi = {10.1109/LRA.2020.2966414},
+  url = {https://ieeexplore.ieee.org/abstract/document/8957584},
+  urldate = {2024-07-10},
+  abstract = {In this work, we present a data-driven simulation and training engine capable of learning end-to-end autonomous vehicle control policies using only sparse rewards. By leveraging real, human-collected trajectories through an environment, we render novel training data that allows virtual agents to drive along a continuum of new local trajectories consistent with the road appearance and semantics, each with a different view of the scene. We demonstrate the ability of policies learned within our simulator to generalize to and navigate in previously unseen real-world roads, without access to any human control labels during training. Our results validate the learned policy onboard a full-scale autonomous vehicle, including in previously un-encountered scenarios, such as new roads and novel, complex, near-crash situations. Our methods are scalable, leverage reinforcement learning, and apply broadly to situations requiring effective perception and robust operation in the physical world.},
+  eventtitle = {{{IEEE Robotics}} and {{Automation Letters}}},
+  keywords = {autonomous agents,Autonomous vehicles,data-driven simulation,Deep learning in robotics and automation,Engines,real world reinforcement learning,Roads,Semantics,Training,Training data,Trajectory},
+  file = {/home/danesabo/Zotero/storage/IN9RTZC2/Amini et al. - 2020 - Learning Robust Control Policies for End-to-End Au.pdf}
+}
+
+@article{amoahFormalModellingAnalysis2016,
+  title = {Formal Modelling and Analysis of {{DNP3}} Secure Authentication},
+  author = {Amoah, Raphael and Camtepe, Seyit and Foo, Ernest},
+  date = {2016-01},
+  journaltitle = {Journal of Network and Computer Applications},
+  shortjournal = {Journal of Network and Computer Applications},
+  volume = {59},
+  pages = {345--360},
+  issn = {10848045},
+  doi = {10.1016/j.jnca.2015.05.015},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S1084804515001228},
+  urldate = {2023-10-10},
+  abstract = {Supervisory Control and Data Acquisition (SCADA) systems are one of the key foundations of smart grids. The Distributed Network Protocol version 3 (DNP3) is a standard SCADA protocol designed to facilitate communications in substations and smart grid nodes. The protocol is embedded with a security mechanism called Secure Authentication (DNP3-SA). This mechanism ensures that end-to-end communication security is provided in substations. This paper presents a formal model for the behavioural analysis of DNP3-SA using Coloured Petri Nets (CPN). Our DNP3-SA CPN model is capable of testing and verifying various attack scenarios: modification, replay and spoofing, combined complex attack and mitigation strategies. Using the model has revealed a previously unidentified flaw in the DNP3-SA protocol that can be exploited by an attacker that has access to the network interconnecting DNP3 devices. An attacker can launch a successful attack on an outstation without possessing the pre-shared keys by replaying a previously authenticated command with arbitrary parameters. We propose an update to the DNP3-SA protocol that removes the flaw and prevents such attacks. The update is validated and verified using our CPN model proving the effectiveness of the model and importance of the formal protocol analysis.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/LDFHS85J/Amoah et al. - 2016 - Formal modelling and analysis of DNP3 secure authe.pdf}
+}
+
+@article{amoahSecuringDNP3Broadcast2016,
+  title = {Securing {{DNP3 Broadcast Communications}} in {{SCADA Systems}}},
+  author = {Amoah, Raphael and Camtepe, Seyit and Foo, Ernest},
+  date = {2016-08},
+  journaltitle = {IEEE Transactions on Industrial Informatics},
+  shortjournal = {IEEE Trans. Ind. Inf.},
+  volume = {12},
+  number = {4},
+  pages = {1474--1485},
+  issn = {1551-3203, 1941-0050},
+  doi = {10.1109/TII.2016.2587883},
+  url = {http://ieeexplore.ieee.org/document/7506334/},
+  urldate = {2023-10-10},
+  abstract = {The Distributed Network Protocol version 3 (DNP3) provides Secure Authentication (DNP3-SA) as the mechanism to authenticate unicast messages from a master station to its outstations in supervisory control and data acquisition systems. In large-scale systems, it may be necessary to broadcast a critical request from a master station to multiple outstations at once. The DNP3 protocol standard describes the use of broadcast communication; however, it does not specify its security. This paper is the first to present DNP3 Secure Authentication for Broadcast (DNP3-SAB), a new lightweight security scheme for broadcast mode communication. This scheme is based on hash chain and only makes use of the existing cryptographic primitives specified in DNP3-SA. The scheme integrates itself into the DNP3-SA key update process. The proposed scheme is modeled, validated, and verified using colored Petri Nets against the most common protocol attacks such as modification, injection, and replay. Performance analysis on our scheme and the existing DNP3-SA modes (NACR and AGM) shows that DNP3-SAB reduces the communication overhead significantly at the cost of an increase with a constant term in processing and storage overhead. This benefit is maintained even when DNP3-SAB is under attack.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/4L7BACFU/Amoah et al. - 2016 - Securing DNP3 Broadcast Communications in SCADA Sy.pdf}
+}
+
+@inproceedings{amoahSecurityAnalysisNonaggressive2014,
+  title = {Security Analysis of the Non-Aggressive Challenge Response of the {{DNP3}} Protocol Using a {{CPN}} Model},
+  booktitle = {2014 {{IEEE International Conference}} on {{Communications}} ({{ICC}})},
+  author = {Amoah, Raphael and Suriadi, Suriadi and Camtepe, Seyit and Foo, Ernest},
+  date = {2014-06},
+  pages = {827--833},
+  publisher = {IEEE},
+  location = {Sydney, NSW},
+  doi = {10.1109/ICC.2014.6883422},
+  url = {http://ieeexplore.ieee.org/document/6883422/},
+  urldate = {2023-10-10},
+  abstract = {Distributed Network Protocol Version 3 (DNP3) is the de-facto communication protocol for power grids. Standardbased interoperability among devices has made the protocol useful to other infrastructures such as water, sewage, oil and gas. DNP3 is designed to facilitate interaction between master stations and outstations. In this paper, we apply a formal modelling methodology called Coloured Petri Nets (CPN) to create an executable model representation of DNP3 protocol. The model facilitates the analysis of the protocol to ensure that the protocol will behave as expected. Also, we illustrate how to verify and validate the behaviour of the protocol, using the CPN model and the corresponding state space tool to determine if there are insecure states. With this approach, we were able to identify a Denial of Service (DoS) attack against the DNP3 protocol.},
+  eventtitle = {{{ICC}} 2014 - 2014 {{IEEE International Conference}} on {{Communications}}},
+  isbn = {978-1-4799-2003-7},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/2XWVX68Q/Amoah et al. - 2014 - Security analysis of the non-aggressive challenge .pdf}
+}
+
+@misc{amsldoc,
+  title = {{{AMS LaTeX Documentation}}},
+  file = {/home/danesabo/Zotero/storage/WE549H7J/amsldoc.pdf}
+}
+
+@inproceedings{anandROSCoqRobotsPowered2015,
+  title = {{{ROSCoq}}: {{Robots Powered}} by {{Constructive Reals}}},
+  shorttitle = {{{ROSCoq}}},
+  booktitle = {Interactive {{Theorem Proving}}},
+  author = {Anand, Abhishek and Knepper, Ross},
+  editor = {Urban, Christian and Zhang, Xingyuan},
+  date = {2015},
+  pages = {34--50},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-319-22102-1_3},
+  abstract = {We present ROSCoq, a framework for developing certified Coq programs for robots. ROSCoq subsystems communicate using messages, as they do in the Robot Operating System (ROS). We extend the logic of events to enable holistic reasoning about the cyber-physical behavior of robotic systems. The behavior of the physical world (e.g. Newton’s laws) and associated devices (e.g. sensors, actuators) are specified axiomatically. For reasoning about physics we use and extend CoRN’s theory of constructive real analysis. Instead of floating points, our Coq programs use CoRN’s exact, yet fast computations on reals, thus enabling accurate reasoning about such computations.},
+  isbn = {978-3-319-22102-1},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/QL3ZHIDZ/Anand and Knepper - 2015 - ROSCoq Robots Powered by Constructive Reals.pdf}
+}
+
+@article{andriotisDeepReinforcementLearning2021,
+  title = {Deep Reinforcement Learning Driven Inspection and Maintenance Planning under Incomplete Information and Constraints},
+  author = {Andriotis, C.P. and Papakonstantinou, K.G.},
+  date = {2021-08},
+  journaltitle = {Reliability Engineering \& System Safety},
+  shortjournal = {Reliability Engineering \& System Safety},
+  volume = {212},
+  pages = {107551},
+  issn = {09518320},
+  doi = {10.1016/j.ress.2021.107551},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S095183202100106X},
+  urldate = {2022-02-11},
+  abstract = {Determination of inspection and maintenance policies for minimizing long-term risks and costs in deteriorating engineering environments constitutes a complex optimization problem. Major computational challenges include the (i) curse of dimensionality, due to exponential scaling of state/action set cardinalities with the number of components; (ii) curse of history, related to exponentially growing decision-trees with the number of decision-steps; (iii) presence of state uncertainties, induced by inherent environment stochasticity and variability of inspection/monitoring measurements; (iv) presence of constraints, pertaining to stochastic long-term limitations, due to resource scarcity and other infeasible/undesirable system responses. In this work, these challenges are addressed within a joint framework of constrained Partially Observable Markov Decision Processes (POMDP) and multi-agent Deep Reinforcement Learning (DRL). POMDPs optimally tackle (ii)-(iii), combining stochastic dynamic programming with Bayesian inference principles. Multi-agent DRL addresses (i), through deep function parametrizations and decentralized control assumptions. Challenge (iv) is herein handled through proper state augmentation and Lagrangian relaxation, with emphasis on life-cycle risk-based constraints and budget limitations. The underlying algorithmic steps are provided, and the proposed framework is found to outperform well-established policy baselines and facilitate adept prescription of inspection and intervention actions, in cases where decisions must be made in the most resource- and risk-aware manner.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/YMIH5G7M/_DRL_InsMaint_Andriotis_2021.pdf}
+}
+
+@article{andriotisManagingEngineeringSystems2019,
+  title = {Managing Engineering Systems with Large State and Action Spaces through Deep Reinforcement Learning},
+  author = {Andriotis, C.P. and Papakonstantinou, K.G.},
+  date = {2019-11},
+  journaltitle = {Reliability Engineering \& System Safety},
+  shortjournal = {Reliability Engineering \& System Safety},
+  volume = {191},
+  pages = {106483},
+  issn = {09518320},
+  doi = {10.1016/j.ress.2019.04.036},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0951832018313309},
+  urldate = {2022-02-11},
+  abstract = {Decision-making for engineering systems management can be efficiently formulated using Markov Decision Processes (MDPs) or Partially Observable MDPs (POMDPs). Typical MDP/POMDP solution procedures utilize offline knowledge about the environment and provide detailed policies for relatively small systems with tractable state and action spaces. However, in large multi-component systems the sizes of these spaces easily explode, as system states and actions scale exponentially with the number of components, whereas environment dynamics are difficult to be described explicitly for the entire system and may only be accessible through numerical simulators. In this work, to address these issues, an integrated Deep Reinforcement Learning (DRL) framework is introduced. The Deep Centralized Multi-agent Actor Critic (DCMAC) is developed, an off-policy actor-critic DRL approach, providing efficient life-cycle policies for large multi-component systems operating in high-dimensional spaces. Apart from deep network approximators parametrizing complex functions in large state spaces, DCMAC also adopts a factorized representation of the system actions, thus being able to designate individualized component- and subsystem-level decisions, while maintaining a centralized value function for the entire system. DCMAC compares well against Deep Q-Network solutions and exact policies, where applicable, and outperforms optimized baselines that are based on time-based, condition-based and periodic inspection and maintenance policies.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/BKBAPZUL/Andriotis and Papakonstantinou - 2019 - Managing engineering systems with large state and .pdf}
+}
+
+@inproceedings{annpureddySTaLiRoToolTemporal2011,
+  title = {S-{{TaLiRo}}: {{A Tool}} for {{Temporal Logic Falsification}} for {{Hybrid Systems}}},
+  shorttitle = {S-{{TaLiRo}}},
+  booktitle = {Tools and {{Algorithms}} for the {{Construction}} and {{Analysis}} of {{Systems}}},
+  author = {Annpureddy, Yashwanth and Liu, Che and Fainekos, Georgios and Sankaranarayanan, Sriram},
+  editor = {Abdulla, Parosh Aziz and Leino, K. Rustan M.},
+  date = {2011},
+  series = {Lecture {{Notes}} in {{Computer Science}}},
+  pages = {254--257},
+  publisher = {Springer},
+  location = {Berlin, Heidelberg},
+  doi = {10.1007/978-3-642-19835-9_21},
+  abstract = {S-TaLiRo is a Matlab (TM) toolbox that searches for trajectories of minimal robustness in Simulink/Stateflow diagrams. It can analyze arbitrary Simulink models or user defined functions that model the system. At the heart of the tool, we use randomized testing based on stochastic optimization techniques including Monte-Carlo methods and Ant-Colony Optimization. Among the advantages of the toolbox is the seamless integration inside the Matlab environment, which is widely used in the industry for model-based development of control software. We present the architecture of S-TaLiRo and its working on an application example.},
+  isbn = {978-3-642-19835-9},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/IEZS7RP5/Annpureddy et al. - 2011 - S-TaLiRo A Tool for Temporal Logic Falsification .pdf}
+}
+
+@article{annunziatoConnectionHamiltonJacobiBellmanFokkerPlanck2014,
+  title = {On the {{Connection}} between the {{Hamilton-Jacobi-Bellman}} and the {{Fokker-Planck Control Frameworks}}},
+  author = {Annunziato, Mario and Borzì, Alfio and Nobile, Fabio and Tempone, Raul},
+  date = {2014-08-29},
+  journaltitle = {Applied Mathematics},
+  volume = {5},
+  number = {16},
+  pages = {2476--2484},
+  publisher = {Scientific Research Publishing},
+  doi = {10.4236/am.2014.516239},
+  url = {https://www.scirp.org/journal/paperinformation.aspx?paperid=49428},
+  urldate = {2023-10-27},
+  abstract = {In the framework of stochastic processes, the connection between the dynamic programming scheme given by the Hamilton-Jacobi-Bellman equation and a recently proposed control approach based on the Fokker-Planck equation is discussed. Under appropriate assumptions it is shown that the two strategies are equivalent in the case of expected cost functionals, while the Fokker-Planck formalism allows considering a larger classof objectives. To illustratethe connection between the two control strategies, the cases of an Itō stochastic process and of a piecewise-deterministic process are considered.},
+  issue = {16},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/TR2PK9NQ/Annunziato et al. - 2014 - On the Connection between the Hamilton-Jacobi-Bell.pdf}
+}
+
+@inproceedings{antoniniSecurityChallengesBuilding2014,
+  title = {Security Challenges in Building Automation and {{SCADA}}},
+  booktitle = {2014 {{International Carnahan Conference}} on {{Security Technology}} ({{ICCST}})},
+  author = {Antonini, Alessio and Barenghi, Alessandro and Pelosi, Gerardo and Zonouz, Saman},
+  date = {2014-10},
+  pages = {1--6},
+  publisher = {IEEE},
+  location = {Rome, Italy},
+  doi = {10.1109/CCST.2014.6986996},
+  url = {http://ieeexplore.ieee.org/document/6986996/},
+  urldate = {2022-09-30},
+  abstract = {Cyber-Physical Systems (CPSs) are systems in which software and hardware entities monitor and manage physical devices using communication channels. They have become ubiquitous in many domains including health monitoring, smart vehicles and energy efficiency as in smart buildings and smart grid operations. The introduction of a digital control system and a communication channel, to exchange data with the physical system, increases the chance of vulnerabilities in the overall system. This paper presents the state-of-the-art of the security vulnerabilities of such systems as well as the possible methods to mitigate/reduce such threats. We will describe recent promising solutions to guarantee confidentiality and authentication of the transported data in building automation network domains, and present ideas to analyze and formally verify the control commands issued by the (possibly compromised) control network computers for execution on SCADA system actuators. The purpose of the latter approach is to prevent malicious parties from injecting malicious commands and potentially driving the underlying physical system into an unsafe state.},
+  eventtitle = {2014 {{International Carnahan Conference}} on {{Security Technology}} ({{ICCST}})},
+  isbn = {978-1-4799-3532-1 978-1-4799-3530-7},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/VCGCU38R/Antonini et al. - 2014 - Security challenges in building automation and SCA.pdf}
+}
+
+@article{antoNovelFrameworkDesign2023,
+  title = {A {{Novel Framework}} for the {{Design}} of {{Resilient Cyber-Physical Systems Using Control Theory}} and {{Formal Methods}}},
+  author = {Anto, Kelvin and Swain, Akshya Kumar and Roop, Partha},
+  date = {2023},
+  journaltitle = {IEEE Access},
+  shortjournal = {IEEE Access},
+  volume = {11},
+  pages = {73556--73567},
+  issn = {2169-3536},
+  doi = {10.1109/ACCESS.2023.3295421},
+  url = {https://ieeexplore.ieee.org/document/10184000/},
+  urldate = {2023-11-03},
+  file = {/home/danesabo/Zotero/storage/PYHR6JE8/Anto et al. - 2023 - A Novel Framework for the Design of Resilient Cybe.pdf}
+}
+
+@online{aranhaHELIOPOLISVerifiableComputation2023,
+  title = {{{HELIOPOLIS}}: {{Verifiable Computation}} over {{Homomorphically Encrypted Data}} from {{Interactive Oracle Proofs}} Is {{Practical}}},
+  shorttitle = {{{HELIOPOLIS}}},
+  author = {Aranha, Diego F. and Costache, Anamaria and Guimarães, Antonio and Soria-Vazquez, Eduardo},
+  date = {2023},
+  number = {2023/1949},
+  url = {https://eprint.iacr.org/2023/1949},
+  urldate = {2024-03-28},
+  abstract = {Homomorphic encryption (HE) enables computation on encrypted data, which in turn facilitates the outsourcing of computation on private data. However, HE offers no guarantee that the returned result was honestly computed by the cloud. In order to have such guarantee, it is necessary to add verifiable computation (VC) into the system.  The most efficient recent works in VC over HE focus on verifying operations on the ciphertext space of the HE scheme, which usually lacks the algebraic structure that would make it compatible with existing VC systems. For example, multiplication of ciphertexts in the current most efficient HE schemes requires non-algebraic operations such as real division and rounding. Therefore, existing works for VC over HE have to either give up on those efficient HE schemes, or incur a large overhead (an amount of constraints proportional to the ciphertext ring's size) in order to emulate these non-algebraic operations. In this work, we move away from that paradigm by placing the verification checks in the plaintext space of HE, all while the prover remains computing on ciphertexts. We achieve this by introducing a general transformation for Interactive Oracle Proofs (IOPs) to work over HE, whose result we denote as HE-IOPs. We apply this same transformation to the FRI [Ben-Sasson et al., ICALP 2018] IOP of proximity and we show how to compile HE-Reed Solomon-encoded IOPs and HE-\$\textbackslash delta\$-correlated-IOPs with HE-FRI into HE-IOPs. Furthermore, our construction is compatible with a prover that provides input in zero-knowledge, and only relies on building blocks that are plausibly quantum-safe. Aligning the security parameters of HE and FRI is a difficult task for which we introduce several optimizations. We demonstrate their efficiency with a proof-of-concept implementation in Python and show that, for an encrypted Reed Solomon codeword with degree bound \$2\textasciicircum\{11\}\$ and rate \$1/16\$ in a (plaintext) field of size \$2\textasciicircum\{256\}\$, we can run FRI's commit phase in just 43 minutes on a single thread on a c6i.metal instance (which could be reduced to less than a minute in a multi-threaded implementation in a large server). Verification takes less than 0.2 seconds, and, based on micro-benchmarks of the employed techniques, we show it could be up to 100 times faster in a fully optimized implementation.},
+  pubstate = {prepublished},
+  annotation = {Publication info: Preprint.},
+  file = {/home/danesabo/Zotero/storage/DZQWEJY8/Aranha et al. - 2023 - HELIOPOLIS Verifiable Computation over Homomorphi.pdf}
+}
+
+@inreference{ArchitectureAnalysisAmp2023,
+  title = {Architecture {{Analysis}} \&amp; {{Design Language}}},
+  booktitle = {Wikipedia},
+  date = {2023-09-06T20:07:42Z},
+  url = {https://en.wikipedia.org/w/index.php?title=Architecture_Analysis_%26_Design_Language&oldid=1174175484},
+  urldate = {2023-10-03},
+  abstract = {The Architecture Analysis \& Design Language (AADL) is an architecture description language standardized by SAE. AADL was first developed in the field of avionics, and was known formerly as the Avionics Architecture Description Language.The Architecture Analysis \& Design Language is derived from MetaH, an architecture description language made by the Advanced Technology Center of Honeywell. AADL is used to model the software and hardware architecture of an embedded, real-time system. Due to its emphasis on the embedded domain, AADL contains constructs for modeling both software and hardware components (with the hardware components named "execution platform" components within the standard). This architecture model can then be used either as a design documentation, for analyses (such as schedulability and flow control) or for code generation (of the software portion), like UML.},
+  langid = {english},
+  annotation = {Page Version ID: 1174175484},
+  file = {/home/danesabo/Zotero/storage/65H9TIS3/Architecture_Analysis_&_Design_Language.html}
+}
+
+@online{ArchitectureAnalysisDesign,
+  title = {Architecture {{Analysis}} and {{Design Language}} ({{AADL}})},
+  url = {https://www.sei.cmu.edu/our-work/projects/display.cfm?customel_datapageid_4050=191439,191439},
+  urldate = {2023-10-03},
+  abstract = {Software for mission- and safety-critical systems, such as avionics systems in aircraft, is growing larger and more expensive. The Architecture Analysis and Design Language (AADL) addresses common problems in the development of these systems, such as mismatched assumptions about the physical system, computer hardware, software, and their interactions that can result in system problems detected too late in the development lifecycle.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/2DE4Z9S6/display.html}
+}
+
+@article{arkadovVirtualDigitalNuclear2014,
+  title = {The Virtual Digital Nuclear Power Plant: {{A}} Modern Tool for Supporting the Lifecycle of {{VVER-based}} Nuclear Power Units},
+  shorttitle = {The Virtual Digital Nuclear Power Plant},
+  author = {Arkadov, G. V. and Zhukavin, A. P. and Kroshilin, A. E. and Parshikov, I. A. and Solov’ev, S. L. and Shishov, A. V.},
+  date = {2014-10},
+  journaltitle = {Thermal Engineering},
+  shortjournal = {Therm. Eng.},
+  volume = {61},
+  number = {10},
+  pages = {697--705},
+  issn = {0040-6015, 1555-6301},
+  doi = {10.1134/S0040601514100012},
+  url = {http://link.springer.com/10.1134/S0040601514100012},
+  urldate = {2023-10-11},
+  abstract = {The article describes the “Virtual Digital VVER–Based Nuclear Power Plant” computerized sys tem comprising a totality of verified initial data (sets of input data for a model intended for describing the behavior of nuclear power plant (NPP) systems in design and emergency modes of their operation) and a uni fied system of new generation computation codes intended for carrying out coordinated computation of the variety of physical processes in the reactor core and NPP equipment. Experiments with the demonstration version of the “Virtual Digital VVER Based NPP” computerized system has shown that it is in principle pos sible to set up a unified system of computation codes in a common software environment for carrying out interconnected calculations of various physical phenomena at NPPs constructed according to the standard AES 2006 project. With the full scale version of the “Virtual Digital VVER Based NPP” computerized sys tem put in operation, the concerned engineering, design, construction, and operating organizations will have access to all necessary information relating to the NPP power unit project throughout its entire lifecycle. The domestically developed commercial grade software product set to operate as an independently operating application to the project will bring about additional competitive advantages in the modern market of nuclear power technologies.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/WVXG2HAU/Arkadov et al. - 2014 - The virtual digital nuclear power plant A modern .pdf}
+}
+
+@article{aronszajnTheoryReproducingKernels1950,
+  title = {Theory of Reproducing Kernels},
+  author = {Aronszajn, N.},
+  date = {1950},
+  journaltitle = {Transactions of the American Mathematical Society},
+  shortjournal = {Trans. Amer. Math. Soc.},
+  volume = {68},
+  number = {3},
+  pages = {337--404},
+  issn = {0002-9947, 1088-6850},
+  doi = {10.1090/S0002-9947-1950-0051437-7},
+  url = {https://www.ams.org/tran/1950-068-03/S0002-9947-1950-0051437-7/},
+  urldate = {2022-04-21},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/SL3BWZ8Q/S0002-9947-1950-0051437-7.pdf}
+}
+
+@article{arrietaExplainableArtificialIntelligence2020,
+  title = {Explainable {{Artificial Intelligence}} ({{XAI}}): {{Concepts}}, Taxonomies, Opportunities and Challenges toward Responsible {{AI}}},
+  author = {Arrieta, Alejandro Barredo and Díaz-Rodríguez, Natalia and Del Ser, Javier and Bennetot, Adrien and Tabik, Siham and Barbado, Alberto and García, Salvador and Gil-López, Sergio and Molina, Daniel and Benjamins, Richard},
+  date = {2020},
+  journaltitle = {Information fusion},
+  volume = {58},
+  pages = {82--115},
+  publisher = {Elsevier},
+  isbn = {1566-2535},
+  file = {/home/danesabo/Zotero/storage/AANMSF9S/storage:storage:storage:Explainable Artificial Intelligence (XAI): Concepts, Taxonomies,
+Opportunities and Challenges toward Responsible AI.pdf}
+}
+
+@book{arthoFormalTechniquesSafetyCritical2015,
+  title = {Formal {{Techniques}} for {{Safety-Critical Systems}}},
+  author = {Artho, Cyrille and Ölveczky, Peter Csaba},
+  date = {2015},
+  publisher = {Springer},
+  file = {/home/danesabo/Zotero/storage/BH4V4E7U/Formal Techniques for Safety Critical Systems.pdf}
+}
+
+@article{arzhanovDiagnosticsCoreBarrel2003,
+  title = {Diagnostics of Core Barrel Vibrations by In-Core and Ex-Core Neutron Noise},
+  author = {Arzhanov, V. and Pázsit, I.},
+  date = {2003-01-01},
+  journaltitle = {Progress in Nuclear Energy},
+  volume = {43},
+  number = {1-4},
+  pages = {151--158},
+  issn = {01491970},
+  doi = {10.1016/s0149-1970(03)00023-4},
+  url = {https://www.sciencedirect.com/science/article/pii/S0149197003000234 https://www.sciencedirect.com/science/article/abs/pii/S0149197003000234?via%3Dihub},
+  abstract = {Diagnostics of core-barrel vibrations has traditionally been made by use of ex-vessel neutron detector signals. We suggest that in addition to the ex-core noise, also the in-core noise, induced by core barrel vibrations, be also used. This would enhance the possibilities of diagnostics where the number of the ex-core detectors is not sufficient or their positions are disadvantageous for effective diagnostics, especially for shell-mode vibrations. To this order, the theory of in-core noise induced by a fluctuating core boundary has been elaborated and applied to the diagnostics of beam and shell mode vibrations. The formulas were tested on some measurements taken in the Ringhals PWRs. The results confirm the validity of the model itself, and the possibilities for enhanced diagnostics were demonstrated. A more effective use of these novel possibilities requires more in-core detectors and/or better detector positioning.}
+}
+
+@article{arzhanovLocalizationVibratingControl2000,
+  title = {Localization of a {{Vibrating Control Rod Pin}} in {{Pressurized Water Reactors Using}} the {{Neutron Flux}} and {{Current Noise}}},
+  author = {Arzhanov, Vasiliy and Pázsit, Imre and Garis, Ninos S.},
+  date = {2000-08-01},
+  journaltitle = {Nuclear Technology},
+  volume = {131},
+  number = {2},
+  pages = {239--251},
+  issn = {0029-5450},
+  doi = {10.13182/NT00-A3114},
+  url = {https://doi.org/10.13182/NT00-A3114 https://www.tandfonline.com/doi/abs/10.13182/NT00-A3114},
+  note = {doi: 10.13182/NT00-A3114}
+}
+
+@online{AS5506DArchitectureAnalysis,
+  title = {{{AS5506D}}: {{Architecture Analysis}} \& {{Design Language}} ({{AADL}}) - {{SAE International}}},
+  shorttitle = {{{AS5506D}}},
+  url = {https://www.sae.org/standards/content/as5506d/},
+  urldate = {2023-10-03},
+  abstract = {This standard defines a language for describing both the software architecture and the execution platform architectures of performance-critical, embedded, real-time systems; the language is known as the SAE AADL.  An AADL model describes a system as a hierarchy of components with their interfaces an},
+  file = {/home/danesabo/Zotero/storage/A6SBHDUG/as5506d.html}
+}
+
+@incollection{asarinReachabilityAnalysisNonlinear2003,
+  title = {Reachability {{Analysis}} of {{Nonlinear Systems Using Conservative Approximation}}},
+  booktitle = {Hybrid {{Systems}}: {{Computation}} and {{Control}}},
+  author = {Asarin, Eugene and Dang, Thao and Girard, Antoine},
+  editor = {Maler, Oded and Pnueli, Amir},
+  editora = {Goos, Gerhard and Hartmanis, Juris and Van Leeuwen, Jan},
+  editoratype = {redactor},
+  date = {2003},
+  volume = {2623},
+  pages = {20--35},
+  publisher = {Springer Berlin Heidelberg},
+  location = {Berlin, Heidelberg},
+  doi = {10.1007/3-540-36580-X_5},
+  url = {http://link.springer.com/10.1007/3-540-36580-X_5},
+  urldate = {2023-11-22},
+  isbn = {978-3-540-00913-9 978-3-540-36580-8}
+}
+
+@inproceedings{asarinRecentProgressContinuous2006,
+  title = {Recent Progress in Continuous and Hybrid Reachability Analysis},
+  booktitle = {2006 {{IEEE Conference}} on {{Computer Aided Control System Design}}, 2006 {{IEEE International Conference}} on {{Control Applications}}, 2006 {{IEEE International Symposium}} on {{Intelligent Control}}},
+  author = {Asarin, Eugene and Dang, Thao and Frehse, Goran and Girard, Antoine and Le Guernic, Colas and Maler, Oded},
+  date = {2006-10},
+  pages = {1582--1587},
+  publisher = {IEEE},
+  location = {Munich, Germany},
+  doi = {10.1109/CACSD-CCA-ISIC.2006.4776877},
+  url = {http://ieeexplore.ieee.org/document/4776877/},
+  urldate = {2023-11-22},
+  eventtitle = {2006 {{IEEE Conference}} on {{Computer Aided Control System Design}}, 2006 {{IEEE International Conference}} on {{Control Applications}}, 2006 {{IEEE International Symposium}} on {{Intelligent Control}}}
+}
+
+@incollection{askarpourFormalMethodsDesigning2019,
+  title = {Formal {{Methods}} in {{Designing Critical Cyber-Physical Systems}}},
+  booktitle = {From {{Software Engineering}} to {{Formal Methods}} and {{Tools}}, and {{Back}}},
+  author = {Askarpour, Mehrnoosh and Ghezzi, Carlo and Mandrioli, Dino and Rossi, Matteo and Tsigkanos, Christos},
+  editor = {Ter Beek, Maurice H. and Fantechi, Alessandro and Semini, Laura},
+  date = {2019},
+  volume = {11865},
+  pages = {110--130},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-030-30985-5_8},
+  url = {http://link.springer.com/10.1007/978-3-030-30985-5_8},
+  urldate = {2023-11-03},
+  isbn = {978-3-030-30984-8 978-3-030-30985-5},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/2TB596AF/Askarpour et al. - 2019 - Formal Methods in Designing Critical Cyber-Physica.pdf}
+}
+
+@incollection{askarpourFormalMethodsDesigning2019a,
+  title = {Formal {{Methods}} in {{Designing Critical Cyber-Physical Systems}}},
+  booktitle = {From {{Software Engineering}} to {{Formal Methods}} and {{Tools}}, and {{Back}}},
+  author = {Askarpour, Mehrnoosh and Ghezzi, Carlo and Mandrioli, Dino and Rossi, Matteo and Tsigkanos, Christos},
+  editor = {Ter Beek, Maurice H. and Fantechi, Alessandro and Semini, Laura},
+  date = {2019},
+  volume = {11865},
+  pages = {110--130},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-030-30985-5_8},
+  url = {http://link.springer.com/10.1007/978-3-030-30985-5_8},
+  urldate = {2023-10-10},
+  abstract = {Cyber-Physical Systems (CPS) are increasingly applied in critical contexts, where they have to support safe and secure operations, often subject to stringent timing requirements. Typical examples are scenarios involving automated living or working spaces in which humans operate, or human-robot collaborations (HRC) in modern manufacturing. Formal methods have been traditionally investigated to support modeling and verification of critical systems. In this paper, we review some of the main new challenges arising in the application of formal methods to modeling and verification of CPS. We do that by presenting two case studies (emergency response in a smart city and a smart manufacturing system), reflecting past work of the authors, from which some general lessons are distilled.},
+  isbn = {978-3-030-30984-8 978-3-030-30985-5},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/TCAKWGJ8/Askarpour et al. - 2019 - Formal Methods in Designing Critical Cyber-Physica.pdf}
+}
+
+@article{askarpourFormalModelHuman2019,
+  title = {Formal Model of Human Erroneous Behavior for Safety Analysis in Collaborative Robotics},
+  author = {Askarpour, Mehrnoosh and Mandrioli, Dino and Rossi, Matteo and Vicentini, Federico},
+  date = {2019-06},
+  journaltitle = {Robotics and Computer-Integrated Manufacturing},
+  shortjournal = {Robotics and Computer-Integrated Manufacturing},
+  volume = {57},
+  pages = {465--476},
+  issn = {07365845},
+  doi = {10.1016/j.rcim.2019.01.001},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0736584518303247},
+  urldate = {2023-10-13},
+  abstract = {Recent developments in manufacturing technologies, also known as Industry 4.0, seek to build Smart Factories where supply chains and production lines are equipped with a higher level of automation. However, this significant innovation does not entirely eliminate the need for the presence of human operators; on the contrary, it requires them to collaborate with robots and execute hybrid tasks. Thus, creating safe workspaces for human operators is crucial for the future of factories where humans and robots collaborate closely in common workspaces. The uncertainty of human behavior and, consequently, of the actual execution of workflows, pose significant challenges to the safety of collaborative applications. This paper extends our earlier work, a formal verification methodology to analyze the safety of collaborative robotics applications (Askarpour et al. 2017) [1], with a rich non-deterministic formal model of operator behaviors that captures the hazardous situations resulting from human errors. The model allows safety engineers to refine their designs until all plausible erroneous behaviors are considered and mitigated. The solidity of the proposed approach is evaluated on a pair of real-life case studies.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/JACEQ3NC/Askarpour et al. - 2019 - Formal model of human erroneous behavior for safet.pdf}
+}
+
+@article{avigadFORMALSYSTEMEUCLID2009,
+  title = {A {{FORMAL SYSTEM FOR EUCLID}}’{{S}} {{{\emph{ELEMENTS}}}}},
+  author = {Avigad, Jeremy and Dean, Edward and Mumma, John},
+  date = {2009-12},
+  journaltitle = {The Review of Symbolic Logic},
+  shortjournal = {The Review of Symbolic Logic},
+  volume = {2},
+  number = {4},
+  pages = {700--768},
+  issn = {1755-0203, 1755-0211},
+  doi = {10.1017/S1755020309990098},
+  url = {https://www.cambridge.org/core/product/identifier/S1755020309990098/type/journal_article},
+  urldate = {2024-05-16},
+  abstract = {We present a formal system, E, which provides a faithful model of the proofs in Euclid’s Elements, including the use of diagrammatic reasoning.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/DBTC2JCM/Avigad et al. - 2009 - A FORMAL SYSTEM FOR EUCLID’S ELEMENTS.pdf}
+}
+
+@online{AWS,
+  title = {{{AWS IoT Twin Maker}}},
+  year = {date accessed 03/24/2022},
+  url = {https://aws.amazon.com/iot-twinmaker/}
+}
+
+@inproceedings{ayo-imoruEnhancedFaultDiagnosis2021,
+  title = {An Enhanced Fault Diagnosis in Nuclear Power Plants for a Digital Twin Framework},
+  booktitle = {2021 {{International Conference}} on {{Electrical}}, {{Computer}} and {{Energy Technologies}} ({{ICECET}})},
+  author = {Ayo-Imoru, Ronke M. and Ali, Ahmed A. and Bokoro, Pitshou N.},
+  date = {2021-12-09},
+  pages = {1--6},
+  publisher = {IEEE},
+  location = {Cape Town, South Africa},
+  doi = {10.1109/ICECET52533.2021.9698715},
+  url = {https://ieeexplore.ieee.org/document/9698715/},
+  urldate = {2023-10-11},
+  abstract = {Nuclear power plants can provide a huge amount of clean energy, which can help most countries to meet their greenhouse gas emission requirements according to the Paris agreement on climate change. To meet this energy need, the nuclear plant must be operated safely and economically, which makes the digital twin concept viable for achieving this aim. The digital twin can be used to monitor plant condition, fault diagnosis, prediction, and plant maintenance support systems. In this work, the framework for digital twin in a nuclear plant is proposed. This framework combines the application of the nuclear plant simulator and machine learning tools. The machine learning aspect of this digital twin concept is the focus of this paper. Data was generated by using a personal computer-based nuclear plant simulator. Principal component analysis was used in reducing the data dimension. Artificial neural networks and adaptive neuro-fuzzy inference systems were trained with the reduced data and used to diagnose the faults. Four faults in the plant were diagnosed with minimal error. The fault diagnosis is a significant aspect of the digital twin framework.},
+  eventtitle = {2021 {{International Conference}} on {{Electrical}}, {{Computer}} and {{Energy Technologies}} ({{ICECET}})},
+  isbn = {978-1-66544-231-2},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/XXPXKD3S/Ayo-Imoru et al. - 2021 - An enhanced fault diagnosis in nuclear power plant.pdf}
+}
+
+@article{ayo-imoruHybridNuclearPlant2017,
+  title = {Hybrid Nuclear Plant Simulator Design Requirements to Enable Dynamic Diagnostics of Plant Operations},
+  author = {Ayo-Imoru, R.M. and Cilliers, A.C.},
+  date = {2017-03},
+  journaltitle = {Annals of Nuclear Energy},
+  shortjournal = {Annals of Nuclear Energy},
+  volume = {101},
+  pages = {447--453},
+  issn = {03064549},
+  doi = {10.1016/j.anucene.2016.11.034},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0306454916308283},
+  urldate = {2023-10-11},
+  abstract = {With nuclear plant full scope simulator technology reaching maturity, the possibility of using its capabilities in expert systems such as online plant diagnostics has become a reality. The effectiveness of plant diagnostics using real-time simulated measurements as a plant reference has been shown in previous papers. However, in order to implement these systems, the full scope plant simulator needs to be designed specifically with this application in mind. This will help in maximising the effectiveness and scope of use of the system. This paper investigates the various simulator technologies available as well as the development strategies and focus areas to establish the design requirements of a single, full scope engineering and training nuclear plant simulator. This can be implemented to provide a real-time dynamic reference to the plant diagnostic system.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/DACDBKXR/Ayo-Imoru and Cilliers - 2017 - Hybrid nuclear plant simulator design requirements.pdf}
+}
+
+@article{baanenHitchhikerGuideLogical,
+  title = {The {{Hitchhiker}}'s {{Guide}} to {{Logical Verification}}},
+  author = {Baanen, Anne and Bentkamp, Alexander and Blanchette, Jasmin and Hölzl, Johannes and Limperg, Jannis},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/R625RBEG/Baanen et al. - The Hitchhiker's Guide to Logical Verification.pdf}
+}
+
+@inproceedings{babayNetworkAttackResilientIntrusionTolerantSCADA2018,
+  title = {Network-{{Attack-Resilient Intrusion-Tolerant}} \{\vphantom\}{{SCADA}}\vphantom\{\} for the {{Power Grid}}},
+  booktitle = {2018 48th {{Annual IEEE}}/{{IFIP International Conference}} on {{Dependable Systems}} and {{Networks}} ({{DSN}})},
+  author = {Babay, Amy and Tantillo, Thomas and Aron, Trevor and Platania, Marco and Amir, Yair},
+  date = {2018-06},
+  pages = {255--266},
+  issn = {2158-3927},
+  doi = {10.1109/DSN.2018.00036},
+  abstract = {As key components of the power grid infrastructure, Supervisory Control and Data Acquisition (SCADA) systems are likely to be targeted by nation-state-level attackers willing to invest considerable resources to disrupt the power grid. We present Spire, the first intrusion-tolerant SCADA system that is resilient to both system-level compromises and sophisticated network-level attacks and compromises. We develop a novel architecture that distributes the SCADA system management across three or more active sites to ensure continuous availability in the presence of simultaneous intrusions and network attacks. A wide-area deployment of Spire, using two control centers and two data centers spanning 250 miles, delivered nearly 99.999\% of all SCADA updates initiated over a 30-hour period within 100ms. This demonstrates that Spire can meet the latency requirements of SCADA for the power grid.},
+  eventtitle = {2018 48th {{Annual IEEE}}/{{IFIP International Conference}} on {{Dependable Systems}} and {{Networks}} ({{DSN}})},
+  file = {/home/danesabo/Zotero/storage/ARKFSCFV/Babay et al. - 2018 - Network-Attack-Resilient Intrusion-Tolerant SCADA .pdf;/home/danesabo/Zotero/storage/R79IR6PF/8416488.html}
+}
+
+@inproceedings{babuSecurityIssuesSCADA2017,
+  title = {Security Issues in {{SCADA}} Based Industrial Control Systems},
+  booktitle = {2017 2nd {{International Conference}} on {{Anti-Cyber Crimes}} ({{ICACC}})},
+  author = {Babu, Bijoy and Ijyas, Thafasal and {Muneer P.} and Varghese, Justin},
+  date = {2017-03},
+  pages = {47--51},
+  publisher = {IEEE},
+  location = {Abha, Saudi Arabia},
+  doi = {10.1109/Anti-Cybercrime.2017.7905261},
+  url = {http://ieeexplore.ieee.org/document/7905261/},
+  urldate = {2022-09-30},
+  abstract = {Ongoing research and developments in modern information and communication technologies have revolutionized the design of industrial control systems (ICS). There is a major domain transition from traditional electromechanical systems to network based digital systems, which has indeed created a powerful interface between state-of the-art computing technologies/paradigms and physical processes sought to be controlled. ICS play a critical role in the industrial and manufacturing sector. Major infrastructures like petrochemical industries, waste water treatment facilities, nuclear power plants, pharmaceuticals, food and beverage industries etc. cannot run properly without ICS. Real-time processing, reliability and advanced distributed intelligence are some of the core characteristics of ICS which are incorporated with the help of state-of-the-art internet communication and computing technologies. The complex embedded coupling of hardware and software components such as actuators, sensors and the physical processes are all monitored and manipulated by the communication and network protocol based controllers like supervisory control and data acquisition (SCADA) systems, programmable logic controllers (PLC), distributed control systems (DCS) etc. The integration of these technologies makes the access to ICS from the external world much easier. On the other hand, this has led to many critical cyber-security issues also. These issues are of such a nature that they may sometimes pose a serious threat to the safety of humans and the environment as well. Unless managed properly, these can have adverse implications for the national economy also, in terms of production losses. In this paper, we attempt to give a comprehensive review of the unique aspects of cyber-security issues in ICS. Specifically, we delve upon the issues of security assessment and architectural reviewing of ICS. We also give a brief survey on different threat attacks on ICS.},
+  eventtitle = {2017 2nd {{International Conference}} on {{Anti-Cyber Crimes}} ({{ICACC}})},
+  isbn = {978-1-5090-5814-3},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/TBS4SE9T/Babu et al. - 2017 - Security issues in SCADA based industrial control .pdf}
+}
+
+@report{BackBuildingBlocks,
+  title = {Back to the {{Building Blocks}}:  {{A Path}} toward {{Secure}} and {{Measurable Software}}},
+  url = {https://www.whitehouse.gov/wp-content/uploads/2024/02/Final-ONCD-Technical-Report.pdf},
+  urldate = {2024-04-30},
+  file = {/home/danesabo/Zotero/storage/E6Q6DUPX/Final-ONCD-Technical-Report.pdf}
+}
+
+@article{baezOpenPetriNets2020,
+  title = {Open {{Petri Nets}}},
+  author = {Baez, John C. and Master, Jade},
+  date = {2020-03},
+  journaltitle = {Mathematical Structures in Computer Science},
+  shortjournal = {Math. Struct. Comp. Sci.},
+  volume = {30},
+  number = {3},
+  eprint = {1808.05415},
+  eprinttype = {arXiv},
+  eprintclass = {cs, math},
+  pages = {314--341},
+  issn = {0960-1295, 1469-8072},
+  doi = {10.1017/S0960129520000043},
+  url = {http://arxiv.org/abs/1808.05415},
+  urldate = {2023-12-12},
+  abstract = {The reachability semantics for Petri nets can be studied using open Petri nets. For us an "open" Petri net is one with certain places designated as inputs and outputs via a cospan of sets. We can compose open Petri nets by gluing the outputs of one to the inputs of another. Open Petri nets can be treated as morphisms of a category \$\textbackslash mathsf\{Open\}(\textbackslash mathsf\{Petri\})\$, which becomes symmetric monoidal under disjoint union. However, since the composite of open Petri nets is defined only up to isomorphism, it is better to treat them as morphisms of a symmetric monoidal double category \$\textbackslash mathbb\{O\}\textbackslash mathbf\{pen\}(\textbackslash mathsf\{Petri\})\$. We describe two forms of semantics for open Petri nets using symmetric monoidal double functors out of \$\textbackslash mathbb\{O\}\textbackslash mathbf\{pen\}(\textbackslash mathsf\{Petri\})\$. The first, an operational semantics, gives for each open Petri net a category whose morphisms are the processes that this net can carry out. This is done in a compositional way, so that these categories can be computed on smaller subnets and then glued together. The second, a reachability semantics, simply says which markings of the outputs can be reached from a given marking of the inputs.},
+  note = {Comment: 30 pages, TikZ figures},
+  file = {/home/danesabo/Zotero/storage/A7YADSNG/Baez and Master - 2020 - Open Petri Nets.pdf;/home/danesabo/Zotero/storage/4RYR2R52/1808.html}
+}
+
+@book{bakerCrossfireCriticalInfrastructure2009,
+  title = {In the Crossfire: {{Critical}} Infrastructure in the Age of Cyber War},
+  shorttitle = {In the Crossfire},
+  author = {Baker, Stewart Abercrombie and Waterman, Shaun and Ivanov, George},
+  date = {2009},
+  publisher = {McAfee, Incorporated}
+}
+
+@article{bakirtzisCompositionalCyberPhysicalSystems2021,
+  title = {Compositional {{Cyber-Physical Systems Modeling}}},
+  author = {Bakirtzis, Georgios and Vasilakopoulou, Christina and Fleming, Cody H.},
+  date = {2021-02-08},
+  journaltitle = {Electronic Proceedings in Theoretical Computer Science},
+  shortjournal = {Electron. Proc. Theor. Comput. Sci.},
+  volume = {333},
+  pages = {125--138},
+  issn = {2075-2180},
+  doi = {10.4204/EPTCS.333.9},
+  url = {http://arxiv.org/abs/2101.10484v1},
+  urldate = {2023-11-08},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/4X7RSJTM/Bakirtzis et al. - 2021 - Compositional Cyber-Physical Systems Modeling.pdf}
+}
+
+@article{bakVerifyingCyberphysicalSystems2016,
+  title = {Verifying Cyber-Physical Systems by Combining Software Model Checking with Hybrid Systems Reachability},
+  author = {Bak, Stanley and Chaki, Sagar},
+  date = {2016},
+  journaltitle = {2016 International Conference on Embedded Software (EMSOFT)},
+  pages = {1--10},
+  doi = {10.1145/2968478.2968490},
+  file = {/home/danesabo/Zotero/storage/YGTE3H28/_.pdf}
+}
+
+@article{baloghModellingUseAdaptive2023,
+  title = {Modelling and {{Use}} of {{Adaptive Control Using Petri Nets}}},
+  author = {Balogh, Zoltán and Fodor, Kristián and Francisti, Jan and Drozda, Martin and Čavojský, Maroš},
+  date = {2023-01-01},
+  journaltitle = {Procedia Computer Science},
+  shortjournal = {Procedia Computer Science},
+  series = {27th {{International Conference}} on {{Knowledge Based}} and {{Intelligent Information}} and {{Engineering Sytems}} ({{KES}} 2023)},
+  volume = {225},
+  pages = {1438--1447},
+  issn = {1877-0509},
+  doi = {10.1016/j.procs.2023.10.132},
+  url = {https://www.sciencedirect.com/science/article/pii/S1877050923012905},
+  urldate = {2024-02-15},
+  abstract = {The issue of modeling holds significant importance for the applicability of control theory, particularly at higher control levels where the verbal description of control objects becomes increasingly crucial. However, a notable disadvantage of such verbal descriptions is the inherent ambiguity and vagueness of the obtained results. This article aims to address this challenge by proposing an approach that utilizes Petri nets (PN) to model and control a specific component within an intelligent home. Additionally, the Simulink modeling tool and Petri net analysis tools are introduced as aids in the modeling process. The article focuses on creating a model that accurately represents the temperature regulation system in the home, considering the constant rise in energy consumption and costs. Furthermore, the transfer of the model to the Simulink environment using IF THEN rules is demonstrated, allowing for an evaluation of its performance. Through the comprehensive application of this approach, the aim is to optimize energy usage and reduce costs within household environments.},
+  file = {/home/danesabo/Zotero/storage/H7H6FI9P/S1877050923012905.html}
+}
+
+@article{bansalIntroductionReachability,
+  title = {Introduction to {{Reachability}}},
+  author = {Bansal, Somil},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/EA5YJSPF/Bansal - Introduction to Reachability.pdf}
+}
+
+@inproceedings{barkaouiSupervisoryControlDiscrete1997,
+  title = {Supervisory Control of Discrete Event Systems Based on Structure Theory of {{Petri}} Nets},
+  booktitle = {Computational {{Cybernetics}} and {{Simulation}} 1997 {{IEEE International Conference}} on {{Systems}}, {{Man}}, and {{Cybernetics}}},
+  author = {Barkaoui, K. and Chaoui, A. and Zouari, B.},
+  date = {1997-10},
+  volume = {4},
+  pages = {3750-3755 vol.4},
+  issn = {1062-922X},
+  doi = {10.1109/ICSMC.1997.633253},
+  url = {https://ieeexplore.ieee.org/abstract/document/633253},
+  urldate = {2024-02-15},
+  abstract = {The present work is related to the use of Petri nets structural techniques in the supervisory control of discrete event systems. A relevant property of the system behaviour under supervision is to be non-blocking, i.e. from any state reachable from initial state, it is always possible to reach a desirable (or marked) state. Recent works had shown that the synthesis of proper supervisors based on Petri net modelling of DES is an interesting approach. In this paper, we present a proper supervisor synthesis method based on a purely structural reasoning. This parametrized method is especially well-suited for a large class of discrete event systems, called G-Task, for modelling concurrent automated manufacturing systems with flexibility on routings and on synchronization patterns with shared resources. Also, it can be exploited for enforcing constraints on the reachability set of any bounded uncontrolled net.},
+  eventtitle = {Computational {{Cybernetics}} and {{Simulation}} 1997 {{IEEE International Conference}} on {{Systems}}, {{Man}}, and {{Cybernetics}}},
+  file = {/home/danesabo/Zotero/storage/NWBN4KDZ/Barkaoui et al. - 1997 - Supervisory control of discrete event systems base.pdf}
+}
+
+@article{barnettRouthAlgorithmCentennial1977,
+  title = {Routh’s {{Algorithm}}: {{A Centennial Survey}}},
+  shorttitle = {Routh’s {{Algorithm}}},
+  author = {Barnett, S. and {šiljak}, D. D.},
+  date = {1977-07},
+  journaltitle = {SIAM Review},
+  shortjournal = {SIAM Rev.},
+  volume = {19},
+  number = {3},
+  pages = {472--489},
+  publisher = {{Society for Industrial and Applied Mathematics}},
+  issn = {0036-1445},
+  doi = {10.1137/1019070},
+  url = {https://epubs.siam.org/doi/abs/10.1137/1019070},
+  urldate = {2024-03-04},
+  abstract = {To decide whether a prescribed complex polynomial has all its zeros with negative real parts, there are available many tests involving the checking of rational or polynomial inequalities in the coefficients. It is shown that the generalized Routh–Hurwitz conditions are from a certain point of view not replaceable by simpler conditions.},
+  file = {/home/danesabo/Zotero/storage/2B77KUQZ/Barnett and šiljak - 1977 - Routh’s Algorithm A Centennial Survey.pdf}
+}
+
+@incollection{barrettSatisfiabilityModuloTheories2018,
+  title = {Satisfiability {{Modulo Theories}}},
+  booktitle = {Handbook of {{Model Checking}}},
+  author = {Barrett, Clark and Tinelli, Cesare},
+  editor = {Clarke, Edmund M. and Henzinger, Thomas A. and Veith, Helmut and Bloem, Roderick},
+  date = {2018},
+  pages = {305--343},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-319-10575-8_11},
+  url = {http://link.springer.com/10.1007/978-3-319-10575-8_11},
+  urldate = {2023-11-02},
+  abstract = {Satisfiability Modulo Theories (SMT) refers to the problem of determining whether a first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT are used as back-end engines in model-checking applications such as bounded, interpolation-based, and predicate-abstraction-based model checking. After a brief illustration of these uses, we survey the predominant techniques for solving SMT problems with an emphasis on the lazy approach, in which a propositional satisfiability (SAT) solver is combined with one or more theory solvers. We discuss the architecture of a lazy SMT solver, give examples of theory solvers, show how to combine such solvers modularly, and mention several extensions of the lazy approach. We also briefly describe the eager approach in which the SMT problem is reduced to a SAT problem. Finally, we discuss how the basic framework for determining satisfiability can be extended with additional functionality such as producing models, proofs, unsatisfiable cores, and interpolants.},
+  isbn = {978-3-319-10574-1 978-3-319-10575-8},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/5KEQZZKH/Barrett and Tinelli - 2018 - Satisfiability Modulo Theories.pdf}
+}
+
+@article{bartosiewiczLocalPositiveReachability2016,
+  title = {Local {{Positive Reachability}} of {{Nonlinear Continuous-Time Systems}}},
+  author = {Bartosiewicz, Zbigniew},
+  date = {2016-12},
+  journaltitle = {IEEE Transactions on Automatic Control},
+  shortjournal = {IEEE Trans. Automat. Contr.},
+  volume = {61},
+  number = {12},
+  pages = {4217--4221},
+  issn = {0018-9286, 1558-2523},
+  doi = {10.1109/TAC.2015.2511921},
+  url = {http://ieeexplore.ieee.org/document/7365428/},
+  urldate = {2023-11-22}
+}
+
+@article{basnightFirmwareModificationAttacks2013,
+  title = {Firmware Modification Attacks on Programmable Logic Controllers},
+  author = {Basnight, Zachry and Butts, Jonathan and Lopez, Juan and Dube, Thomas},
+  date = {2013-06-01},
+  journaltitle = {International Journal of Critical Infrastructure Protection},
+  shortjournal = {International Journal of Critical Infrastructure Protection},
+  volume = {6},
+  number = {2},
+  pages = {76--84},
+  issn = {1874-5482},
+  doi = {10.1016/j.ijcip.2013.04.004},
+  url = {https://www.sciencedirect.com/science/article/pii/S1874548213000231},
+  urldate = {2024-08-14},
+  abstract = {Recent attacks on industrial control systems, such as the highly publicized Stuxnet malware, have intensified a “race to the bottom” where lower-level attacks have a tactical advantage. Programmable logic controller (PLC) firmware, which provides a software-driven interface between system inputs and physical outputs, can be easily modified at the user level. Efforts directed at protecting against firmware modification are hindered by the lack of foundational research about attack development and implementation. This paper examines the vulnerability of PLCs to intentional firmware modifications in order to obtain a better understanding of the threats posed by PLC firmware modification attacks and the feasibility of these attacks. A general firmware analysis methodology is presented, and a proof-of-concept experiment is used to demonstrate how legitimate firmware can be updated and uploaded to an Allen-Bradley ControlLogix L61 PLC.},
+  keywords = {Firmware,Industrial control systems,Modification attacks,Programmable logic controllers,Reverse engineering},
+  file = {/home/danesabo/Zotero/storage/Q79V2USH/S1874548213000231.html}
+}
+
+@misc{beamer,
+  title = {Beamer {{User Guide}}},
+  file = {/home/danesabo/Zotero/storage/BW7CCP9X/beameruserguide.pdf}
+}
+
+@inreference{BellLaPadulaModel2023,
+  title = {Bell–{{LaPadula}} Model},
+  booktitle = {Wikipedia},
+  date = {2023-09-09T07:32:26Z},
+  url = {https://en.wikipedia.org/w/index.php?title=Bell%E2%80%93LaPadula_model&oldid=1174562903},
+  urldate = {2023-10-03},
+  abstract = {The Bell–LaPadula Model (BLP) is a state machine model used for enforcing access control in government and military applications. It was developed by David Elliott Bell, and Leonard J. LaPadula, subsequent to strong guidance from Roger R. Schell, to formalize the U.S. Department of Defense (DoD) multilevel security (MLS) policy. The model is a formal state transition model of computer security policy that describes a set of access control rules which use security labels on objects and clearances for subjects. Security labels range from the most sensitive (e.g., "Top Secret"), down to the least sensitive (e.g., "Unclassified" or "Public"). The Bell–LaPadula model is an example of a model where there is no clear distinction between protection and security.},
+  langid = {english},
+  annotation = {Page Version ID: 1174562903},
+  file = {/home/danesabo/Zotero/storage/NA3GZQH4/Bell–LaPadula_model.html}
+}
+
+@article{beltaFormalMethodsControl2019,
+  title = {Formal {{Methods}} for {{Control Synthesis}}: {{An Optimization Perspective}}},
+  shorttitle = {Formal {{Methods}} for {{Control Synthesis}}},
+  author = {Belta, Calin and Sadraddini, Sadra},
+  date = {2019},
+  journaltitle = {Annual Review of Control, Robotics, and Autonomous Systems},
+  volume = {2},
+  number = {1},
+  pages = {115--140},
+  doi = {10.1146/annurev-control-053018-023717},
+  url = {https://doi.org/10.1146/annurev-control-053018-023717},
+  urldate = {2022-06-20},
+  abstract = {In control theory, complicated dynamics such as systems of (nonlinear) differential equations are controlled mostly to achieve stability. This fundamental property, which can be with respect to a desired operating point or a prescribed trajectory, is often linked with optimality, which requires minimizing a certain cost along the trajectories of a stable system. In formal verification (model checking), simple systems, such as finite-state transition graphs that model computer programs or digital circuits, are checked against rich specifications given as formulas of temporal logics. The formal synthesis problem, in which the goal is to synthesize or control a finite system from a temporal logic specification, has recently received increased interest. In this article, we review some recent results on the connection between optimal control and formal synthesis. Specifically, we focus on the following problem: Given a cost and a correctness temporal logic specification for a dynamical system, generate an optimal control strategy that satisfies the specification. We first provide a short overview of automata-based methods, in which the dynamics of the system are mapped to a finite abstraction that is then controlled using an automaton corresponding to the specification. We then provide a detailed overview of a class of methods that rely on mapping the specification and the dynamics to constraints of an optimization problem. We discuss advantages and limitations of these two types of approaches and suggest directions for future research.}
+}
+
+@book{beltaFormalMethodsDiscreteTime2017,
+  title = {Formal {{Methods}} for {{Discrete-Time Dynamical Systems}}},
+  author = {Belta, Calin and Yordanov, Boyan and Aydin Gol, Ebru},
+  date = {2017},
+  series = {Studies in {{Systems}}, {{Decision}} and {{Control}}},
+  volume = {89},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-319-50763-7},
+  url = {http://link.springer.com/10.1007/978-3-319-50763-7},
+  urldate = {2024-02-13},
+  isbn = {978-3-319-50762-0 978-3-319-50763-7},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/6I6QFSPQ/Belta et al. - 2017 - Formal Methods for Discrete-Time Dynamical Systems.pdf}
+}
+
+@book{beltaFormalMethodsDiscretetime2017a,
+  title = {Formal Methods for Discrete-Time Dynamical Systems},
+  author = {Belta, Calin and Yordanov, Boyan and Gol, Ebru Aydin},
+  date = {2017},
+  volume = {89},
+  publisher = {Springer},
+  isbn = {3-319-50763-X}
+}
+
+@inproceedings{beltaFormalMethodsDynamical2014,
+  title = {Formal {{Methods}} for {{Dynamical Systems}}},
+  booktitle = {2014 21st {{International Symposium}} on {{Temporal Representation}} and {{Reasoning}}},
+  author = {Belta, Calin},
+  date = {2014-09},
+  pages = {3--3},
+  issn = {2332-6468},
+  doi = {10.1109/TIME.2014.16},
+  url = {https://ieeexplore.ieee.org/document/6940367},
+  urldate = {2023-10-30},
+  abstract = {In control theory, "complex" models of physical processes, such as systems of differential equations, are usually checked against "simple" specifications, such as stability and set invariance. In formal methods, "rich" specifications, such as languages and formulae of temporal logics, are checked against "simple" models of software programs and digital circuits, such as finite transition graphs. With the development and integration of cyber physical and safety critical systems, there is an increasing need for computational tools for verification and control of complex systems from rich, temporal logic specifications. The formal verification and synthesis problems have been shown to be undecidable even for very simple classes of infinitespace continuous and hybrid systems. However, provably correct but conservative approaches, in which the satisfaction of a property by a dynamical system is implied by the satisfaction of the property by a finite over-approximation (abstraction) of the system, have received a lot of attention in recent years. Some classes of systems allowing for computationally efficient verification and control from temporal logic specifications are reviewed. For continuous and discrete-time linear systems and continuous-time multi-linear systems, it is shown that finite abstractions can be constructed through polyhedral operations only. By using techniques from model checking and automata games, this allows for verification and control from specifications given as Linear Temporal Logic (LTL) formulae over linear predicates in the state variables. A connection between the existence of Lyapunov functions and finite bisimulations is established for discrete-time linear and switched linear systems. Finally, optimality and correctness requirements are combined in a model predictive approach to generate control strategies for discrete-time linear systems. The usefulness of these computational tools is illustrated with various examples such as verification and synthesis of biological circuits in synthetic biology and motion planning and control in robotics.},
+  eventtitle = {2014 21st {{International Symposium}} on {{Temporal Representation}} and {{Reasoning}}},
+  file = {/home/danesabo/Zotero/storage/GRSZBL4X/Belta - 2014 - Formal Methods for Dynamical Systems.pdf;/home/danesabo/Zotero/storage/2SSRE3WT/6940367.html}
+}
+
+@article{benidirExtendedTableEliminating1990,
+  title = {Extended Table for Eliminating the Singularities in {{Routh}}'s Array},
+  author = {Benidir, M. and Picinbono, B.},
+  year = {Feb./1990},
+  journaltitle = {IEEE Transactions on Automatic Control},
+  shortjournal = {IEEE Trans. Automat. Contr.},
+  volume = {35},
+  number = {2},
+  pages = {218--222},
+  issn = {00189286},
+  doi = {10.1109/9.45185},
+  url = {http://ieeexplore.ieee.org/document/45185/},
+  urldate = {2024-03-04},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/GAFM9PG4/Benidir and Picinbono - 1990 - Extended table for eliminating the singularities i.pdf}
+}
+
+@article{bernardiSecurityModellingFormal2021,
+  title = {Security Modelling and Formal Verification of Survivability Properties: {{Application}} to Cyber–Physical Systems},
+  shorttitle = {Security Modelling and Formal Verification of Survivability Properties},
+  author = {Bernardi, S. and Gentile, U. and Marrone, S. and Merseguer, J. and Nardone, R.},
+  date = {2021-01},
+  journaltitle = {Journal of Systems and Software},
+  shortjournal = {Journal of Systems and Software},
+  volume = {171},
+  pages = {110746},
+  issn = {01641212},
+  doi = {10.1016/j.jss.2020.110746},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0164121220301710},
+  urldate = {2023-10-10},
+  abstract = {The modelling and verification of systems security is an open research topic whose complexity and importance needs, in our view, the use of formal and non-formal methods. This paper addresses the modelling of security using misuse cases and the automatic verification of survivability properties using model checking. The survivability of a system characterises its capacity to fulfil its mission (promptly) in the presence of attacks, failures, or accidents, as defined by Ellison. The original contributions of this paper are a methodology and its tool support, through a framework called surreal. The methodology starts from a misuse case specification enriched with UML profile annotations and obtains, as a byproduct, a survivability assessment model (SAM). Using predefined queries the survivability properties are proved in the SAM. A total of fourteen properties have been formulated and also implemented in surreal, which encompasses tools to model the security specification, to create the SAM and to prove the properties. Finally, the paper validates the methodology and the framework using a cyber–physical system (CPS) case study, in the automotive field.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/QST35ZQT/Bernardi et al. - 2021 - Security modelling and formal verification of surv.pdf}
+}
+
+@article{bertotCoqHurry2016,
+  title = {Coq in a {{Hurry}}},
+  author = {Bertot, Yves},
+  date = {2016-06-29},
+  pages = {49},
+  url = {https://cel.hal.science/inria-00001173},
+  urldate = {2024-01-22},
+  abstract = {These notes provide a quick introduction to the Coq system and show how it can be used to define logical concepts and functions and reason about them. It is designed as a tutorial, so that readers can quickly start their own experiments, learning only a few of the capabilities of the system. A much more comprehensive study is provided in [1], which also provides an extensive collection of exercises to train on.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/IU2M3ZIJ/Bertot - 2016 - Coq in a Hurry.pdf}
+}
+
+@article{berzComputationApplicationTaylor1998,
+  title = {Computation and {{Application}} of {{Taylor Polynomials}} with {{Interval Remainder Bounds}}},
+  author = {Berz, Martin and Hoffstätter, Georg},
+  date = {1998-02-01},
+  journaltitle = {Reliable Computing},
+  shortjournal = {Reliable Computing},
+  volume = {4},
+  number = {1},
+  pages = {83--97},
+  issn = {1573-1340},
+  doi = {10.1023/A:1009958918582},
+  url = {https://doi.org/10.1023/A:1009958918582},
+  urldate = {2023-10-30},
+  abstract = {The expansion of complicated functions of many variables in Taylor polynomials is an important problem for many applications, and in practice can be performed rather conveniently (even to high orders) using polynomial algebras. An important application of these methods is the field of beam physics, where often expansions in about six variables to orders between five and ten are used.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/SUMEMWNH/Berz and Hoffstätter - 1998 - Computation and Application of Taylor Polynomials .pdf}
+}
+
+@article{berztissFormalVerificationPrograms,
+  title = {Formal {{Verification}} of {{Programs}}},
+  author = {Berztiss, Alfs T and Ardis, Mark A},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/YZRTPDGC/Berztiss and Ardis - Formal Verification of Programs.pdf}
+}
+
+@article{berzVerifiedIntegrationODEs1998,
+  title = {Verified {{Integration}} of {{ODEs}} and {{Flows Using Differential Algebraic Methods}} on {{High-Order Taylor Models}}},
+  author = {Berz, Martin and Makino, Kyoko},
+  date = {1998-11-01},
+  journaltitle = {Reliable Computing},
+  shortjournal = {Reliable Computing},
+  volume = {4},
+  number = {4},
+  pages = {361--369},
+  issn = {1573-1340},
+  doi = {10.1023/A:1024467732637},
+  url = {https://doi.org/10.1023/A:1024467732637},
+  urldate = {2023-10-30},
+  abstract = {A method is developed that allows the verified integration of ODEs based on local modeling with high-order Taylor polynomials with remainder bound. The use of such Taylor models of order n allows convenient automated verified inclusion of functional dependencies with an accuracy that scales with the (n + 1)-st order of the domain and substantially reduces blow-up.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/DTAN4RVW/Berz and Makino - 1998 - Verified Integration of ODEs and Flows Using Diffe.pdf}
+}
+
+@article{besterfield-sacreDefiningOutcomesFramework2000,
+  title = {Defining the Outcomes: A Framework for {{EC-2000}}},
+  shorttitle = {Defining the Outcomes},
+  author = {Besterfield-Sacre, M. and Shuman, L.J. and Wolfe, H. and Atman, C.J. and McGourty, J. and Miller, R.L. and Olds, B.M. and Rogers, G.M.},
+  date = {2000-05},
+  journaltitle = {IEEE Transactions on Education},
+  volume = {43},
+  number = {2},
+  pages = {100--110},
+  issn = {1557-9638},
+  doi = {10.1109/13.848060},
+  url = {https://ieeexplore.ieee.org/abstract/document/848060?casa_token=Jpsiv1cWF_wAAAAA:3RukMC2EM9ZIIUhvq6gPSxj8Pp5mDlbUh-pZRVxsEjWgqeain-pbOt7RRo86x2io8DK-yflg8g},
+  urldate = {2024-01-30},
+  abstract = {The "new" Accreditation Board for Engineering and Technology criteria, EC-2000, has caused engineering educators to focus on 11 intentionally undefined outcomes as a necessary step in the accreditation process. As part of a large study sponsored by the National Science Foundation, a framework, based on Bloom's taxonomy, has been developed for better specifying these outcomes. Using this framework, each outcome has been expanded into a set of attributes that can then be used by engineering faculty in adapting the outcomes to their own program. Also discussed are two ways in which this characterization of outcomes can be used as part of an assessment and feedback process. These outcome definitions are considered to be in a dynamic state; i.e., they will continue to be modified and updated as more is learned about their specificity and use.},
+  eventtitle = {{{IEEE Transactions}} on {{Education}}},
+  file = {/home/danesabo/Zotero/storage/CUT9LFQ5/Besterfield-Sacre et al. - 2000 - Defining the outcomes a framework for EC-2000.pdf;/home/danesabo/Zotero/storage/834CICMU/848060.html}
+}
+
+@article{bhandalApplicationDigitalTwin2022,
+  title = {The Application of Digital Twin Technology in Operations and Supply Chain Management: A Bibliometric Review},
+  shorttitle = {The Application of Digital Twin Technology in Operations and Supply Chain Management},
+  author = {Bhandal, Rajinder and Mcriton, Royston and Kavanagh, Richard Edward and Brown, Anthony},
+  date = {2022-02-17},
+  journaltitle = {Supply Chain Management-an International Journal},
+  shortjournal = {Supply Chain Manag.},
+  volume = {27},
+  number = {2},
+  pages = {182--206},
+  publisher = {Emerald Group Publishing Ltd},
+  location = {Bingley},
+  issn = {1359-8546},
+  doi = {10.1108/SCM-01-2021-0053},
+  url = {http://www.webofscience.com/wos/woscc/summary/marked/relevance/1},
+  urldate = {2022-03-08},
+  abstract = {Purpose The application of digital twins to optimise operations and supply chain management functions is a bourgeoning practice. Scholars have attempted to keep pace with this development initiating a fast-evolving research agenda. The purpose of this paper is to take stock of the emerging research stream identifying trends and capture the value potential of digital twins to the field of operations and supply chain management. Design/methodology/approach In this work we employ a bibliometric literature review supported by bibliographic coupling and keyword co-occurrence network analysis to examine current trends in the research field regarding the value-added potential of digital twin in operations and supply chain management. Findings The main findings of this work are the identification of four value clusters and one enabler cluster. Value clusters are comprised of articles that describe how the application of digital twin can enhance supply chain activities at the level of business processes as well as the level of supply chain capabilities. Value clusters of production flow management and product development operate at the business processes level and are maturing communities. The supply chain resilience and risk management value cluster operates at the capability level, it is just emerging, and is positioned at the periphery of the main network. Originality/value This is the first study that attempts to conceptualise digital twin as a dynamic capability and employs bibliometric and network analysis on the research stream of digital twin in operations and supply chain management to capture evolutionary trends, literature communities and value-creation dynamics in a digital-twin-enabled supply chain.},
+  langid = {english},
+  keywords = {cyber-physical system},
+  annotation = {WOS:000753838000001},
+  file = {/home/danesabo/Zotero/storage/LLXN77UM/Bhandal et al. - 2022 - The application of digital twin technology in oper.pdf}
+}
+
+@inproceedings{bhurkeMethodsFormalAnalysis2021,
+  title = {Methods of {{Formal Analysis}} for {{ICS Protocols}} and {{HART}} - {{IP CPN}} Modelling},
+  booktitle = {2021 {{Asian Conference}} on {{Innovation}} in {{Technology}} ({{ASIANCON}})},
+  author = {Bhurke, Anish Uday and Kazi, Faruk},
+  date = {2021-08-27},
+  pages = {1--7},
+  publisher = {IEEE},
+  location = {PUNE, India},
+  doi = {10.1109/ASIANCON51346.2021.9544603},
+  url = {https://ieeexplore.ieee.org/document/9544603/},
+  urldate = {2023-10-10},
+  abstract = {Industrial Control System (ICS) used in critical infrastructure like energy sector, oil and natural gas, chemical processing, waste water treatment etc. are of great importance since it serves to a larger population and hence termed as National Critical Infrastructure (NCI). Security of such infrastructures is essential from physical as well as from cyber point of view. Traditional approach for the security was only physical consisting of creating SOP, access control, physical verification, etc. But due past cyber disturbing events like Stuxnet, Blackenergy-3, Turkey pipeline explosion, Havex, New York dam attack, etc. it is realized that the network security of the connected devices within the infrastructure is also of same importance. Various researches in this field have helped to make the NCI immune to a certain extent as well as resilient against cyber-attacks. One such approach is using Formal Analysis for performing security analysis of the communication protocols used in ICS domain. In this paper a compressive review of all available methods for formal analysis along with CPN modelling is done for analysis of valid as well as invalid states of HART protocol. The Modelling shows various states that the protocol can take during one transaction of communication. Further this analysis can be extended for other Fieldbus protocols for security analysis.},
+  eventtitle = {2021 {{Asian Conference}} on {{Innovation}} in {{Technology}} ({{ASIANCON}})},
+  isbn = {978-1-72818-402-9},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/YUG8WQ85/Bhurke and Kazi - 2021 - Methods of Formal Analysis for ICS Protocols and H.pdf}
+}
+
+@article{biblatex-cheat,
+  title = {Biblatex {{Cheat Sheet}}},
+  author = {Rees, Clea F},
+  pages = {2},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/R32TBWM3/Rees - Biblatex Cheat Sheet.pdf}
+}
+
+@incollection{biereBoundedModelChecking2003,
+  title = {Bounded {{Model Checking}}},
+  booktitle = {Advances in {{Computers}}},
+  author = {Biere, Armin and Cimatti, Alessandro and Clarke, Edmund M. and Strichman, Ofer and Zhu, Yunshan},
+  date = {2003},
+  volume = {58},
+  pages = {117--148},
+  publisher = {Elsevier},
+  doi = {10.1016/S0065-2458(03)58003-2},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0065245803580032},
+  urldate = {2023-11-02},
+  abstract = {Symbolic model checking with Binary Decision Diagrams (BDDs) has been successfully used in the last decade for formally verifying finite state systems such as sequential circuits and protocols. Since its introduction in the beginning of the 90’s, it has been integrated in the quality assurance process of several major hardware companies. The main bottleneck of this method is that BDDs may grow exponentially, and hence the amount of available memory restricts the size of circuits that can be verified efficiently. In this article we survey a technique called Bounded Model Checking (BMC), which uses a propositional SAT solver rather than BDD manipulation techniques. Since its introduction in 1999, BMC has been well received by the industry. It can find many logical errors in complex systems that can not be handled by competing techniques, and is therefore widely perceived as a complementary technique to BDD-based model checking. This observation is supported by several independent comparisons that have been published in the last few years.},
+  isbn = {978-0-12-012158-8},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/YYVN39RT/Biere et al. - 2003 - Bounded Model Checking.pdf}
+}
+
+@book{bifflSecurityQualityCyberPhysical2019,
+  title = {Security and {{Quality}} in {{Cyber-Physical Systems Engineering}}: {{With Forewords}} by {{Robert M}}. {{Lee}} and {{Tom Gilb}}},
+  shorttitle = {Security and {{Quality}} in {{Cyber-Physical Systems Engineering}}},
+  editor = {Biffl, Stefan and Eckhart, Matthias and Lüder, Arndt and Weippl, Edgar},
+  date = {2019},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-030-25312-7},
+  url = {http://link.springer.com/10.1007/978-3-030-25312-7},
+  urldate = {2023-10-11},
+  isbn = {978-3-030-25311-0 978-3-030-25312-7},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/WRY7XD7X/Biffl et al. - 2019 - Security and Quality in Cyber-Physical Systems Eng.pdf}
+}
+
+@article{biggsEnhancingTeachingConstructive1996,
+  title = {Enhancing Teaching through Constructive Alignment},
+  author = {Biggs, John},
+  date = {1996-10-01},
+  journaltitle = {Higher Education},
+  shortjournal = {High Educ},
+  volume = {32},
+  number = {3},
+  pages = {347--364},
+  issn = {1573-174X},
+  doi = {10.1007/BF00138871},
+  url = {https://doi.org/10.1007/BF00138871},
+  urldate = {2024-01-26},
+  abstract = {Two lines of thinking are becoming increasingly important in higher educational practice. The first derives from constructivist learning theory, and the second from the instructional design literature. Constructivism comprises a family of theories but all have in common the centrality of the learner's activities in creating meaning. These and related ideas have important implications for teaching and assessment. Instructional designers for their part have emphasised alignment between the objectives of a course or unit and the targets for assessing student performance. “Constructive alignment” represents a marriage of the two thrusts, constructivism being used as a framework to guide decision-making at all stages in instructional design: in deriving curriculum objectives in terms of performances that represent a suitably high cognitive level, in deciding teaching/learning activities judged to elicit those performances, and to assess and summatively report student performance. The “performances of understanding” nominated in the objectives are thus used to systematically align the teaching methods and the assessment. The process is illustrated with reference to a professional development unit in educational psychology for teachers, but the model may be generalized to most units or programs in higher education.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/DIDSY7TD/Biggs - 1996 - Enhancing teaching through constructive alignment.pdf}
+}
+
+@article{blanchiniModelFreePlantTuning2017,
+  title = {Model-{{Free Plant Tuning}}},
+  author = {Blanchini, Franco and Fenu, Gianfranco and Giordano, Giulia and Pellegrino, Felice Andrea},
+  date = {2017-06},
+  journaltitle = {IEEE Transactions on Automatic Control},
+  volume = {62},
+  number = {6},
+  pages = {2623--2634},
+  issn = {1558-2523},
+  doi = {10.1109/TAC.2016.2616025},
+  url = {https://ieeexplore.ieee.org/abstract/document/7586127},
+  urldate = {2024-07-10},
+  abstract = {Given a static plant described by a differentiable input-output function, which is completely unknown, but whose Jacobian takes values in a known polytope in the matrix space, this paper considers the problem of tuning (i.e., driving to a desired value) the output, by suitably choosing the input. It is shown that, if the polytope is robustly nonsingular (or has full rank, in the nonsquare case), then a suitable tuning scheme drives the output to the desired point. The proof exploits a Lyapunov-like function and applies a well-known game-theoretic result, concerning the existence of a saddle point for a min-max zero-sum game. When the plant output is represented in an implicit form, it is shown that the same result can be obtained, resorting to a different Lyapunov-like function. The case in which proper input or output constraints must be enforced during the transient is considered as well. Some application examples are proposed to show the effectiveness of the approach.},
+  keywords = {Games,Generators,Jacobian matrices,Lyapunov methods,min-max theorem robust control,Robustness,Steady-state,Transient analysis,Tuning,uncertain systems},
+  file = {/home/danesabo/Zotero/storage/EIWCR5N3/Blanchini et al. - 2017 - Model-Free Plant Tuning.pdf;/home/danesabo/Zotero/storage/M3UQ3IZC/Blanchini et al. - 2017 - Model-Free Plant Tuning.html}
+}
+
+@article{blanchiniModelFreePlantTuning2017a,
+  title = {Model-{{Free Plant Tuning}}},
+  author = {Blanchini, Franco and Fenu, Gianfranco and Giordano, Giulia and Pellegrino, Felice Andrea},
+  date = {2017-06},
+  journaltitle = {IEEE Transactions on Automatic Control},
+  volume = {62},
+  number = {6},
+  pages = {2623--2634},
+  issn = {1558-2523},
+  doi = {10.1109/TAC.2016.2616025},
+  url = {https://ieeexplore.ieee.org/abstract/document/7586127},
+  urldate = {2024-07-10},
+  abstract = {Given a static plant described by a differentiable input-output function, which is completely unknown, but whose Jacobian takes values in a known polytope in the matrix space, this paper considers the problem of tuning (i.e., driving to a desired value) the output, by suitably choosing the input. It is shown that, if the polytope is robustly nonsingular (or has full rank, in the nonsquare case), then a suitable tuning scheme drives the output to the desired point. The proof exploits a Lyapunov-like function and applies a well-known game-theoretic result, concerning the existence of a saddle point for a min-max zero-sum game. When the plant output is represented in an implicit form, it is shown that the same result can be obtained, resorting to a different Lyapunov-like function. The case in which proper input or output constraints must be enforced during the transient is considered as well. Some application examples are proposed to show the effectiveness of the approach.},
+  eventtitle = {{{IEEE Transactions}} on {{Automatic Control}}},
+  keywords = {Games,Generators,Jacobian matrices,Lyapunov methods,min-max theorem robust control,Robustness,Steady-state,Transient analysis,Tuning,uncertain systems},
+  file = {/home/danesabo/Zotero/storage/L3QSB6YH/Blanchini et al. - 2017 - Model-Free Plant Tuning.pdf}
+}
+
+@inproceedings{blumreiterSelfExplainableCyberPhysicalSystems2019,
+  title = {Towards {{Self-Explainable Cyber-Physical Systems}}},
+  booktitle = {2019 {{ACM}}/{{IEEE}} 22nd {{International Conference}} on {{Model Driven Engineering Languages}} and {{Systems Companion}} ({{MODELS-C}})},
+  author = {Blumreiter, Mathias and Greenyer, Joel and Chiyah Garcia, Francisco Javier and Klos, Verena and Schwammberger, Maike and Sommer, Christoph and Vogelsang, Andreas and Wortmann, Andreas},
+  date = {2019-09},
+  pages = {543--548},
+  publisher = {IEEE},
+  location = {Munich, Germany},
+  doi = {10.1109/MODELS-C.2019.00084},
+  url = {https://ieeexplore.ieee.org/document/8904796/},
+  urldate = {2023-10-11},
+  abstract = {With the increasing complexity of Cyber-Physical Systems, their behavior and decisions become increasingly difficult to understand and comprehend for users and other stakeholders. Our vision is to build self-explainable systems that can, at run-time, answer questions about the system’s past, current, and future behavior. As hitherto no design methodology or reference framework exists for building such systems, we propose the Monitor, Analyze, Build, Explain (MAB-EX) framework for building self-explainable systems that leverage requirements- and explainability models at run-time. The basic idea of MAB-EX is to first Monitor and Analyze a certain behavior of a system, then Build an explanation from explanation models and convey this EXplanation in a suitable way to a stakeholder. We also take into account that new explanations can be learned, by updating the explanation models, should new and yet unexplainable behavior be detected by the system.},
+  eventtitle = {2019 {{ACM}}/{{IEEE}} 22nd {{International Conference}} on {{Model Driven Engineering Languages}} and {{Systems Companion}} ({{MODELS-C}})},
+  isbn = {978-1-72815-125-0},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/RN7QFCDR/Blumreiter et al. - 2019 - Towards Self-Explainable Cyber-Physical Systems.pdf}
+}
+
+@book{boldoComputerArithmeticFormal2017,
+  title = {Computer {{Arithmetic}} and {{Formal Proofs}}:  {{Verifying Floating-point Algorithms}} with the {{Coq System}}},
+  author = {Boldo, Sylvie and Melquiond, Guillaume},
+  date = {2017},
+  publisher = {ITSE Press, Ltd}
+}
+
+@book{boldoComputerArithmeticFormal2017a,
+  title = {Computer Arithmetic and Formal Proofs: Verifying Floating-Point Algorithms with the {{Coq}} System},
+  author = {Boldo, Sylvie and Melquiond, Guillaume},
+  date = {2017},
+  publisher = {Elsevier},
+  isbn = {0-08-101170-9}
+}
+
+@inproceedings{boldoFlocqUnifiedLibrary2011,
+  title = {Flocq: {{A Unified Library}} for {{Proving Floating-Point Algorithms}} in {{Coq}}},
+  shorttitle = {Flocq},
+  booktitle = {2011 {{IEEE}} 20th {{Symposium}} on {{Computer Arithmetic}}},
+  author = {Boldo, Sylvie and Melquiond, Guillaume},
+  date = {2011-07},
+  pages = {243--252},
+  publisher = {IEEE},
+  location = {Tuebingen, Germany},
+  doi = {10.1109/ARITH.2011.40},
+  url = {http://ieeexplore.ieee.org/document/5992132/},
+  urldate = {2024-01-16},
+  abstract = {Several formalizations of floating-point arithmetic have been designed for the Coq system, a generic proof assistant. Their different purposes have favored some specific applications: program verification, high-level properties, automation. Based on our experience using and/or developing these libraries, we have built a new system that is meant to encompass the other ones in a unified framework. It offers a multi-radix and multi-precision formalization for various floating- and fixed-point formats. This fresh setting has been the occasion for reevaluating known properties and generalizing them. This paper presents design decisions and examples of theorems from the Flocq system: a library easy to use, suitable for automation yet high-level and generic.},
+  eventtitle = {2011 {{IEEE}} 20th {{Symposium}} on {{Computer Arithmetic}} ({{ARITH}})},
+  isbn = {978-1-4244-9457-6},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/ZC4NLBJP/Boldo and Melquiond - 2011 - Flocq A Unified Library for Proving Floating-Poin.pdf}
+}
+
+@article{boldoWaveEquationNumerical2013,
+  title = {Wave {{Equation Numerical Resolution}}: {{A Comprehensive Mechanized Proof}} of a {{C Program}}},
+  shorttitle = {Wave {{Equation Numerical Resolution}}},
+  author = {Boldo, Sylvie and Clément, François and Filliâtre, Jean-Christophe and Mayero, Micaela and Melquiond, Guillaume and Weis, Pierre},
+  date = {2013-04-01},
+  journaltitle = {Journal of Automated Reasoning},
+  shortjournal = {J Autom Reasoning},
+  volume = {50},
+  number = {4},
+  pages = {423--456},
+  issn = {1573-0670},
+  doi = {10.1007/s10817-012-9255-4},
+  url = {https://doi.org/10.1007/s10817-012-9255-4},
+  urldate = {2024-03-19},
+  abstract = {We formally prove correct a C program that implements a numerical scheme for the resolution of the one-dimensional acoustic wave equation. Such an implementation introduces errors at several levels: the numerical scheme introduces method errors, and floating-point computations lead to round-off errors. We annotate this C program to specify both method error and round-off error. We use Frama-C to generate theorems that guarantee the soundness of the code. We discharge these theorems using SMT solvers, Gappa, and Coq. This involves a large Coq development to prove the adequacy of the C program to the numerical scheme and to bound errors. To our knowledge, this is the first time such a numerical analysis program is fully machine-checked.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/R8HBQT6A/Boldo et al. - 2013 - Wave Equation Numerical Resolution A Comprehensiv.pdf}
+}
+
+@article{boldoWaveEquationNumerical2013a,
+  title = {Wave {{Equation Numerical Resolution}}: {{A Comprehensive Mechanized Proof}} of a {{C Program}}},
+  shorttitle = {Wave {{Equation Numerical Resolution}}},
+  author = {Boldo, Sylvie and Clément, François and Filliâtre, Jean-Christophe and Mayero, Micaela and Melquiond, Guillaume and Weis, Pierre},
+  date = {2013-04-01},
+  journaltitle = {Journal of Automated Reasoning},
+  shortjournal = {J Autom Reasoning},
+  volume = {50},
+  number = {4},
+  pages = {423--456},
+  issn = {1573-0670},
+  doi = {10.1007/s10817-012-9255-4},
+  url = {https://doi.org/10.1007/s10817-012-9255-4},
+  urldate = {2024-03-19},
+  abstract = {We formally prove correct a C program that implements a numerical scheme for the resolution of the one-dimensional acoustic wave equation. Such an implementation introduces errors at several levels: the numerical scheme introduces method errors, and floating-point computations lead to round-off errors. We annotate this C program to specify both method error and round-off error. We use Frama-C to generate theorems that guarantee the soundness of the code. We discharge these theorems using SMT solvers, Gappa, and Coq. This involves a large Coq development to prove the adequacy of the C program to the numerical scheme and to bound errors. To our knowledge, this is the first time such a numerical analysis program is fully machine-checked.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/NLHQNXSN/Boldo et al. - 2013 - Wave Equation Numerical Resolution A Comprehensiv.pdf}
+}
+
+@article{booktabs,
+  title = {Booktabs: Quality Tables in {{LATEX}}},
+  author = {Fear, Simon},
+  pages = {17},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/ZN2GFZDI/Fear - Publication quality tables in LATEX.pdf}
+}
+
+@article{borchaniSurveyMultioutputRegression2015,
+  title = {A Survey on Multi-Output Regression},
+  author = {Borchani, Hanen and Varando, Gherardo and Bielza, Concha and Larrañaga, Pedro},
+  date = {2015},
+  journaltitle = {WIREs Data Mining and Knowledge Discovery},
+  volume = {5},
+  number = {5},
+  pages = {216--233},
+  issn = {1942-4795},
+  doi = {10.1002/widm.1157},
+  url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/widm.1157},
+  urldate = {2022-04-20},
+  abstract = {In recent years, a plethora of approaches have been proposed to deal with the increasingly challenging task of multi-output regression. This study provides a survey on state-of-the-art multi-output regression methods, that are categorized as problem transformation and algorithm adaptation methods. In addition, we present the mostly used performance evaluation measures, publicly available data sets for multi-output regression real-world problems, as well as open-source software frameworks. WIREs Data Mining Knowl Discov 2015, 5:216–233. doi: 10.1002/widm.1157 This article is categorized under: Technologies {$>$} Machine Learning},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/548PCU92/Borchani et al. - 2015 - A survey on multi-output regression.pdf;/home/danesabo/Zotero/storage/THZZJIXI/widm.html}
+}
+
+@article{bourbouhCoCoSimCodeGeneration,
+  title = {{{CoCoSim}}, a Code Generation Framework for Control/Command Applications {{An}} Overview of {{CoCoSim}} for Multi-Periodic Discrete {{Simulink}} Models},
+  author = {Bourbouh, Hamza and Garoche, Pierre-Loïc and Loquen, Thomas and Noulard, Éric and Pagetti, Claire},
+  abstract = {We present CoCoSim, a framework to support the design, code generation and analysis of discrete dataflow model expressed in Simulink. In this work, we specifically focus on the analysis and code generation of multi-periodic systems. For that CoCoSim provides two complementary approaches: the first amounts to encode the multiperiodic semantics in a pure-synchronous one – à la Lustre–, enabling the use of model checker for verifying properties. The second provides a faithful code generation into multiple communicating (mono)synchronous components – à la Prelude–that can be then simulated or embedded in the final platform with any real-time scheduler. These approaches have been experimented in various settings.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/JDXYWMDE/Bourbouh et al. - CoCoSim, a code generation framework for controlc.pdf}
+}
+
+@inproceedings{brajeAdversarySafetyConstruction2022,
+  title = {Adversary Safety by Construction in a Language of Cryptographic Protocols},
+  booktitle = {2022 {{IEEE}} 35th {{Computer Security Foundations Symposium}} ({{CSF}})},
+  author = {Braje, Timothy M. and Lee, Alice R. and Wagner, Andrew and Kaiser, Benjamin and Park, Daniel and Kalke, Martine and Cunningham, Robert K. and Chlipala, Adam},
+  date = {2022},
+  pages = {412--427},
+  publisher = {IEEE},
+  isbn = {1-66548-417-9},
+  file = {/home/danesabo/Zotero/storage/29RD9H85/Braje et al. - Adversary Safety by Construction in a Language of .pdf}
+}
+
+@article{brandmanPhysicalHashPreventing2020,
+  title = {A Physical Hash for Preventing and Detecting Cyber-Physical Attacks in Additive Manufacturing Systems},
+  author = {Brandman, Josh and Sturm, Logan and White, Jules and Williams, Chris},
+  date = {2020-07-01},
+  journaltitle = {Journal of Manufacturing Systems},
+  shortjournal = {Journal of Manufacturing Systems},
+  volume = {56},
+  pages = {202--212},
+  issn = {0278-6125},
+  doi = {10.1016/j.jmsy.2020.05.014},
+  url = {https://www.sciencedirect.com/science/article/pii/S0278612520300789},
+  urldate = {2023-09-27},
+  abstract = {Cyber-physical security is a major concern in the modern environment of digital manufacturing, wherein a cyber-attack has the potential to result in the production of defective parts, theft of IP, or damage to infrastructure or the operator have become a real threat that have the potential to create bad parts. Current cyber only solutions are insufficient due to the nature of manufacturing environments where it may not be feasible or even possible to upgrade physical equipment to the most current cyber security standards, necessitating an approach that addresses both the cyber and the physical components. This paper proposes a new method for detecting malicious cyber-physical attacks on additive manufacturing (AM) systems. The method makes use of a physical hash, which links digital data to the manufactured part via a disconnected side-channel measurement system. The disconnection ensures that if the network and/or AM system becomes compromised, the manufacturer can still rely on the measurement system for attack detection. The physical hash ensures protection of the intellectual property (IP) associated with both process and toolpath parameters while also enabling in situ quality assurance. In this paper, the physical hash takes the form of a QR code that contains a hash string of the nominal process parameters and toolpath. It is manufactured alongside the original geometry for the measurement system to scan and compare to the readings from its sensor suite. By taking measurements in situ, the measurement system can detect in real-time if the part being manufactured matches the designer’s specification. In this paper, the overall concept and underlying algorithm of the physical hash is presented. A proof-of-concept validation is realized on a material extrusion AM machine, to demonstrate the ability of a physical hash and in situ monitoring to detect the existence (and absence) of malicious attacks on the STL file, the printing process parameters, and the printing toolpath.},
+  file = {/home/danesabo/Zotero/storage/NV4232RN/Brandman et al. - 2020 - A physical hash for preventing and detecting cyber.pdf}
+}
+
+@article{brandtnerEntropicRiskMeasures2018,
+  title = {Entropic Risk Measures and Their Comparative Statics in Portfolio Selection: {{Coherence}} vs. Convexity},
+  shorttitle = {Entropic Risk Measures and Their Comparative Statics in Portfolio Selection},
+  author = {Brandtner, Mario and Kürsten, Wolfgang and Rischau, Robert},
+  date = {2018-01},
+  journaltitle = {European Journal of Operational Research},
+  shortjournal = {European Journal of Operational Research},
+  volume = {264},
+  number = {2},
+  pages = {707--716},
+  issn = {03772217},
+  doi = {10.1016/j.ejor.2017.07.007},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0377221717306343},
+  urldate = {2024-01-26},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/5TBV5DU9/Brandtner et al. - 2018 - Entropic risk measures and their comparative stati.pdf}
+}
+
+@inproceedings{branickyAnalyzingContinuousSwitching1994,
+  title = {Analyzing Continuous Switching Systems: Theory and Examples},
+  shorttitle = {Analyzing Continuous Switching Systems},
+  booktitle = {Proceedings of 1994 {{American Control Conference}} - {{ACC}} '94},
+  author = {Branicky, M.S.},
+  date = {1994-06},
+  volume = {3},
+  pages = {3110-3114 vol.3},
+  doi = {10.1109/ACC.1994.735143},
+  url = {https://ieeexplore.ieee.org/document/735143},
+  urldate = {2024-01-16},
+  abstract = {This paper details work on ordinary differential equations that continuously switch among regimes of operation. In the first part, we develop some tools for analyzing such systems. We prove an extension of Bendixson's theorem to the case of Lipschitz continuous vector fields. We also prove a lemma dealing with the robustness of differential equations with respect to perturbations that preserve a linear part, which we call the linear robustness lemma (LRL). We then give some simple propositions that allow us to use this lemma in studying certain singular perturbation problems. In the second part, the attention focuses on example systems and their analysis. We use the tools from the first part and develop some general insights. The example systems arise from a realistic aircraft control problem. The extension of Bendixson's theorem and the LRL have applicability beyond the systems discussed in this paper.},
+  eventtitle = {Proceedings of 1994 {{American Control Conference}} - {{ACC}} '94},
+  file = {/home/danesabo/Zotero/storage/RKHNBI5U/Branicky - 1994 - Analyzing continuous switching systems theory and.pdf;/home/danesabo/Zotero/storage/7FKIYSN8/735143.html}
+}
+
+@incollection{branickyIntroductionHybridSystems2005,
+  title = {Introduction to {{Hybrid Systems}}},
+  booktitle = {Handbook of {{Networked}} and {{Embedded Control Systems}}},
+  author = {Branicky, Michael S.},
+  editor = {Hristu-Varsakelis, Dimitrios and Levine, William S.},
+  date = {2005},
+  pages = {91--116},
+  publisher = {Birkhäuser Boston},
+  location = {Boston, MA},
+  doi = {10.1007/0-8176-4404-0_5},
+  url = {http://link.springer.com/10.1007/0-8176-4404-0_5},
+  urldate = {2024-01-16},
+  abstract = {Hybrid systems arise when the continuous and the discrete meet. Combine continuous and discrete inputs, outputs, states, or dynamics, and you have a hybrid system. Particularly, hybrid systems arise from the use of finite-state logic to govern continuous physical processes (as in embedded control systems) or from topological and network constraints interacting with continuous control (as in networked control systems). This chapter provides an introduction to hybrid systems, building them up first from the completely continuous side and then from the completely discrete side. It should be accessible to control theorists and computer scientists alike.},
+  isbn = {978-0-8176-3239-7 978-0-8176-4404-8},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/ECDHT5FK/Branicky - 2005 - Introduction to Hybrid Systems.pdf}
+}
+
+@article{branickyMultipleLyapunovFunctions1998,
+  title = {Multiple {{Lyapunov}} Functions and Other Analysis Tools for Switched and Hybrid Systems},
+  author = {Branicky, M.S.},
+  date = {1998-04},
+  journaltitle = {IEEE Transactions on Automatic Control},
+  volume = {43},
+  number = {4},
+  pages = {475--482},
+  issn = {1558-2523},
+  doi = {10.1109/9.664150},
+  url = {https://ieeexplore.ieee.org/document/664150},
+  urldate = {2024-01-16},
+  abstract = {We introduce some analysis tools for switched and hybrid systems. We first present work on stability analysis. We introduce multiple Lyapunov functions as a tool for analyzing Lyapunov stability and use iterated function systems theory as a tool for Lagrange stability. We also discuss the case where the switched systems are indexed by an arbitrary compact set. Finally, we extend Bendixson's theorem to the case of Lipschitz continuous vector fields, allowing limit cycle analysis of a class of "continuous switched" systems.},
+  eventtitle = {{{IEEE Transactions}} on {{Automatic Control}}},
+  file = {/home/danesabo/Zotero/storage/RU3Y8BYT/Branicky - 1998 - Multiple Lyapunov functions and other analysis too.pdf;/home/danesabo/Zotero/storage/DFU9PIWV/664150.html}
+}
+
+@inproceedings{branickySolvingHybridControl2000,
+  title = {Solving Hybrid Control Problems: Level Sets and Behavioral Programming},
+  shorttitle = {Solving Hybrid Control Problems},
+  booktitle = {Proceedings of the 2000 {{American Control Conference}}. {{ACC}} ({{IEEE Cat}}. {{No}}.{{00CH36334}})},
+  author = {Branicky, M.S. and Zhang, G.},
+  date = {2000-06},
+  volume = {2},
+  pages = {1175-1180 vol.2},
+  issn = {0743-1619},
+  doi = {10.1109/ACC.2000.876685},
+  url = {https://ieeexplore.ieee.org/document/876685},
+  urldate = {2024-01-16},
+  abstract = {Hybrid systems include both continuous dynamics and discrete events. We represent the continuous dynamics by differential equations and represent the events by a discrete transition model. We describe computational approaches to solving optimal hybrid control problems using two techniques: a fast marching level set method and behavioral programming. We review our extension of the fast marching level set method to the hybrid setting, including its formalization, a constructive proof of its correctness, approximation errors to the analog solution, and upper- and lower-bounding approximate solutions. Our work also explores an idea known as behavioral programming. We review the theoretical underpinnings and then perform some experiments using this technique to solve a specific problem in robotic assembly, the peg-in-hole problem. We demonstrate the abstraction of primitive actions into behaviors, try out several strategies for combining behaviors, and compare their optimality and computational effort vis-a-vis primitive actions.},
+  eventtitle = {Proceedings of the 2000 {{American Control Conference}}. {{ACC}} ({{IEEE Cat}}. {{No}}.{{00CH36334}})},
+  file = {/home/danesabo/Zotero/storage/9SYCJ9SN/Branicky and Zhang - 2000 - Solving hybrid control problems level sets and be.pdf;/home/danesabo/Zotero/storage/IUU6XNNQ/876685.html}
+}
+
+@inproceedings{branickyStabilityHybridSystems1997,
+  title = {Stability of Hybrid Systems: State of the Art},
+  shorttitle = {Stability of Hybrid Systems},
+  booktitle = {Proceedings of the 36th {{IEEE Conference}} on {{Decision}} and {{Control}}},
+  author = {Branicky, M.S.},
+  date = {1997-12},
+  volume = {1},
+  pages = {120-125 vol.1},
+  issn = {0191-2216},
+  doi = {10.1109/CDC.1997.650600},
+  url = {https://ieeexplore.ieee.org/document/650600},
+  urldate = {2024-01-16},
+  abstract = {This paper collects work on the stability analysis of hybrid systems. The hybrid systems considered are those that combine continuous dynamics (represented by differential or difference equations) with finite dynamics, usually thought of as being a finite automaton. We review multiple Lyapunov functions as a tool for analyzing Lyapunov stability of general hybrid systems. Background results, the author's introductory work, and subsequent extensions are covered. Specializing to hybrid systems with linear dynamics in each constituent mode and linear jump operators, we review some key theorems of Barabanov-Staroshilov (1988), and give corollaries encompassing several recently-derived "stability by first approximation" theorems in the literature. We also comment on the use of computational tests for stability of hybrid systems, and the general complexity. The result is a tutorial on the state of the art in theory and computation of hybrid systems stability.},
+  eventtitle = {Proceedings of the 36th {{IEEE Conference}} on {{Decision}} and {{Control}}},
+  file = {/home/danesabo/Zotero/storage/UUWDHV3I/Branicky - 1997 - Stability of hybrid systems state of the art.pdf;/home/danesabo/Zotero/storage/HWR8AGZP/650600.html}
+}
+
+@inproceedings{branickyStabilityHybridSystems1997a,
+  title = {Stability of Hybrid Systems: State of the Art},
+  shorttitle = {Stability of Hybrid Systems},
+  booktitle = {Proceedings of the 36th {{IEEE Conference}} on {{Decision}} and {{Control}}},
+  author = {Branicky, M.S.},
+  date = {1997},
+  volume = {1},
+  pages = {120--125},
+  publisher = {IEEE},
+  location = {San Diego, CA, USA},
+  doi = {10.1109/CDC.1997.650600},
+  url = {http://ieeexplore.ieee.org/document/650600/},
+  urldate = {2024-03-04},
+  eventtitle = {36th {{IEEE Conference}} on {{Decision}} and {{Control}}},
+  isbn = {978-0-7803-4187-6}
+}
+
+@inproceedings{branickyStabilitySwitchedHybrid1994,
+  title = {Stability of Switched and Hybrid Systems},
+  booktitle = {Proceedings of 1994 33rd {{IEEE Conference}} on {{Decision}} and {{Control}}},
+  author = {Branicky, M.S.},
+  date = {1994-12},
+  volume = {4},
+  pages = {3498-3503 vol.4},
+  doi = {10.1109/CDC.1994.411688},
+  url = {https://ieeexplore.ieee.org/document/411688},
+  urldate = {2024-01-16},
+  abstract = {This paper outlines some preliminary work on the stability analysis of switched and hybrid systems. The hybrid systems considered are those that combine continuous dynamics, represented by differential or difference equations, with finite dynamics usually thought of as being a finite automaton. Here, we concentrate on the continuous dynamics and model the finite dynamics as switching among finitely many continuous systems. We introduce multiple Lyapunov functions as a tool for analyzing Lyapunov stability of such "switched systems". We use iterated function systems theory as a tool for Lagrange stability. We also discuss the case where the switched systems are indexed by an arbitrary compact set.{$<>$}},
+  eventtitle = {Proceedings of 1994 33rd {{IEEE Conference}} on {{Decision}} and {{Control}}},
+  file = {/home/danesabo/Zotero/storage/8P3E82NG/Branicky - 1994 - Stability of switched and hybrid systems.pdf}
+}
+
+@thesis{branickyStudiesHybridSystems1995,
+  title = {Studies in {{Hybrid Systems}}:  {{Modeling}}, {{Analysis}}, and {{Control}}},
+  author = {Branicky, Michael S.},
+  date = {1995},
+  institution = {MIT},
+  file = {/home/danesabo/Zotero/storage/2DQB9B7W/33226976-MIT.pdf}
+}
+
+@inproceedings{branickyTopologyHybridSystems1993,
+  title = {Topology of Hybrid Systems},
+  booktitle = {Proceedings of 32nd {{IEEE Conference}} on {{Decision}} and {{Control}}},
+  author = {Branicky, M.S.},
+  date = {1993-12},
+  pages = {2309-2314 vol.3},
+  doi = {10.1109/CDC.1993.325609},
+  url = {https://ieeexplore.ieee.org/document/325609},
+  urldate = {2024-01-16},
+  abstract = {We discuss topological issues that arise when differential equations and finite automata interact (hybrid systems). In particular, we examine topologies for achieving continuity of maps from a set of measurements of continuous dynamics to a finite set of input symbols and from a finite set of output symbols into the control space for those continuous dynamics. Finding some anomalies in completing this loop, we discuss a new view of hybrid systems that may broach them and is more in line with traditional control systems. In fact, the most widely used fuzzy control system is related to this new view and does not possess these anomalies. Indeed, we show that fuzzy control leads to continuous maps (from measurements to controls) and that all such continuous maps may be implemented via fuzzy control.{$<>$}},
+  eventtitle = {Proceedings of 32nd {{IEEE Conference}} on {{Decision}} and {{Control}}},
+  file = {/home/danesabo/Zotero/storage/SM3N5268/Branicky - 1993 - Topology of hybrid systems.pdf;/home/danesabo/Zotero/storage/XXTGKMN7/325609.html}
+}
+
+@inproceedings{branickyUnifiedFrameworkHybrid1994,
+  title = {A Unified Framework for Hybrid Control},
+  booktitle = {Proceedings of 1994 33rd {{IEEE Conference}} on {{Decision}} and {{Control}}},
+  author = {Branicky, M.S. and Borkar, V.S. and Mitter, S.K.},
+  date = {1994-12},
+  volume = {4},
+  pages = {4228-4234 vol.4},
+  doi = {10.1109/CDC.1994.411615},
+  url = {https://ieeexplore.ieee.org/document/411615},
+  urldate = {2024-01-16},
+  abstract = {We propose a very general framework for hybrid control problems that encompasses several types of hybrid phenomena considered in the literature. A specific control problem is studied in this framework, leading to an existence result for optimal controls. The "value function" associated with this problem is expected to satisfy a set of "generalized quasi-variational inequalities".{$<>$}},
+  eventtitle = {Proceedings of 1994 33rd {{IEEE Conference}} on {{Decision}} and {{Control}}},
+  file = {/home/danesabo/Zotero/storage/66RJAFNB/Branicky et al. - 1994 - A unified framework for hybrid control.pdf}
+}
+
+@article{branickyUnifiedFrameworkHybrid1998,
+  title = {A Unified Framework for Hybrid Control: Model and Optimal Control Theory},
+  shorttitle = {A Unified Framework for Hybrid Control},
+  author = {Branicky, M.S. and Borkar, V.S. and Mitter, S.K.},
+  date = {1998-01},
+  journaltitle = {IEEE Transactions on Automatic Control},
+  volume = {43},
+  number = {1},
+  pages = {31--45},
+  issn = {1558-2523},
+  doi = {10.1109/9.654885},
+  url = {https://ieeexplore.ieee.org/document/654885},
+  urldate = {2024-01-16},
+  abstract = {We propose a very general framework that systematizes the notion of a hybrid system, combining differential equations and automata, governed by a hybrid controller that issues continuous-variable commands and makes logical decisions. We first identify the phenomena that arise in real-world hybrid systems. Then, we introduce a mathematical model of hybrid systems as interacting collections of dynamical systems, evolving on continuous-variable state spaces and subject to continuous controls and discrete transitions. The model captures the identified phenomena, subsumes previous models, yet retains enough structure to pose and solve meaningful control problems. We develop a theory for synthesizing hybrid controllers for hybrid plants in all optimal control framework. In particular, we demonstrate the existence of optimal (relaxed) and near-optimal (precise) controls and derive "generalized quasi-variational inequalities" that the associated value function satisfies. We summarize algorithms for solving these inequalities based on a generalized Bellman equation, impulse control, and linear programming.},
+  eventtitle = {{{IEEE Transactions}} on {{Automatic Control}}},
+  file = {/home/danesabo/Zotero/storage/JV94PIIA/Branicky et al. - 1998 - A unified framework for hybrid control model and .pdf;/home/danesabo/Zotero/storage/WEDHD2UZ/654885.html}
+}
+
+@misc{breenLevelSetMethods,
+  title = {Level {{Set Methods}} for {{Visualization}}},
+  author = {Breen, David and Museth, Ken},
+  file = {/home/danesabo/Zotero/storage/BH9FC2S4/Viz06_LS_Course_Notes.pdf}
+}
+
+@unpublished{brockApplicationReinforcementLearning2021,
+  title = {An Application of Reinforcement Learning to Residential Energy Storage under Real-Time Pricing},
+  author = {Brock, Eli and Bruckstein, Lauren and Connor, Patrick and Nguyen, Sabrina and Kerestes, Robert and Abdelhakim, Mai},
+  date = {2021-11-22},
+  eprint = {2111.11367},
+  eprinttype = {arXiv},
+  eprintclass = {cs, eess},
+  url = {http://arxiv.org/abs/2111.11367},
+  urldate = {2022-03-25},
+  abstract = {With the proliferation of advanced metering infrastructure (AMI), more real-time data is available to electric utilities and consumers. Such high volumes of data facilitate innovative electricity rate structures beyond flat-rate and time-of-use (TOU) tariffs. One such innovation is real-time pricing (RTP), in which the wholesale market-clearing price is passed directly to the consumer on an hour-by-hour basis. While rare, RTP exists in parts of the United States and has been observed to reduce electric bills. Although these reductions are largely incidental, RTP may represent an opportunity for large-scale peak shaving, demand response, and economic efficiency when paired with intelligent control systems. Algorithms controlling flexible loads and energy storage have been deployed for demand response elsewhere in the literature, but few studies have investigated these algorithms in an RTP environment. If properly optimized, the dynamic between RTP and intelligent control has the potential to counteract the unwelcome spikes and dips of demand driven by growing penetration of distributed renewable generation and electric vehicles (EV). This paper presents a simple reinforcement learning (RL) application for optimal battery control subject to an RTP signal.},
+  note = {Comment: To be published in the proceedings of the IEEE Power and Energy Society Innovative Smart Grid Technologies (ISGT) Asia Conference},
+  file = {/home/danesabo/Zotero/storage/HMQGDSL6/Brock et al. - 2021 - An application of reinforcement learning to reside.pdf;/home/danesabo/Zotero/storage/GGP87JEY/2111.html}
+}
+
+@article{brosinskyEmbeddedDigitalTwins2020,
+  title = {Embedded {{Digital Twins}} in Future Energy Management Systems: Paving the Way for Automated Grid Control},
+  shorttitle = {Embedded {{Digital Twins}} in Future Energy Management Systems},
+  author = {Brosinsky, Christoph and Krebs, Rainer and Westermann, Dirk},
+  date = {2020-09},
+  journaltitle = {At-Automatisierungstechnik},
+  shortjournal = {AT-Autom.},
+  volume = {68},
+  number = {9},
+  pages = {750--764},
+  publisher = {Walter De Gruyter Gmbh},
+  location = {Berlin},
+  issn = {0178-2312},
+  doi = {10.1515/auto-2020-0086},
+  url = {http://www.webofscience.com/wos/woscc/summary/marked/relevance/1?markedListId=List%202},
+  urldate = {2022-03-08},
+  abstract = {Emerging real-time applications in information technology, and operational technology enable new innovative concepts to design and operate cyber-physical systems. A promising approach, which has been discovered recently as key technology by several industries is the Digital Twin (DT) concept. A DT connects the virtual representation of a physical object, system or process by available information and sensor data streams, which allows to gather new information about the system it mirrors by applying analytic functions. Thereby the DT technology can help to fill sensor data gaps, e. g., to support anomaly detection, and to predict future operating conditions and system states. This paper discusses a dynamic power system DT as a cornerstone instance of a new generation of EMS, and a prospective new EMS architecture, to support the increasingly complex operation of electric power systems. Unlike in traditional offline power system models, the parameters are updated dynamically using measurement information from the supervisory control and data acquisition (SCADA) and a wide area monitoring system (WAMS) to tune the model. This allows to derive a highly accurate virtual representation of the mirrored physical objects. A simulation engine, the Digital Dynamic Mirror (DDM) is introduced, in order to be able to reproduce the state of a reference network in real-time. The validation of the approach is carried out by a case study. In a closed loop within EMS applications, the DDM can help to assess contingency mitigation strategies, thus it can support the decision-making process under variable system conditions. The next generation of control centre Energy Management System (EMS) can benefit from this development by augmentation of the dynamic observability, and the rise of operator situation awareness.},
+  langid = {english},
+  keywords = {key},
+  annotation = {WOS:000565120800005},
+  file = {/home/danesabo/Zotero/storage/W32NJ8MC/Brosinsky et al. - 2020 - Embedded Digital Twins in future energy management.pdf}
+}
+
+@article{brosinskyFortunateDecisionThat2024,
+  title = {A {{Fortunate Decision That You Can Trust}}: {{Digital Twins}} as {{Enablers}} for the {{Next Generation}} of {{Energy Management Systems}} and {{Sophisticated Operator Assistance Systems}}},
+  shorttitle = {A {{Fortunate Decision That You Can Trust}}},
+  author = {Brosinsky, Christoph and Naglič, Matija and Lehnhoff, Sebastian and Krebs, Rainer and Westermann, Dirk},
+  date = {2024-01},
+  journaltitle = {IEEE Power and Energy Magazine},
+  volume = {22},
+  number = {1},
+  pages = {24--34},
+  issn = {1558-4216},
+  doi = {10.1109/MPE.2023.3330120},
+  url = {https://ieeexplore.ieee.org/document/10398577/},
+  urldate = {2024-03-13},
+  abstract = {Power system operation is gaining complexity due to the changes imposed by the energy transition. Especially, the increased share of intermittent and decentralized renewable generation units in the energy mix, an increased uncertainty regarding the supply of energy, and the predominantly market-driven cross-region and cross-border transport of electricity impose new challenges on the operation of power systems in Europe. In particular, power system operators must facilitate higher utilization of the grid capacity and coordinate more with neighboring transmission system operators (TSOs) and distribution system operators (DSOs). To deal with these new challenges, there is a pressing need to improve the observability and controllability of key system parameters to safeguard the reliability of power systems. Furthermore, the aforementioned developments and challenges go hand in hand with the need to improve the system resilience from the cybersecurity and system stability points of view. In the future, these challenges cannot be met without innovation towards intelligent decision support systems and assistant functions, which allow a look ahead combined with fast response and proactive actions. Here, the rather novel digital twin (DT) concept in combination with data-driven (i.e., machine learning) applications can be purposefully applied.},
+  eventtitle = {{{IEEE Power}} and {{Energy Magazine}}},
+  file = {/home/danesabo/Zotero/storage/6VNDBUGU/Brosinsky et al. - 2024 - A Fortunate Decision That You Can Trust Digital T.pdf;/home/danesabo/Zotero/storage/GB3C5QN3/10398577.html}
+}
+
+@online{BuildingMathematicalLibrary2020,
+  title = {Building the {{Mathematical Library}} of the {{Future}}},
+  date = {2020-10-01T16:05+00:00},
+  url = {https://www.quantamagazine.org/building-the-mathematical-library-of-the-future-20201001/},
+  urldate = {2024-01-28},
+  abstract = {A small community of mathematicians is using a software program called Lean to build a new digital repository. They hope it represents the future of their field.}
+}
+
+@article{bukkapatnamForecastingEvolutionNonlinear2010,
+  title = {Forecasting the Evolution of Nonlinear and Nonstationary Systems Using Recurrence-Based Local {{Gaussian}} Process Models},
+  author = {Bukkapatnam, Satish T. S. and Cheng, Changqing},
+  date = {2010-11-15},
+  journaltitle = {Physical Review E},
+  shortjournal = {Phys. Rev. E},
+  volume = {82},
+  number = {5},
+  pages = {056206},
+  publisher = {American Physical Society},
+  doi = {10.1103/PhysRevE.82.056206},
+  url = {https://link.aps.org/doi/10.1103/PhysRevE.82.056206},
+  urldate = {2022-04-21},
+  abstract = {An approach based on combining nonparametric Gaussian process (GP) modeling with certain local topological considerations is presented for prediction (one-step look ahead) of complex physical systems that exhibit nonlinear and nonstationary dynamics. The key idea here is to partition system trajectories into multiple near-stationary segments by aligning the boundaries of the partitions with those of the piecewise affine projections of the underlying dynamic system, and deriving nonparametric prediction models within each segment. Such an alignment is achieved through the consideration of recurrence and other local topological properties of the underlying system. This approach was applied for state and performance forecasting in Lorenz system under different levels of induced noise and nonstationarity, synthetic heart-rate signals, and a real-world time-series from an industrial operation known to exhibit highly nonlinear and nonstationary dynamics. The results show that local Gaussian process can significantly outperform not just classical system identification, neural network and nonparametric models, but also the sequential Bayesian Monte Carlo methods in terms of prediction accuracy and computational speed.},
+  file = {/home/danesabo/Zotero/storage/SDWGB9IC/Bukkapatnam and Cheng - 2010 - Forecasting the evolution of nonlinear and nonstat.pdf;/home/danesabo/Zotero/storage/DDWB34PC/PhysRevE.82.html}
+}
+
+@article{bullockHardwareintheloopSimulation2004,
+  title = {Hardware-in-the-Loop Simulation},
+  author = {Bullock, Darcy and Johnson, Brian and Wells, Richard B. and Kyte, Michael and Li, Zhen},
+  date = {2004-02-01},
+  journaltitle = {Transportation Research Part C: Emerging Technologies},
+  shortjournal = {Transportation Research Part C: Emerging Technologies},
+  volume = {12},
+  number = {1},
+  pages = {73--89},
+  issn = {0968-090X},
+  doi = {10.1016/j.trc.2002.10.002},
+  url = {https://www.sciencedirect.com/science/article/pii/S0968090X03000792},
+  urldate = {2024-08-08},
+  abstract = {The current generation of macroscopic and microscopic simulation packages do not have control algorithms that incorporate many of the advanced features now available in commercial traffic control hardware. Consequently, there is a need to develop cost effective procedures for evaluating state of the practice traffic signal control equipment so that informed deployment and design decisions can be made. These same procedures can also be used by researchers to develop new algorithms for applications such as transit priority or adaptive control. In order to achieve that objective, this paper presents the motivation for using hardware-in-the-loop simulation procedures. Hardware-in-the-loop simulation presents a new set of challenges for traffic engineering model developers as the “correctness” of a real-time model not only depends upon the numerical computation, but the timeliness with which the simulation model interacts with external control equipment. This paper reviews the state of practice, summarizes the fundamental technologies necessary for implementing such a system, and uses a simple statistical test for assessing the real-time errors introduced into a simulation model.},
+  keywords = {Controller,Equipment,Hardware,Signal,Simulation,Traffic},
+  file = {/home/danesabo/Zotero/storage/L3678LNB/S0968090X03000792.html}
+}
+
+@incollection{busoniuApproximateDynamicProgramming2010,
+  title = {Approximate {{Dynamic Programming}} and {{Reinforcement Learning}}},
+  booktitle = {Interactive {{Collaborative Information Systems}}},
+  author = {Buşoniu, Lucian and De Schutter, Bart and Babuška, Robert},
+  editor = {Babuška, Robert and Groen, Frans C. A.},
+  editora = {Kacprzyk, Janusz},
+  editoratype = {redactor},
+  date = {2010},
+  volume = {281},
+  pages = {3--44},
+  publisher = {Springer Berlin Heidelberg},
+  location = {Berlin, Heidelberg},
+  doi = {10.1007/978-3-642-11688-9_1},
+  url = {http://link.springer.com/10.1007/978-3-642-11688-9_1},
+  urldate = {2024-04-20},
+  abstract = {Dynamic Programming (DP) and Reinforcement Learning (RL) can be used to address problems from a variety of fields, including automatic control, artificial intelligence, operations research, and economy. Many problems in these fields are described by continuous variables, whereas DP and RL can find exact solutions only in the discrete case. Therefore, approximation is essential in practical DP and RL. This chapter provides an in-depth review of the literature on approximate DP and RL in large or continuous-space, infinite-horizon problems. Value iteration, policy iteration, and policy search approaches are presented in turn. Model-based (DP) as well as online and batch model-free (RL) algorithms are discussed. We review theoretical guarantees on the approximate solutions produced by these algorithms. Numerical examples illustrate the behavior of several representative algorithms in practice. Techniques to automatically derive value function approximators are discussed, and a comparison between value iteration, policy iteration, and policy search is provided. The chapter closes with a discussion of open issues and promising research directions in approximate DP and RL.},
+  isbn = {978-3-642-11687-2 978-3-642-11688-9},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/5AXF69RI/Buşoniu et al. - 2010 - Approximate Dynamic Programming and Reinforcement .pdf}
+}
+
+@article{calc,
+  title = {The Calc Package {{Infix}} Notation Arithmetic in {{LaTeX}}},
+  author = {Thorup, Kresten Krab and Jensen, Frank and Rowley, Chris},
+  pages = {17},
+  abstract = {The calc package reimplements the LATEX commands \textbackslash setcounter, \textbackslash addtocounter, \textbackslash setlength, and \textbackslash addtolength. Instead of a simple value, these commands now accept an infix notation expression.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/K7SRMG7X/Thorup et al. - The calc package Infix notation arithmetic in LaTe.pdf}
+}
+
+@inreference{CalculusConstructions2023,
+  title = {Calculus of Constructions},
+  booktitle = {Wikipedia},
+  date = {2023-12-30T17:58:22Z},
+  url = {https://en.wikipedia.org/w/index.php?title=Calculus_of_constructions&oldid=1192670368},
+  urldate = {2024-02-22},
+  abstract = {In mathematical logic and computer science, the calculus of constructions (CoC) is a type theory created by Thierry Coquand. It can serve as both a typed programming language and as constructive foundation for mathematics. For this second reason, the CoC and its variants have been the basis for Coq and other proof assistants. Some of its variants include the calculus of inductive constructions (which adds inductive types), the calculus of (co)inductive constructions (which adds coinduction), and the predicative calculus of inductive constructions (which removes some impredicativity).},
+  langid = {english},
+  annotation = {Page Version ID: 1192670368},
+  file = {/home/danesabo/Zotero/storage/8AAX379X/Calculus_of_constructions.html}
+}
+
+@book{caleroAutonomicTrustedComputing2011,
+  title = {Autonomic and {{Trusted Computing}}},
+  editor = {Calero, Jose M. Alcaraz and Yang, Laurence T. and Mármol, Félix Gómez and García Villalba, Luis Javier and Li, Andy Xiaolin and Wang, Yan},
+  date = {2011},
+  series = {Lecture {{Notes}} in {{Computer Science}}},
+  volume = {6906},
+  publisher = {Springer Berlin Heidelberg},
+  location = {Berlin, Heidelberg},
+  doi = {10.1007/978-3-642-23496-5},
+  url = {http://link.springer.com/10.1007/978-3-642-23496-5},
+  urldate = {2023-10-11},
+  isbn = {978-3-642-23495-8 978-3-642-23496-5},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/KZDEPX74/Calero et al. - 2011 - Autonomic and Trusted Computing.pdf}
+}
+
+@article{caoSurveyEdgeEdgeCloud2021,
+  title = {A {{Survey}} on {{Edge}} and {{Edge-Cloud Computing Assisted Cyber-Physical Systems}}},
+  author = {Cao, Kun and Hu, Shiyan and Shi, Yang and Colombo, Armando and Karnouskos, Stamatis and Li, Xin},
+  date = {2021-11},
+  journaltitle = {IEEE Transactions on Industrial Informatics},
+  shortjournal = {IEEE Trans. Ind. Inf.},
+  volume = {17},
+  number = {11},
+  pages = {7806--7819},
+  issn = {1551-3203, 1941-0050},
+  doi = {10.1109/TII.2021.3073066},
+  url = {https://ieeexplore.ieee.org/document/9403939/},
+  urldate = {2022-09-30},
+  abstract = {In recent years, the investigations on cyberphysical systems (CPS) have become increasingly popular in both academia and industry. A primary obstruction against the booming deployment of CPS applications lies in how to process and manage large amounts of generated data for decision making. To tackle this predicament, researchers advocate the idea of coupling edge computing, or edge-cloud computing into the design of CPS. However, this coupling process raises a diversity of challenges to the quality-of-services (QoS) of CPS applications. In this article, we present a survey on edge computing or edge-cloud computing assisted CPS designs from the QoS optimization perspective. We first discuss critical challenges in service latency, energy consumption, security, privacy, and reliability during the integration of CPS with edge computing or edge-cloud computing. Afterwards, we give an overview on the state-of-the-art works tackling different challenges for QoS optimization, and present a systematic classification during outlining literature for highlighting their similarities and differences. We finally summarize the experiences learned from surveyed works and envision future research directions on edge computing or edge-cloud computing assisted CPS optimization.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/8M6PJ9VH/Cao et al. - 2021 - A Survey on Edge and Edge-Cloud Computing Assisted.pdf}
+}
+
+@article{caponnettoUniversalMultiTaskKernels2008,
+  title = {Universal {{Multi-Task Kernels}}},
+  author = {Caponnetto, Andrea and Micchelli, Charles A. and Pontil, Massimiliano and Ying, Yiming},
+  date = {2008-06-01},
+  journaltitle = {The Journal of Machine Learning Research},
+  shortjournal = {J. Mach. Learn. Res.},
+  volume = {9},
+  pages = {1615--1646},
+  issn = {1532-4435},
+  abstract = {In this paper we are concerned with reproducing kernel Hilbert spaces HK of functions from an input space into a Hilbert space Y, an environment appropriate for multi-task learning. The reproducing kernel K associated to HK has its values as operators on Y. Our primary goal here is to derive conditions which ensure that the kernel K is universal. This means that on every compact subset of the input space, every continuous function with values in Y can be uniformly approximated by sections of the kernel. We provide various characterizations of universal kernels and highlight them with several concrete examples of some practical importance. Our analysis uses basic principles of functional analysis and especially the useful notion of vector measures which we describe in sufficient detail to clarify our results.},
+  file = {/home/danesabo/Zotero/storage/KRBHNSNG/Caponnetto et al. - 2008 - Universal Multi-Task Kernels.pdf}
+}
+
+@inproceedings{cardenasChallengesSecuringCyber2009,
+  title = {Challenges for Securing Cyber Physical Systems},
+  booktitle = {Workshop on Future Directions in Cyber-Physical Systems Security},
+  author = {Cardenas, Alvaro and Amin, Saurabh and Sinopoli, Bruno and Giani, Annarita and Perrig, Adrian and Sastry, Shankar},
+  date = {2009},
+  volume = {5},
+  number = {1},
+  publisher = {Citeseer},
+  file = {/home/danesabo/Zotero/storage/VIPBRX72/Cardenas et al. - Challenges for Securing Cyber Physical Systems.pdf}
+}
+
+@article{cardoneHistoryLambdacalculusCombinatory2006,
+  title = {History of Lambda-Calculus and Combinatory Logic},
+  author = {Cardone, Felice and Hindley, J Roger},
+  date = {2006},
+  journaltitle = {Handbook of the History of Logic},
+  shortjournal = {Handbook of the History of Logic},
+  volume = {5},
+  pages = {723--817},
+  publisher = {Citeseer},
+  file = {/home/danesabo/Zotero/storage/GCW3LDKX/Cardone and Hindley - 2006 - History of lambda-calculus and combinatory logic.pdf}
+}
+
+@online{CareersPreparationNational,
+  title = {Careers {{Preparation National Center}} | {{CAE Community}}},
+  url = {https://www.caecommunity.org/national-center/careers-preparation-national-center},
+  urldate = {2023-11-07},
+  file = {/home/danesabo/Zotero/storage/P7W6HMVG/careers-preparation-national-center.html}
+}
+
+@online{carneiroLean4LeanFormalizedMetatheory2024,
+  title = {{{Lean4Lean}}: {{Towards}} a Formalized Metatheory for the {{Lean}} Theorem Prover},
+  shorttitle = {{{Lean4Lean}}},
+  author = {Carneiro, Mario},
+  date = {2024-03-20},
+  eprint = {2403.14064},
+  eprinttype = {arXiv},
+  eprintclass = {cs},
+  url = {http://arxiv.org/abs/2403.14064},
+  urldate = {2024-03-25},
+  abstract = {In this paper we present a new "external verifier" for the Lean theorem prover, written in Lean itself. This is the first complete verifier for Lean 4 other than the reference implementation in C++ used by Lean itself, and our new verifier is competitive with the original, running between 20\% and 50\% slower and usable to verify all of Lean's mathlib library, forming an additional step in Lean's aim to self-host the full elaborator and compiler. Moreover, because the verifier is written in a language which admits formal verification, it is possible to state and prove properties about the kernel itself, and we report on some initial steps taken in this direction to formalize the Lean type theory abstractly and show that the kernel correctly implements this theory, to eliminate the possibility of implementation bugs in the kernel and increase the trustworthiness of proofs conducted in it. This work is still ongoing but we plan to use this project to help justify any future changes to the kernel and type theory and ensure unsoundness does not sneak in through either the abstract theory or implementation bugs.},
+  pubstate = {prepublished},
+  version = {1},
+  note = {Comment: 17 pages, submitted to ITP 2024},
+  file = {/home/danesabo/Zotero/storage/JSQM93W8/Carneiro - 2024 - Lean4Lean Towards a formalized metatheory for the.pdf;/home/danesabo/Zotero/storage/DTNS3D35/2403.html}
+}
+
+@book{carreiraFoundationsMultiParadigmModelling2020,
+  title = {Foundations of {{Multi-Paradigm Modelling}} for {{Cyber-Physical Systems}}},
+  editor = {Carreira, Paulo and Amaral, Vasco and Vangheluwe, Hans},
+  date = {2020},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-030-43946-0},
+  url = {http://link.springer.com/10.1007/978-3-030-43946-0},
+  urldate = {2023-11-08},
+  isbn = {978-3-030-43945-3 978-3-030-43946-0},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/BR5ZCJH3/Carreira et al. - 2020 - Foundations of Multi-Paradigm Modelling for Cyber-.pdf}
+}
+
+@inproceedings{carterCyberSecurityAssessment2017,
+  title = {Cyber {{Security Assessment}} of {{Distributed Energy Resources}}},
+  booktitle = {2017 {{IEEE}} 44th {{Photovoltaic Specialist Conference}} ({{PVSC}})},
+  author = {Carter, Cedric and Onunkwo, Ifeoma and Cordeiro, Patricia and Johnson, Jay},
+  date = {2017-06},
+  pages = {2135--2140},
+  publisher = {IEEE},
+  location = {Washington, DC},
+  doi = {10.1109/PVSC.2017.8366503},
+  url = {https://ieeexplore.ieee.org/document/8366503/},
+  urldate = {2023-10-05},
+  abstract = {New distributed energy resource (DER) interconnection standards require communications and interoperability to provide grid operators greater flexibility for delivering voltage and frequency support. These communication channels are designed to allow utilities, aggregators, and other grid operators the ability to enable and configure various grid-support functions. However, these capabilities expand the power system cyber security attack surface and pose a significant risk to the resilience of the electric grid if controlled in aggregate. To advise the solar industry, grid operators, and government of the current risks and provide evidence-based recommendations to the community, Sandia performed cyber security assessments of a communications-enabled PV inverter and remote grid-monitoring gateway. The team found several well-designed security features but also some weaknesses. Based on these findings, recommendations are provided to improve the security features of DER devices.},
+  eventtitle = {2017 {{IEEE}} 44th {{Photovoltaic Specialists Conference}} ({{PVSC}})},
+  isbn = {978-1-5090-5605-7},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/3TNQR3Y8/Carter et al. - 2017 - Cyber Security Assessment of Distributed Energy Re.pdf;/home/danesabo/Zotero/storage/CHYNQ6YG/Carter et al. - 2017 - Cyber Security Assessment of Distributed Energy Re.pdf;/home/danesabo/Zotero/storage/XNPBSGA8/8366503.html}
+}
+
+@inproceedings{carterEC2000Criterion2001,
+  title = {{{EC}} 2000 {{Criterion}} 2: {{A Procedure For Creating}}, {{Assessing}}, {{And Documenting Program Educational Objectives}}},
+  shorttitle = {Ec 2000 {{Criterion}} 2},
+  booktitle = {2001 {{Annual Conference Proceedings}}},
+  author = {Carter, Michael and Brent, Rebecca and Rajala, Sarah},
+  date = {2001-06},
+  pages = {6.400.1-6.400.11},
+  publisher = {ASEE Conferences},
+  location = {Albuquerque, New Mexico},
+  doi = {10.18260/1-2--9153},
+  url = {http://peer.asee.org/9153},
+  urldate = {2024-01-30},
+  eventtitle = {2001 {{Annual Conference}}},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/ZUSEY378/Carter and Rajala - 2001 - Ec 2000 Criterion 2 A Procedure For Creating, Ass.pdf}
+}
+
+@article{caspiLUSTREDeclarativeLanguage,
+  title = {{{LUSTRE}}: {{A}} Declarative Language for Programming Synchronous Systems},
+  author = {Caspi, P and Pilaud, D and Halbwachs, N and Plaice, J A},
+  abstract = {LUSTRE is a synchronous data-flow language for programming systems which interact with their environments in real-time. After an informal presentation of the language, we describe its semantics by means of structural inference rules. Moreover, we show how to use this semantics in order to generate efficient sequential code, namely, a finite state automaton which represents the control of the program. Formal rules for program transformation are also presented.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/6379N5DJ/Caspi et al. - LUSTRE A declarative language for programming syn.pdf}
+}
+
+@inreference{CategoryTheory2023,
+  title = {Category Theory},
+  booktitle = {Wikipedia},
+  date = {2023-12-03T02:30:08Z},
+  url = {https://en.wikipedia.org/w/index.php?title=Category_theory&oldid=1188056431},
+  urldate = {2023-12-12},
+  abstract = {Category theory is a general theory of mathematical structures and their relations that was introduced by Samuel Eilenberg and Saunders Mac Lane in the middle of the 20th century in their foundational work on algebraic topology. Category theory is used in almost all areas of mathematics. In particular, many constructions of new mathematical objects from previous ones that appear similarly in several contexts are conveniently expressed and unified in terms of categories. Examples include quotient spaces, direct products, completion, and duality. Many areas of computer science also rely on category theory, such as functional programming and  semantics. A category is formed by two sorts of objects: the objects of the category, and the morphisms, which relate two objects called the source and the target of the morphism. One often says that a morphism is an arrow that maps its source to its target. Morphisms can be composed if the target of the first morphism equals the source of the second one, and morphism composition has similar properties as function composition (associativity and existence of identity morphisms). Morphisms are often some sort of function, but this is not always the case. For example, a monoid may be viewed as a category with a single object, whose morphisms are the elements of the monoid. The second fundamental concept of category theory is the concept of a functor, which plays the role of a morphism between two categories                                    C                        1                                     \{\textbackslash displaystyle C\_\{1\}\}    and                                    C                        2                             :                 \{\textbackslash displaystyle C\_\{2\}:\}    it maps objects of                                    C                        1                                     \{\textbackslash displaystyle C\_\{1\}\}    to objects of                                    C                        2                                     \{\textbackslash displaystyle C\_\{2\}\}    and morphisms of                                    C                        1                                     \{\textbackslash displaystyle C\_\{1\}\}    to morphisms of                                    C                        2                                     \{\textbackslash displaystyle C\_\{2\}\}    in such a way that sources are mapped to sources, and targets are mapped to targets (or, in the case of a contravariant functor, sources are mapped to targets and vice-versa). A third fundamental concept is a natural transformation that may be viewed as a morphism of functors.},
+  langid = {english},
+  annotation = {Page Version ID: 1188056431},
+  file = {/home/danesabo/Zotero/storage/JLEGLRH9/Category_theory.html}
+}
+
+@report{CESER-Blueprint,
+  title = {{{CESER}} Blueprint},
+  author = {{Office of Cybersecurity, Energy Security, and Emergency Response}},
+  date = {2021-01},
+  institution = {U.S. Dept. of Energy},
+  file = {/home/danesabo/Zotero/storage/GJPWR646/Office of Cybersecurity, Energy Security, and Emergency Response - 2021 - CESER blueprint.pdf}
+}
+
+@misc{CfE,
+  title = {Center for {{Energy}}},
+  year = {Date accessed 11/2021},
+  url = {https://cfe.pitt.edu}
+}
+
+@incollection{championKindModelChecker2016,
+  title = {The {{Kind}} 2 {{Model Checker}}},
+  booktitle = {Computer {{Aided Verification}}},
+  author = {Champion, Adrien and Mebsout, Alain and Sticksel, Christoph and Tinelli, Cesare},
+  editor = {Chaudhuri, Swarat and Farzan, Azadeh},
+  date = {2016},
+  volume = {9780},
+  pages = {510--517},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-319-41540-6_29},
+  url = {http://link.springer.com/10.1007/978-3-319-41540-6_29},
+  urldate = {2023-11-02},
+  abstract = {Kind 2 is an open-source, multi-engine, SMT-based model checker for safety properties of finite- and infinite-state synchronous reactive systems. It takes as input models written in an extension of the Lustre language that allows the specification of assume-guarantee-style contracts for system components. Kind 2 was implemented from scratch based on techniques used by its predecessor, the PKind model checker. This paper discusses a number of improvements over PKind in terms of invariant generation. It also introduces two main features: contract-based compositional reasoning and certificate generation.},
+  isbn = {978-3-319-41539-0 978-3-319-41540-6},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/9NYU8FU7/Champion et al. - 2016 - The Kind 2 Model Checker.pdf}
+}
+
+@article{chanFormalVerificationStability,
+  title = {Formal {{Verification}} of {{Stability Properties}} of {{Cyber-physical Systems}}},
+  author = {Chan, Matthew and Ricketts, Daniel and Lerner, Sorin and Malecha, Gregory},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/DU2NYBHL/Chan et al. - Formal Verification of Stability Properties of Cybe.pdf}
+}
+
+@unpublished{chanReasoningBayesianNetwork2012,
+  title = {Reasoning about {{Bayesian}} Network Classifiers},
+  author = {Chan, Hei and Darwiche, Adnan},
+  date = {2012},
+  eprint = {1212.2470},
+  eprinttype = {arXiv},
+  file = {/home/danesabo/Zotero/storage/B654ZQJB/Reasoning about Bayesian Network Classifiers}
+}
+
+@article{chappellatElementaryProofsClassical1990,
+  title = {Elementary Proofs of Some Classical Stability Criteria},
+  author = {Chappellat, H. and Mansour, M. and Bhattacharyya, S.P.},
+  date = {1990-08},
+  journaltitle = {IEEE Transactions on Education},
+  volume = {33},
+  number = {3},
+  pages = {232--239},
+  issn = {1557-9638},
+  doi = {10.1109/13.57067},
+  url = {https://ieeexplore.ieee.org/abstract/document/57067?casa_token=SodSTIZPpjcAAAAA:ONTyRX4k9bUtWJTm0CpJTswPYnu3yjEiqspACwSjdysCegdrs2_eASfrDg3GmkXXElkGYUJbcw},
+  urldate = {2024-03-04},
+  abstract = {Classical stability results and test on the stability of a given polynomial are proved and derived using a simple continuity property. The resulting proofs given of the Hermite-Bieler theorem and the Routh and Jury tests are elementary and full of insight. The proofs allow the instructor to present these fundamental topics of control theory to undergraduates in an elementary, rational, and meaningful way rather than as mere sets of rules and formulae.{$<>$}},
+  eventtitle = {{{IEEE Transactions}} on {{Education}}},
+  file = {/home/danesabo/Zotero/storage/72C8YKGT/Chappellat et al. - 1990 - Elementary proofs of some classical stability crit.pdf;/home/danesabo/Zotero/storage/YLLB6JD5/57067.html}
+}
+
+@online{charalambousNewEraSoftware2023,
+  title = {A {{New Era}} in {{Software Security}}: {{Towards Self-Healing Software}} via {{Large Language Models}} and {{Formal Verification}}},
+  shorttitle = {A {{New Era}} in {{Software Security}}},
+  author = {Charalambous, Yiannis and Tihanyi, Norbert and Jain, Ridhi and Sun, Youcheng and Ferrag, Mohamed Amine and Cordeiro, Lucas C.},
+  date = {2023-05-24},
+  eprint = {2305.14752},
+  eprinttype = {arXiv},
+  eprintclass = {cs},
+  doi = {10.48550/arXiv.2305.14752},
+  url = {http://arxiv.org/abs/2305.14752},
+  urldate = {2024-03-07},
+  abstract = {In this paper we present a novel solution that combines the capabilities of Large Language Models (LLMs) with Formal Verification strategies to verify and automatically repair software vulnerabilities. Initially, we employ Bounded Model Checking (BMC) to locate the software vulnerability and derive a counterexample. The counterexample provides evidence that the system behaves incorrectly or contains a vulnerability. The counterexample that has been detected, along with the source code, are provided to the LLM engine. Our approach involves establishing a specialized prompt language for conducting code debugging and generation to understand the vulnerability's root cause and repair the code. Finally, we use BMC to verify the corrected version of the code generated by the LLM. As a proof of concept, we create ESBMC-AI based on the Efficient SMT-based Context-Bounded Model Checker (ESBMC) and a pre-trained Transformer model, specifically gpt-3.5-turbo, to detect and fix errors in C programs. Our experimentation involved generating a dataset comprising 1000 C code samples, each consisting of 20 to 50 lines of code. Notably, our proposed method achieved an impressive success rate of up to 80\% in repairing vulnerable code encompassing buffer overflow and pointer dereference failures. We assert that this automated approach can effectively incorporate into the software development lifecycle's continuous integration and deployment (CI/CD) process.},
+  pubstate = {prepublished},
+  file = {/home/danesabo/Zotero/storage/8DZV9YCB/Charalambous et al. - 2023 - A New Era in Software Security Towards Self-Heali.pdf;/home/danesabo/Zotero/storage/SJ2HSCEP/2305.html}
+}
+
+@inproceedings{chattopadhyaySecureCyberPhysicalSystems2017,
+  title = {Secure {{Cyber-Physical Systems}}: {{Current}} Trends, Tools and Open Research Problems},
+  shorttitle = {Secure {{Cyber-Physical Systems}}},
+  booktitle = {Design, {{Automation}} \& {{Test}} in {{Europe Conference}} \& {{Exhibition}} ({{DATE}}), 2017},
+  author = {Chattopadhyay, Anupam and Prakash, Alok and Shafique, Muhammad},
+  date = {2017-03},
+  pages = {1104--1109},
+  issn = {1558-1101},
+  doi = {10.23919/DATE.2017.7927154},
+  url = {https://ieeexplore.ieee.org/abstract/document/7927154?casa_token=QNqi0saUdwEAAAAA:KPTsWMHmdyoghPYxRzcnyQSieO7zVDZ4cEZZ2VQRaJv_bhT2cbReTvOea5GdjxYVJIMR7A56-A},
+  urldate = {2023-09-27},
+  abstract = {To understand and identify the attack surfaces of a Cyber-Physical System (CPS) is an essential step towards ensuring its security. The growing complexity of the cybernetics and the interaction of independent domains such as avionics, robotics and automotive is a major hindrance against a holistic view CPS. Furthermore, proliferation of communication networks have extended the reach of CPS from a user-centric single platform to a widely distributed network, often connecting to critical infrastructure, e.g., through smart energy initiative. In this manuscript, we reflect on this perspective and provide a review of current security trends and tools for secure CPS. We emphasize on both the design and execution flows and particularly highlight the necessity of efficient attack surface detection. We provide a detailed characterization of attacks reported on different cyber-physical systems, grouped according to their application domains, attack complexity, attack source and impact. Finally, we review the current tools, point out their inadequacies and present a roadmap of future research.},
+  eventtitle = {Design, {{Automation}} \& {{Test}} in {{Europe Conference}} \& {{Exhibition}} ({{DATE}}), 2017},
+  file = {/home/danesabo/Zotero/storage/V8VNW324/Chattopadhyay et al. - 2017 - Secure Cyber-Physical Systems Current trends, too.pdf}
+}
+
+@inproceedings{chattopadhyaySecurityAutonomousVehicle2017,
+  title = {Security of Autonomous Vehicle as a Cyber-Physical System},
+  booktitle = {2017 7th {{International Symposium}} on {{Embedded Computing}} and {{System Design}} ({{ISED}})},
+  author = {Chattopadhyay, Anupam and Lam, Kwok-Yan},
+  date = {2017-12},
+  pages = {1--6},
+  issn = {2473-9413},
+  doi = {10.1109/ISED.2017.8303906},
+  url = {https://ieeexplore.ieee.org/abstract/document/8303906?casa_token=iDWWXJEJpdQAAAAA:VIFwVpPaz4yT1ijG0OXWzSfrdOt5TpKejLYqj6GVW3EyO92bkjH82vri-s6QNCrHa_LL_ct8wg},
+  urldate = {2023-09-27},
+  abstract = {Security of (semi)-autonomous vehicles is a growing concern due to, first, the growing reliance of car functionalities on diverse (semi)-autonomous systems; second, the increased exposure of the such functionalities to potential attackers; third, the interaction of a single vehicle with myriads of other smart systems in an modern urban traffic infrastructure. In this paper, we review the security objectives of Autonomous Vehicle (AV) and argue that AV is a kind of Cyber-Physical System (CPS) for control and operations of the vehicle. We attempt to identify the core issues of securing an AV by modeling an AV as a special kind of CPS, which tend to be implemented by a complex interconnected embedded system hardware. Subsequently, the technical challenges of AV security are identified.},
+  eventtitle = {2017 7th {{International Symposium}} on {{Embedded Computing}} and {{System Design}} ({{ISED}})},
+  file = {/home/danesabo/Zotero/storage/XN6BIM6G/Chattopadhyay and Lam - 2017 - Security of autonomous vehicle as a cyber-physical.pdf}
+}
+
+@inproceedings{chekoleEnforcingMemorySafety2018,
+  title = {Enforcing {{Memory Safety}} in {{Cyber-Physical Systems}}},
+  booktitle = {Computer {{Security}}},
+  author = {Chekole, Eyasu Getahun and Castellanos, John Henry and Ochoa, Martín and Yau, David K. Y.},
+  editor = {Katsikas, Sokratis K. and Cuppens, Frédéric and Cuppens, Nora and Lambrinoudakis, Costas and Kalloniatis, Christos and Mylopoulos, John and Antón, Annie and Gritzalis, Stefanos},
+  date = {2018},
+  pages = {127--144},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-319-72817-9_9},
+  abstract = {Cyber-Physical Systems (CPS) integrate computations and communications with physical processes and are being widely adopted in various application areas. However, the increasing prevalence of cyber attacks targeting them poses a growing security concern. In particular, attacks exploiting memory-safety vulnerabilities constitute a major attack vector against CPS, because embedded systems often rely on unsafe but fast programming languages to meet their hard time constraints. A wide range of countermeasures has been developed to provide protection against these attacks. However, the most reliable countermeasures incur in high runtime overheads. In this work, we explore the applicability of strong countermeasures against memory-safety attacks in the context of realistic Industrial Control Systems (ICS). To this end, we design an experimental setup, based on a secure water treatment plant (SWaT) to empirically measure the memory safety overhead (MSO) caused by memory-safe compilation of the Programmable Logic Controller (PLC). We then quantify the tolerability of this overhead in terms of the expected real-time constraints of SWaT. Our results show high effectiveness of the security measure in detecting memory-safety violations and a MSO (197.86~\$\$\textbackslash upmu \textbackslash text \{s\}\$\$per scan-cycle) that is also tolerable for the SWaT simulation. We also discuss how different parameters impact the execution time of PLCs and the resulting absolute MSO.},
+  isbn = {978-3-319-72817-9},
+  langid = {english}
+}
+
+@article{cheminodFormalVulnerabilityAnalysis2011,
+  title = {Formal {{Vulnerability Analysis}} of a {{Security System}} for {{Remote Fieldbus Access}}},
+  author = {Cheminod, Manuel and Pironti, Alfredo and Sisto, Riccardo},
+  date = {2011-02},
+  journaltitle = {IEEE Transactions on Industrial Informatics},
+  shortjournal = {IEEE Trans. Ind. Inf.},
+  volume = {7},
+  number = {1},
+  pages = {30--40},
+  issn = {1551-3203, 1941-0050},
+  doi = {10.1109/TII.2010.2099233},
+  url = {http://ieeexplore.ieee.org/document/5685603/},
+  urldate = {2023-10-10},
+  abstract = {As fieldbus networks are becoming accessible from the Internet, security mechanisms to grant access only to authorized users and to protect data are becoming essential. This paper proposes a formally based approach to the analysis of such systems, both at the security protocols level and at the system architecture level. This multilevel analysis allows the evaluation of the effects of an attack on the overall system, due to security problems that affect the underlying security protocols. A case study on a typical fieldbus security system validates the approach.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/LQHDDLSW/Cheminod et al. - 2011 - Formal Vulnerability Analysis of a Security System.pdf}
+}
+
+@article{chenDynamicAttackDetection2017,
+  title = {Dynamic {{Attack Detection}} in {{Cyber-Physical Systems With Side Initial State Information}}},
+  author = {Chen, Yuan and Kar, Soummya and Moura, José M. F.},
+  date = {2017-09},
+  journaltitle = {IEEE Transactions on Automatic Control},
+  volume = {62},
+  number = {9},
+  pages = {4618--4624},
+  issn = {1558-2523},
+  doi = {10.1109/TAC.2016.2626267},
+  url = {https://ieeexplore.ieee.org/abstract/document/7738535?casa_token=L2XJAVNpixsAAAAA:NsDbRC_6b-skTa09odiexH7BsMjjU358Afx0HQ5NZqB6LnS8xSYj9LzQhSJ35oDgEMIIMj3_-w},
+  urldate = {2023-09-27},
+  abstract = {This technical note studies the impact of side initial state information on the detectability of data deception attacks against cyber-physical systems. We assume the attack detector has access to a linear function of the initial system state that cannot be altered by an attacker. First, we provide a necessary and sufficient condition for an attack to be undetectable by any dynamic attack detector under each specific side information pattern. Second, we characterize attacks that can be sustained for arbitrarily long periods without being detected. Third, we define the zero state inducing attack, the only type of attack that remains dynamically undetectable regardless of the side initial state information available to the attack detector. Finally, we design a dynamic attack detector that detects detectable attacks.},
+  eventtitle = {{{IEEE Transactions}} on {{Automatic Control}}},
+  file = {/home/danesabo/Zotero/storage/QXD5L4EW/Chen et al. - 2017 - Dynamic Attack Detection in Cyber-Physical Systems.pdf}
+}
+
+@inproceedings{chenFlowAnalyzerNonlinear2013,
+  title = {Flow*: {{An Analyzer}} for {{Non-linear Hybrid Systems}}},
+  shorttitle = {Flow*},
+  booktitle = {Computer {{Aided Verification}}},
+  author = {Chen, Xin and Ábrahám, Erika and Sankaranarayanan, Sriram},
+  editor = {Sharygina, Natasha and Veith, Helmut},
+  date = {2013},
+  series = {Lecture {{Notes}} in {{Computer Science}}},
+  pages = {258--263},
+  publisher = {Springer},
+  location = {Berlin, Heidelberg},
+  doi = {10.1007/978-3-642-39799-8_18},
+  abstract = {The tool Flow* performs Taylor model-based flowpipe construction for non-linear (polynomial) hybrid systems. Flow* combines well-known Taylor model arithmetic techniques for guaranteed approximations of the continuous dynamics in each mode with a combination of approaches for handling mode invariants and discrete transitions. Flow* supports a wide variety of optimizations including adaptive step sizes, adaptive selection of approximation orders and the heuristic selection of template directions for aggregating flowpipes. This paper describes Flow* and demonstrates its performance on a series of non-linear continuous and hybrid system benchmarks. Our comparisons show that Flow* is competitive with other tools.},
+  isbn = {978-3-642-39799-8},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/SK8CFEYG/Chen et al. - 2013 - Flow An Analyzer for Non-linear Hybrid Systems.pdf}
+}
+
+@article{chenFullscopeHighfidelitySimulatorbased2024,
+  title = {A Full-Scope, High-Fidelity Simulator-Based Hardware-in-the-Loop Testbed for Comprehensive Nuclear Power Plant Cybersecurity Research},
+  author = {Chen, Xiangyi and Coble, Jamie and Zhang, Fan},
+  date = {2024-10-01},
+  journaltitle = {Progress in Nuclear Energy},
+  shortjournal = {Progress in Nuclear Energy},
+  volume = {175},
+  pages = {105348},
+  issn = {0149-1970},
+  doi = {10.1016/j.pnucene.2024.105348},
+  url = {https://www.sciencedirect.com/science/article/pii/S0149197024002981},
+  urldate = {2024-08-08},
+  abstract = {Nuclear power plant (NPP) cybersecurity research often relies on hardware-in-the-loop (HIL) testbeds that integrate real hardware components into simulated environments. These testbeds allow researchers to identify vulnerabilities, evaluate attack impacts, and test security measures in a controlled setting. However, previous HIL testbeds lacked fidelity to accurately represent real nuclear systems, limiting the scope of cybersecurity analysis. This study presents the creation of a HIL testbed, devised upon a full-scope, high-fidelity NPP simulator, to facilitate realistic and comprehensive cybersecurity research. To demonstrate its capabilities, the control logic for the steam generator water level was migrated from the simulator to an external programmable logic controller. As a practical application of the developed testbed, supply chain attack scenarios were simulated by injecting malicious code into the controller logic, and the effects of manipulating sensor inputs and control commands were observed. While this HIL testbed provides more detailed simulations, enhanced realism, and wider applicability compared to other options utilizing a less complex simulator, it is also more intricate and costly. For this reason, we include a detailed comparison with some alternative architectures to aid fellow researchers and practitioners in the selection of a suitable HIL architecture based on specific research objectives.},
+  keywords = {Cybersecurity,Hardware-in-the-loop,Nuclear power plants},
+  file = {/home/danesabo/Zotero/storage/728ANR9A/S0149197024002981.html}
+}
+
+@book{chengJoyAbstractionExploration2022,
+  title = {The {{Joy}} of {{Abstraction}}: {{An Exploration}} of {{Math}}, {{Category Theory}}, and {{Life}}},
+  shorttitle = {The {{Joy}} of {{Abstraction}}},
+  author = {Cheng, Eugenia},
+  date = {2022},
+  publisher = {Cambridge University Press},
+  location = {Cambridge},
+  doi = {10.1017/9781108769389},
+  url = {https://www.cambridge.org/core/books/joy-of-abstraction/00D9AFD3046A406CB85D1AFF5450E657},
+  urldate = {2023-12-12},
+  abstract = {Mathematician and popular science author Eugenia Cheng is on a mission to show you that mathematics can be flexible, creative, and visual. This joyful journey through the world of abstract mathematics into category theory will demystify mathematical thought processes and help you develop your own thinking, with no formal mathematical background needed. The book brings abstract mathematical ideas down to earth using examples of social justice, current events, and everyday life – from privilege to COVID-19 to driving routes. The journey begins with the ideas and workings of abstract mathematics, after which you will gently climb toward more technical material, learning everything needed to understand category theory, and then key concepts in category theory like natural transformations, duality, and even a glimpse of ongoing research in higher-dimensional category theory. For fans of How to Bake Pi, this will help you dig deeper into mathematical concepts and build your mathematical background.},
+  isbn = {978-1-108-47722-2},
+  file = {/home/danesabo/Zotero/storage/WP7ENA7K/Cheng - 2022 - The Joy of Abstraction An Exploration of Math, Ca.pdf}
+}
+
+@article{chenIntegratedIntelligentManufacturing2017,
+  title = {Integrated and {{Intelligent Manufacturing}}: {{Perspectives}} and {{Enablers}}},
+  shorttitle = {Integrated and {{Intelligent Manufacturing}}},
+  author = {Chen, Yubao},
+  date = {2017-10},
+  journaltitle = {Engineering},
+  shortjournal = {Engineering},
+  volume = {3},
+  number = {5},
+  pages = {588--595},
+  issn = {20958099},
+  doi = {10.1016/J.ENG.2017.04.009},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S2095809917307105},
+  urldate = {2023-10-11},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/U9SWFV93/Chen - 2017 - Integrated and Intelligent Manufacturing Perspect.pdf}
+}
+
+@incollection{chenReachabilityAnalysisCyberPhysical2022,
+  title = {Reachability {{Analysis}} for {{Cyber-Physical Systems}}: {{Are We There Yet}}?},
+  shorttitle = {Reachability {{Analysis}} for {{Cyber-Physical Systems}}},
+  booktitle = {{{NASA Formal Methods}}},
+  author = {Chen, Xin and Sankaranarayanan, Sriram},
+  editor = {Deshmukh, Jyotirmoy V. and Havelund, Klaus and Perez, Ivan},
+  date = {2022},
+  volume = {13260},
+  pages = {109--130},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-031-06773-0_6},
+  url = {https://link.springer.com/10.1007/978-3-031-06773-0_6},
+  urldate = {2023-11-01},
+  abstract = {Reachability analysis is a fundamental problem in verification that checks for a given model and set of initial states if the system will reach a given set of unsafe states. Its importance lies in the ability to exhaustively explore the behaviors of a model over a finite or infinite time horizon. The problem of reachability analysis for Cyber-Physical Systems (CPS) is especially challenging because it involves reasoning about the continuous states of the system as well as its switching behavior. Each of these two aspects can by itself cause the reachability analysis problem to be undecidable. In this paper, we survey recent progress in this field beginning with the success of hybrid systems with affine dynamics. We then examine the current state-of-the-art for CPS with nonlinear dynamics and those driven by “learning-enabled” components such as neural networks. We conclude with an examination of some promising directions and open challenges.},
+  isbn = {978-3-031-06772-3 978-3-031-06773-0},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/REWKIBHI/Chen and Sankaranarayanan - 2022 - Reachability Analysis for Cyber-Physical Systems .pdf}
+}
+
+@report{chenReachabilityAnalysisNonLinear2015,
+  title = {Reachability {{Analysis}} of {{Non-Linear Hybrid Systems Using Taylor Models}}},
+  author = {Chen, Xin},
+  date = {2015-03},
+  institution = {RWTH Aachen},
+  file = {/home/danesabo/Zotero/storage/U4KQSFLR/_.pdf}
+}
+
+@inproceedings{chenTaylorModelFlowpipe2012,
+  title = {Taylor {{Model Flowpipe Construction}} for {{Non-linear Hybrid Systems}}},
+  booktitle = {2012 {{IEEE}} 33rd {{Real-Time Systems Symposium}}},
+  author = {Chen, Xin and Abraham, Erika and Sankaranarayanan, Sriram},
+  date = {2012-12},
+  pages = {183--192},
+  publisher = {IEEE},
+  location = {San Juan, PR, USA},
+  doi = {10.1109/RTSS.2012.70},
+  url = {http://ieeexplore.ieee.org/document/6424802/},
+  urldate = {2023-10-13},
+  abstract = {We propose an approach for verifying non-linear hybrid systems using higher-order Taylor models that are a combination of bounded degree polynomials over the initial conditions and time, bloated by an interval. Taylor models are an effective means for computing rigorous bounds on the complex time trajectories of non-linear differential equations. As a result, Taylor models have been successfully used to verify properties of non-linear continuous systems. However, the handling of discrete (controller) transitions remains a challenging problem.},
+  eventtitle = {2012 {{IEEE}} 33rd {{Real-Time Systems Symposium}} ({{RTSS}})},
+  isbn = {978-1-4673-3098-5},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/LXKWGYPQ/Chen et al. - 2012 - Taylor Model Flowpipe Construction for Non-linear .pdf}
+}
+
+@article{chiccoDataConsistencyDataDriven2021,
+  title = {Data {{Consistency}} for {{Data-Driven Smart Energy Assessment}}},
+  author = {Chicco, Gianfranco},
+  date = {2021-05-13},
+  journaltitle = {Frontiers in Big Data},
+  shortjournal = {Front. Big Data},
+  volume = {4},
+  pages = {683682},
+  publisher = {Frontiers Media Sa},
+  location = {Lausanne},
+  doi = {10.3389/fdata.2021.683682},
+  url = {http://www.webofscience.com/wos/woscc/summary/ffb5b6d6-a673-4bef-9ff0-b8d88b1e6e37-287c2a9c/relevance/1},
+  urldate = {2022-03-08},
+  abstract = {In the smart grid era, the number of data available for different applications has increased considerably. However, data could not perfectly represent the phenomenon or process under analysis, so their usability requires a preliminary validation carried out by experts of the specific domain. The process of data gathering and transmission over the communication channels has to be verified to ensure that data are provided in a useful format, and that no external effect has impacted on the correct data to be received. Consistency of the data coming from different sources (in terms of timings and data resolution) has to be ensured and managed appropriately. Suitable procedures are needed for transforming data into knowledge in an effective way. This contribution addresses the previous aspects by highlighting a number of potential issues and the solutions in place in different power and energy system, including the generation, grid and user sides. Recent references, as well as selected historical references, are listed to support the illustration of the conceptual aspects.},
+  langid = {english},
+  annotation = {WOS:000659098500001},
+  file = {/home/danesabo/Zotero/storage/3W93LTNE/Chicco - 2021 - Data Consistency for Data-Driven Smart Energy Asse.pdf;/home/danesabo/Zotero/storage/WNK9M53J/Chicco - 2021 - Data Consistency for Data-Driven Smart Energy Asse.pdf}
+}
+
+@book{chlipalaCertifiedProgrammingDependent2022,
+  title = {Certified {{Programming}} with {{Dependent Types}}: {{A Pragmatic Introduction}} to the {{Coq Proof Assistant}}},
+  shorttitle = {Certified {{Programming}} with {{Dependent Types}}},
+  author = {Chlipala, Adam},
+  date = {2022-06-07},
+  eprint = {Ji9uEAAAQBAJ},
+  eprinttype = {googlebooks},
+  publisher = {MIT Press},
+  abstract = {A handbook to the Coq software for writing and checking mathematical proofs, with a practical engineering focus.The technology of mechanized program verification can play a supporting role in many kinds of research projects in computer science, and related tools for formal proof-checking are seeing increasing adoption in mathematics and engineering. This book provides an introduction to the Coq software for writing and checking mathematical proofs. It takes a practical engineering focus throughout, emphasizing techniques that will help users to build, understand, and maintain large Coq developments and minimize the cost of code change over time.Two topics, rarely discussed elsewhere, are covered in detail: effective dependently typed programming (making productive use of a feature at the heart of the Coq system) and construction of domain-specific proof tactics. Almost every subject covered is also relevant to interactive computer theorem proving in general, not just program verification, demonstrated through examples of verified programs applied in many different sorts of formalizations. The book develops a unique automated proof style and applies it throughout; even experienced Coq users may benefit from reading about basic Coq concepts from this novel perspective. The book also offers a library of tactics, or programs that find proofs, designed for use with examples in the book. Readers will acquire the necessary skills to reimplement these tactics in other settings by the end of the book. All of the code appearing in the book is freely available online.},
+  isbn = {978-0-262-54574-7},
+  langid = {english},
+  pagetotal = {437}
+}
+
+@inproceedings{chlipalaProofAssistantsHardwaresoftware2020,
+  title = {Proof Assistants at the Hardware-Software Interface (Invited Talk)},
+  author = {Chlipala, Adam},
+  date = {2020-01-22},
+  series = {{{CPP}} 2020},
+  pages = {2},
+  publisher = {Association for Computing Machinery},
+  location = {New York, NY, USA},
+  doi = {10.1145/3372885.3378575},
+  url = {https://dl.acm.org/doi/10.1145/3372885.3378575},
+  urldate = {2024-01-27},
+  abstract = {Some of the earliest applications of proof assistants were to correctness of digital hardware designs, but the subject doesn’t come up too frequently today at venues like CPP. I will try to make the case that proof assistants are a crucial tool for resolving both classical problems and new ones at the hardware-software interface. That is, it is important to understand exactly what guarantees a processor exports to software, it is important to verify that hardware exports those guarantees correctly, and it is important to prove end-to-end theorems covering both hardware and software. A few social developments make this an exciting time to tackle these problems: open instruction sets and open-source hardware designs are growing in real-world relevance, and surprising new classes of security vulnerabilities have gotten more practitioners thinking about precise hardware-software contracts. I will sketch the state of the research area and go into detail on a few of my own related projects. An ancillary goal is to convey that programming or proving digital hardware is a lot like programming or proving software, with a few fun distinctions, so more of the CPP crowd might want to give it a try!},
+  isbn = {978-1-4503-7097-4},
+  keywords = {formal verification,hardware-software interface,information leaks through side channels,machine-language instruction sets,Proof assistants},
+  file = {/home/danesabo/Zotero/storage/MS9I87ZS/Chlipala - 2020 - Proof assistants at the hardware-software interface (invited talk).pdf}
+}
+
+@article{choiCompilingNeuralNetworks2017,
+  title = {Compiling Neural Networks into Tractable {{Boolean}} Circuits},
+  author = {Choi, Arthur and Shi, Weijia and Shih, Andy and Darwiche, Adnan},
+  date = {2017},
+  journaltitle = {intelligence},
+  file = {/home/danesabo/Zotero/storage/I47P8AX8/Compiling Neural Networks into Tractable Boolean Circuits.pdf}
+}
+
+@inproceedings{choiRealTimeHardwareintheLoopHIL2021,
+  title = {A {{Real-Time Hardware-in-the-Loop}} ({{HIL}}) {{Cybersecurity Testbed}} for {{Power Electronics Devices}} and {{Systems}} in {{Cyber-Physical Environments}}},
+  booktitle = {2021 {{IEEE}} 12th {{International Symposium}} on {{Power Electronics}} for {{Distributed Generation Systems}} ({{PEDG}})},
+  author = {Choi, Jinchun and Narayanasamy, Deneesh and Ahn, Bohyun and Ahmad, Seerin and Zeng, Jianwu and Kim, Taesic},
+  date = {2021-06},
+  pages = {1--5},
+  issn = {2329-5767},
+  doi = {10.1109/PEDG51384.2021.9494202},
+  url = {https://ieeexplore.ieee.org/abstract/document/9494202?casa_token=M3oUmP8SwFwAAAAA:ACZjrOLxlTZLojfGcQKbezrwrOZAN_5jpmlBS7p3zQ0CKbwkSEr9KWUL1lFacIseAFjGsSOdxEo},
+  urldate = {2024-08-08},
+  abstract = {Cybersecurity of power electronics (PE) is increasingly essential as more systems from renewable energy systems, energy storage systems, and electric vehicle charging stations utilize PE devices to connect them into power grids with complex communication and computation systems for advanced control and situational awareness improvement in smart grid environments. However, cybersecurity research and development (R\&D) of networked power electronics (PE) is hampered by the lack of real-time security testbed incorporating real cyber events. This paper proposes a real-time hardware-in-the-loop cybersecurity tested for PE systems in cyber-physical environments. The proposed security testbed consists of: 1) a real-time PE system simulator; 2) a real-time cyber system using real network systems and a server; and 3) penetration testing tools generating real Cyber-attacks as cyber events. Several real cyber-attacks are created and their impacts in a PE system are provided to validate the feasibility of the proposed security testbed.},
+  eventtitle = {2021 {{IEEE}} 12th {{International Symposium}} on {{Power Electronics}} for {{Distributed Generation Systems}} ({{PEDG}})},
+  keywords = {Control systems,Cybersecurity,Distributed databases,false data injection attack,hardware-in-the-loop testbed,man-in-the-middle attack,penetration testing,power electronics,Real-time systems,Renewable energy sources,Servers,Smart grids,Tools},
+  file = {/home/danesabo/Zotero/storage/NAAC2F9Q/Choi et al. - 2021 - A Real-Time Hardware-in-the-Loop (HIL) Cybersecuri.pdf;/home/danesabo/Zotero/storage/LCESNBE5/9494202.html}
+}
+
+@report{chongReportNSFWorkshop2016,
+  title = {Report on the {{NSF}} Workshop on Formal Methods for Security},
+  author = {Chong, Stephen and Guttman, Joshua and Datta, Anupam and Myers, Andrew and Pierce, Benjamin and Schaumont, Patrick and Sherwood, Tim and Zeldovich, Nickolai},
+  date = {2016},
+  file = {/home/danesabo/Zotero/storage/H95MLW3Y/Chong et al. - Formal Methods for Security.pdf}
+}
+
+@article{christianStudyCoreSupport2015,
+  title = {Study of Core Support Barrel Vibration Monitoring Using Ex-Core Neutron Noise Analysis and Fuzzy Logic Algorithm},
+  author = {Christian, Robby and Song, Seon Ho and Kang, Hyun Gook},
+  date = {2015},
+  journaltitle = {Nuclear Engineering and Technology},
+  volume = {47},
+  number = {2},
+  pages = {165--175},
+  issn = {17385733},
+  doi = {10.1016/j.net.2014.10.002},
+  url = {https://www.sciencedirect.com/science/article/pii/S1738573315000042?via%3Dihub},
+  abstract = {The application of neutron noise analysis (NNA) to the ex-core neutron detector signal for monitoring the vibration characteristics of a reactor core support barrel (CSB) was investigated. Ex-core flux data were generated by using a nonanalog Monte Carlo neutron transport method in a simulated CSB model where the implicit capture and Russian roulette technique were utilized. First and third order beam and shell modes of CSB vibration were modeled based on parallel processing simulation. A NNA module was developed to analyze the ex-core flux data based on its time variation, normalized power spectral density, normalized cross-power spectral density, coherence, and phase differences. The data were then analyzed with a fuzzy logic module to determine the vibration characteristics. The ex-core neutron signal fluctuation was directly proportional to the CSB's vibration observed at 8~Hz and 15~Hz in the beam mode vibration, and at 8~Hz in the shell mode vibration. The coherence result between flux pairs was unity at the vibration peak frequencies. A distinct pattern of phase differences was observed for each of the vibration models. The developed fuzzy logic module demonstrated successful recognition of the vibration frequencies, modes, orders, directions, and phase differences within 0.4~ms for the beam and shell mode vibrations.},
+  note = {G704-000135.2015.47.2.004}
+}
+
+@article{cimattiSMTBasedVerificationHybrid2021,
+  title = {{{SMT-Based Verification}} of {{Hybrid Systems}}},
+  author = {Cimatti, Alessandro and Mover, Sergio and Tonetta, Stefano},
+  date = {2021-09-20},
+  journaltitle = {Proceedings of the AAAI Conference on Artificial Intelligence},
+  shortjournal = {AAAI},
+  volume = {26},
+  number = {1},
+  pages = {2100--2105},
+  issn = {2374-3468, 2159-5399},
+  doi = {10.1609/aaai.v26i1.8442},
+  url = {https://ojs.aaai.org/index.php/AAAI/article/view/8442},
+  urldate = {2023-11-02},
+  abstract = {Hybrid automata networks (HAN) are a powerful formalism to model complex embedded systems. In this paper, we survey the recent advances in the application of Satisfiability Modulo Theories (SMT) to the analysis of HAN. SMT can be seen as an extended form of Boolean satisfiability (SAT), where literals are interpreted with respect to a background theory (e.g. linear arithmetic). HAN can be symbolically represented by means of SMT formulae, and analyzed by generalizing to the case of SMT the traditional model checking algorithms based on SAT.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/LKR5F7WA/Cimatti et al. - 2021 - SMT-Based Verification of Hybrid Systems.pdf}
+}
+
+@article{cleavelandFormallyVerifiedNextgeneration2023,
+  title = {Formally {{Verified Next-generation Airborne Collision Avoidance Games}} in {{ACAS X}}},
+  author = {Cleaveland, Rachel and Mitsch, Stefan and Platzer, André},
+  date = {2023-01-31},
+  journaltitle = {ACM Transactions on Embedded Computing Systems},
+  shortjournal = {ACM Trans. Embed. Comput. Syst.},
+  volume = {22},
+  number = {1},
+  pages = {1--30},
+  issn = {1539-9087, 1558-3465},
+  doi = {10.1145/3544970},
+  url = {https://dl.acm.org/doi/10.1145/3544970},
+  urldate = {2023-10-13},
+  abstract = {The design of aircraft collision avoidance algorithms is a subtle but important challenge that merits the need for provable safety guarantees. Obtaining such guarantees is nontrivial given the unpredictability of the interplay of the intruder aircraft decisions, the ownship pilot reactions, and the subtlety of the continuous motion dynamics of aircraft. Existing collision avoidance systems, such as TCAS and the Next-Generation Airborne Collision Avoidance System ACAS~X, have been analyzed assuming severe restrictions on the intruder’s flight maneuvers, limiting their safety guarantees in real-world scenarios where the intruder may change its course.             This work takes a conceptually significant and practically relevant departure from existing ACAS~X models by generalizing them to hybrid games with first-class representations of the ownship and intruder decisions coming from two independent players, enabling significantly advanced predictive power. By proving the existence of winning strategies for the resulting Adversarial ACAS~X in differential game logic, collision-freedom is established for the rich encounters of ownship and intruder aircraft with independent decisions along differential equations for flight paths with evolving vertical/horizontal velocities. We present three classes of models of increasing complexity: single-advisory infinite-time models, bounded time models, and infinite time, multi-advisory models. Within each class of models, we identify symbolic conditions and prove that there then always is a possible ownship maneuver that will prevent a collision between the two aircraft.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/Q2YWB54J/Cleaveland et al. - 2023 - Formally Verified Next-generation Airborne Collisi.pdf}
+}
+
+@online{CNVerifyingSystems,
+  title = {{{CN}}: {{Verifying Systems C Code}} with {{Separation-Logic Refinement Types}}},
+  url = {https://www.cl.cam.ac.uk/~cp526/popl23.html},
+  urldate = {2024-04-04},
+  file = {/home/danesabo/Zotero/storage/KUI8J3TZ/popl23.html}
+}
+
+@inproceedings{coeckePicturingQuantumProcesses2018,
+  title = {Picturing {{Quantum Processes}}},
+  booktitle = {Diagrammatic {{Representation}} and {{Inference}}},
+  author = {Coecke, Bob and Kissinger, Aleks},
+  editor = {Chapman, Peter and Stapleton, Gem and Moktefi, Amirouche and Perez-Kriz, Sarah and Bellucci, Francesco},
+  date = {2018},
+  series = {Lecture {{Notes}} in {{Computer Science}}},
+  pages = {28--31},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-319-91376-6_6},
+  abstract = {We provide a self-contained introduction to quantum theory using a unique diagrammatic language. Far from simple visual aids, the diagrams we use are mathematical objects in their own right, which allow us to develop from first principles a completely rigorous treatment of ‘textbook’ quantum theory. Additionally, the diagrammatic treatment eliminates the need for the typical prerequisites of a standard course on the subject, making it suitable for a multi-disciplinary audience with no prior knowledge in physics or advanced mathematics.},
+  isbn = {978-3-319-91376-6},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/4EIF5CL6/Coecke and Kissinger - 2018 - Picturing Quantum Processes.pdf}
+}
+
+@article{coferCyberassuredSystemsEngineering2022,
+  title = {Cyberassured {{Systems Engineering}} at {{Scale}}},
+  author = {Cofer, Darren and Amundson, Isaac and Babar, Junaid and Hardin, David and Slind, Konrad and Alexander, Perry and Hatcliff, John and {Robby} and Klein, Gerwin and Lewis, Corey and Mercer, Eric and Shackleton, John},
+  date = {2022-05},
+  journaltitle = {IEEE Security \& Privacy},
+  shortjournal = {IEEE Secur. Privacy},
+  volume = {20},
+  number = {3},
+  pages = {52--64},
+  issn = {1540-7993, 1558-4046},
+  doi = {10.1109/MSEC.2022.3151733},
+  url = {https://ieeexplore.ieee.org/document/9734792/},
+  urldate = {2024-01-26},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/C5UFPI5F/Cofer et al. - 2022 - Cyberassured Systems Engineering at Scale.pdf}
+}
+
+@report{coferSecureMathematicallyAssuredComposition2017,
+  type = {Final Technical Report},
+  title = {Secure {{Mathematically-Assured Composition}} of {{Control Models}}},
+  author = {Cofer, Darren and Backes, John and Gacek, Andrew and DaCosta, Daniel and Whalen, Michael and Kuz, Ihor and Klein, Gerwin and Heiser, Gernot and Pike, Lee and Foltzer, Adam and Podhradsky, Michal and Stuart, Douglas and Grahan, Jason and Wilson, Brett},
+  date = {2017},
+  number = {AFRL-RI-RS-TR-2017-176},
+  abstract = {The Secure Mathematically-Assured Composition of Control Models project (SMACCM) has developed new tools for building UAV software that is provably secure against many classes of cyber-attack. The goal of the project is to provide verifiable security; that is, system designs which provide the highest levels of confidence in their security based upon verifiable evidence. The SMACCM team has developed system architecture models, software components for mission and control functions, and operating system software, all of which are mathematically analyzed to ensure key security properties.},
+  file = {/home/danesabo/Zotero/storage/X4WW6A5E/SECURE MATHEMATICALLY-ASSURED COMPOSITION OF CONTROL MODELS.pdf}
+}
+
+@incollection{cohenFormalProofCoq2017,
+  title = {A {{Formal Proof}} in {{Coq}} of {{LaSalle}}’s {{Invariance Principle}}},
+  booktitle = {Interactive {{Theorem Proving}}},
+  author = {Cohen, Cyril and Rouhling, Damien},
+  editor = {Ayala-Rincón, Mauricio and Muñoz, César A.},
+  date = {2017},
+  volume = {10499},
+  pages = {148--163},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-319-66107-0_10},
+  url = {https://link.springer.com/10.1007/978-3-319-66107-0_10},
+  urldate = {2024-01-22},
+  abstract = {Stability analysis of dynamical systems plays an important role in the study of control techniques. LaSalle’s invariance principle is a result about the asymptotic stability of the solutions to a nonlinear system of differential equations and several extensions of this principle have been designed to fit different particular kinds of system. In this paper we present a formalization, in the Coq proof assistant, of a slightly improved version of the original principle. This is a step towards a formal verification of dynamical systems.},
+  isbn = {978-3-319-66106-3 978-3-319-66107-0},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/TGTE6VEY/Cohen and Rouhling - 2017 - A Formal Proof in Coq of LaSalle’s Invariance Prin.pdf}
+}
+
+@book{commissionCyberSecurityPrograms2010,
+  title = {Cyber Security Programs for Nuclear Facilities},
+  author = {Commission, US Nuclear Regulatory},
+  date = {2010},
+  publisher = {US Nuclear Regulatory Commission, Office of Nuclear Regulatory Research},
+  file = {/home/danesabo/Zotero/storage/QV45YLEI/NRC - CYBER SECURITY PROGRAMS FOR NUCLEAR FACILITIES.pdf}
+}
+
+@book{committeeonavisionforthefutureofcenter-basedmultidisciplinaryengineeringresearchNewVisionCenterBased2017,
+  title = {A {{New Vision}} for {{Center-Based Engineering Research}}},
+  author = {{Committee on a Vision for the Future of Center-Based Multidisciplinary Engineering Research} and {National Materials and Manufacturing Board} and {Division on Engineering and Physical Sciences} and {National Academy of Engineering} and {National Academies of Sciences, Engineering, and Medicine}},
+  date = {2017-07-18},
+  pages = {24767},
+  publisher = {National Academies Press},
+  location = {Washington, D.C.},
+  doi = {10.17226/24767},
+  url = {https://www.nap.edu/catalog/24767},
+  urldate = {2024-01-26},
+  isbn = {978-0-309-45905-1},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/5PV6DQFF/Committee on a Vision for the Future of Center-Based Multidisciplinary Engineering Research et al. - 2017 - A New Vision for Center-Based Engineering Research.pdf}
+}
+
+@inproceedings{communityLeanMathematicalLibrary2020,
+  title = {The {{Lean}} Mathematical Library},
+  booktitle = {Proceedings of the 9th {{ACM SIGPLAN International Conference}} on {{Certified Programs}} and {{Proofs}}},
+  author = {family=Community, given=The, prefix=mathlib, useprefix=false},
+  date = {2020-01-20},
+  eprint = {1910.09336},
+  eprinttype = {arXiv},
+  eprintclass = {cs, math},
+  pages = {367--381},
+  doi = {10.1145/3372885.3373824},
+  url = {http://arxiv.org/abs/1910.09336},
+  urldate = {2024-01-30},
+  abstract = {This paper describes mathlib, a community-driven effort to build a unified library of mathematics formalized in the Lean proof assistant. Among proof assistant libraries, it is distinguished by its dependently typed foundations, focus on classical mathematics, extensive hierarchy of structures, use of large- and small-scale automation, and distributed organization. We explain the architecture and design decisions of the library and the social organization that has led us here.},
+  file = {/home/danesabo/Zotero/storage/NFJMCVN5/Community - 2020 - The Lean mathematical library.pdf;/home/danesabo/Zotero/storage/EXVAUZBA/1910.html}
+}
+
+@online{CompetencyClient,
+  title = {{{CompetencyClient}}},
+  url = {https://cybercompetencies.com/help},
+  urldate = {2023-11-09},
+  file = {/home/danesabo/Zotero/storage/28XFHABH/help.html}
+}
+
+@misc{CompetencyDevelopment2pager,
+  title = {Competency {{Development}} 2-Pager},
+  file = {/home/danesabo/Zotero/storage/8BWNU6ZL/Competency Development_ 2-pager July 2023.pdf}
+}
+
+@online{CompfilesREADMEMd,
+  title = {Compfiles/{{README}}.Md at Main · Dwrensha/Compfiles},
+  url = {https://github.com/dwrensha/compfiles/blob/main/README.md},
+  urldate = {2024-03-28},
+  file = {/home/danesabo/Zotero/storage/9388NUZC/README.html}
+}
+
+@incollection{ComputerArithmeticFormal2017,
+  title = {Computer {{Arithmetic}} and {{Formal Proofs}}},
+  booktitle = {Floating-{{Point Algorithms}} and {{Formal Proofs}}},
+  date = {2017},
+  pages = {i-iii},
+  publisher = {Elsevier},
+  doi = {10.1016/B978-1-78548-112-3.50010-2},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/B9781785481123500102},
+  urldate = {2024-01-16},
+  isbn = {978-1-78548-112-3},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/MCCW3PB5/2017 - Front matter.pdf}
+}
+
+@article{contiSidechannelAttacksMobile2022,
+  title = {Side-Channel Attacks on Mobile and {{IoT}} Devices for {{Cyber}}–{{Physical}} Systems},
+  author = {Conti, Mauro and Losiouk, Eleonora and Poovendran, Radha and Spolaor, Riccardo},
+  date = {2022-04-22},
+  journaltitle = {Computer Networks},
+  shortjournal = {Computer Networks},
+  volume = {207},
+  pages = {108858},
+  issn = {1389-1286},
+  doi = {10.1016/j.comnet.2022.108858},
+  url = {https://www.sciencedirect.com/science/article/pii/S138912862200069X},
+  urldate = {2023-09-27},
+  abstract = {The attacks that leverage the side-channels produced by processes running on mobile and IoT devices are a concrete threat for cyber–physical systems. This special issue is focused on the most recent research work that investigates novel aspects of this topic. This editorial summarizes the contributions of the seven accepted papers for this special issue.},
+  file = {/home/danesabo/Zotero/storage/H2VIPJCV/Conti et al. - 2022 - Side-channel attacks on mobile and IoT devices for.pdf}
+}
+
+@online{controltutorialsformatlab&simulinkInvertedPendulumSystem,
+  type = {Tutorial},
+  title = {Inverted {{Pendulum}}: {{System Modeling}}},
+  author = {Control Tutorials For Matlab \& Simulink},
+  url = {https://ctms.engin.umich.edu/CTMS/index.php?example=InvertedPendulum&section=SystemModeling},
+  urldate = {2023-11-15},
+  organization = {Control Tutorials For Matlab \& Simulink}
+}
+
+@book{ConvergenceFacilitatingTransdisciplinary2014,
+  title = {Convergence: {{Facilitating Transdisciplinary Integration}} of {{Life Sciences}}, {{Physical Sciences}}, {{Engineering}}, and {{Beyond}}},
+  shorttitle = {Convergence},
+  date = {2014-06-16},
+  pages = {18722},
+  publisher = {National Academies Press},
+  location = {Washington, D.C.},
+  doi = {10.17226/18722},
+  url = {http://www.nap.edu/catalog/18722},
+  urldate = {2024-01-26},
+  isbn = {978-0-309-30151-0},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/7Z64C3WL/2014 - Convergence Facilitating Transdisciplinary Integr.pdf}
+}
+
+@article{cookIndustrialControlSystem2017,
+  title = {The Industrial Control System Cyber Defence Triage Process},
+  author = {Cook, Allan and Janicke, Helge and Smith, Richard and Maglaras, Leandros},
+  date = {2017-09},
+  journaltitle = {Computers \& Security},
+  shortjournal = {Computers \& Security},
+  volume = {70},
+  pages = {467--481},
+  issn = {01674048},
+  doi = {10.1016/j.cose.2017.07.009},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0167404817301505},
+  urldate = {2023-10-11},
+  abstract = {The threat to Industrial Control Systems (ICS) from cyber attacks is widely acknowledged by governments and literature. Operators of ICS are looking to address these threats in an effective and cost-sensitive manner that does not expose their operations to additional risks through invasive testing. Whilst existing standards and guidelines offer comprehensive advice for reviewing the security of ICS infrastructure, resource and time limitations can lead to incomplete assessments or undesirably long countermeasure implementation schedules. In this paper we consider the problem of undertaking efficient cyber security risk assessments and implementing mitigations in large, established ICS operations for which a full security review cannot be implemented on a constrained timescale. The contribution is the Industrial Control System Cyber Defence Triage Process (ICS-CDTP). ICS-CDTP determines areas of priority where the impact of attacks is greatest, and where initial investment reduces the organisation’s overall exposure swiftly. ICS-CDTP is designed to be a precursor to a wider, holistic review across the operation following established security management approaches. ICS-CDTP is a novel combination of the Diamond Model of Intrusion Analysis, the Mandiant Attack Lifecycle, and the CARVER Matrix, allowing for an effective triage of attack vectors and likely targets for a capable antagonist. ICS-CDTP identifies and focuses on key ICS processes and their exposure to cyber threats with the view to maintain critical operations. The article defines ICS-CDTP and exemplifies its application using a fictitious water treatment facility, and explains its evaluation as part of a large-scale serious game exercise.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/GSXFDXCH/Cook et al. - 2017 - The industrial control system cyber defence triage.pdf}
+}
+
+@article{coquandCalculusConstructions,
+  title = {The Calculus of Constructions},
+  author = {Coquand, T and Huet, Gérard},
+  file = {/home/danesabo/Zotero/storage/6RINJL4G/Coquand and Huet - The calculus of constructions.pdf}
+}
+
+@article{coralloCybersecurityAwarenessContext2022,
+  title = {Cybersecurity Awareness in the Context of the {{Industrial Internet}} of {{Things}}: {{A}} Systematic Literature Review},
+  shorttitle = {Cybersecurity Awareness in the Context of the {{Industrial Internet}} of {{Things}}},
+  author = {Corallo, Angelo and Lazoi, Mariangela and Lezzi, Marianna and Luperto, Angela},
+  date = {2022-05},
+  journaltitle = {Computers in Industry},
+  shortjournal = {Computers in Industry},
+  volume = {137},
+  pages = {103614},
+  issn = {01663615},
+  doi = {10.1016/j.compind.2022.103614},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0166361522000094},
+  urldate = {2022-09-30},
+  abstract = {Cybersecurity is one of the main challenges faced by companies in the context of the Industrial Internet of Things (IIoT), in which a number of smart devices associated with machines, computers and people are networked and communicate with each other. In this connected industrial scenario, personnel need to be aware of cybersecurity issues in order to prevent or minimise the occurrence of cybersecurity incidents and corporate data breaches, and thus to make companies resilient to cyber-attacks. In addition, the recent increase in smart working due to the COVID-19 pandemic means that the need for cybersecurity awareness is more relevant than ever.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/Y2AIC6HE/Corallo et al. - 2022 - Cybersecurity awareness in the context of the Indu.pdf}
+}
+
+@book{councilDigitalInstrumentationControl1997,
+  title = {Digital Instrumentation and Control Systems in Nuclear Power Plants: Safety and Reliability Issues},
+  author = {Council, National Research},
+  date = {1997},
+  publisher = {National Academies Press},
+  isbn = {0-309-05732-9},
+  file = {/home/danesabo/Zotero/storage/B88RJKSN/Council - 1997 - Digital instrumentation and control systems in nuc.pdf}
+}
+
+@misc{CPS-def,
+  note = {Definition from National Science Foundation, 2016, “Cyber-Physical Systems,” program solicitation 16-549, NSF document number nsf16549, March 4. https://www.nsf.gov/publications/pub\_summ.jsp?ods\_key=nsf16549}
+}
+
+@article{cremersFormalMethodsSecurity2003,
+  title = {Formal Methods for Security Protocols: {{Three}} Examples of the Black-Box Approach},
+  author = {Cremers, C. J. F. and Mauw, S. and De Vink, E. P.},
+  date = {2003},
+  journaltitle = {NVTI newsletter},
+  volume = {7},
+  pages = {21--32},
+  file = {/home/danesabo/Zotero/storage/TEF7JGI3/Cremers et al. - Formal Methods for Security Protocols Three Examp.pdf}
+}
+
+@inproceedings{crespoComputationalFrameworkControl2010,
+  title = {A {{Computational Framework}} to {{Control Verification}} and {{Robustness Analysis}}},
+  author = {Crespo, Luis G. and Kenny, Sean P. and Giesy, Daniel P.},
+  date = {2010-01-01},
+  url = {https://ntrs.nasa.gov/citations/20100006918},
+  urldate = {2024-07-10},
+  abstract = {This paper presents a methodology for evaluating the robustness of a controller based on its ability to satisfy the design requirements. The framework proposed is generic since it allows for high-fidelity models, arbitrary control structures and arbitrary functional dependencies between the requirements and the uncertain parameters. The cornerstone of this contribution is the ability to bound the region of the uncertain parameter space where the degradation in closed-loop performance remains acceptable. The size of this bounding set, whose geometry can be prescribed according to deterministic or probabilistic uncertainty models, is a measure of robustness. The robustness metrics proposed herein are the parametric safety margin, the reliability index, the failure probability and upper bounds to this probability. The performance observed at the control verification setting, where the assumptions and approximations used for control design may no longer hold, will fully determine the proposed control assessment.},
+  keywords = {Aircraft Stability And Control},
+  annotation = {NTRS Author Affiliations: National Inst. of Aerospace, NASA Langley Research Center\\
+NTRS Report/Patent Number: L-19786\\
+NTRS Document ID: 20100006918\\
+NTRS Research Center: Langley Research Center (LaRC)},
+  file = {/home/danesabo/Zotero/storage/FGHX7PPI/Crespo et al. - 2010 - A Computational Framework to Control Verification .pdf;/home/danesabo/Zotero/storage/GTKHW7XL/20100006918.html}
+}
+
+@online{CriteriaAccreditingEngineering,
+  title = {Criteria for {{Accrediting Engineering Programs}}, 2022 - 2023},
+  url = {https://www.abet.org/accreditation/accreditation-criteria/criteria-for-accrediting-engineering-programs-2022-2023/},
+  urldate = {2024-01-26},
+  langid = {american},
+  organization = {ABET}
+}
+
+@inproceedings{crossLevelSetMethods2008,
+  title = {Level Set Methods for Computing Reachable Sets of Systems with Differential Algebraic Equation Dynamics},
+  booktitle = {2008 {{American Control Conference}}},
+  author = {Cross, Elizabeth Ann and Mitchell, Ian M.},
+  date = {2008-06},
+  pages = {2260--2265},
+  publisher = {IEEE},
+  location = {Seattle, WA},
+  doi = {10.1109/ACC.2008.4586828},
+  url = {http://ieeexplore.ieee.org/document/4586828/},
+  urldate = {2023-10-27},
+  abstract = {Most existing algorithms for approximating the reachable sets of continuous systems assume an ordinary differential equation model of system evolution. In this paper we adapt such an existing algorithm—one based on level set methods and the Hamilton-Jacobi partial differential equation—in two distinct ways to work with systems modeled by index one differential algebraic equations (DAEs). The first method works by analytic projection of the dynamics onto the DAE’s constraint manifold, while the second works in the full dimensional state space. The two schemes are demonstrated on a nonlinear power system voltage safety problem.},
+  eventtitle = {2008 {{American Control Conference}} ({{ACC}} '08)},
+  isbn = {978-1-4244-2078-0},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/9QYT24ZG/getPDF.pdf}
+}
+
+@online{Cryptol,
+  title = {Cryptol},
+  url = {https://cryptol.net/},
+  urldate = {2024-04-04}
+}
+
+@online{cuomoScientificMachineLearning2022,
+  title = {Scientific {{Machine Learning}} through {{Physics-Informed Neural Networks}}: {{Where}} We Are and {{What}}'s Next},
+  shorttitle = {Scientific {{Machine Learning}} through {{Physics-Informed Neural Networks}}},
+  author = {Cuomo, Salvatore and family=Cola, given=Vincenzo Schiano, prefix=di, useprefix=true and Giampaolo, Fabio and Rozza, Gianluigi and Raissi, Maziar and Piccialli, Francesco},
+  date = {2022-06-07},
+  eprint = {2201.05624},
+  eprinttype = {arXiv},
+  eprintclass = {physics},
+  url = {http://arxiv.org/abs/2201.05624},
+  urldate = {2024-01-30},
+  abstract = {Physics-Informed Neural Networks (PINN) are neural networks (NNs) that encode model equations, like Partial Differential Equations (PDE), as a component of the neural network itself. PINNs are nowadays used to solve PDEs, fractional equations, integral-differential equations, and stochastic PDEs. This novel methodology has arisen as a multi-task learning framework in which a NN must fit observed data while reducing a PDE residual. This article provides a comprehensive review of the literature on PINNs: while the primary goal of the study was to characterize these networks and their related advantages and disadvantages. The review also attempts to incorporate publications on a broader range of collocation-based physics informed neural networks, which stars form the vanilla PINN, as well as many other variants, such as physics-constrained neural networks (PCNN), variational hp-VPINN, and conservative PINN (CPINN). The study indicates that most research has focused on customizing the PINN through different activation functions, gradient optimization techniques, neural network structures, and loss function structures. Despite the wide range of applications for which PINNs have been used, by demonstrating their ability to be more feasible in some contexts than classical numerical techniques like Finite Element Method (FEM), advancements are still possible, most notably theoretical issues that remain unresolved.},
+  pubstate = {prepublished},
+  keywords = {Computer Science - Artificial Intelligence,Computer Science - Machine Learning,Mathematics - Numerical Analysis,Physics - Data Analysis Statistics and Probability,Review Paper},
+  file = {/home/danesabo/Zotero/storage/QRD8BXX9/Cuomo et al. - 2022 - Scientific Machine Learning through Physics-Inform.pdf;/home/danesabo/Zotero/storage/QEJYHDAU/2201.html}
+}
+
+@online{CWECommonWeakness,
+  title = {{{CWE}} - {{Common Weakness Enumeration}}},
+  url = {https://cwe.mitre.org/},
+  urldate = {2024-02-29},
+  file = {/home/danesabo/Zotero/storage/XQYSKTJH/cwe.mitre.org.html}
+}
+
+@online{CWECWECAPEC,
+  title = {{{CWE}} - {{CWE}}/{{CAPEC Board}}},
+  url = {https://cwe.mitre.org/community/board.html},
+  urldate = {2024-02-29},
+  file = {/home/danesabo/Zotero/storage/ABWFP6Q7/board.html}
+}
+
+@misc{Cyber-X,
+  date = {2020-08/2022-02},
+  note = {The University of Pittsburgh team has conducted customer discovery interviews with stakeholders in cybersecurity, the Industrial Internet of Things, operational technology, and various verticals, including the energy sector. This discovery has included over 80 interviews with stakeholders in the cybersecurity of operational technology.}
+}
+
+@online{CyberAttackGerman2015,
+  title = {Cyber {{Attack}} on {{German Steel Mill Leads}} to ‘{{Massive}}’ {{Real World Damage}}},
+  date = {2015-01-08},
+  url = {https://www.pbs.org/wgbh/nova/article/cyber-attack-german-steel-mill-leads-massive-real-world-damage/},
+  urldate = {2024-08-13},
+  abstract = {A steel mill in Germany lost control of its blast furnace. Hackers had infiltrated the mill’s control system, according to the German government’s office for information security.},
+  langid = {american},
+  file = {/home/danesabo/Zotero/storage/Y6IAD9IJ/cyber-attack-german-steel-mill-leads-massive-real-world-damage.html}
+}
+
+@report{CyberInformedEngineeringImplementation2023,
+  title = {Cyber-{{Informed Engineering Implementation Guide}}},
+  date = {2023-08-07},
+  number = {INL/RPT-23-74072},
+  file = {/home/danesabo/Zotero/storage/7PU4N9BT/Sort_67122.pdf}
+}
+
+@misc{CyberPhysicalSystems,
+  title = {Cyber Physical Systems Security Limitations Issues and Future Trends.Pdf}
+}
+
+@article{CybersecurityCapabilityMaturity,
+  title = {Cybersecurity {{Capability Maturity Model}}                                                                                                    {{White Paper}}},
+  pages = {35},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/2VNSQKEE/Cybersecurity Capability Maturity Model           .pdf}
+}
+
+@online{CyberSecurityDigital,
+  title = {Cyber {{Security Digital Twin}}},
+  url = {https://www.haruspexsecurity.com/cyber-security-digital-twin/},
+  urldate = {2022-04-02},
+  abstract = {What is a Digital Twin in Cyber Security?The term refers to a digital replica of assets, systems and devices that can be used for various purposes.},
+  langid = {american},
+  organization = {Haruspex}
+}
+
+@online{CybersecurityEmergingEngineering,
+  title = {Cybersecurity in {{Emerging Engineering Systems}} | {{Academics}}},
+  url = {https://www.academics.pitt.edu/programs/cybersecurity-emerging-engineering-systems},
+  urldate = {2024-03-27},
+  file = {/home/danesabo/Zotero/storage/FBXWWXCL/cybersecurity-emerging-engineering-systems.html}
+}
+
+@article{CYBERSECURITYHIGHRISKSERIES,
+  title = {{{CYBERSECURITY HIGH-RISK SERIES}}:  {{Challenges}} in {{Protecting Cyber Critical Infrastructure}}},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/DU9QPYDJ/GAO-23-106441, CYBERSECURITY HIGH-RISK SERIES  Ch.pdf}
+}
+
+@report{CyberSecurityPlan2010,
+  title = {Cyber {{Security Plan}} for {{Nuclear Power Reactors}}},
+  date = {2010-04},
+  number = {NEI 08-09 [Rev. 6]},
+  file = {/home/danesabo/Zotero/storage/XL5B2QC3/ML101180437.pdf}
+}
+
+@article{dahlinParticleFilterbasedGaussian2014,
+  title = {Particle Filter-Based {{Gaussian}} Process Optimisation for Parameter Inference},
+  author = {Dahlin, Johan and Lindsten, Fredrik},
+  date = {2014},
+  journaltitle = {IFAC Proceedings Volumes},
+  shortjournal = {IFAC Proceedings Volumes},
+  volume = {47},
+  number = {3},
+  pages = {8675--8680},
+  issn = {14746670},
+  doi = {10.3182/20140824-6-ZA-1003.00278},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S1474667016429824},
+  urldate = {2022-04-21},
+  abstract = {We propose a novel method for maximum-likelihood-based parameter inference in nonlinear and/or non-Gaussian state space models. The method is an iterative procedure with three steps. At each iteration a particle filter is used to estimate the value of the loglikelihood function at the current parameter iterate. Using these log-likelihood estimates, a surrogate objective function is created by utilizing a Gaussian process model. Finally, we use a heuristic procedure to obtain a revised parameter iterate, providing an automatic trade-off between exploration and exploitation of the surrogate model. The method is profiled on two state space models with good performance both considering accuracy and computational cost.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/SJS9AE88/Dahlin and Lindsten - 2014 - Particle filter-based Gaussian process optimisatio.pdf}
+}
+
+@article{daiIndustrialEdgeComputing2019,
+  title = {Industrial {{Edge Computing}}: {{Enabling Embedded Intelligence}}},
+  shorttitle = {Industrial {{Edge Computing}}},
+  author = {Dai, Wenbin and Nishi, Hiroaki and Vyatkin, Valeriy and Huang, Victor and Shi, Yang and Guan, Xinping},
+  date = {2019-12},
+  journaltitle = {IEEE Industrial Electronics Magazine},
+  shortjournal = {EEE Ind. Electron. Mag.},
+  volume = {13},
+  number = {4},
+  pages = {48--56},
+  issn = {1932-4529, 1941-0115},
+  doi = {10.1109/MIE.2019.2943283},
+  url = {https://ieeexplore.ieee.org/document/8941000/},
+  urldate = {2022-09-30},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/7CXXH5QF/Dai et al. - 2019 - Industrial Edge Computing Enabling Embedded Intel.pdf}
+}
+
+@incollection{dammLscBreathingLife1999,
+  title = {Lsc’s: {{Breathing Life Into Message Sequence Charts}}},
+  shorttitle = {Lsc’s},
+  booktitle = {Formal {{Methods}} for {{Open Object-Based Distributed Systems}}},
+  author = {Damm, Werner and Harel, David},
+  editor = {Ciancarini, Paolo and Fantechi, Alessandro and Gorrieri, Robert},
+  date = {1999},
+  pages = {293--311},
+  publisher = {Springer US},
+  location = {Boston, MA},
+  doi = {10.1007/978-0-387-35562-7_23},
+  url = {http://link.springer.com/10.1007/978-0-387-35562-7_23},
+  urldate = {2023-10-11},
+  abstract = {While message sequence charts (MSCs) are widely used in industry to document the interworking of processes or objects, they are expressively weak, being based on the modest semantic notion of a partial ordering of events as defined, e.g., in the ITU standard. A highly expressive and rigorously defined MSC language is a must for serious, semantically meaningful tool support for use-cases and scenarios. It is also a prerequisite to addressing what we regard as one of the central problems in behavioral specification of systems: relating scenario-based inter-object specification to state-machine intra-object specification. This paper proposes an extension of MSCs, which we call live sequence charts (or LSCs), since our main extension deals with specifying “liveness”, i.e., things that must occur. In fact, LSCs allow the distinction between possible and necessary behavior both globally, on the level of an entire chart and locally, when specifying events, conditions and progress over time within a chart. This makes it possible to specify forbidden scenarios, for example, and enables naturally specified structuring constructs such as subcharts, branching and iteration.},
+  isbn = {978-1-4757-5266-3 978-0-387-35562-7},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/X2KCT9RY/Damm and Harel - 1999 - Lsc’s Breathing Life Into Message Sequence Charts.pdf}
+}
+
+@inproceedings{dangeloProbabilisticRobustnessAnalysis2019,
+  title = {Probabilistic {{Robustness Analysis}} of an {{Actively Controlled Structure}} That {{Operates}} in {{Harsh}} and {{Uncertain Environments}}},
+  booktitle = {Structural {{Health Monitoring}}, {{Photogrammetry}} \& {{DIC}}, {{Volume}} 6},
+  author = {D’Angelo, Christopher J. and Cole, Daniel G. and Collinger, John C.},
+  editor = {Niezrecki, Christopher and Baqersad, Javad},
+  date = {2019},
+  pages = {121--131},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-319-74476-6_17},
+  abstract = {This work uses probabilistic robustness techniques to show how the stability margin of an uncertain controlled structure that operates in a harsh, potentially radioactive environment can be analyzed in order to find a less conservative destabilizing uncertainty perturbation. The uncertainty is quantified in terms of a measure on the size of the covariance matrix in a multivariate Gaussian distribution. This uncertainty is used to capture the aggregate effects on a structure’s dynamic behavior due to material changes resulting from radiation embrittlement and mechanical fatigue. A probabilistic-robust full-state feedback ℋ∞\$\$\{\textbackslash mathcal \{H\}\_\textbackslash infty \}\$\$controller is synthesized for a low-dimensional structural model using a technique known as scenario-based probabilistic-robust synthesis. A probabilistic-robust stability margin is defined and extracted from a stability degradation function, demonstrating that a fourfold increase in the amount of uncertainty in the model can be tolerated if the designer is willing to concede a small probability that the actively-controlled structure may be unstable for certain system configurations.},
+  isbn = {978-3-319-74476-6},
+  langid = {english},
+  keywords = {\(\mathcal H_\infty \),Active vibration control,Probabilistic robust control,Probabilistic stability margins,Uncertainty},
+  file = {/home/danesabo/Zotero/storage/URB949VZ/D’Angelo et al. - 2019 - Probabilistic Robustness Analysis of an Actively C.pdf}
+}
+
+@incollection{darvasFormalVerificationSafety2016,
+  title = {Formal {{Verification}} of {{Safety PLC Based Control Software}}},
+  booktitle = {Integrated {{Formal Methods}}},
+  author = {Darvas, Dániel and Majzik, István and Blanco Viñuela, Enrique},
+  editor = {Ábrahám, Erika and Huisman, Marieke},
+  date = {2016},
+  volume = {9681},
+  pages = {508--522},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-319-33693-0_32},
+  url = {http://link.springer.com/10.1007/978-3-319-33693-0_32},
+  urldate = {2023-10-10},
+  abstract = {Programmable Logic Controllers (PLCs) are widely used in the industry for various industrial automation tasks. Besides non-safety applications, the usage of PLCs became accepted in safety-critical installations, where the cost of failure is high. In these cases the used hardware is special (so-called fail-safe or safety PLCs), but also the software needs special considerations. Formal verification is a method that can help to develop high-quality software for critical tasks. However, such method should be adapted to the special needs of the safety PLCs, that are often particular compared to the normal PLC development domain. In this paper we propose two complementary solutions for the formal verification of safety-critical PLC programs based on model checking and equivalence checking using formal specification. Furthermore, a case study is presented, demonstrating our approach.},
+  isbn = {978-3-319-33692-3 978-3-319-33693-0},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/WJ76H7IQ/Darvas et al. - 2016 - Formal Verification of Safety PLC Based Control So.pdf}
+}
+
+@article{dasSoKComprehensiveReexamination2020,
+  title = {{{SoK}}: {{A Comprehensive Reexamination}} of {{Phishing Research From}} the {{Security Perspective}}},
+  shorttitle = {{{SoK}}},
+  author = {Das, Avisha and Baki, Shahryar and El Aassal, Ayman and Verma, Rakesh and Dunbar, Arthur},
+  date = {2020},
+  journaltitle = {IEEE Communications Surveys \& Tutorials},
+  volume = {22},
+  number = {1},
+  pages = {671--708},
+  issn = {1553-877X},
+  doi = {10.1109/COMST.2019.2957750},
+  url = {https://ieeexplore.ieee.org/document/8924660},
+  urldate = {2023-10-04},
+  abstract = {Phishing and spear phishing are typical examples of masquerade attacks since trust is built up through impersonation for the attack to succeed. Given the prevalence of these attacks, considerable research has been conducted on these problems along multiple dimensions. We reexamine the existing research on phishing and spear phishing from the perspective of the unique needs of the security domain, which we call security challenges: real-time detection, active attacker, dataset quality and base-rate fallacy. We explain these challenges and then survey the existing phishing/spear phishing solutions in their light. This viewpoint consolidates the literature and illuminates several opportunities for improving existing solutions. We organize the existing literature based on detection techniques for different attack vectors (e.g., URLs, websites, emails) along with studies on user awareness. For detection techniques we examine properties of the dataset, feature extraction, detection algorithms used, and performance evaluation metrics. This work can help guide the development of more effective defenses for phishing, spear phishing and email masquerade attacks of the future, as well as provide a framework for a thorough evaluation and comparison.},
+  eventtitle = {{{IEEE Communications Surveys}} \& {{Tutorials}}},
+  file = {/home/danesabo/Zotero/storage/PRQGZWPM/Das et al. - 2020 - SoK A Comprehensive Reexamination of Phishing Res.pdf;/home/danesabo/Zotero/storage/ZUHNKVRW/8924660.html}
+}
+
+@online{DataDrivenModelingCyberPhysical,
+  title = {Data-{{Driven Modeling}} of {{Cyber-Physical Systems Using Side-Channel Analysis}}},
+  url = {https://www.google.com/books/edition/Data_Driven_Modeling_of_Cyber_Physical_S/2TbPDwAAQBAJ?hl=en&gbpv=1&pg=PR8&printsec=frontcover&bshm=rime/1},
+  urldate = {2023-09-27},
+  file = {/home/danesabo/Zotero/storage/67PIBQ6G/Data-Driven Modeling of Cyber-Physical Systems Usi.pdf;/home/danesabo/Zotero/storage/DEZLIM3W/2TbPDwAAQBAJ.html}
+}
+
+@article{dattaStabilityInertia1999,
+  title = {Stability and Inertia},
+  author = {Datta, Biswa Nath},
+  date = {1999-12},
+  journaltitle = {Linear Algebra and its Applications},
+  shortjournal = {Linear Algebra and its Applications},
+  volume = {302--303},
+  pages = {563--600},
+  issn = {00243795},
+  doi = {10.1016/S0024-3795(99)00213-X},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S002437959900213X},
+  urldate = {2024-03-04},
+  abstract = {The purpose of this paper is to present a brief overview of matrix stability and inertia theory. A few applications of inertia and stability theorems, and a nonspectral implicit matrix equation method for determining stability and inertia of a nonhermitian matrix are also presented. Inter-relationships between different theorems are explicitly stated, whenever appropriate. The paper concludes with some problems for future research in this area. © 1999 Elsevier Science Inc. All rights reserved.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/KR633RQ7/Datta - 1999 - Stability and inertia.pdf}
+}
+
+@article{davisFidelityMathematicalDiscourse1972,
+  title = {Fidelity in {{Mathematical Discourse}}: {{Is One}} and {{One Really Two}}?},
+  shorttitle = {Fidelity in {{Mathematical Discourse}}},
+  author = {Davis, P. J.},
+  date = {1972},
+  journaltitle = {The American Mathematical Monthly},
+  volume = {79},
+  number = {3},
+  eprint = {2316620},
+  eprinttype = {jstor},
+  pages = {252--263},
+  publisher = {Mathematical Association of America},
+  issn = {0002-9890},
+  doi = {10.2307/2316620},
+  url = {https://www.jstor.org/stable/2316620},
+  urldate = {2024-02-17},
+  file = {/home/danesabo/Zotero/storage/TSW5BQ6F/Davis - 1972 - Fidelity in Mathematical Discourse Is One and One.pdf}
+}
+
+@misc{dci-map,
+  author = {{Economic Innovation Group}},
+  year = {Date accessed 11/2021},
+  url = {https://eig.org/dci/interactive-map}
+}
+
+@article{decarloPerspectivesResultsStability2000,
+  title = {Perspectives and Results on the Stability and Stabilizability of Hybrid Systems},
+  author = {Decarlo, R.A. and Branicky, M.S. and Pettersson, S. and Lennartson, B.},
+  date = {2000-07},
+  journaltitle = {Proceedings of the IEEE},
+  volume = {88},
+  number = {7},
+  pages = {1069--1082},
+  issn = {1558-2256},
+  doi = {10.1109/5.871309},
+  url = {https://ieeexplore.ieee.org/document/871309},
+  urldate = {2024-01-16},
+  abstract = {This paper introduces the concept of a hybrid system and some of the challenges associated with the stability of such systems, including the issues of guaranteeing stability of switched stable systems and finding conditions for the existence of switched controllers for stabilizing switched unstable systems. In this endeavour, this paper surveys the major results in the (Lyapunov) stability of finite-dimensional hybrid systems and then discusses the stronger, more specialized results of switched linear (stable and unstable) systems. A section detailing how some of the results can be formulated as linear matrix inequalities is given. Stability analyses on the regulation of the angle of attack of an aircraft and on the PI control of a vehicle with an automatic transmission are given. Other examples are included to illustrate various results in this paper.},
+  eventtitle = {Proceedings of the {{IEEE}}},
+  file = {/home/danesabo/Zotero/storage/BZZGQZKR/Decarlo et al. - 2000 - Perspectives and results on the stability and stab.pdf}
+}
+
+@article{delahayeProbabilisticContractsCompositional2011,
+  title = {Probabilistic Contracts: A Compositional Reasoning Methodology for the Design of Systems with Stochastic and/or Non-Deterministic Aspects},
+  shorttitle = {Probabilistic Contracts},
+  author = {Delahaye, Benoît and Caillaud, Benoît and Legay, Axel},
+  date = {2011-02},
+  journaltitle = {Formal Methods in System Design},
+  shortjournal = {Form Methods Syst Des},
+  volume = {38},
+  number = {1},
+  pages = {1--32},
+  issn = {0925-9856, 1572-8102},
+  doi = {10.1007/s10703-010-0107-8},
+  url = {http://link.springer.com/10.1007/s10703-010-0107-8},
+  urldate = {2023-11-08},
+  abstract = {A contract allows to distinguish hypotheses made on a system (the guarantees) from those made on its environment (the assumptions). In this paper, we focus on models of Assume/Guarantee contracts for (stochastic) systems. We consider contracts capable of capturing reliability and availability properties of such systems. We also show that classical notions of Satisfaction and Refinement can be checked by effective methods thanks to a reduction to classical verification problems. Finally, theorems supporting compositional reasoning and enabling the scalable analysis of complex systems are also studied.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/VKNJ5WQI/Delahaye et al. - 2011 - Probabilistic contracts a compositional reasoning.pdf}
+}
+
+@article{demilloSocialProcessesProofs1979,
+  title = {Social Processes and Proofs of Theorems and Programs},
+  author = {De Millo, Richard A. and Lipton, Richard J. and Perlis, Alan J.},
+  date = {1979-05-01},
+  journaltitle = {Communications of the ACM},
+  shortjournal = {Commun. ACM},
+  volume = {22},
+  number = {5},
+  pages = {271--280},
+  issn = {0001-0782},
+  doi = {10.1145/359104.359106},
+  url = {https://dl.acm.org/doi/10.1145/359104.359106},
+  urldate = {2024-02-17},
+  abstract = {It is argued that formal verifications of programs, no matter how obtained, will not play the same key role in the development of computer science and software engineering as proofs do in mathematics. Furthermore the absence of continuity, the inevitability of change, and the complexity of specification of significantly many real programs make the formal verification process difficult to justify and manage. It is felt that ease of formal verification should not dominate program language design.},
+  file = {/home/danesabo/Zotero/storage/3EZJGH5Z/De Millo et al. - 1979 - Social processes and proofs of theorems and progra.pdf}
+}
+
+@article{demouraLeanTheoremProver,
+  title = {The {{Lean}} 4 {{Theorem Prover}} and {{Programming Language}} ({{System Description}})},
+  author = {family=Moura, given=Leonardo, prefix=de, useprefix=true and Ullrich, Sebastian},
+  abstract = {Lean 4 is a reimplementation of the Lean interactive theorem prover (ITP) in Lean itself. It addresses many shortcomings of the previous versions and contains many new features. Lean 4 is fully extensible: users can modify and extend the parser, elaborator, tactics, decision procedures, pretty printer, and code generator. The new system has a hygienic macro system custom-built for ITPs. It contains a new typeclass resolution procedure based on tabled resolution, addressing significant performance problems reported by the growing user base. Lean 4 is also an efficient functional programming language based on a novel programming paradigm called functional but in-place. Efficient code generation is crucial for Lean users because many write custom proof automation procedures in Lean itself.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/5SN35WB7/de Moura and Ullrich - The Lean 4 Theorem Prover and Programming Language.pdf}
+}
+
+@article{derlerModelingCyberPhysical2012,
+  title = {Modeling {{Cyber}}–{{Physical Systems}}},
+  author = {Derler, P. and Lee, E. A. and Vincentelli, A. S.},
+  date = {2012-01},
+  journaltitle = {Proceedings of the IEEE},
+  shortjournal = {Proc. IEEE},
+  volume = {100},
+  number = {1},
+  pages = {13--28},
+  issn = {0018-9219, 1558-2256},
+  doi = {10.1109/JPROC.2011.2160929},
+  url = {http://ieeexplore.ieee.org/document/5995279/},
+  urldate = {2023-10-11},
+  abstract = {This paper focuses on the challenges of modeling cyber–physical systems (CPSs) that arise from the intrinsic heterogeneity, concurrency, and sensitivity to timing of such systems. It uses a portion of an aircraft vehicle management system (VMS), specifically the fuel management subsystem, to illustrate the challenges, and then discusses technologies that at least partially address the challenges. Specific technologies described include hybrid system modeling and simulation, concurrent and heterogeneous models of computation, the use of domain-specific ontologies to enhance modularity, and the joint modeling of functionality and implementation architectures.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/IG6G3BEH/Derler et al. - 2012 - Modeling Cyber–Physical Systems.pdf}
+}
+
+@article{deutschbeinHardwareSecurityProperty2022,
+  title = {Toward {{Hardware Security Property Generation}} at {{Scale}}},
+  author = {Deutschbein, Calvin and Meza, Andres and Restuccia, Francesco and Gregoire, Matthew and Kastner, Ryan and Sturton, Cynthia},
+  date = {2022-05},
+  journaltitle = {IEEE Security \& Privacy},
+  shortjournal = {IEEE Secur. Privacy},
+  volume = {20},
+  number = {3},
+  pages = {43--51},
+  issn = {1540-7993, 1558-4046},
+  doi = {10.1109/MSEC.2022.3155376},
+  url = {https://ieeexplore.ieee.org/document/9765633/},
+  urldate = {2024-01-26},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/VMQL5YJU/Deutschbein et al. - 2022 - Toward Hardware Security Property Generation at Sc.pdf}
+}
+
+@online{dhariwalDiffusionModelsBeat2021,
+  title = {Diffusion {{Models Beat GANs}} on {{Image Synthesis}}},
+  author = {Dhariwal, Prafulla and Nichol, Alex},
+  date = {2021-06-01},
+  eprint = {2105.05233},
+  eprinttype = {arXiv},
+  eprintclass = {cs, stat},
+  doi = {10.48550/arXiv.2105.05233},
+  url = {http://arxiv.org/abs/2105.05233},
+  urldate = {2023-10-05},
+  abstract = {We show that diffusion models can achieve image sample quality superior to the current state-of-the-art generative models. We achieve this on unconditional image synthesis by finding a better architecture through a series of ablations. For conditional image synthesis, we further improve sample quality with classifier guidance: a simple, compute-efficient method for trading off diversity for fidelity using gradients from a classifier. We achieve an FID of 2.97 on ImageNet 128\$\textbackslash times\$128, 4.59 on ImageNet 256\$\textbackslash times\$256, and 7.72 on ImageNet 512\$\textbackslash times\$512, and we match BigGAN-deep even with as few as 25 forward passes per sample, all while maintaining better coverage of the distribution. Finally, we find that classifier guidance combines well with upsampling diffusion models, further improving FID to 3.94 on ImageNet 256\$\textbackslash times\$256 and 3.85 on ImageNet 512\$\textbackslash times\$512. We release our code at https://github.com/openai/guided-diffusion},
+  pubstate = {prepublished},
+  note = {Comment: Added compute requirements, ImageNet 256\$\textbackslash times\$256 upsampling FID and samples, DDIM guided sampler, fixed typos},
+  file = {/home/danesabo/Zotero/storage/AI9WPMRK/Dhariwal and Nichol - 2021 - Diffusion Models Beat GANs on Image Synthesis.pdf;/home/danesabo/Zotero/storage/LVTW6CH8/2105.html}
+}
+
+@article{dicairanoStabilizingDynamicControllers2014,
+  title = {Stabilizing {{Dynamic Controllers}} for {{Hybrid Systems}}: {{A Hybrid Control Lyapunov Function Approach}}},
+  shorttitle = {Stabilizing {{Dynamic Controllers}} for {{Hybrid Systems}}},
+  author = {Di Cairano, Stefano and Heemels, W. P. Maurice H. and Lazar, Mircea and Bemporad, Alberto},
+  date = {2014-10},
+  journaltitle = {IEEE Transactions on Automatic Control},
+  shortjournal = {IEEE Trans. Automat. Contr.},
+  volume = {59},
+  number = {10},
+  pages = {2629--2643},
+  issn = {0018-9286, 1558-2523},
+  doi = {10.1109/TAC.2014.2324111},
+  url = {http://ieeexplore.ieee.org/document/6816126/},
+  urldate = {2023-11-22},
+  file = {/home/danesabo/Zotero/storage/M362U7HY/Di Cairano et al. - 2014 - Stabilizing Dynamic Controllers for Hybrid Systems.pdf}
+}
+
+@inproceedings{didebanControllerSynthesisPetri2009,
+  title = {Controller {{Synthesis By Petri Nets Modeling}}},
+  author = {Dideban, Abbas and Alla, Hassane},
+  date = {2009-07-01},
+  publisher = {BCS Learning \& Development},
+  doi = {10.14236/ewic/VECOS2009.10},
+  url = {https://www.scienceopen.com/hosted-document?doi=10.14236/ewic/VECOS2009.10},
+  urldate = {2024-02-15},
+  abstract = {In this paper, we present two different methods for the synthesis of a simplified controller using Petri Nets. The supervisory control theory presented by Ramadge and Wonham is adapted to Petri nets modeling. Uncontrollable transitions in discrete event systems are the cause of forbidden states in supervisory control. This paper concerns the problem of forbidden states in safe Petri Net. We present different methods to reduce the number of constraints that prevent from forbidden states. Using these methods, we can construct a maximally permissive controller. The implementation of these approaches is considered using the SFC model.},
+  eventtitle = {Third {{International Workshop}} on {{Verification}} and {{Evaluation}} of {{Computer}} and {{Communication Systems}} ({{VECoS}} 2009)},
+  file = {/home/danesabo/Zotero/storage/3ZTRNBGA/Dideban and Alla - 2009 - Controller Synthesis By Petri Nets Modeling.pdf}
+}
+
+@inproceedings{digennaroReductionTimedHybrid1994,
+  title = {Reduction of Timed Hybrid Systems},
+  booktitle = {Proceedings of 1994 33rd {{IEEE Conference}} on {{Decision}} and {{Control}}},
+  author = {Di Gennaro, S. and Horn, C. and Kulkarni, S.R. and Ramadge, P.J.},
+  date = {1994-12},
+  volume = {4},
+  pages = {4215-4220 vol.4},
+  doi = {10.1109/CDC.1994.411613},
+  url = {https://ieeexplore.ieee.org/abstract/document/411613?casa_token=jZEjNvcldxoAAAAA:7rrnH_LmLsGug_cmuNNoeGuE6kjFX31OYZeElBL-zU8gc1FgLPuT9-qzHnsDtPR-vBGatshfXg},
+  urldate = {2024-01-16},
+  abstract = {We consider a class of hybrid dynamic systems composed of interacting discrete and continuous subsystems. Of particular interest is the reduction of the coupled system to a single finite state automaton. Such a reduction has been proposed and analyzed in the literature on computer verification for certain special hybrid systems called timed automata. We use timed automata with two clocks (integrators) as a tool to explore extensions and generalizations of the reduction constructions. Several interesting new classes of reductions are presented.{$<>$}},
+  eventtitle = {Proceedings of 1994 33rd {{IEEE Conference}} on {{Decision}} and {{Control}}},
+  file = {/home/danesabo/Zotero/storage/J4N49CTA/Di Gennaro et al. - 1994 - Reduction of timed hybrid systems.pdf;/home/danesabo/Zotero/storage/Z8UZQZFH/411613.html}
+}
+
+@inproceedings{diggaralaVerificationAnnotatedModels,
+  title = {Verification of {{Annotated Models}} from {{Executions}}},
+  booktitle = {{{EMSOFT}} 2023},
+  author = {Diggarala and Mitra and Visawnathan},
+  file = {/home/danesabo/Zotero/storage/VC6QY8S5/C2E2Theory2.pdf}
+}
+
+@online{DigitalTwins,
+  title = {Digital {{Twins}}},
+  url = {https://www.nrc.gov/reactors/power/digital-twins.html},
+  urldate = {2024-05-21},
+  abstract = {Digital Twins},
+  langid = {american},
+  organization = {NRC Web},
+  file = {/home/danesabo/Zotero/storage/VL2AU6JP/digital-twins.html}
+}
+
+@article{dingSurveySecurityControl2018,
+  title = {A Survey on Security Control and Attack Detection for Industrial Cyber-Physical Systems},
+  author = {Ding, Derui and Han, Qing-Long and Xiang, Yang and Ge, Xiaohua and Zhang, Xian-Ming},
+  date = {2018-01-31},
+  journaltitle = {Neurocomputing},
+  shortjournal = {Neurocomputing},
+  volume = {275},
+  pages = {1674--1683},
+  publisher = {Elsevier},
+  location = {Amsterdam},
+  issn = {0925-2312},
+  doi = {10.1016/j.neucom.2017.10.009},
+  url = {http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&amp;SrcAuth=DOISource&amp;SrcApp=WOS&amp;KeyAID=10.1016%2Fj.neucom.2017.10.009&amp;DestApp=DOI&amp;SrcAppSID=8COHllwH67CX3cigLe5&amp;SrcJTitle=NEUROCOMPUTING&amp;DestDOIRegistrantName=Elsevier},
+  urldate = {2022-03-08},
+  abstract = {Cyber-physical systems (CPSs), which are an integration of computation, networking, and physical processes, play an increasingly important role in critical infrastructure, government and everyday life. Due to physical constraints, embedded computers and networks may give rise to some additional security vulnerabilities, which results in losses of enormous economy benefits or disorder of social life. As a result, it is of significant to properly investigate the security issue of CPSs to ensure that such systems are operating in a safe manner. This paper, from a control theory perspective, presents an overview of recent advances on security control and attack detection of industrial CPSs. First, the typical system modeling on CPSs is summarized to cater for the requirement of the performance analysis. Then three typical types of cyber-attacks, i.e. denial-of-service attacks, replay attacks, and deception attacks, are disclosed from an engineering perspective. Moreover, robustness, security and resilience as well as stability are discussed to govern the capability of weakening various attacks. The development on attack detection for industrial CPSs is reviewed according to the categories on detection approaches. Furthermore, the security control and state estimation are discussed in detail. Finally, some challenge issues are raised for the future research. (c) 2017 Elsevier B.V. All rights reserved.},
+  langid = {english},
+  keywords = {DGC read,key},
+  annotation = {WOS:000418370200157},
+  file = {/home/danesabo/Zotero/storage/GUU8LBLK/Ding19.pdf}
+}
+
+@online{DoDCyberWorkforce,
+  title = {{{DoD Cyber Workforce Framework}} – {{DoD Cyber Exchange}}},
+  url = {https://public.cyber.mil/wid/dcwf/},
+  urldate = {2023-11-07},
+  file = {/home/danesabo/Zotero/storage/3EM5FBI9/dcwf.html}
+}
+
+@report{DOE-TRL,
+  title = {Technology Readiness Assessment Guide},
+  author = {{Office of Project Management Oversight \& Assessments}},
+  date = {2011},
+  number = {DOE G 413.3-4A},
+  institution = {U.S. Department of Energy}
+}
+
+@article{dollnerGeospatialArtificialIntelligence2020,
+  title = {Geospatial {{Artificial Intelligence}}: {{Potentials}} of {{Machine Learning}} for {{3D Point Clouds}} and {{Geospatial Digital Twins}}},
+  shorttitle = {Geospatial {{Artificial Intelligence}}},
+  author = {Döllner, Jürgen},
+  date = {2020-02},
+  journaltitle = {PFG – Journal of Photogrammetry, Remote Sensing and Geoinformation Science},
+  shortjournal = {PFG},
+  volume = {88},
+  number = {1},
+  pages = {15--24},
+  issn = {2512-2789, 2512-2819},
+  doi = {10.1007/s41064-020-00102-3},
+  url = {http://link.springer.com/10.1007/s41064-020-00102-3},
+  urldate = {2022-03-02},
+  abstract = {Artificial intelligence (AI) is changing fundamentally the way how IT solutions are implemented and operated across all application domains, including the geospatial domain. This contribution outlines AI-based techniques for 3D point clouds and geospatial digital twins as generic components of geospatial AI. First, we briefly reflect on the term “AI” and outline technology developments needed to apply AI to IT solutions, seen from a software engineering perspective. Next, we characterize 3D point clouds as key category of geodata and their role for creating the basis for geospatial digital twins; we explain the feasibility of machine learning (ML) and deep learning (DL) approaches for 3D point clouds. In particular, we argue that 3D point clouds can be seen as a corpus with similar properties as natural language corpora and formulate a “Naturalness Hypothesis” for 3D point clouds. In the main part, we introduce a workflow for interpreting 3D point clouds based on ML/ DL approaches that derive domain-specific and application-specific semantics for 3D point clouds without having to create explicit spatial 3D models or explicit rule sets. Finally, examples are shown how ML/DL enables us to efficiently build and maintain base data for geospatial digital twins such as virtual 3D city models, indoor models, or building information models.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/46VFLZTD/Geospatial AI.pdf}
+}
+
+@online{dragos2020,
+  title = {2020 {{ICS Cybersecurity Year}} in {{Review}} | {{Dragos}}},
+  date = {2021-02-24T12:29:00Z},
+  url = {https://www.dragos.com/blog/industry-news/2020-ics-cybersecurity-year-in-review/},
+  urldate = {2022-03-25},
+  abstract = {Today we published our 2020 ICS Cybersecurity Year in Review report, an annual analysis of Industrial Control System (ICS)/Operational Technology (OT) focused cyber threats, vulnerabilities, assessments, and incident response insights. The ICS/OT community has long struggled with a lack of public insights into these types of problem areas. It is Dragos’s goal to share the observations and lessons learned with the industrial community for data-driven analysis and...},
+  langid = {american},
+  file = {/home/danesabo/Zotero/storage/JCGXARU4/2020-ics-cybersecurity-year-in-review.html}
+}
+
+@article{dreierFormallyPracticallyVerifying2019,
+  title = {Formally and Practically Verifying Flow Properties in Industrial Systems},
+  author = {Dreier, Jannik and Puys, Maxime and Potet, Marie-Laure and Lafourcade, Pascal and Roch, Jean-Louis},
+  date = {2019-09},
+  journaltitle = {Computers \& Security},
+  shortjournal = {Computers \& Security},
+  volume = {86},
+  pages = {453--470},
+  issn = {01674048},
+  doi = {10.1016/j.cose.2018.09.018},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S016740481831441X},
+  urldate = {2023-10-10},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/V3FNANF6/Dreier et al. - 2019 - Formally and practically verifying flow properties.pdf}
+}
+
+@online{DSPACE,
+  title = {{{dSPACE}}},
+  url = {https://www.dspace.com/en/inc/home.cfm},
+  urldate = {2024-08-14},
+  abstract = {Around the world, dSPACE helps companies make their visions and ideas come to life faster and more reliably. In this we take pride. We are your partner in simulation and validation.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/G49FSLXT/home.html}
+}
+
+@incollection{duggiralaC2E2VerificationTool2015,
+  title = {{{C2E2}}: {{A Verification Tool}} for {{Stateflow Models}}},
+  shorttitle = {{{C2E2}}},
+  booktitle = {Tools and {{Algorithms}} for the {{Construction}} and {{Analysis}} of {{Systems}}},
+  author = {Duggirala, Parasara Sridhar and Mitra, Sayan and Viswanathan, Mahesh and Potok, Matthew},
+  editor = {Baier, Christel and Tinelli, Cesare},
+  date = {2015},
+  volume = {9035},
+  pages = {68--82},
+  publisher = {Springer Berlin Heidelberg},
+  location = {Berlin, Heidelberg},
+  doi = {10.1007/978-3-662-46681-0_5},
+  url = {http://link.springer.com/10.1007/978-3-662-46681-0_5},
+  urldate = {2023-11-02},
+  abstract = {Mathwork’s Stateflow is a predominant environment for modeling embedded and cyberphysical systems where control software interact with physical processes. We present Compare-Execute-Check-Engine (C2E2)—a verification tool for continuous and hybrid Stateflow models. It checks bounded time invariant properties of models with nonlinear dynamics, and discrete transitions with guards and resets. C2E2 transforms the model, computing simulations using a validated numerical solver, and then computes reachtube over-approximations with increasing precision. For this last step it uses annotations that have to be added to the model. These annotations are extensions of proof certificates studied in Control Theory and can be automatically obtained for linear dynamics. The C2E2 algorithm is sound and it is guaranteed to terminate if the system is robustly safe (or unsafe) with respect to perturbations to the of guards and invariants of the model. We present the architecture of C2E2, its workflow, and examples illustrating its potential role in model-based design, verification, and validation.},
+  isbn = {978-3-662-46680-3 978-3-662-46681-0},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/ETLC4293/Duggirala et al. - 2015 - C2E2 A Verification Tool for Stateflow Models.pdf}
+}
+
+@online{duLearningUniversalPolicies2023,
+  title = {Learning {{Universal Policies}} via {{Text-Guided Video Generation}}},
+  author = {Du, Yilun and Yang, Mengjiao and Dai, Bo and Dai, Hanjun and Nachum, Ofir and Tenenbaum, Joshua B. and Schuurmans, Dale and Abbeel, Pieter},
+  date = {2023-02-01},
+  eprint = {2302.00111},
+  eprinttype = {arXiv},
+  eprintclass = {cs},
+  url = {http://arxiv.org/abs/2302.00111},
+  urldate = {2023-10-05},
+  abstract = {A goal of artificial intelligence is to construct an agent that can solve a wide variety of tasks. Recent progress in text-guided image synthesis has yielded models with an impressive ability to generate complex novel images, exhibiting combinatorial generalization across domains. Motivated by this success, we investigate whether such tools can be used to construct more general-purpose agents. Specifically, we cast the sequential decision making problem as a text-conditioned video generation problem, where, given a text-encoded specification of a desired goal, a planner synthesizes a set of future frames depicting its planned actions in the future, after which control actions are extracted from the generated video. By leveraging text as the underlying goal specification, we are able to naturally and combinatorially generalize to novel goals. The proposed policy-as-video formulation can further represent environments with different state and action spaces in a unified space of images, which, for example, enables learning and generalization across a variety of robot manipulation tasks. Finally, by leveraging pretrained language embeddings and widely available videos from the internet, the approach enables knowledge transfer through predicting highly realistic video plans for real robots.},
+  langid = {english},
+  pubstate = {prepublished},
+  note = {Comment: Project Website: https://universal-policy.github.io/},
+  file = {/home/danesabo/Zotero/storage/5DQ68KBM/Du et al. - 2023 - Learning Universal Policies via Text-Guided Video .pdf}
+}
+
+@article{durethConditionalDiffusionbasedMicrostructure2023,
+  title = {Conditional Diffusion-Based Microstructure Reconstruction},
+  author = {Düreth, Christian and Seibert, Paul and Rücker, Dennis and Handford, Stephanie and Kästner, Markus and Gude, Maik},
+  date = {2023-06},
+  journaltitle = {Materials Today Communications},
+  shortjournal = {Materials Today Communications},
+  volume = {35},
+  pages = {105608},
+  issn = {23524928},
+  doi = {10.1016/j.mtcomm.2023.105608},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S2352492823002982},
+  urldate = {2024-05-20},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/IQ3XQTUG/Düreth et al. - 2023 - Conditional diffusion-based microstructure reconst.pdf}
+}
+
+@incollection{dutertreFormalModelingAnalysis2007,
+  title = {Formal {{Modeling}} and {{Analysis}} of the {{Modbus Protocol}}},
+  booktitle = {Critical {{Infrastructure Protection}}},
+  author = {Dutertre, Bruno},
+  editor = {Goetz, Eric and Shenoi, Sujeet},
+  date = {2007},
+  volume = {253},
+  pages = {189--204},
+  publisher = {Springer US},
+  location = {Boston, MA},
+  doi = {10.1007/978-0-387-75462-8_14},
+  url = {http://link.springer.com/10.1007/978-0-387-75462-8_14},
+  urldate = {2023-10-10},
+  abstract = {Modbus is a communication protocol that is widely used in SCADA systems and distributed control applications. This paper presents formal specifications of Modbus developed using PVS, a generic theorem prover; and SAL, a toolset for the automatic analysis of state-transition systems. Both formalizations are based on the Modbus Application Protocol, which specifies the format of Modbus request and response messages. This formal modeling effort is the first step in the development of automated methods for systematic and extensive testing of Modbus devices.},
+  isbn = {978-0-387-75461-1},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/S78P2BS3/Dutertre - 2007 - Formal Modeling and Analysis of the Modbus Protoco.pdf}
+}
+
+@article{dwDARPAExplainableArtificial2019,
+  title = {{{DARPA}}’s Explainable Artificial Intelligence Program},
+  author = {DW, Gunning D. Aha},
+  date = {2019},
+  journaltitle = {AI Mag},
+  volume = {40},
+  number = {2},
+  pages = {44},
+  file = {/home/danesabo/Zotero/storage/MVPYRP4A/storage:storage:DARPA’s Explainable
+Artificial Intelligence Program.pdf}
+}
+
+@misc{DyanmicDeceptionIndustrial,
+  title = {Dyanmic {{Deception}} for {{Industrial Automation}} and {{Control Systems}}},
+  url = {https://attivonetworks.com/documentation/Attivo_Networks-Energy_Whitepaper.pdf},
+  organization = {Attivo Networks},
+  file = {/home/danesabo/Zotero/storage/88H2IMR9/Attivo_Networks-Energy_Whitepaper.pdf}
+}
+
+@article{dyliaccoEnhancingPowerSystem1997,
+  title = {Enhancing Power System Security Control},
+  author = {DyLiacco, T. E.},
+  date = {1997-07},
+  journaltitle = {Ieee Computer Applications in Power},
+  shortjournal = {IEEE Comput. Appl. Power},
+  volume = {10},
+  number = {3},
+  pages = {38--41},
+  publisher = {Ieee-Inst Electrical Electronics Engineers Inc},
+  location = {New York},
+  issn = {0895-0156},
+  doi = {10.1109/67.595291},
+  url = {http://www.webofscience.com/wos/woscc/summary/marked/relevance/1},
+  urldate = {2022-03-08},
+  langid = {english},
+  keywords = {DGC read},
+  annotation = {WOS:A1997XG57700009},
+  file = {/home/danesabo/Zotero/storage/CFARXNQ6/DyLiacco - 1997 - Enhancing power system security control.pdf}
+}
+
+@article{edmondsSECURITYANALYSISMULTILAYER,
+  title = {{{SECURITY ANALYSIS OF MULTILAYER SCADA PROTOCOLS}}: {{A MODBUS TCP CASE STUDY}}},
+  author = {Edmonds, Janica and Papa, Mauricio and Shenoi, Sujeet},
+  journaltitle = {CRITICAL INFRASTRUCTURE PROTECTION},
+  pages = {17},
+  abstract = {The layering of protocols in critical infrastructure networks – exemplified by Modbus TCP in the oil and gas sector and SS7oIP in the telecommunications sector – raises important security issues. The individual protocol stacks, e.g., Modbus and SS7, have certain vulnerabilities, and transporting these protocols using carrier protocols, e.g., TCP/IP, brings into play the vulnerabilities of the carrier protocols. Moreover, the layering produces unintended inter-protocol interactions and, possibly, new vulnerabilities. This paper describes a formal methodology for evaluating the security of multilayer SCADA protocols. The methodology, involving the analysis of peer-to-peer communications and multilayer protocol interactions, is discussed in the context of Modbus TCP, the predominant protocol used for oil and gas pipeline operations.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/EIXS9WGU/Edmonds et al. - SECURITY ANALYSIS OF MULTILAYER SCADA PROTOCOLS A.pdf}
+}
+
+@book{EffectiveHaskell,
+  title = {Effective {{Haskell}}},
+  url = {https://learning.oreilly.com/library/view/effective-haskell/9798888650400/},
+  urldate = {2023-12-13},
+  abstract = {Put the power of  Haskell to work in your programs, learning from an engineer who uses  Haskell daily to get practical work done efficiently. Leverage powerful features like Monad Transformers and...},
+  isbn = {9798888650400},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/PLQMGIZH/9798888650400.html}
+}
+
+@video{egerstedtLectureHybridAutomata2014,
+  entrysubtype = {video},
+  title = {Lecture 5.2 - {{Hybrid Automata}}},
+  editor = {Egerstedt, Magnus},
+  editortype = {director},
+  date = {2014},
+  location = {Georgia Instiute of Technology},
+  url = {https://www.youtube.com/watch?v=KdjMz0rpMms},
+  urldate = {2023-11-14}
+}
+
+@article{einickeRobustExtendedKalman1999,
+  title = {Robust Extended {{Kalman}} Filtering},
+  author = {Einicke, G.A. and White, L.B.},
+  year = {Sept./1999},
+  journaltitle = {IEEE Transactions on Signal Processing},
+  shortjournal = {IEEE Trans. Signal Process.},
+  volume = {47},
+  number = {9},
+  pages = {2596--2599},
+  issn = {1053587X},
+  doi = {10.1109/78.782219},
+  url = {http://ieeexplore.ieee.org/document/782219/},
+  urldate = {2022-02-11},
+  abstract = {Linearization errors inherent in the specification of an extended Kalman filter (EKF) can severely degrade its performance. This correspondence presents a new approach to the robust design of a discrete-time EKF by application of the robust linear design methods based on the H1 norm minimization criterion. The results of simulations are presented to demonstrate an advantage for signal demodulation and nonlinear equalization applications.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/5MBDQVW8/Einicke and White - 1999 - Robust extended Kalman filtering.pdf}
+}
+
+@report{ElectricityGridModernization,
+  title = {Electricity {{Grid Modernization}}:  {{Progress Being Made}} on {{Cybersecurity Guidelines}}, but {{Key Challenges Remain}} to Be {{Addressed}}},
+  url = {https://www.gao.gov/assets/gao-11-117.pdf},
+  urldate = {2022-03-22},
+  file = {/home/danesabo/Zotero/storage/6WBLUWJY/gao-11-117.pdf}
+}
+
+@article{ellisonExtendingAADLSecurity2015,
+  title = {Extending {{AADL}} for Security Design Assurance of Cyber-Physical Systems},
+  author = {Ellison, Robert and Householder, Allen and Hudak, John and Kazman, Rik and Woody, Carol},
+  date = {2015},
+  journaltitle = {CMU/SEI Report},
+  file = {/home/danesabo/Zotero/storage/H2IWZM6I/Ellison et al. - Extending AADL for Security Design Assurance of Cy.pdf}
+}
+
+@book{EnhancingEffectivenessTeam2015,
+  title = {Enhancing the {{Effectiveness}} of {{Team Science}}},
+  date = {2015-07-15},
+  pages = {19007},
+  publisher = {National Academies Press},
+  location = {Washington, D.C.},
+  doi = {10.17226/19007},
+  url = {http://www.nap.edu/catalog/19007},
+  urldate = {2024-01-26},
+  isbn = {978-0-309-31682-8},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/P8PJ4FTW/2015 - Enhancing the Effectiveness of Team Science.pdf}
+}
+
+@article{enumitem,
+  title = {Customizing Lists with the Enumitem Package},
+  author = {Bezos, Javier},
+  pages = {23},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/N5IWAHJE/Bezos - Customizing lists with the enumitem package.pdf}
+}
+
+@article{erikstadMergingPhysicsBig,
+  title = {Merging {{Physics}}, {{Big Data Analytics}} and {{Simulation}} for the {{Next-Generation Digital Twins}}},
+  author = {Erikstad, Stein Ove},
+  pages = {11},
+  abstract = {A digital twin is a model capable of rendering the state and behaviour of a unique real asset in (close to) real time. Thus, it offers opportunities beyond the capabilities offered by traditional CAD, CAE and PLM. In this paper, we will lay out the core principles on which digital twins are founded, pointing to its history from engineering analysis and simulation models. Further, we compare a physics-based digital twin solution with artificial intelligence and machine learning. Our proposition is that while the two are fundamentally different in how knowledge and insight is generated, they at the same time offer opportunities for innovative complementary solutions based on big data sensor platforms.},
+  langid = {english},
+  keywords = {DGC read},
+  file = {/home/danesabo/Zotero/storage/HGUPGNGR/Merging physics, big data, and simulations for DTs.pdf}
+}
+
+@article{esmaeiliEnhancingDigitalRock2024,
+  title = {Enhancing Digital Rock Analysis through Generative Artificial Intelligence: {{Diffusion}} Models},
+  shorttitle = {Enhancing Digital Rock Analysis through Generative Artificial Intelligence},
+  author = {Esmaeili, Mohammad},
+  date = {2024-06},
+  journaltitle = {Neurocomputing},
+  shortjournal = {Neurocomputing},
+  volume = {587},
+  pages = {127676},
+  issn = {09252312},
+  doi = {10.1016/j.neucom.2024.127676},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0925231224004478},
+  urldate = {2024-05-20},
+  langid = {english}
+}
+
+@article{estefanSurveyModelBasedSystems2008,
+  title = {Survey of {{Model-Based Systems Engineering}} ({{MBSE}}) {{Methodologies}}},
+  author = {Estefan, Jeff A},
+  date = {2008},
+  langid = {english},
+  keywords = {Important},
+  file = {/home/danesabo/Zotero/storage/R8V4TI8S/Estefan - 2008 - Survey of Model-Based Systems Engineering (MBSE) M.pdf}
+}
+
+@report{ETA-report,
+  title = {Economic Review of Pennsylvania},
+  date = {2021-08},
+  institution = {Center for Workforce Information \& Analysis}
+}
+
+@online{ExplainableVerificationSurvey2024,
+  title = {Explainable {{Verification}}: {{Survey}}, {{Situations}}, and {{New Ideas}}},
+  shorttitle = {Explainable {{Verification}}},
+  date = {2024-04-16},
+  url = {https://insights.sei.cmu.edu/library/explainable-verification-survey-situations-and-new-ideas/},
+  urldate = {2024-06-26},
+  abstract = {This report focuses on potential changes in software development practice and research that would help tools used for formal methods explain their output, making software practitioners more likely to trust them.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/TMYUKHUT/explainable-verification-survey-situations-and-new-ideas.html}
+}
+
+@article{fabianPetriNetsControl1994,
+  title = {Petri {{Nets}} and {{Control Synthesis}}: {{An Object-Oriented Approach}}},
+  shorttitle = {Petri {{Nets}} and {{Control Synthesis}}},
+  author = {Fabian, M. and Lennartson, B.},
+  date = {1994-06-01},
+  journaltitle = {IFAC Proceedings Volumes},
+  shortjournal = {IFAC Proceedings Volumes},
+  series = {{{IFAC Workshop}} on {{Intelligent Manufacturing Systems}} 1994 ({{IMS}}'94), {{Vienna}}, {{Austria}}, 13-15 {{June}}},
+  volume = {27},
+  number = {4},
+  pages = {365--370},
+  issn = {1474-6670},
+  doi = {10.1016/S1474-6670(17)46051-4},
+  url = {https://www.sciencedirect.com/science/article/pii/S1474667017460514},
+  urldate = {2024-02-15},
+  abstract = {When implementing control of discrete event systems, the efficiency and reliability would be greatly improved if the control algorithms could be automatically synthesised. Using reussble software models as models of the physical resources, and part-routing es specifications on the system-behavior, we will show how such automatic generation of coatrol algorithms can be achieved. Our approach IS based on the Supervisory Control Theory (SCT) developed by Ramadge and Wonham. The machining resources are modeled by Petri Nets. The pat-routes are also given ad petri Nets describing the order in which each part should, or can (alternative routes are allowed)visit the respective resources, together with which operation the resource is to perform on the individual part The parts’ desired routes are individually specified irrespective of parts of other types, even though they may compete for mutual resources. The part specifications, seen now as users of the resources, are composed into a joint global specification which is further composed with the resources. Elementary Petri Net manipulations give a net describing the total system with but a fraction of the states that would result from composition of the corresponding state-automatons. The reachability-graph of this Petri Net is then calculated and used as the finite state-machine input to an SCT algorithm. At this point further specifications, in the from of desired or forbidden stetes can be introduced, whereafter the supervisor is generated. In the global specification, and hence within the supervisor, the same event can lead to any of a subset of different states. This non-determinism is resolved by inspection of the system-state before and after the event. In this paper we will describe a flexible manufcturing system with a number of different products and generate its control-laws as outlined above.},
+  file = {/home/danesabo/Zotero/storage/JZU3UPC4/S1474667017460514.html}
+}
+
+@article{fabianPetriNetsControl1994a,
+  title = {Petri {{Nets}} and {{Control Synthesis}}: {{An Object-Oriented Approach}}},
+  shorttitle = {Petri {{Nets}} and {{Control Synthesis}}},
+  author = {Fabian, M. and Lennartson, B.},
+  date = {1994-06},
+  journaltitle = {IFAC Proceedings Volumes},
+  shortjournal = {IFAC Proceedings Volumes},
+  volume = {27},
+  number = {4},
+  pages = {365--370},
+  issn = {14746670},
+  doi = {10.1016/S1474-6670(17)46051-4},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S1474667017460514},
+  urldate = {2024-02-15},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/LICAU236/Fabian and Lennartson - 1994 - Petri Nets and Control Synthesis An Object-Orient.pdf}
+}
+
+@online{FactSheetONCD2024,
+  title = {Fact {{Sheet}}: {{ONCD Report Calls}} for {{Adoption}} of {{Memory Safe Programming Languages}} and {{Addressing}} the {{Hard Research Problem}} of {{Software Measurability}} | {{ONCD}}},
+  shorttitle = {Fact {{Sheet}}},
+  date = {2024-02-26},
+  url = {https://www.whitehouse.gov/oncd/briefing-room/2024/02/26/memory-safety-fact-sheet/},
+  urldate = {2024-08-14},
+  abstract = {ONCD Rallies Industry, Academia, and Civil Society to Join Effort February 26, 2024 Read the full report here Watch the video address here Today, the Office of the National Cyber Director (ONCD) published a technical report entitled “Back to the Building Blocks: A Path Toward Secure and Measurable Software.” The report builds upon the President’s…},
+  langid = {american},
+  organization = {The White House},
+  file = {/home/danesabo/Zotero/storage/5E2YKELM/memory-safety-fact-sheet.html}
+}
+
+@article{fainekosRobustnessTemporalLogic2009,
+  title = {Robustness of Temporal Logic Specifications for Continuous-Time Signals},
+  author = {Fainekos, Georgios E. and Pappas, George J.},
+  date = {2009-09-28},
+  journaltitle = {Theoretical Computer Science},
+  shortjournal = {Theoretical Computer Science},
+  volume = {410},
+  number = {42},
+  pages = {4262--4291},
+  issn = {0304-3975},
+  doi = {10.1016/j.tcs.2009.06.021},
+  url = {https://www.sciencedirect.com/science/article/pii/S0304397509004149},
+  urldate = {2023-11-03},
+  abstract = {In this paper, we consider the robust interpretation of Metric Temporal Logic (MTL) formulas over signals that take values in metric spaces. For such signals, which are generated by systems whose states are equipped with non-trivial metrics, for example continuous or hybrid, robustness is not only natural, but also a critical measure of system performance. Thus, we propose multi-valued semantics for MTL formulas, which capture not only the usual Boolean satisfiability of the formula, but also topological information regarding the distance, ε, from unsatisfiability. We prove that any other signal that remains ε-close to the initial one also satisfies the same MTL specification under the usual Boolean semantics. Finally, our framework is applied to the problem of testing formulas of two fragments of MTL, namely Metric Interval Temporal Logic (MITL) and closed Metric Temporal Logic (clMTL), over continuous-time signals using only discrete-time analysis. The motivating idea behind our approach is that if the continuous-time signal fulfills certain conditions and the discrete-time signal robustly satisfies the temporal logic specification, then the corresponding continuous-time signal should also satisfy the same temporal logic specification.},
+  file = {/home/danesabo/Zotero/storage/7247R8AS/Fainekos and Pappas - 2009 - Robustness of temporal logic specifications for co.pdf;/home/danesabo/Zotero/storage/ZUNXFP5U/S0304397509004149.html}
+}
+
+@incollection{fanAutomaticReachabilityAnalysis2016,
+  title = {Automatic {{Reachability Analysis}} for {{Nonlinear Hybrid Models}} with {{C2E2}}},
+  booktitle = {Computer {{Aided Verification}}},
+  author = {Fan, Chuchu and Qi, Bolun and Mitra, Sayan and Viswanathan, Mahesh and Duggirala, Parasara Sridhar},
+  editor = {Chaudhuri, Swarat and Farzan, Azadeh},
+  date = {2016},
+  volume = {9779},
+  pages = {531--538},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-319-41528-4_29},
+  url = {http://link.springer.com/10.1007/978-3-319-41528-4_29},
+  urldate = {2023-11-02},
+  abstract = {C2E2 is a bounded reachability analysis tool for nonlinear dynamical systems and hybrid automaton models. Previously it required users to annotate each system of differential equations of the hybrid automaton with discrepancy functions, and since these annotations are difficult to get for general nonlinear differential equations, the tool had limited usability. This version of C2E2 is improved in several ways, the most prominent among which is the elimination of the need for userprovided discrepancy functions. It automatically computes piece-wise (or local) discrepancy functions around the reachable parts of the state space using symbolically computed Jacobian matrix and eigenvalue perturbation bounds. The special cases of linear and constant rate differential equations are handled with more efficient algorithm. In this paper, we discuss these and other new features that make the new C2E2 a usable tool for bounded reachability analysis of hybrid systems.},
+  isbn = {978-3-319-41527-7 978-3-319-41528-4},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/5RSUFEFL/Fan et al. - 2016 - Automatic Reachability Analysis for Nonlinear Hybr.pdf}
+}
+
+@inproceedings{fanOverviewCybersecurityIndustrial2015,
+  title = {Overview of Cyber-Security of Industrial Control System},
+  booktitle = {2015 {{International Conference}} on {{Cyber Security}} of {{Smart Cities}}, {{Industrial Control System}} and {{Communications}} ({{SSIC}})},
+  author = {Fan, Xiaohe and Fan, Kefeng and Wang, Yong and Zhou, Ruikang},
+  date = {2015-08},
+  pages = {1--7},
+  publisher = {IEEE},
+  location = {Shanghai, China},
+  doi = {10.1109/SSIC.2015.7245324},
+  url = {http://ieeexplore.ieee.org/document/7245324/},
+  urldate = {2022-09-30},
+  abstract = {With the development of information technology, the network connection of industrial control system (ICS) and information technology (IT) is becoming more and more closely. What’s more, the security issues of traditional IT systems in industrial control system are also more prominent. Early industrial control system mainly uses physical isolation approach to protect security. In this paper, we review the characteristics and reference models of industrial control system and analyze the current security status of industrial control system. Moreover, we propose a defense-in-depth system, security policies of active protection and passive monitoring for these security issues. Besides, we also discuss the key technologies and summarize the full text.},
+  eventtitle = {2015 {{International Conference}} on {{Cyber Security}} of {{Smart}} Cities, {{Industrial Control System}} and {{Communications}} ({{SSIC}})},
+  isbn = {978-1-4673-7977-9},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/E6FISREL/Fan et al. - 2015 - Overview of cyber-security of industrial control s.pdf}
+}
+
+@inproceedings{faruqueDesignMethodologiesSecuring2015,
+  title = {Design Methodologies for Securing Cyber-Physical Systems},
+  booktitle = {2015 {{International Conference}} on {{Hardware}}/{{Software Codesign}} and {{System Synthesis}} ({{CODES}}+{{ISSS}})},
+  author = {Faruque, Mohammad Al and Regazzoni, Francesco and Pajic, Miroslav},
+  date = {2015-10},
+  pages = {30--36},
+  doi = {10.1109/CODESISSS.2015.7331365},
+  url = {https://ieeexplore.ieee.org/abstract/document/7331365},
+  urldate = {2023-09-27},
+  abstract = {Cyber-Physical Systems (CPS) are in most cases safety- and mission-critical. Standard design techniques used for securing embedded systems are not suitable for CPS due to the restricted computation and communication budget available in the latter. In addition, the sensitivity of sensed data and the presence of actuation components further increase the security requirements of CPS. To address these issues, it is necessary to provide new design methods in which security is considered from the beginning of the whole design flow and addressed in a holistic way. In this paper, we focus on the design of secure CPS as part of the complete CPS design process, and provide insights into new requirements on platform-aware design of control components, design methodologies and architectures posed by CPS design. We start by discussing methods for the multi-disciplinary modeling, simulation, tools, and software synthesis challenges for CPS. We also present a framework for design of secure control systems for CPS, while taking into account properties of the underlying computation and communication platforms. Finally, we describe the security challenges in the computing hardware that is used in CPS.},
+  eventtitle = {2015 {{International Conference}} on {{Hardware}}/{{Software Codesign}} and {{System Synthesis}} ({{CODES}}+{{ISSS}})},
+  keywords = {design},
+  file = {/home/danesabo/Zotero/storage/AIM5XFAM/Faruque et al. - 2015 - Design methodologies for securing cyber-physical s.pdf}
+}
+
+@article{faselEnsembleSINDyRobustSparse2022,
+  title = {Ensemble-{{SINDy}}: {{Robust}} Sparse Model Discovery in the Low-Data, High-Noise Limit, with Active Learning and Control},
+  shorttitle = {Ensemble-{{SINDy}}},
+  author = {Fasel, U. and Kutz, J. N. and Brunton, B. W. and Brunton, S. L.},
+  date = {2022-04},
+  journaltitle = {Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences},
+  shortjournal = {Proc. R. Soc. A.},
+  volume = {478},
+  number = {2260},
+  pages = {20210904},
+  issn = {1364-5021, 1471-2946},
+  doi = {10.1098/rspa.2021.0904},
+  url = {https://royalsocietypublishing.org/doi/10.1098/rspa.2021.0904},
+  urldate = {2024-01-04},
+  abstract = {Sparse model identification enables the discovery of nonlinear dynamical systems purely from data; however, this approach is sensitive to noise, especially in the low-data limit. In this work, we leverage the statistical approach of bootstrap aggregating (bagging) to robustify the sparse identification of~the nonlinear dynamics (SINDy) algorithm. First, an ensemble of SINDy models is identified from subsets of limited and noisy data. The aggregate model statistics are then used to produce inclusion probabilities of the candidate functions, which enables uncertainty quantification and probabilistic forecasts. We apply this ensemble-SINDy (E-SINDy) algorithm to several synthetic and real-world datasets and demonstrate substantial improvements to the accuracy and robustness of model discovery from extremely noisy and limited data. For example, E-SINDy uncovers partial differential equations models from data with more than twice as much measurement noise as has been previously reported. Similarly, E-SINDy learns the Lotka Volterra dynamics from remarkably limited data of yearly lynx and hare pelts collected from 1900 to 1920. E-SINDy is computationally efficient, with similar scaling as standard SINDy. Finally, we show that ensemble statistics from E-SINDy can be exploited for active learning and improved model predictive control.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/GEIIX8KL/Fasel et al. - 2022 - Ensemble-SINDy Robust sparse model discovery in t.pdf}
+}
+
+@article{fayGaussianProcessModels2017,
+  title = {Gaussian {{Process}} Models for Ubiquitous User Comfort Preference Sampling; Global Priors, Active Sampling and Outlier Rejection},
+  author = {Fay, Damien and O’Toole, Liam and Brown, Kenneth N.},
+  date = {2017-08},
+  journaltitle = {Pervasive and Mobile Computing},
+  shortjournal = {Pervasive and Mobile Computing},
+  volume = {39},
+  pages = {135--158},
+  issn = {15741192},
+  doi = {10.1016/j.pmcj.2016.08.012},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S1574119216301651},
+  urldate = {2022-04-21},
+  abstract = {This paper presents a ubiquitous thermal comfort preference learning study in a noisy environment. We introduce Gaussian Process models into this field and show they are ideal, allowing rejection of outliers, deadband samples, and produce excellent estimates of a users preference function. In addition, informative combinations of users preferences becomes possible, some of which demonstrate well defined maxima ideal for control signals. Interestingly, while those users studied have differing preferences, their hyperparameters are concentrated allowing priors for new users. In addition, we present an active learning algorithm which estimates when to poll users to maximise the information returned.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/6FLNTKD5/Fay et al. - 2017 - Gaussian Process models for ubiquitous user comfor.pdf}
+}
+
+@article{FederalCybersecurityResearch2023,
+  title = {Federal {{Cybersecurity Research}} and {{Development Strategic Plan}} (2023)},
+  date = {2023},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/ZES2SB5T/2023 - Federal Cybersecurity Research and Development Str.pdf}
+}
+
+@incollection{fehnkerBenchmarksHybridSystems2004,
+  title = {Benchmarks for {{Hybrid Systems Verification}}},
+  booktitle = {Hybrid {{Systems}}: {{Computation}} and {{Control}}},
+  author = {Fehnker, Ansgar and Ivančić, Franjo},
+  editor = {Alur, Rajeev and Pappas, George J.},
+  editora = {Goos, Gerhard and Hartmanis, Juris and Van Leeuwen, Jan},
+  editoratype = {redactor},
+  date = {2004},
+  volume = {2993},
+  pages = {326--341},
+  publisher = {Springer Berlin Heidelberg},
+  location = {Berlin, Heidelberg},
+  doi = {10.1007/978-3-540-24743-2_22},
+  url = {http://link.springer.com/10.1007/978-3-540-24743-2_22},
+  urldate = {2023-11-01},
+  abstract = {There are numerous application examples for hybrid systems verification in recent literature. Most of them were introduced to illustrate a new approach to hybrid systems verification, and are therefore of a limited size. Others are case studies that serve to prove that an approach can be applied to real world problems. Verification of these typically requires a lot of domain experience to obtain a tractable, verifiable model. Verification of a case study yields a singular result that is hard to compare and time-consuming to reproduce.},
+  isbn = {978-3-540-21259-1 978-3-540-24743-2},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/3W8M5M5I/Fehnker and Ivančić - 2004 - Benchmarks for Hybrid Systems Verification.pdf}
+}
+
+@article{felderABCENGINEERINGEDUCATION2004,
+  title = {{{THE ABC}}’{{S OF ENGINEERING EDUCATION}}: {{ABET}}, {{BLOOM}}’{{S TAXONOMY}}, {{COOPERATIVE LEARNING}}, {{AND SO ON}}},
+  author = {Felder, Richard M and Brent, Rebecca},
+  date = {2004},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/PMHC56FH/Felder and Brent - 2004 - THE ABC’S OF ENGINEERING EDUCATION ABET, BLOOM’S .pdf}
+}
+
+@article{felderDesigningTeachingCourses2003,
+  title = {Designing and {{Teaching Courses}} to {{Satisfy}} the {{ABET Engineering Criteria}}},
+  author = {Felder, Richard M. and Brent, Rebecca},
+  date = {2003},
+  journaltitle = {Journal of Engineering Education},
+  volume = {92},
+  number = {1},
+  pages = {7--25},
+  issn = {2168-9830},
+  doi = {10.1002/j.2168-9830.2003.tb00734.x},
+  url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/j.2168-9830.2003.tb00734.x},
+  urldate = {2024-01-26},
+  abstract = {Since the new ABET accreditation system was first introduced to American engineering education in the middle 1990s as Engineering Criteria 2000, most discussion in the literature has focused on how to assess Outcomes 3a-3k and relatively little has concerned how to equip students with the skills and attitudes specified in those outcomes. This paper seeks to fill this gap. Its goals are to (1) overview the accreditation process and clarify the confusing array of terms associated with it (objectives, outcomes, outcome indicators, etc.); (2) provide guidance on the formulation of course learning objectives and assessment methods that address Outcomes 3a-3k; (3) identify and describe instructional techniques that should effectively prepare students to achieve those outcomes by the time they graduate; and (4) propose a strategy for integrating program-level and course-level activities when designing an instructional program to meet the requirements of the ABET engineering criteria.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/CWVDC6WV/Felder and Brent - 2003 - Designing and Teaching Courses to Satisfy the ABET.pdf;/home/danesabo/Zotero/storage/MEG822JW/j.2168-9830.2003.tb00734.html}
+}
+
+@article{fernandezadiegoApplyingModelChecking2015,
+  title = {Applying {{Model Checking}} to {{Industrial-Sized PLC Programs}}},
+  author = {Fernández Adiego, Borja and Darvas, Dániel and Viñuela, Enrique Blanco and Tournier, Jean-Charles and Bliudze, Simon and Blech, Jan Olaf and González Suárez, Víctor Manuel},
+  date = {2015-12},
+  journaltitle = {IEEE Transactions on Industrial Informatics},
+  volume = {11},
+  number = {6},
+  pages = {1400--1410},
+  issn = {1941-0050},
+  doi = {10.1109/TII.2015.2489184},
+  url = {https://ieeexplore.ieee.org/abstract/document/7295624?casa_token=0JbkBFtDk8cAAAAA:sp0RxKZlXykLt1TObkrAtS9gMJiSHS7NuevkhtyVRi5v104B7KMTEzWZJdD0HWeglU55PJHDd9E},
+  urldate = {2024-08-08},
+  abstract = {Programmable logic controllers (PLCs) are embedded computers widely used in industrial control systems. Ensuring that a PLC software complies with its specification is a challenging task. Formal verification has become a recommended practice to ensure the correctness of safety-critical software, but is still underused in industry due to the complexity of building and managing formal models of real applications. In this paper, we propose a general methodology to perform automated model checking of complex properties expressed in temporal logics [e.g., computation tree logic (CTL) and linear temporal logic (LTL)] on PLC programs. This methodology is based on an intermediate model (IM) meant to transform PLC programs written in various standard languages [structured text (ST), sequential function chart (SFC), etc.] to different modeling languages of verification tools. We present the syntax and semantics of the IM, and the transformation rules of the ST and SFC languages to the nuXmv model checker passing through the IM. Finally, two real cases studies of the European Organization for Nuclear Research (CERN) PLC programs, written mainly in the ST language, are presented to illustrate and validate the proposed approach.},
+  eventtitle = {{{IEEE Transactions}} on {{Industrial Informatics}}},
+  keywords = {automata,Automata,Biological system modeling,IEC 61131,IEC Standards,Informatics,model checking,Model checking,modeling,nuXmv,PLC,programmable logic controller (PLC),Software,verification},
+  file = {/home/danesabo/Zotero/storage/SQVUQS5B/Fernández Adiego et al. - 2015 - Applying Model Checking to Industrial-Sized PLC Pr.pdf;/home/danesabo/Zotero/storage/B6DJHWQY/7295624.html}
+}
+
+@article{ferranteSimpleProofRouth1999,
+  title = {A Simple Proof of the {{Routh}} Test},
+  author = {Ferrante, A. and Lepschy, A. and Viaro, U.},
+  date = {1999-06},
+  journaltitle = {IEEE Transactions on Automatic Control},
+  volume = {44},
+  number = {6},
+  pages = {1306--1309},
+  issn = {1558-2523},
+  doi = {10.1109/9.769396},
+  url = {https://ieeexplore.ieee.org/abstract/document/769396?casa_token=qEO0cTxWiXAAAAAA:-BTm1YxP6pWOUaC6hv8pF3OOIYGiwL4YqOTO3Qu-9oylO5EN-gn2yeEu45EAC2uq7oxUP88JUA},
+  urldate = {2024-03-04},
+  abstract = {An elementary proof of the classic Routh method for counting the number of left half-plane and right half-plane zeros of a real coefficient polynomial P/sub n/(s) of degree n is given. Such a proof refers to the polynomials P/sub i/(s) of degree i/spl les/n formed from the entries of the rows of order i and i-1 of the relevant Routh array. In particular, it is based on the consideration of an auxiliary polynomial P/sub i/(s; q), linearly dependent on a real parameter q, which reduces to either polynomial P/sub i/(s) or to polynomial P/sub i-1/(s) for particular values of q. In this way, it is easy to show that i-1 zeroes of P/sub i/(s) lie in the same half-plane as the zeros of P/sub i/(s), and the remaining zero lies in the left or in the right half-plane according to the sign of the ratio of the leading coefficients of P/sub i/(s) and P/sub i-1/(s). By successively applying this property to all pairs of polynomials in the sequence, starting from P/sub o/(s) and P/sub 1/(s), the standard rule for determining the zero distribution of P/sub n/(s) is immediately derived.},
+  eventtitle = {{{IEEE Transactions}} on {{Automatic Control}}},
+  file = {/home/danesabo/Zotero/storage/YWCFSEZ9/Ferrante et al. - 1999 - A simple proof of the Routh test.pdf;/home/danesabo/Zotero/storage/7Y7K6BSP/769396.html}
+}
+
+@article{ferreiraSimulationIndustryStateoftheart2020,
+  title = {Simulation in Industry 4.0: {{A}} State-of-the-Art Review},
+  shorttitle = {Simulation in Industry 4.0},
+  author = {Ferreira, William de Paula and Armellini, Fabiano and De Santa-Eulalia, Luis Antonio},
+  date = {2020-11},
+  journaltitle = {Computers \& Industrial Engineering},
+  shortjournal = {Comput. Ind. Eng.},
+  volume = {149},
+  pages = {106868},
+  publisher = {Pergamon-Elsevier Science Ltd},
+  location = {Oxford},
+  issn = {0360-8352},
+  doi = {10.1016/j.cie.2020.106868},
+  url = {http://www.webofscience.com/wos/woscc/summary/marked/relevance/1},
+  urldate = {2022-03-08},
+  abstract = {Simulation is a key technology for developing planning and exploratory models to optimize decision making as well as the design and operations of complex and smart production systems. It could also aid companies to evaluate the risks, costs, implementation barriers, impact on operational performance, and roadmap toward Industry 4.0. Although several advances have been made in this domain, studies that systematically characterize and analyze the development of simulation-based research in Industry 4.0 are scarce. Therefore, this study aims to investigate the state-of-the-art research performed on the intersecting area of simulation and the field of Industry 4.0. Initially, a conceptual framework describing Industry 4.0 in terms of enabling technologies and design principles for modeling and simulation of Industry 4.0 scenarios is proposed. Thereafter, literature on simulation technologies and Industry 4.0 design principles is systematically reviewed using the preferred reporting items for systematic reviews and meta-analyses (PRISMA) methodology. This study reveals an increasing trend in the number of publications on simulation in Industry 4.0 within the last four years. In total, 10 simulation-based approaches and 17 Industry 4.0 design principles were identified. A cross-analysis of concepts and evaluation of models' development suggest that simulation can capture the design principles of Industry 4.0 and support the investigation of the Industry 4.0 phenomenon from different perspectives. Finally, the results of this study indicate hybrid simulation and digital twin as the primary simulation-based approaches in the context of Industry 4.0.},
+  langid = {english},
+  keywords = {DGC read},
+  annotation = {WOS:000582320000073},
+  file = {/home/danesabo/Zotero/storage/E3ZU3XVX/Ferreira et al. - 2020 - Simulation in industry 4.0 A state-of-the-art rev.pdf}
+}
+
+@article{fischerRemarksMeasureRisk2007,
+  title = {Remarks on “{{A}} Measure of Risk and a Decision-Making Model Based on Expected Utility and Entropy” by {{Jiping Yang}} and {{Wanhua Qiu}} ({{EJOR}} 164 (2005), 792–799)},
+  author = {Fischer, Kathrin and Kleine, Andreas},
+  date = {2007-10},
+  journaltitle = {European Journal of Operational Research},
+  shortjournal = {European Journal of Operational Research},
+  volume = {182},
+  number = {1},
+  pages = {469--474},
+  issn = {03772217},
+  doi = {10.1016/j.ejor.2006.07.033},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0377221706007983},
+  urldate = {2024-01-26},
+  abstract = {Yang and Qiu [Yang, J., Qiu, W., 2005. A measure of risk and a decision-making model based on expected utility and entropy. European Journal of Operational Research 164, 792–799] suggest a new concept for decision making under risk. This concept relies on a combination of the well-known expected utility criterion and the so-called entropy. The authors claim that the approach might be used as a descriptive as well as a normative decision model.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/V38GBN9Y/Fischer and Kleine - 2007 - Remarks on “A measure of risk and a decision-makin.pdf}
+}
+
+@article{fisherHACMSProgramUsing2017,
+  title = {The {{HACMS}} Program: Using Formal Methods to Eliminate Exploitable Bugs},
+  shorttitle = {The {{HACMS}} Program},
+  author = {Fisher, Kathleen and Launchbury, John and Richards, Raymond},
+  date = {2017-10-13},
+  journaltitle = {Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences},
+  shortjournal = {Phil. Trans. R. Soc. A.},
+  volume = {375},
+  number = {2104},
+  pages = {20150401},
+  issn = {1364-503X, 1471-2962},
+  doi = {10.1098/rsta.2015.0401},
+  url = {https://royalsocietypublishing.org/doi/10.1098/rsta.2015.0401},
+  urldate = {2023-10-10},
+  abstract = {For decades, formal methods have offered the promise of verified software that does not have exploitable bugs. Until recently, however, it has not been possible to verify software of sufficient complexity to be useful. Recently, that situation has changed. SeL4 is an open-source operating system microkernel efficient enough to be used in a wide range of practical applications. Its designers proved it to be fully functionally correct, ensuring the absence of buffer overflows, null pointer exceptions, use-after-free errors, etc., and guaranteeing integrity and confidentiality. The CompCert Verifying C Compiler maps source C programs to provably equivalent assembly language, ensuring the absence of exploitable bugs in the compiler. A number of factors have enabled this revolution, including faster processors, increased automation, more extensive infrastructure, specialized logics and the decision to co-develop code and correctness proofs rather than verify existing artefacts. In this paper, we explore the promise and limitations of current formal-methods techniques. We discuss these issues in the context of DARPA’s HACMS program, which had as its goal the creation of high-assurance software for vehicles, including quadcopters, helicopters and automobiles.             This article is part of the themed issue ‘Verified trustworthy software systems’.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/JF5DILLS/Fisher et al. - 2017 - The HACMS program using formal methods to elimina.pdf}
+}
+
+@inproceedings{fitzgeraldCyberPhysicalSystemsDesign2015,
+  title = {Cyber-{{Physical Systems Design}}: {{Formal Foundations}}, {{Methods}} and {{Integrated Tool Chains}}},
+  shorttitle = {Cyber-{{Physical Systems Design}}},
+  booktitle = {2015 {{IEEE}}/{{ACM}} 3rd {{FME Workshop}} on {{Formal Methods}} in {{Software Engineering}}},
+  author = {Fitzgerald, John and Gamble, Carl and Larsen, Peter Gorm and Pierce, Kenneth and Woodcock, Jim},
+  date = {2015-05},
+  pages = {40--46},
+  publisher = {IEEE},
+  location = {Florence, Italy},
+  doi = {10.1109/FormaliSE.2015.14},
+  url = {http://ieeexplore.ieee.org/document/7166696/},
+  urldate = {2023-10-10},
+  abstract = {The engineering of dependable cyber-physical systems (CPSs) is inherently collaborative, demanding cooperation between diverse disciplines. A goal of current research is the development of integrated tool chains for model-based CPS design that support co-modelling, analysis, co-simulation, testing and implementation. We discuss the role of formal methods in addressing three key aspects of this goal: providing reasoning support for semantically heterogeneous models, managing the complexity and scale of design space exploration, and supporting traceability and provenance in the CPS design set. We briefly outline an approach to the development of such a tool chain based on existing tools and discuss ongoing challenges and open research questions in this area.},
+  eventtitle = {2015 {{IEEE}}/{{ACM}} 3rd {{FME Workshop}} on {{Formal Methods}} in {{Software Engineering}} ({{FormaliSE}})},
+  isbn = {978-1-4673-7043-1},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/FWTMMHFV/Fitzgerald et al. - 2015 - Cyber-Physical Systems Design Formal Foundations,.pdf}
+}
+
+@online{five-worst,
+  title = {The Five Worst Cyberattacks against the Power Industry since 2014},
+  date = {2020-04-02T16:59:05+00:00},
+  url = {https://www.power-technology.com/features/the-five-worst-cyberattacks-against-the-power-industry-since2014/},
+  urldate = {2022-03-22},
+  abstract = {Power Technology investigates the five biggest cyberattacks to the power sector that took place in the last five years on a global scale.},
+  langid = {american},
+  organization = {Power Technology},
+  file = {/home/danesabo/Zotero/storage/A99ZAMAK/the-five-worst-cyberattacks-against-the-power-industry-since2014.html}
+}
+
+@article{fleischhackerRelationshipEntropyDemand2015,
+  title = {On the Relationship between Entropy, Demand Uncertainty, and Expected Loss},
+  author = {Fleischhacker, Adam J. and Fok, Pak-Wing},
+  date = {2015-09},
+  journaltitle = {European Journal of Operational Research},
+  shortjournal = {European Journal of Operational Research},
+  volume = {245},
+  number = {2},
+  pages = {623--628},
+  issn = {03772217},
+  doi = {10.1016/j.ejor.2015.03.014},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0377221715002076},
+  urldate = {2024-01-26},
+  abstract = {We analyze the effect of demand uncertainty, as measured by entropy, on expected costs in a stochastic inventory model. Existing models studying demand variability’s impact use either stochastic ordering techniques or use variance as a measure of uncertainty. Due to both axiomatic appeal and recent use of entropy in the operations management literature, this paper develops entropy’s use as a demand uncertainty measure. Our key contribution is an insightful proof quantifying how costs are non-increasing when entropy is reduced.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/VTLUY7XG/Fleischhacker and Fok - 2015 - On the relationship between entropy, demand uncert.pdf}
+}
+
+@article{foleyOperadsComplexSystem2021,
+  title = {Operads for Complex System Design Specification, Analysis and Synthesis},
+  author = {Foley, John D. and Breiner, Spencer and Subrahmanian, Eswaran and Dusel, John M.},
+  date = {2021-06-23},
+  journaltitle = {Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences},
+  volume = {477},
+  number = {2250},
+  pages = {20210099},
+  publisher = {Royal Society},
+  doi = {10.1098/rspa.2021.0099},
+  url = {https://royalsocietypublishing.org/doi/full/10.1098/rspa.2021.0099},
+  urldate = {2023-12-12},
+  abstract = {As the complexity and heterogeneity of a system grows, the challenge of specifying, documenting and synthesizing correct, machine-readable designs increases dramatically. Separation of the system into manageable parts is needed to support analysis at various levels of granularity so that the system is maintainable and adaptable over its life cycle. In this paper, we argue that operads provide an effective knowledge representation to address these challenges. Formal documentation of a syntactically correct design is built up during design synthesis, guided by semantic reasoning about design effectiveness. Throughout, the ability to decompose the system into parts and reconstitute the whole is maintained. We describe recent progress in effective modelling under this paradigm and directions for future work to systematically address scalability challenges for complex system design.},
+  keywords = {Important},
+  file = {/home/danesabo/Zotero/storage/TS9KYZJ6/Foley et al. - 2021 - Operads for complex system design specification, a.pdf}
+}
+
+@online{FormalMethods,
+  title = {Formal {{Methods}}},
+  url = {https://users.ece.cmu.edu/~koopman/des_s99/formal_methods/},
+  urldate = {2024-07-09}
+}
+
+@online{FormalMethodsa,
+  title = {Formal {{Methods}}},
+  url = {https://users.ece.cmu.edu/~koopman/des_s99/formal_methods/#:~:text=Formal%20methods%20are%20techniques%20used,thorough%20fashion%20than%20empirical%20testing.},
+  organization = {Formal Methods}
+}
+
+@online{FormalMethodsb,
+  title = {Formal {{Methods}}},
+  url = {https://users.ece.cmu.edu/~koopman/des_s99/formal_methods/},
+  urldate = {2024-02-13},
+  file = {/home/danesabo/Zotero/storage/2ZSBFVTQ/formal_methods.html}
+}
+
+@online{FormalMethodsSafetyCritical2023,
+  title = {Formal {{Methods}} for {{Safety-Critical Control}}},
+  date = {2023-10-26T12:11:26-04:00},
+  url = {https://lids.mit.edu/news-and-events/events/formal-methods-safety-critical-control},
+  urldate = {2024-07-09},
+  langid = {english},
+  organization = {MIT LIDS},
+  file = {/home/danesabo/Zotero/storage/38GH569T/formal-methods-safety-critical-control.html}
+}
+
+@unpublished{fradeCalculusInductiveConstructions2008,
+  title = {Calculus of {{Inductive Constructions}}:  {{Software Formal Verification}}},
+  author = {Frade, Maria João},
+  date = {2008/2009},
+  url = {https://web.archive.org/web/20140529103535/http://www3.di.uminho.pt/~mjf/pub/SFV-CIC-2up.pdf},
+  urldate = {2024-02-22},
+  file = {/home/danesabo/Zotero/storage/IUHSL2GV/2014 - Wayback Machine.pdf}
+}
+
+@article{frickerProbabilisticUncertaintyAnalysis2011,
+  title = {Probabilistic Uncertainty Analysis of an {{FRF}} of a Structure Using a {{Gaussian}} Process Emulator},
+  author = {Fricker, Thomas E. and Oakley, Jeremy E. and Sims, Neil D. and Worden, Keith},
+  date = {2011-11-01},
+  journaltitle = {Mechanical Systems and Signal Processing},
+  shortjournal = {Mechanical Systems and Signal Processing},
+  volume = {25},
+  number = {8},
+  pages = {2962--2975},
+  issn = {0888-3270},
+  doi = {10.1016/j.ymssp.2011.06.013},
+  url = {https://www.sciencedirect.com/science/article/pii/S0888327011002354},
+  urldate = {2022-04-21},
+  abstract = {This paper introduces methods for probabilistic uncertainty analysis of a frequency response function (FRF) of a structure obtained via a finite element (FE) model. The methods are applicable to computationally expensive FE models, making use of a Bayesian metamodel known as an emulator. The emulator produces fast predictions of the FE model output, but also accounts for the additional uncertainty induced by only having a limited number of model evaluations. Two approaches to the probabilistic uncertainty analysis of FRFs are developed. The first considers the uncertainty in the response at discrete frequencies, giving pointwise uncertainty intervals. The second considers the uncertainty in an entire FRF across a frequency range, giving an uncertainty envelope function. The methods are demonstrated and compared to alternative approaches in a practical case study.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/P3VYXIIP/Fricker et al. - 2011 - Probabilistic uncertainty analysis of an FRF of a .pdf;/home/danesabo/Zotero/storage/563LVUXA/S0888327011002354.html}
+}
+
+@article{frickTechnoeconomicAssessmentHydrogen2022,
+  title = {Technoeconomic Assessment of Hydrogen Cogeneration via High Temperature Steam Electrolysis with a Light-Water Reactor},
+  author = {Frick, Konor and Wendt, Daniel and Talbot, Paul and Rabiti, Cristian and Boardman, Richard},
+  date = {2022-01},
+  journaltitle = {Applied Energy},
+  shortjournal = {Applied Energy},
+  volume = {306},
+  pages = {118044},
+  issn = {03062619},
+  doi = {10.1016/j.apenergy.2021.118044},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0306261921013386},
+  urldate = {2022-03-30},
+  abstract = {Increased electricity production from renewable energy resources, coupled with low natural gas (NG) prices, has caused existing light-water reactors (LWRs) to experience diminishing returns from the electricity market. This reduction in revenue is forcing LWRs to consider alternative revenue streams, such as introduction hydrogen production or desalination, to remain profitable. This paper performs a technoeconomic assessment (TEA) regarding the viability of retrofitting existing pressurized-water reactors (PWRs) to produce green hydrogen (H2) via high-temperature steam electrolysis (HTSE). Such an integration would allow nuclear facilities to expand into additional markets that may be more profitable in the long term and eliminate CO2 emissions from the hydrogen production process. To accommodate such an integration, a detailed single market levelized cost of hydrogen (LCOH) and multimarket analyses were conducted of HTSE process operation, requirements, costing, and flex­ ibility. Alongside this costing analysis, market analyses were conducted on the electric and hydrogen markets in the PJM interconnect.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/IETRVMNW/Frick et al. - 2022 - Technoeconomic assessment of hydrogen cogeneration.pdf}
+}
+
+@book{friedmanLittleTyper2018,
+  title = {The {{Little Typer}}},
+  author = {Friedman, Daniel P. and Christiansen, David Thrane},
+  date = {2018},
+  publisher = {MIT Press},
+  isbn = {0-262-35100-5}
+}
+
+@inproceedings{fultonKeYmaeraAxiomaticTactical2015,
+  title = {{{KeYmaera~X}}: {{An Axiomatic Tactical Theorem Prover}} for {{Hybrid Systems}}},
+  shorttitle = {{{KeYmaera~X}}},
+  booktitle = {Automated {{Deduction}} - {{CADE-25}}},
+  author = {Fulton, Nathan and Mitsch, Stefan and Quesel, Jan-David and Völp, Marcus and Platzer, André},
+  editor = {Felty, Amy P. and Middeldorp, Aart},
+  date = {2015},
+  pages = {527--538},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-319-21401-6_36},
+  abstract = {KeYmaera~X is a theorem prover for differential dynamic logic (), a logic for specifying and verifying properties of hybrid systems. Reasoning about complicated hybrid systems models requires support for sophisticated proof techniques, efficient computation, and a user interface that crystallizes salient properties of the system. KeYmaera~X allows users to specify custom proof search techniques as tactics, execute these tactics in parallel, and interface with partial proofs via an extensible user interface.},
+  isbn = {978-3-319-21401-6},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/948LBZVA/Fulton et al. - 2015 - KeYmaera X An Axiomatic Tactical Theorem Prover f.pdf}
+}
+
+@article{furrerSafeSecureSystem2023,
+  title = {Safe and Secure System Architectures for Cyber-Physical Systems},
+  author = {Furrer, Frank J.},
+  date = {2023-04},
+  journaltitle = {Informatik Spektrum},
+  shortjournal = {Informatik Spektrum},
+  volume = {46},
+  number = {2},
+  pages = {96--103},
+  issn = {0170-6012, 1432-122X},
+  doi = {10.1007/s00287-023-01533-z},
+  url = {https://link.springer.com/10.1007/s00287-023-01533-z},
+  urldate = {2023-11-08},
+  abstract = {Cyber-physical systems are at the core of our current civilization. Countless examples dominate our daily life and work, such as driverless cars that will soon master our roads, implanted medical devices that will improve many lives, and industrial control systems that control production and infrastructure. Because cyber-physical systems manipulate the real world, they constitute a danger for many applications. Therefore, their safety and security are essential properties of these indispensable systems. The long history of systems engineering has demonstrated that the system quality properties—such as safety and security—strongly depend on the underlying system architecture. Satisfactory system quality properties can only be ensured if the fundamental system architecture is sound! The development of dependable cyber-physical architectures in recent years suggests that two harmonical architectures are required: a design-time architecture and a run-time architecture. The design-time architecture defines and specifies all parts and relationships, assuring the required system quality properties. However, in today’s complex systems, ensuring all quality properties in all operating conditions during design time will never be possible. Therefore, an additional line of defense against safety accidents and security incidents is indispensable: This must be provided by the run-time architecture. The run-time architecture primarily consists of a protective shell that monitors the run-time system during operation. It detects anomalies in system behavior, interface functioning, or data—often using artificial intelligence algorithms—and takes autonomous mitigation measures, thus attempting to prevent imminent safety accidents or security incidents before they occur. This paper’s core is the protective shell as a run-time protection mechanism for cyber-physical systems. The paper has the form of an introductory tutorial and includes focused references.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/7MHXAPX6/Furrer - 2023 - Safe and secure system architectures for cyber-phy.pdf}
+}
+
+@inproceedings{gaborSimulationBasedArchitectureSmart2016,
+  title = {A {{Simulation-Based Architecture}} for {{Smart Cyber-Physical Systems}}},
+  booktitle = {2016 {{IEEE International Conference}} on {{Autonomic Computing}} ({{ICAC}})},
+  author = {Gabor, Thomas and Belzner, Lenz and Kiermeier, Marie and Beck, Michael Till and Neitz, Alexander},
+  date = {2016-07},
+  pages = {374--379},
+  publisher = {IEEE},
+  location = {Wuerzburg, Germany},
+  doi = {10.1109/ICAC.2016.29},
+  url = {http://ieeexplore.ieee.org/document/7573168/},
+  urldate = {2023-10-11},
+  abstract = {In order to accurately predict future states of a smart cyber-physical system, which can change its behavior to a large degree in response to environmental influences, the existence of precise models of the system and its surroundings is demandable. In machine engineering, ultra-high fidelity simulations have been developed to better understand both constraints in system design and possible consequences of external influences during the system’s operation. These digital twins enable further applications in software design for complex cyberphysical systems as online planning methods can utilize good simulations to continuously optimize the system behavior, yielding a software architecture framework based on the information flow between the cyber-physical system, its physical environment and the digital twin model.},
+  eventtitle = {2016 {{IEEE International Conference}} on {{Autonomic Computing}} ({{ICAC}})},
+  isbn = {978-1-5090-1654-9},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/KKRR6XCH/Gabor et al. - 2016 - A Simulation-Based Architecture for Smart Cyber-Ph.pdf}
+}
+
+@article{gallierConstructiveLogicsPart1993,
+  title = {Constructive Logics {{Part I}}: {{A}} Tutorial on Proof Systems and Typed λ-Calculi},
+  shorttitle = {Constructive Logics {{Part I}}},
+  author = {Gallier, Jean},
+  date = {1993-03-29},
+  journaltitle = {Theoretical Computer Science},
+  shortjournal = {Theoretical Computer Science},
+  volume = {110},
+  number = {2},
+  pages = {249--339},
+  issn = {0304-3975},
+  doi = {10.1016/0304-3975(93)90011-H},
+  url = {https://www.sciencedirect.com/science/article/pii/030439759390011H},
+  urldate = {2024-02-21},
+  abstract = {The purpose of this paper is to give an exposition of material dealing with constructive logics, typed λ-calculi, and linear logic. The emergence in the past ten years of a coherent field of research often named “logic and computation” has had two major (and related) effects: firstly, it has rocked vigorously the world of mathematical logic; secondly, it has created a new computer science discipline, which spans a range of subjects from what is traditionally called the theory of computation, to programming language design. Remarkably, this new body of work relies heavily on some “old” concepts found in mathematical logic, like natural deduction, sequent calculus, and λ-calculus (but often viewed in a different light), and also on some newer concepts. Thus, it may be quite a challenge to become initiated to this new body of work (but the situation is improving, and there are now some excellent texts on this subject matter). This paper attempts to provide a coherent and hopefully “gentle” initiation to this new body of work. We have attempted to cover the basic material on natural deduction, sequent calculus, and typed λ-calculus, but also to provide an introduction to Girard's linear logic, one of the most exciting developments in logic these past six years. The first part of these notes gives an exposition of the background material (with some exceptions, such as “contraction-free” systems for intuitionistic propositional logic and the Girard translation of classical logic into intuitionistic logic, which is new). The second part is devoted to more current topics such as linear logic, proof nets, the geometry of interaction, and unified systems of logic (LU).},
+  file = {/home/danesabo/Zotero/storage/92VUR955/030439759390011H.html}
+}
+
+@inproceedings{gallois-wongCoqFormalizationDigital2018,
+  title = {A {{Coq Formalization}} of {{Digital Filters}}},
+  booktitle = {Intelligent {{Computer Mathematics}}},
+  author = {Gallois-Wong, Diane and Boldo, Sylvie and Hilaire, Thibault},
+  editor = {Rabe, Florian and Farmer, William M. and Passmore, Grant O. and Youssef, Abdou},
+  date = {2018},
+  series = {Lecture {{Notes}} in {{Computer Science}}},
+  pages = {87--103},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-319-96812-4_8},
+  abstract = {Digital filters are small iterative algorithms, used as basic bricks in signal processing (filters) and control theory (controllers). They receive as input a stream of values, and output another stream of values, computed from their internal state and from the previous inputs. These systems can be found in communication, aeronautics, automotive, robotics, etc. As the application domain may be critical, we aim at providing a formal guarantee of the good behavior of these algorithms in time-domain. In particular, we formally proved in Coq some error analysis theorems about digital filters, namely the Worst-Case Peak Gain theorem and the existence of a filter characterizing the difference between the exact filter and the implemented one. Moreover, the digital signal processing literature provides us with many equivalent algorithms, called realizations. We formally defined and proved the equivalence of several realizations (Direct Forms and State-Space).},
+  isbn = {978-3-319-96812-4},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/HWGP7DUB/Gallois-Wong et al. - 2018 - A Coq Formalization of Digital Filters.pdf}
+}
+
+@incollection{galvaoFormalVerificationFocused2019,
+  title = {Formal {{Verification}}: {{Focused}} on the {{Verification Using}} a {{Plant Model}}},
+  shorttitle = {Formal {{Verification}}},
+  booktitle = {Innovation, {{Engineering}} and {{Entrepreneurship}}},
+  author = {Galvão, Joel and Oliveira, Cedrico and Lopes, Helena and Tiainen, Laura},
+  editor = {Machado, José and Soares, Filomena and Veiga, Germano},
+  date = {2019},
+  volume = {505},
+  pages = {124--131},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-319-91334-6_18},
+  url = {http://link.springer.com/10.1007/978-3-319-91334-6_18},
+  urldate = {2023-10-10},
+  abstract = {The main goal of this paper is present a review and discussion about the option of using plant models in formal verification techniques. Relevant works in the field considering different approaches are reviewed and the importance of choosing the level of detail correctly is discussed. Although exists few works about this topic, the studies revealed the necessity and importance to consider the plant model in formal verification.},
+  isbn = {978-3-319-91333-9 978-3-319-91334-6},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/DY9V9YUI/Galvão et al. - 2019 - Formal Verification Focused on the Verification U.pdf}
+}
+
+@article{gaoCyberAttacksSignature2014,
+  title = {On {{Cyber Attacks}} and {{Signature Based Intrusion Detection}} for {{Modbus Based Industrial Control Systems}}},
+  author = {Gao, Wei and Morris, Thomas},
+  date = {2014-01-01},
+  journaltitle = {Journal of Digital Forensics, Security and Law},
+  volume = {9},
+  number = {1},
+  issn = {1558-7223},
+  doi = {10.15394/jdfsl.2014.1162},
+  url = {https://commons.erau.edu/jdfsl/vol9/iss1/3},
+  file = {/home/danesabo/Zotero/storage/YH7XVP5K/Gao and Morris - 2014 - On Cyber Attacks and Signature Based Intrusion Det.pdf;/home/danesabo/Zotero/storage/YX9PYKKB/3.html}
+}
+
+@online{gaoDeltaCompleteAnalysisBounded2014,
+  title = {Delta-{{Complete Analysis}} for {{Bounded Reachability}} of {{Hybrid Systems}}},
+  author = {Gao, Sicun and Kong, Soonho and Chen, Wei and Clarke, Edmund},
+  date = {2014-04-28},
+  eprint = {1404.7171},
+  eprinttype = {arXiv},
+  eprintclass = {cs},
+  url = {http://arxiv.org/abs/1404.7171},
+  urldate = {2023-11-02},
+  abstract = {We present the framework of δ-complete analysis for bounded reachability problems of general hybrid systems. We perform bounded reachability checking through solving δ-decision problems over the reals. The techniques take into account of robustness properties of the systems under numerical perturbations. We prove that the verification problems become much more mathematically tractable in this new framework. Our implementation of the techniques, an open-source tool dReach, scales well on several highly nonlinear hybrid system models that arise in biomedical and robotics applications.},
+  langid = {english},
+  pubstate = {prepublished},
+  file = {/home/danesabo/Zotero/storage/UY85DK5H/Gao et al. - 2014 - Delta-Complete Analysis for Bounded Reachability o.pdf}
+}
+
+@inproceedings{garciaHeyMyMalware2017,
+  title = {Hey, {{My Malware Knows Physics}}! {{Attacking PLCs}} with {{Physical Model Aware Rootkit}}.},
+  booktitle = {{{NDSS}}},
+  author = {Garcia, Luis and Brasser, Ferdinand and Cintuglu, Mehmet Hazar and Sadeghi, Ahmad-Reza and Mohammed, Osama A. and Zonouz, Saman A.},
+  date = {2017},
+  pages = {1--15},
+  file = {/home/danesabo/Zotero/storage/BMF5SJNX/Garcia et al. - 2017 - Hey, My Malware Knows Physics! Attacking PLCs with.pdf}
+}
+
+@inproceedings{garciaHyPLCHybridProgrammable2019,
+  title = {{{HyPLC}}: Hybrid Programmable Logic Controller Program Translation for Verification},
+  shorttitle = {{{HyPLC}}},
+  booktitle = {Proceedings of the 10th {{ACM}}/{{IEEE International Conference}} on {{Cyber-Physical Systems}}},
+  author = {Garcia, Luis and Mitsch, Stefan and Platzer, André},
+  date = {2019-04-16},
+  pages = {47--56},
+  publisher = {ACM},
+  location = {Montreal Quebec Canada},
+  doi = {10.1145/3302509.3311036},
+  url = {https://dl.acm.org/doi/10.1145/3302509.3311036},
+  urldate = {2023-10-10},
+  abstract = {Programmable Logic Controllers (PLCs) provide a prominent choice of implementation platform for safety-critical industrial control systems. Formal verification provides ways of establishing correctness guarantees, which can be quite important for such safety-critical applications. But since PLC code does not include an analytic model of the system plant, their verification is limited to discrete properties. In this paper, we, thus, start the other way around with hybrid programs that include continuous plant models in addition to discrete control algorithms. Correctness properties of hybrid programs can be formally verified in the theorem prover KeYmaera X that implements differential dynamic logic, dL, for hybrid programs. After verifying the hybrid program, we now present an approach for translating hybrid programs into PLC code. The new HyPLC tool implements this translation of discrete control code of verified hybrid program models to PLC controller code and, vice versa, the translation of existing PLC code into the discrete control actions for a hybrid program given an additional input of the continuous dynamics of the system to be verified. This approach allows for the generation of real controller code while preserving, by compilation, the correctness of a valid and verified hybrid program. PLCs are common cyber-physical interfaces for safety-critical industrial control applications, and HyPLC serves as a pragmatic tool for bridging formal verification of complex cyber-physical systems at the algorithmic level of hybrid programs with the execution layer of concrete PLC implementations.},
+  eventtitle = {{{ICCPS}} '19: {{ACM}}/{{IEEE}} 10th {{International Conference}} on {{Cyber-Physical Systems}}},
+  isbn = {978-1-4503-6285-6},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/ZI3JNAKD/Garcia et al. - 2019 - HyPLC hybrid programmable logic controller progra.pdf}
+}
+
+@report{garciaREGULATORYEFFORTSCYBER,
+  title = {U.{{S}}.{{A}}. {{REGULATORY EFFORTS FOR CYBER SECURITY OF ADVANCED REACTORS}}},
+  author = {Garcia, I and Jauntirans, J and Rowland, M},
+  abstract = {Small Modular Reactors / Advanced Reactors (SMR/ARs) are expected to provide safe, secure, and economical power that have the potential to support initiatives aimed at combating climate change. Current proposed SMR/ARs involve diverse technologies that include next generation modular pressurized water reactors, high temperature gas cooled reactors, molten salt reactors, and liquid metal cooled fast reactors. These diverse technologies each have a unique set of functions and systems that support both nuclear safety and security. To address these challenges, the U.S. Nuclear Regulatory Commission (NRC) is moving toward a risk informed, performance based and technology-neutral regulation and associated regulatory guides. The U.S. NRC, supported by cyber security experts from DOE national laboratories and U.S. universities, has undertaken efforts to develop a regulatory guide (RG), to provide an advanced reactor licensee with an acceptable approach for meeting the requirements of the proposed cyber security rule for advanced reactors, 10 CFR 73.110, “Technology neutral requirements for protection of digital computer and communication systems and networks.” The RG aims to provide a process that accounts for the differing risk levels within advanced reactor technologies while providing reasonable assurance of adequate protection of public health and safety and promoting the common defense and security and protecting the environment. As such, a key RG outcome will be to provide the licensee with a risk-informed approach that would allow for the design and implementation of a cyber security program to meet demands for protection against the unacceptable consequences from a cyber attack. The RG is expected to leverage both the outcomes of the safety and security analyses performed for the associated reactor design.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/T8QH76S6/Garcia et al. - U.S.A. REGULATORY EFFORTS FOR CYBER SECURITY OF AD.pdf}
+}
+
+@article{gawandSecuringCyberPhysical2017,
+  title = {Securing a {{Cyber Physical System}} in {{Nuclear Power Plants Using Least Square Approximation}} and {{Computational Geometric Approach}}},
+  author = {Gawand, Hemangi Laxman and Bhattacharjee, A.K. and Roy, Kallol},
+  date = {2017-04},
+  journaltitle = {Nuclear Engineering and Technology},
+  shortjournal = {Nuclear Engineering and Technology},
+  volume = {49},
+  number = {3},
+  pages = {484--494},
+  issn = {17385733},
+  doi = {10.1016/j.net.2016.10.009},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S1738573316302881},
+  urldate = {2022-09-30},
+  abstract = {In industrial plants such as nuclear power plants, system operations are performed by embedded controllers orchestrated by Supervisory Control and Data Acquisition (SCADA) software. A targeted attack (also termed a control aware attack) on the controller/SCADA software can lead a control system to operate in an unsafe mode or sometimes to complete shutdown of the plant. Such malware attacks can result in tremendous cost to the organization for recovery, cleanup, and maintenance activity. SCADA systems in operational mode generate huge log files. These files are useful in analysis of the plant behavior and diagnostics during an ongoing attack. However, they are bulky and difficult for manual inspection. Data mining techniques such as least squares approximation and computational methods can be used in the analysis of logs and to take proactive actions when required. This paper explores methodologies and algorithms so as to develop an effective monitoring scheme against control aware cyber attacks. It also explains soft computation techniques such as the computational geometric method and least squares approximation that can be effective in monitor design. This paper provides insights into diagnostic monitoring of its effectiveness by attack simulations on a four-tank model and using computation techniques to diagnose it. Cyber security of instrumentation and control systems used in nuclear power plants is of paramount importance and hence could be a possible target of such applications.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/KDTTK37C/Gawand et al. - 2017 - Securing a Cyber Physical System in Nuclear Power .pdf}
+}
+
+@misc{GE,
+  year = {date accessed 03/24/2022},
+  url = {https://www.ge.com/digital/applications/digital-twin}
+}
+
+@online{GenerativeModelingEstimating,
+  title = {Generative {{Modeling}} by {{Estimating Gradients}} of the {{Data Distribution}} | {{Yang Song}}},
+  url = {https://yang-song.net/blog/2021/score/},
+  urldate = {2024-02-28},
+  file = {/home/danesabo/Zotero/storage/LXHEU3GU/score.html}
+}
+
+@article{gentonClassesKernelsMachine2001,
+  title = {Classes of {{Kernels}} for {{Machine Learning}}: {{A Statistics Perspective}}},
+  shorttitle = {Classes of {{Kernels}} for {{Machine Learning}}},
+  author = {Genton, Marc G.},
+  date = {2001},
+  journaltitle = {Journal of Machine Learning Research},
+  volume = {2},
+  pages = {299--312},
+  issn = {ISSN 1533-7928},
+  url = {https://www.jmlr.org/papers/v2/genton01a},
+  urldate = {2022-04-28},
+  abstract = {In this paper, we present classes of kernels for machine learning from a statistics perspective. Indeed, kernels are positive definite functions and thus also covariances. After discussing key properties of kernels, as well as a new formula to construct kernels, we present several important classes of kernels: anisotropic stationary kernels, isotropic stationary kernels, compactly supported kernels, locally stationary kernels, nonstationary kernels, and separable nonstationary kernels. Compactly supported kernels and separable nonstationary kernels are of prime interest because they provide a computational reduction for kernel-based methods. We describe the spectral representation of the various classes of kernels and conclude with a discussion on the characterization of nonlinear maps that reduce nonstationary kernels to either stationarity or local stationarity.},
+  issue = {Dec},
+  file = {/home/danesabo/Zotero/storage/MYQDSLG7/Genton - 2001 - Classes of Kernels for Machine Learning A Statist.pdf}
+}
+
+@misc{geometry,
+  title = {Geometry {{Package}}},
+  file = {/home/danesabo/Zotero/storage/XZDPUFRF/geometry.pdf}
+}
+
+@online{GetAheadCyberattacks,
+  title = {Get {{Ahead}} of {{Cyberattacks}} with {{Digital Twins}} | {{Accenture}}},
+  url = {https://www.accenture.com/us-en/blogs/technology-innovation/klein-engelberg-get-ahead-of-cyberattacks-with-digital-twins},
+  urldate = {2022-04-02},
+  file = {/home/danesabo/Zotero/storage/4PY7F8J9/klein-engelberg-get-ahead-of-cyberattacks-with-digital-twins.html}
+}
+
+@unpublished{ghasemiBayesianApproachData2016,
+  title = {A {{Bayesian Approach}} to the {{Data Description Problem}}},
+  author = {Ghasemi, Alireza and Rabiee, Hamid R. and Manzuri, Mohammad T. and Rohban, M. H.},
+  date = {2016-02-24},
+  eprint = {1602.07507},
+  eprinttype = {arXiv},
+  eprintclass = {cs},
+  url = {http://arxiv.org/abs/1602.07507},
+  urldate = {2022-04-21},
+  abstract = {In this paper, we address the problem of data description using a Bayesian framework. The goal of data description is to draw a boundary around objects of a certain class of interest to discriminate that class from the rest of the feature space. Data description is also known as one-class learning and has a wide range of applications. The proposed approach uses a Bayesian framework to precisely compute the class boundary and therefore can utilize domain information in form of prior knowledge in the framework. It can also operate in the kernel space and therefore recognize arbitrary boundary shapes. Moreover, the proposed method can utilize unlabeled data in order to improve accuracy of discrimination.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/X8NRRRFN/Ghasemi et al. - 2016 - A Bayesian Approach to the Data Description Proble.pdf}
+}
+
+@incollection{gheorghiubobaruAutomatedAssumeGuaranteeReasoning2008,
+  title = {Automated {{Assume-Guarantee Reasoning}} by {{Abstraction Refinement}}},
+  booktitle = {Computer {{Aided Verification}}},
+  author = {Gheorghiu Bobaru, Mihaela and Păsăreanu, Corina S. and Giannakopoulou, Dimitra},
+  editor = {Gupta, Aarti and Malik, Sharad},
+  date = {2008},
+  volume = {5123},
+  pages = {135--148},
+  publisher = {Springer Berlin Heidelberg},
+  location = {Berlin, Heidelberg},
+  issn = {0302-9743, 1611-3349},
+  doi = {10.1007/978-3-540-70545-1_14},
+  url = {http://link.springer.com/10.1007/978-3-540-70545-1_14},
+  urldate = {2023-10-10},
+  isbn = {978-3-540-70543-7 978-3-540-70545-1},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/ULHBRVL6/Gheorghiu Bobaru et al. - 2008 - Automated Assume-Guarantee Reasoning by Abstractio.pdf}
+}
+
+@article{gibouReviewLevelsetMethods2018,
+  title = {A Review of Level-Set Methods and Some Recent Applications},
+  author = {Gibou, Frederic and Fedkiw, Ronald and Osher, Stanley},
+  date = {2018-01-15},
+  journaltitle = {Journal of Computational Physics},
+  shortjournal = {Journal of Computational Physics},
+  volume = {353},
+  pages = {82--109},
+  issn = {0021-9991},
+  doi = {10.1016/j.jcp.2017.10.006},
+  url = {https://www.sciencedirect.com/science/article/pii/S0021999117307441},
+  urldate = {2023-10-27},
+  abstract = {We review some of the recent advances in level-set methods and their applications. In particular, we discuss how to impose boundary conditions at irregular domains and free boundaries, as well as the extension of level-set methods to adaptive Cartesian grids and parallel architectures. Illustrative applications are taken from the physical and life sciences. Fast sweeping methods are briefly discussed.},
+  file = {/home/danesabo/Zotero/storage/8M6R3PJ9/Gibou et al. - 2018 - A review of level-set methods and some recent appl.pdf;/home/danesabo/Zotero/storage/478XA3J7/S0021999117307441.html}
+}
+
+@article{giraldoSecurityPrivacyCyberPhysical2017,
+  title = {Security and {{Privacy}} in {{Cyber-Physical Systems}}: {{A Survey}} of {{Surveys}}},
+  shorttitle = {Security and {{Privacy}} in {{Cyber-Physical Systems}}},
+  author = {Giraldo, Jairo and Sarkar, Esha and Cardenas, Alvaro A. and Maniatakos, Michail and Kantarcioglu, Murat},
+  date = {2017-08},
+  journaltitle = {IEEE Design \& Test},
+  volume = {34},
+  number = {4},
+  pages = {7--17},
+  issn = {2168-2364},
+  doi = {10.1109/MDAT.2017.2709310},
+  url = {https://ieeexplore.ieee.org/abstract/document/7935369?casa_token=MOko-Qoz5_sAAAAA:B7aBj7Fcy9X2COxaGpuLurum7X2JnNtLbzWtA-k__zag5Khe9ZoCV5E1klMpSZODmQjsKUM47w},
+  urldate = {2023-09-27},
+  abstract = {The following is a survey on surveys and may help the interested reader to find a way through the jungle of literature on the security and CPS topics out there already. In order to ease the search, the authors have provided a classification in CPS Domains, Attacks, Defenses, Research-trends, Network-security, Security level implementation, and Computational Strategies which makes this survey a unique and I believe very helpful article.},
+  eventtitle = {{{IEEE Design}} \& {{Test}}},
+  keywords = {survey},
+  file = {/home/danesabo/Zotero/storage/YGVXJWDR/Giraldo et al. - 2017 - Security and Privacy in Cyber-Physical Systems A .pdf}
+}
+
+@inproceedings{girardInvariantSetsAssumeGuarantee2022,
+  title = {Invariant {{Sets}} for {{Assume-Guarantee Contracts}}},
+  booktitle = {2022 {{IEEE}} 61st {{Conference}} on {{Decision}} and {{Control}} ({{CDC}})},
+  author = {Girard, Antoine and Iovine, Alessio and Benberkane, Sofiane},
+  date = {2022-12-06},
+  pages = {2190--2195},
+  publisher = {IEEE},
+  location = {Cancun, Mexico},
+  doi = {10.1109/CDC51059.2022.9993344},
+  url = {https://ieeexplore.ieee.org/document/9993344/},
+  urldate = {2023-11-08},
+  abstract = {Contract theory is a powerful tool to reason on systems that are interacting with an external environment, possibly made of other systems. Formally, a contract is usually given by assumptions and guarantees, which specify the expected behavior of the system (the guarantees) in a certain context (the assumptions). In this work, we present a verification framework for discrete-time dynamical systems with assume-guarantee contracts. We first introduce a class of assume-guarantee contracts with their satisfaction semantics parameterized by a time-horizon over which assumptions are evaluated. We then show that the problem of verifying whether such contracts are satisfied is equivalent to show the existence of a positive invariant set for an auxiliary system. This allows us to leverage the extensive literature on invariant set computation. A simple illustrative example is provided to show the effectiveness of our approach.},
+  eventtitle = {2022 {{IEEE}} 61st {{Conference}} on {{Decision}} and {{Control}} ({{CDC}})},
+  isbn = {978-1-66546-761-2},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/MYCDQVDI/Girard et al. - 2022 - Invariant Sets for Assume-Guarantee Contracts.pdf}
+}
+
+@incollection{girardReachabilityUncertainLinear2005,
+  title = {Reachability of {{Uncertain Linear Systems Using Zonotopes}}},
+  booktitle = {Hybrid {{Systems}}: {{Computation}} and {{Control}}},
+  author = {Girard, Antoine},
+  editor = {Morari, Manfred and Thiele, Lothar},
+  editora = {Hutchison, David and Kanade, Takeo and Kittler, Josef and Kleinberg, Jon M. and Mattern, Friedemann and Mitchell, John C. and Naor, Moni and Nierstrasz, Oscar and Pandu Rangan, C. and Steffen, Bernhard and Sudan, Madhu and Terzopoulos, Demetri and Tygar, Dough and Vardi, Moshe Y. and Weikum, Gerhard},
+  editoratype = {redactor},
+  date = {2005},
+  volume = {3414},
+  pages = {291--305},
+  publisher = {Springer Berlin Heidelberg},
+  location = {Berlin, Heidelberg},
+  doi = {10.1007/978-3-540-31954-2_19},
+  url = {http://link.springer.com/10.1007/978-3-540-31954-2_19},
+  urldate = {2023-11-01},
+  abstract = {We present a method for the computation of reachable sets of uncertain linear systems. The main innovation of the method consists in the use of zonotopes for reachable set representation. Zonotopes are special polytopes with several interesting properties : they can be encoded efficiently, they are closed under linear transformations and Minkowski sum. The resulting method has been used to treat several examples and has shown great performances for high dimensional systems. An extension of the method for the verification of piecewise linear hybrid systems is proposed.},
+  isbn = {978-3-540-25108-8 978-3-540-31954-2},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/DNBBFVL8/Girard - 2005 - Reachability of Uncertain Linear Systems Using Zon.pdf}
+}
+
+@article{giuaPetriNetsAutomatic2018,
+  title = {Petri Nets and {{Automatic Control}}: {{A}} Historical Perspective},
+  shorttitle = {Petri Nets and {{Automatic Control}}},
+  author = {Giua, Alessandro and Silva, Manuel},
+  date = {2018},
+  journaltitle = {Annual Reviews in Control},
+  shortjournal = {Annual Reviews in Control},
+  volume = {45},
+  pages = {223--239},
+  issn = {13675788},
+  doi = {10.1016/j.arcontrol.2018.04.006},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S1367578818300117},
+  urldate = {2024-02-15},
+  abstract = {The goal of this paper is to overview the historical development of the field of Petri nets (PNs) from a Systems Theory and Automatic Control perspective. It is intentionally not meant to be comprehensive: we limit ourselves to outline, through selected representative topics, some of the conceptual issues studied in the literature. In a first part we retrace the emergence of some basic net concepts to provide a broad view of the family of PN formalisms. Then we focus, more specifically, on the use of Petri nets within Automatic Control. Discrete net models have been considered since the middle of the 70s and starting since the late 80s have also been used for addressing classical problems, such as supervisory and deadlock control, state estimation, diagnosis, and so on. The double benefit is the ability to model a larger class of systems and to provide efficient algorithms for solving certain of those problems. We also discuss new approaches based on continuous and hybrid nets, which have been developed within the Automatic Control community.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/Z5WCCXJA/Giua and Silva - 2018 - Petri nets and Automatic Control A historical per.pdf}
+}
+
+@article{giuaPetriNetStructural1994,
+  title = {Petri Net Structural Analysis for Supervisory Control},
+  author = {Giua, A. and DiCesare, F.},
+  date = {1994-04},
+  journaltitle = {IEEE Transactions on Robotics and Automation},
+  volume = {10},
+  number = {2},
+  pages = {185--195},
+  issn = {2374-958X},
+  doi = {10.1109/70.282543},
+  url = {https://ieeexplore.ieee.org/abstract/document/282543?casa_token=mzh0ebl2u50AAAAA:e0mDsVZJxEI2G7I8y5eafMtGOpvXPFp6AkObg96NMVS4NOMN4HyuBombfMXntRYtqHIz7b_SeQ},
+  urldate = {2024-02-15},
+  abstract = {The primary motivation for this research is to show how Petri nets may be efficiently used within the framework of supervisory control. In particular, the paper discusses how integer programming techniques for Petri net models may be used to validate supervisors for the control of discrete event systems. We consider a class of place/transition nets, called elementary composed state machines. The reachability problem for this class can be solved by a modification of classical incidence matrix analysis. In fact it is possible to derive a set of linear inequalities that exactly defines the set of reachable markings. Finally, we show how important properties of discrete event systems, such as the absence of blocking states or controllability, may be analyzed by integer programming techniques.{$<>$}},
+  eventtitle = {{{IEEE Transactions}} on {{Robotics}} and {{Automation}}},
+  file = {/home/danesabo/Zotero/storage/7WNHYMKP/Giua and DiCesare - 1994 - Petri net structural analysis for supervisory cont.pdf}
+}
+
+@article{giuaSystemsTheoryView,
+  title = {A {{Systems Theory View}} of {{Petri Nets}}},
+  author = {Giua, Alessandro and Seatzu, Carla},
+  abstract = {Petri nets are a family of powerful discrete event models whose interest has grown, within the automatic control community, in parallel with the development of the theory of discrete event systems. In this tutorial paper our goal is that of giving a flavor, by means of simple examples, of the features that make Petri nets a good model for systems theory and of pointing out at a few open areas for research. We focus on Place/Transitions nets, the simplest Petri net model. In particular we compare Petri nets with automata, and show that the former model has several advantages over the latter, not only because it is more general but also because it offers a better structure that has been used for developing computationally efficient algorithms for analysis and synthesis.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/K8MQSQ7D/Giua and Seatzu - A Systems Theory View of Petri Nets.pdf}
+}
+
+@inproceedings{glaessgenDigitalTwinParadigm2012,
+  title = {The {{Digital Twin Paradigm}} for {{Future NASA}} and {{U}}.{{S}}. {{Air Force Vehicles}}},
+  booktitle = {53rd {{AIAA}}/{{ASME}}/{{ASCE}}/{{AHS}}/{{ASC Structures}}, {{Structural Dynamics}} and {{Materials Conference}}\&lt;{{BR}}\&gt;20th {{AIAA}}/{{ASME}}/{{AHS Adaptive Structures Conference}}\&lt;{{BR}}\&gt;14th {{AIAA}}},
+  author = {Glaessgen, Edward and Stargel, David},
+  date = {2012-04-23},
+  publisher = {{American Institute of Aeronautics and Astronautics}},
+  location = {Honolulu, Hawaii},
+  doi = {10.2514/6.2012-1818},
+  url = {http://arc.aiaa.org/doi/abs/10.2514/6.2012-1818},
+  urldate = {2023-10-11},
+  eventtitle = {53rd {{AIAA}}/{{ASME}}/{{ASCE}}/{{AHS}}/{{ASC Structures}}, {{Structural Dynamics}} and {{Materials Conference}}{$<$}{{BR}}{$>$}20th {{AIAA}}/{{ASME}}/{{AHS Adaptive Structures Conference}}{$<$}{{BR}}{$>$}14th {{AIAA}}},
+  isbn = {978-1-60086-937-2},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/RFVZYEB9/Glaessgen and Stargel - 2012 - The Digital Twin Paradigm for Future NASA and U.S..pdf}
+}
+
+@online{golovnevBrakedownLineartimeFieldagnostic2021,
+  title = {Brakedown: {{Linear-time}} and Field-Agnostic {{SNARKs}} for {{R1CS}}},
+  shorttitle = {Brakedown},
+  author = {Golovnev, Alexander and Lee, Jonathan and Setty, Srinath and Thaler, Justin and Wahby, Riad S.},
+  date = {2021},
+  number = {2021/1043},
+  url = {https://eprint.iacr.org/2021/1043},
+  urldate = {2024-04-01},
+  abstract = {This paper introduces Brakedown, the first built system that provides linear-time SNARKs for NP, meaning the prover incurs O(N) finite field operations to prove the satisfiability of an N-sized R1CS instance. Brakedown’s prover is faster, both concretely and asymptotically, than prior SNARK implementations. Brakedown does not require a trusted setup and is plausibly post-quantum secure. Furthermore, it is compatible with arbitrary finite fields of sufficient size; this property is new amongst implemented arguments with sublinear proof sizes. To design Brakedown, we observe that recent work of Bootle, Chiesa, and Groth (BCG, TCC 2020) provides a polynomial commitment scheme that, when combined with the linear-time interactive proof system of Spartan (CRYPTO 2020), yields linear-time IOPs and SNARKs for R1CS (a similar theoretical result was previously established by BCG, but our approach is conceptually simpler, and crucial for achieving high-speed SNARKs). A core ingredient in the polynomial commitment scheme that we distill from BCG is a linear-time encodable code. Existing constructions of such codes are believed to be impractical. Nonetheless, we design and engineer a new one that is practical in our context. We also implement a variant of Brakedown that uses Reed-Solomon codes instead of our linear-time encodable codes; we refer to this variant as Shockwave. Shockwave is not a linear-time SNARK, but it provides shorter proofs and lower verification times than Brakedown (it also provides a faster prover than prior plausibly post-quantum SNARKs).},
+  pubstate = {prepublished},
+  annotation = {Publication info: A minor revision of an IACR publication in CRYPTO 2023},
+  file = {/home/danesabo/Zotero/storage/HLCP25RW/Golovnev et al. - 2021 - Brakedown Linear-time and field-agnostic SNARKs f.pdf}
+}
+
+@inproceedings{goncalvesFormalVerificationAADL2017,
+  title = {Formal {{Verification}} of {{AADL Models Using UPPAAL}}},
+  booktitle = {2017 {{VII Brazilian Symposium}} on {{Computing Systems Engineering}} ({{SBESC}})},
+  author = {Goncalves, Fernando Silvano and Pereira, David and Tovar, Eduardo and Becker, Leandro Buss},
+  date = {2017-11},
+  pages = {117--124},
+  publisher = {IEEE},
+  location = {Curitiba},
+  doi = {10.1109/SBESC.2017.22},
+  url = {http://ieeexplore.ieee.org/document/8116568/},
+  urldate = {2023-10-10},
+  abstract = {Cyber-Physical Systems (CPS) are known to be highly complex systems which can be applied to a variety of different environments, covering both civil and military application domains. As CPS are typically complex systems, its design process requires strong guarantees that the specified functional and nonfunctional properties are satisfied on the designed application. Model-Driven Engineering (MDE) and high-level specification languages are a valuable asset to help the design and evaluation of such complex systems. However, when looking at the existing MDE tool-support, it is observed that there is still little support for the automated integration of formal verification techniques in these tools. Given that formal verification is necessary to ensure the levels of reliability required by safety critical CPS, this paper presents an approach that aims to integrate the Model Checking technique in the CPS design process for the purpose of correctly analyzing temporal and safety characteristics. A tool named ECPS Verifier was designed to support the model checking integration into the design process, providing the generation of timed automata models from high-levels specifications in AADL. The proposed method is illustrated by means of the design of an Unmanned Aerial Vehicle, from where we derive the timed automata models to be analyzed in the UPPAAL tool.},
+  eventtitle = {2017 {{VII Brazilian Symposium}} on {{Computing Systems Engineering}} ({{SBESC}})},
+  isbn = {978-1-5386-3590-2},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/KHXC8GUZ/Goncalves et al. - 2017 - Formal Verification of AADL Models Using UPPAAL.pdf}
+}
+
+@thesis{gonthierSmallScaleReflection2016,
+  type = {report},
+  title = {A {{Small Scale Reflection Extension}} for the {{Coq}} System},
+  author = {Gonthier, Georges and Mahboubi, Assia and Tassi, Enrico},
+  date = {2016},
+  institution = {Inria Saclay Ile de France},
+  url = {https://inria.hal.science/inria-00258384},
+  urldate = {2024-03-18},
+  abstract = {This is the user manual of Ssreflect, a set of extensions to the proof scripting language of the Coq proof assistant. While these extensions were developed to support a particular proof methodology - small-scale reflection - most of them actually are of a quite general nature, improving the functionality of Coq in basic areas such as script layout and structuring, proof context management, and rewriting. Consequently, and in spite of the title of this document, most of the extensions described here should be of interest for all Coq users, whether they embrace small-scale reflection or not.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/JX7Y48DY/Gonthier et al. - 2016 - A Small Scale Reflection Extension for the Coq sys.pdf}
+}
+
+@online{goodfellowGenerativeAdversarialNetworks2014,
+  title = {Generative {{Adversarial Networks}}},
+  author = {Goodfellow, Ian J. and Pouget-Abadie, Jean and Mirza, Mehdi and Xu, Bing and Warde-Farley, David and Ozair, Sherjil and Courville, Aaron and Bengio, Yoshua},
+  date = {2014-06-10},
+  eprint = {1406.2661},
+  eprinttype = {arXiv},
+  eprintclass = {cs, stat},
+  url = {http://arxiv.org/abs/1406.2661},
+  urldate = {2023-10-05},
+  abstract = {We propose a new framework for estimating generative models via an adversarial process, in which we simultaneously train two models: a generative model G that captures the data distribution, and a discriminative model D that estimates the probability that a sample came from the training data rather than G. The training procedure for G is to maximize the probability of D making a mistake. This framework corresponds to a minimax two-player game. In the space of arbitrary functions G and D, a unique solution exists, with G recovering the training data distribution and D equal to 1/2 everywhere. In the case where G and D are defined by multilayer perceptrons, the entire system can be trained with backpropagation. There is no need for any Markov chains or unrolled approximate inference networks during either training or generation of samples. Experiments demonstrate the potential of the framework through qualitative and quantitative evaluation of the generated samples.},
+  langid = {english},
+  pubstate = {prepublished},
+  file = {/home/danesabo/Zotero/storage/9DMPU6MU/Goodfellow et al. - 2014 - Generative Adversarial Networks.pdf}
+}
+
+@online{goodinHowVPNVulnerability2021,
+  title = {How a {{VPN}} Vulnerability Allowed Ransomware to Disrupt Two Manufacturing Plants},
+  author = {Goodin, Dan},
+  date = {2021-04-07},
+  url = {https://arstechnica.com/information-technology/2021/04/ransomware-shuts-down-production-at-two-manufacturing-plants/},
+  urldate = {2022-04-02},
+  abstract = {Patching in industrial settings is hard. Ransomware shutting down production is harder.},
+  langid = {american},
+  organization = {Ars Technica}
+}
+
+@article{goodmanStatisticalAnalysisBased1963,
+  title = {Statistical {{Analysis Based}} on a {{Certain Multivariate Complex Gaussian Distribution}} ({{An Introduction}})},
+  author = {Goodman, N. R.},
+  date = {1963-03},
+  journaltitle = {The Annals of Mathematical Statistics},
+  shortjournal = {Ann. Math. Statist.},
+  volume = {34},
+  number = {1},
+  pages = {152--177},
+  issn = {0003-4851},
+  doi = {10.1214/aoms/1177704250},
+  url = {http://projecteuclid.org/euclid.aoms/1177704250},
+  urldate = {2022-04-21},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/ZLIH62PD/Goodman - 1963 - Statistical Analysis Based on a Certain Multivaria.pdf}
+}
+
+@inproceedings{goubaultForwardInnerApproximatedReachability2017,
+  title = {Forward {{Inner-Approximated Reachability}} of {{Non-Linear Continuous Systems}}},
+  booktitle = {Proceedings of the 20th {{International Conference}} on {{Hybrid Systems}}: {{Computation}} and {{Control}}},
+  author = {Goubault, Eric and Putot, Sylvie},
+  date = {2017-04-13},
+  pages = {1--10},
+  publisher = {ACM},
+  location = {Pittsburgh Pennsylvania USA},
+  doi = {10.1145/3049797.3049811},
+  url = {https://dl.acm.org/doi/10.1145/3049797.3049811},
+  urldate = {2023-11-22},
+  eventtitle = {{{HSCC}} '17: 20th {{International Conference}} on {{Hybrid Systems}}: {{Computation}} and {{Control}}},
+  isbn = {978-1-4503-4590-3},
+  langid = {english}
+}
+
+@online{gouertArctyrEXAcceleratedEncrypted2023,
+  title = {{{ArctyrEX}} : {{Accelerated Encrypted Execution}} of {{General-Purpose Applications}}},
+  shorttitle = {{{ArctyrEX}}},
+  author = {Gouert, Charles and Joseph, Vinu and Dalton, Steven and Augonnet, Cedric and Garland, Michael and Tsoutsos, Nektarios Georgios},
+  date = {2023-06-19},
+  eprint = {2306.11006},
+  eprinttype = {arXiv},
+  eprintclass = {cs},
+  doi = {10.48550/arXiv.2306.11006},
+  url = {http://arxiv.org/abs/2306.11006},
+  urldate = {2023-12-06},
+  abstract = {Fully Homomorphic Encryption (FHE) is a cryptographic method that guarantees the privacy and security of user data during computation. FHE algorithms can perform unlimited arithmetic computations directly on encrypted data without decrypting it. Thus, even when processed by untrusted systems, confidential data is never exposed. In this work, we develop new techniques for accelerated encrypted execution and demonstrate the significant performance advantages of our approach. Our current focus is the Fully Homomorphic Encryption over the Torus (CGGI) scheme, which is a current state-of-the-art method for evaluating arbitrary functions in the encrypted domain. CGGI represents a computation as a graph of homomorphic logic gates and each individual bit of the plaintext is transformed into a polynomial in the encrypted domain. Arithmetic on such data becomes very expensive: operations on bits become operations on entire polynomials. Therefore, evaluating even relatively simple nonlinear functions, such as a sigmoid, can take thousands of seconds on a single CPU thread. Using our novel framework for end-to-end accelerated encrypted execution called ArctyrEX, developers with no knowledge of complex FHE libraries can simply describe their computation as a C program that is evaluated over \$40\textbackslash times\$ faster on an NVIDIA DGX A100 and \$6\textbackslash times\$ faster with a single A100 relative to a 256-threaded CPU baseline.},
+  pubstate = {prepublished},
+  file = {/home/danesabo/Zotero/storage/IVZRPKSN/Gouert et al. - 2023 - ArctyrEX  Accelerated Encrypted Execution of Gene.pdf;/home/danesabo/Zotero/storage/2NB92UVC/2306.html}
+}
+
+@online{GraduateCourseApplied,
+  title = {A {{Graduate Course}} in {{Applied Cryptography}}},
+  url = {https://toc.cryptobook.us/},
+  urldate = {2024-04-01},
+  file = {/home/danesabo/Zotero/storage/7TJMJH3J/toc.cryptobook.us.html}
+}
+
+@book{gramacySurrogatesGaussianProcess2020,
+  title = {Surrogates: {{Gaussian}} Process Modeling, Design, and Optimization for the Applied Sciences},
+  shorttitle = {Surrogates},
+  author = {Gramacy, Robert B.},
+  date = {2020},
+  publisher = {CRC Press, Taylor \& Francis Group},
+  location = {Boca Raton},
+  abstract = {"Surrogates: a graduate textbook, or professional handbook, on topics at the interface between machine learning, spatial statistics, computer simulation, meta-modeling (i.e., emulation), design of experiments, and optimization. Experimentation through simulation, "human out-of-the-loop" statistical support (focusing on the science), management of dynamic processes, online and real-time analysis, automation, and practical application are at the forefront. Topics include: Gaussian process (GP) regression for flexible nonparametric and nonlinear modeling. Applications to uncertainty quantification, sensitivity analysis, calibration of computer models to field data, sequential design/active learning and (blackbox/Bayesian) optimization under uncertainty. Advanced topics include treed partitioning, local GP approximation, modeling of simulation experiments (e.g., agent-based models) with coupled nonlinear mean and variance (heteroskedastic) models. Treatment appreciates historical response surface methodology (RSM) and canonical examples, but emphasizes contemporary methods and implementation in R at modern scale. Rmarkdown facilitates a fully reproducible tour, complete with motivation from, application to, and illustration with, compelling real-data examples. Presentation targets numerically competent practitioners in engineering, physical, and biological sciences. Writing is statistical in form, but the subjects are not about statistics. Rather, they're about prediction and synthesis under uncertainty; about visualization and information, design and decision making, computing and clean code"--},
+  isbn = {978-0-367-81549-3},
+  pagetotal = {1},
+  file = {/home/danesabo/Zotero/storage/949DZ8QM/surrogates.pdf}
+}
+
+@article{grandeAugmentedNeuralLyapunov2023,
+  title = {Augmented {{Neural Lyapunov Control}}},
+  author = {Grande, Davide and Peruffo, Andrea and Anderlini, Enrico and Salavasidis, Georgios},
+  date = {2023},
+  journaltitle = {IEEE Access},
+  volume = {11},
+  pages = {67979--67986},
+  issn = {2169-3536},
+  doi = {10.1109/ACCESS.2023.3291349},
+  url = {https://ieeexplore.ieee.org/document/10171339},
+  urldate = {2024-01-17},
+  abstract = {Machine learning-based methodologies have recently been adapted to solve control problems. The Neural Lyapunov Control (NLC) method is one such example. This approach combines Artificial Neural Networks (ANNs) with Satisfiability Modulo Theories (SMT) solvers to synthesise stabilising control laws and to prove their formal correctness. The ANNs are trained over a dataset of state-space samples to generate candidate control and Lyapunov functions, while the SMT solvers are tasked with certifying the correctness of the Lyapunov function over a continuous domain or by returning a counterexample. Despite the approach’s attractiveness, issues can occur due to subsequent calls of the SMT module at times returning similar counterexamples, which can turn out to be uninformative and may lead to dataset overfitting. Additionally, the control network weights are usually initialised with pre-computed gains from state-feedback controllers, e.g. Linear-Quadratic Regulators. To properly perform the initialisation requires user time and control expertise. In this work, we present an Augmented NLC method that mitigates these drawbacks, removes the need for the control initialisation and further improves counterexample generation. As a result, the proposed method allows the synthesis of nonlinear (as well as linear) control laws with the sole requirement being the knowledge of the system dynamics. The ANLC is tested over challenging benchmarks such as the Lorenz attractor and outperformed existing methods in terms of successful synthesis rate. The developed framework is released open-source at: https://github.com/grande-dev/Augmented-Neural-Lyapunov-Control.},
+  eventtitle = {{{IEEE Access}}},
+  file = {/home/danesabo/Zotero/storage/TMV4CJLY/Grande et al. - 2023 - Augmented Neural Lyapunov Control.pdf;/home/danesabo/Zotero/storage/N7RBAZGV/10171339.html}
+}
+
+@software{gratzerJozefgLearntt2024,
+  title = {Jozefg/Learn-Tt},
+  author = {{gratzer}, daniel},
+  date = {2024-01-21T08:30:44Z},
+  origdate = {2015-08-03T17:47:52Z},
+  url = {https://github.com/jozefg/learn-tt},
+  urldate = {2024-01-22},
+  abstract = {A collection of resources for learning type theory and type theory adjacent fields.},
+  note = {\begin{quotation}
+The paper on the calculus of constructions
+
+\end{quotation}}
+}
+
+@article{grayIndustryuniversityProjectsCenters1986,
+  title = {Industry-University Projects and Centers: {{An}} Empirical Comparison of Two Federally-Funded Models of Cooperative Science},
+  author = {Gray, D. O. and Johnson, E. C. and Gidley, T. R.},
+  date = {1986},
+  journaltitle = {Evaluation Review},
+  volume = {10},
+  pages = {776--793}
+}
+
+@misc{GRID-Institute,
+  author = {{GRID Institute}},
+  year = {Date accessed 11/2021},
+  url = {http://grid.pitt.edu/}
+}
+
+@thesis{grobelnaGroblena_masterPdf2019,
+  type = {mathesis},
+  title = {Groblena\_master.Pdf},
+  author = {Grobelna, Marta},
+  date = {2019-09-16},
+  institution = {RWTH Aachen University},
+  file = {/home/danesabo/Zotero/storage/CZQDVPRN/groblena_master.pdf}
+}
+
+@article{grochowskiAlgorithmicTransparencyExplainability2021,
+  title = {Algorithmic Transparency and Explainability for {{EU}} Consumer Protection: Unwrapping the Regulatory Premises},
+  author = {Grochowski, Mateusz and Jablonowska, Agnieszka and Lagioia, Francesca and Sartor, Giovanni},
+  date = {2021},
+  journaltitle = {Critical Analysis L.},
+  volume = {8},
+  pages = {43},
+  publisher = {HeinOnline},
+  file = {/home/danesabo/Zotero/storage/5X97WYVF/storage:storage:Algorithmic Transparency and
+Explainability for EU Consumer
+Protection: Unwrapping the
+Regulatory Premises.pdf}
+}
+
+@article{gronlundGronlundWritingInstructional2009,
+  title = {Gronlund's Writing Instructional Objectives},
+  author = {Gronlund, Norman Edward and Brookhart, Susan M.},
+  date = {2009},
+  journaltitle = {(No Title)}
+}
+
+@report{grossApplicationModelbasedFault1997,
+  title = {Application of a Model-Based Fault Detection System to Nuclear Plant Signals},
+  author = {Gross, K. C. and Singer, R. M. and Wegerich, S. W. and Herzog, J. P. and VanAlstine, R. and Bockhorst, F.},
+  date = {1997},
+  institution = {Argonne National Lab.(ANL), Argonne, IL (United States)},
+  file = {/home/danesabo/Zotero/storage/IEXQ4VSQ/Application of a Model-based Fault Detection System to Nuclear Plant Signals .pdf}
+}
+
+@article{guanDistributedAttackDetection2018,
+  title = {Distributed {{Attack Detection}} and {{Secure Estimation}} of {{Networked Cyber-Physical Systems Against False Data Injection Attacks}} and {{Jamming Attacks}}},
+  author = {Guan, Yanpeng and Ge, Xiaohua},
+  date = {2018-03},
+  journaltitle = {IEEE Transactions on Signal and Information Processing over Networks},
+  volume = {4},
+  number = {1},
+  pages = {48--59},
+  issn = {2373-776X},
+  doi = {10.1109/TSIPN.2017.2749959},
+  url = {https://ieeexplore.ieee.org/abstract/document/8027127?casa_token=rllSka8MB9EAAAAA:vYDGy1ij41XuemTklUypRHekLdb8acjX_43kZZK_vxStbIOULex18bLWs9nPGjECIzNIQOMosQ},
+  urldate = {2023-09-27},
+  abstract = {This paper is concerned with the problem of joint distributed attack detection and distributed secure estimation for a networked cyber-physical system under physical and cyber attacks. The system is monitored by a wireless sensor network, in which a group of sensors is spatially distributed and the sensors' measurements are broadcast to remote estimators via a wireless network medium. A malicious adversary simultaneously launches a false data injection attack at the physical system layer to intentionally modify the system's state and jamming attacks at the cyber layer to block the wireless transmission channels between sensors and remote estimators. The sensors' measurements can be randomly dropped with mathematical probability if the corresponding transmission channels are deliberately jammed by the adversary. Resilient attack detection estimators are delicately constructed to provide locally reliable state estimations and detect the false data injection attack. Then, criteria for analyzing the estimation performance and designing the desired estimators are derived to guarantee the solvability of the problem. Finally, the effectiveness of the proposed approach is shown through an illustrative example.},
+  eventtitle = {{{IEEE Transactions}} on {{Signal}} and {{Information Processing}} over {{Networks}}},
+  file = {/home/danesabo/Zotero/storage/RB4JBYIB/Guan and Ge - 2018 - Distributed Attack Detection and Secure Estimation.pdf}
+}
+
+@article{guanStabilityBasedControllerDesign2021,
+  title = {Stability-{{Based Controller Design}} of {{Cloud Control System With Uncertainties}}},
+  author = {Guan, Shouping and Niu, Senlin},
+  date = {2021},
+  journaltitle = {IEEE Access},
+  shortjournal = {IEEE Access},
+  volume = {9},
+  pages = {29056--29070},
+  issn = {2169-3536},
+  doi = {10.1109/ACCESS.2021.3059766},
+  url = {https://ieeexplore.ieee.org/document/9354804/},
+  urldate = {2022-09-30},
+  abstract = {A cloud control system (CCS) is inherently uncertain due to the dynamic services and resources in cloud computing. In this paper, an approach of modeling and controller design for CCS is proposed that considers the uncertainties existing in the controlled plant, network, and controller simultaneously; then, a general framework for modeling and controlling uncertain control systems is constructed. First, a typical CCS structure is presented, and the uncertainties in the CCS are analyzed and decomposed. On this basis, a generalized uncertain state-space model is established, which includes the interval controlled plant and the stochastic network, considering the time-delay and packet loss. Meanwhile, the cloud controller model with interval parameters and stochastic time-delay is designed, which includes the state observer and control law. Then, based on the Lyapunov stability theorem and the linear matrix inequality (LMI) method, a stability criterion for obtaining the parameters of the cloud controller is proposed, in which all the results are expressed in the form of the LMI. Finally, simulation results show the effectiveness and generalization performance of the designed cloud controller.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/EI4QKM6C/Guan and Niu - 2021 - Stability-Based Controller Design of Cloud Control.pdf}
+}
+
+@book{guckenheimerNonlinearOscillationsDynamical2013,
+  title = {Nonlinear Oscillations, Dynamical Systems, and Bifurcations of Vector Fields},
+  author = {Guckenheimer, John and Holmes, Philip},
+  date = {2013},
+  volume = {42},
+  publisher = {Springer Science \& Business Media},
+  isbn = {1-4612-1140-9}
+}
+
+@inproceedings{guFormalVerificationAutonomous2018,
+  title = {Formal Verification of an Autonomous Wheel Loader by Model Checking},
+  booktitle = {Proceedings of the 6th {{Conference}} on {{Formal Methods}} in {{Software Engineering}}},
+  author = {Gu, Rong and Marinescu, Raluca and Seceleanu, Cristina and Lundqvist, Kristina},
+  date = {2018-06-02},
+  pages = {74--83},
+  publisher = {ACM},
+  location = {Gothenburg Sweden},
+  doi = {10.1145/3193992.3193999},
+  url = {https://dl.acm.org/doi/10.1145/3193992.3193999},
+  urldate = {2023-10-10},
+  abstract = {In an attempt to increase productivity and the workers’ safety, the construction industry is moving towards autonomous construction sites, where various construction machines operate without human intervention. In order to perform their tasks autonomously, the machines are equipped with different features, such as position localization, human and obstacle detection, collision avoidance, etc. Such systems are safety critical, and should operate autonomously with very high dependability (e.g., by meeting task deadlines, avoiding (fatal) accidents at all costs, etc.). An Autonomous Wheel Loader is a machine that transports materials within the construction site without a human in the cab. To check the dependability of the loader, in this paper we provide a timed automata description of the vehicle’s control system, including the abstracted path planning and collision avoidance algorithms used to navigate the loader, and we model check the encoding in UPPAAL, against various functional, timing and safety requirements. The complex nature of the navigation algorithms makes the loader’s abstract modeling and the verification very challenging. Our work shows that exhaustive verification techniques can be applied early in the development of autonomous systems, to enable finding potential design errors that would incur increased costs if discovered later.},
+  eventtitle = {{{ICSE}} '18: 40th {{International Conference}} on {{Software Engineering}}},
+  isbn = {978-1-4503-5718-0},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/YQK398X2/Gu et al. - 2018 - Formal verification of an autonomous wheel loader .pdf}
+}
+
+@misc{Guide_to_the_Systems_Engineering_Body_of_KnowledgePdf,
+  title = {Guide\_to\_the\_{{Systems}}\_{{Engineering}}\_{{Body}}\_of\_{{Knowledge}}.Pdf},
+  file = {/home/danesabo/Zotero/storage/UD7HE99X/Guide_to_the_Systems_Engineering_Body_of_Knowledge.pdf}
+}
+
+@article{guoDetectionStealthyFalse2022,
+  title = {Detection of {{Stealthy False Data Injection Attacks Against Cyber-Physical Systems}}: {{A Stochastic Coding Scheme}}},
+  shorttitle = {Detection of {{Stealthy False Data Injection Attacks Against Cyber-Physical Systems}}},
+  author = {Guo, Haibin and Pang, Zhonghua and Sun, Jian and Li, Jun},
+  date = {2022-10-01},
+  journaltitle = {Journal of Systems Science and Complexity},
+  shortjournal = {J Syst Sci Complex},
+  volume = {35},
+  number = {5},
+  pages = {1668--1684},
+  issn = {1559-7067},
+  doi = {10.1007/s11424-022-1005-z},
+  url = {https://doi.org/10.1007/s11424-022-1005-z},
+  urldate = {2023-09-27},
+  abstract = {This paper, from the view of a defender, addresses the security problem of cyber-physical systems (CPSs) subject to stealthy false data injection (FDI) attacks that cannot be detected by a residual-based anomaly detector without other defensive measures. To detect such a class of FDI attacks, a stochastic coding scheme, which codes the sensor measurement with a Gaussian stochastic signal at the sensor side, is proposed to assist an anomaly detector to expose the FDI attack. In order to ensure the system performance in the normal operational context, a decoder is adopted to decode the coded sensor measurement when received at the controller side. With this detection scheme, the residual under the attack can be significantly different from that in the normal situation, and thus trigger an alarm. The design condition of the coding signal covariance is derived to meet the constraints of false alarm rate and attack detection rate. To minimize the trace of the coding signal covariance, the design problem of the coding signal is converted into a constraint non-convex optimization problem, and an estimation-optimization iteration algorithm is presented to obtain a numerical solution of the coding signal covariance. A numerical example is given to verify the effectiveness of the proposed scheme.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/LER95QRN/Guo et al. - 2022 - Detection of Stealthy False Data Injection Attacks.pdf}
+}
+
+@article{guoNewModelbasedApproach2014,
+  title = {A New Model-Based Approach for Power Plant {{Tube-ball}} Mill Condition Monitoring and Fault Detection},
+  author = {Guo, Shen and Wang, Jihong and Wei, Jianlin and Zachariades, Paschalis},
+  date = {2014-04},
+  journaltitle = {Energy Conversion and Management},
+  shortjournal = {Energy Conversion and Management},
+  volume = {80},
+  pages = {10--19},
+  issn = {01968904},
+  doi = {10.1016/j.enconman.2013.12.046},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0196890413008224},
+  urldate = {2023-10-11},
+  abstract = {With the fast growth in intermittent renewable power generation, unprecedented demands for power plant operation flexibility have posed new challenges to the ageing conventional power plants in the UK. Adding biomass to coal for co-fired power generation has become widely implemented practices in order to meet the emission regulation targets. These have impacted the coal mill and power plant operation safety and reliability. The Vertical Spindle mill model was developed through the authors’ work before 2007. From then, the new research progress has been made in modelling and condition monitoring for Tube-ball mills and is reported in the paper. A mathematical model for Tube-ball milling process is developed by applying engineering principles combined with model unknown parameter identifications using a computational intelligent algorithm. The model describes the whole milling process from the mill idle status, start-up to normal grinding and shut-down. The model is verified using on-site measurement data and on-line test. The on-line model is used for mill condition monitoring in two ways: (i) to compare the predicted and measured mill output pressure and temperatures and to raise alarms if there are big discrepancies; and (ii) to monitor the mill model parameter variation patterns which detect the potential faults and mill malfunctions.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/4HFL5VK6/Guo et al. - 2014 - A new model-based approach for power plant Tube-ba.pdf}
+}
+
+@online{HackerTriedPoison,
+  title = {A Hacker Tried to Poison the Water Supply in {{Oldsmar}}, {{Florida}}, Police Said - {{The Washington Post}}},
+  url = {https://www.washingtonpost.com/nation/2021/02/09/oldsmar-water-supply-hack-florida/},
+  urldate = {2022-04-02}
+}
+
+@online{HackExposesVulnerability,
+  title = {Hack Exposes Vulnerability of Cash-Strapped {{US}} Water Plants | {{AP News}}},
+  url = {https://apnews.com/article/business-water-utilities-florida-coronavirus-pandemic-utilities-e783b0f1ca2af02f19f5a308d44e6abb},
+  urldate = {2022-04-02},
+  file = {/home/danesabo/Zotero/storage/X7LUJZM7/business-water-utilities-florida-coronavirus-pandemic-utilities-e783b0f1ca2af02f19f5a308d44e6ab.html}
+}
+
+@online{HackExposesVulnerability2021,
+  title = {Hack Exposes Vulnerability of Cash-Strapped {{US}} Water Plants},
+  date = {2021-04-20T19:47:14Z},
+  url = {https://apnews.com/article/business-water-utilities-florida-coronavirus-pandemic-utilities-e783b0f1ca2af02f19f5a308d44e6abb},
+  urldate = {2022-04-02},
+  abstract = {ST. PETERSBURG, Fla. (AP) — A hacker’s botched attempt to poison the water supply of a small Florida city is raising alarms about just how vulnerable the nation's water systems may be to attacks by more sophisticated intruders...},
+  langid = {english},
+  organization = {AP NEWS}
+}
+
+@article{hadiControlCOVID19System2021,
+  title = {Control of {{COVID-19}} System Using a Novel Nonlinear Robust Control Algorithm},
+  author = {Hadi, Musadaq A. and Ali, Hazem I.},
+  date = {2021-02},
+  journaltitle = {Biomedical Signal Processing and Control},
+  shortjournal = {Biomedical Signal Processing and Control},
+  volume = {64},
+  pages = {102317},
+  issn = {17468094},
+  doi = {10.1016/j.bspc.2020.102317},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S1746809420304341},
+  urldate = {2024-05-20},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/7EMIZIQ2/Hadi and Ali - 2021 - Control of COVID-19 system using a novel nonlinear.pdf}
+}
+
+@article{hahnAUTOMATEDCYBERSECURITY,
+  title = {{{AUTOMATED CYBER SECURITY TESTING PLATFORM FOR INDUSTRIAL CONTROL SYSTEMS}}},
+  author = {Hahn, Andrew and Sandoval, Daniel R and Fasano, Raymond E and Lamb, Christopher},
+  abstract = {Nuclear Power Plants (NPPs) are a complex system of coupled physics controlled by a network of Programmable Logic Controllers (PLCs). These PLCs communicate process data across the network to coordinate control actions with each other and inform the operators of process variables and control decisions. Networking the PLCs allows more effective process control and provides the operator more information which results in more efficient plant operation. This interconnectivity creates new security issues, as operators have more access to the plant controls, so will bad actors.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/TDEZJ6BC/Hahn et al. - AUTOMATED CYBER SECURITY TESTING PLATFORM FOR INDU.pdf}
+}
+
+@online{hahnSMARTTOT_Emulation_Data_BrokerMain,
+  title = {{{SMARTT}}/{{OT}}\_{{Emulation}}\_{{Data}}\_{{Broker}} at Main · Sandialabs/{{SMARTT}}},
+  author = {Hahn, A S},
+  url = {https://github.com/sandialabs/SMARTT/tree/main/OT_Emulation_Data_Broker},
+  urldate = {2024-08-14},
+  file = {/home/danesabo/Zotero/storage/8VEH9M4J/OT_Emulation_Data_Broker.html}
+}
+
+@article{hailesellasieIntrusionDetectionPLCBased2018,
+  title = {Intrusion {{Detection}} in {{PLC-Based Industrial Control Systems Using Formal Verification Approach}} in {{Conjunction}} with {{Graphs}}},
+  author = {Hailesellasie, Muluken and Hasan, Syed Rafay},
+  date = {2018-03},
+  journaltitle = {Journal of Hardware and Systems Security},
+  shortjournal = {J Hardw Syst Secur},
+  volume = {2},
+  number = {1},
+  pages = {1--14},
+  issn = {2509-3428, 2509-3436},
+  doi = {10.1007/s41635-017-0017-y},
+  url = {http://link.springer.com/10.1007/s41635-017-0017-y},
+  urldate = {2023-10-10},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/M9EPIB2N/Hailesellasie and Hasan - 2018 - Intrusion Detection in PLC-Based Industrial Contro.pdf}
+}
+
+@report{hancockIncorporationThermalHydraulic2021,
+  title = {Incorporation of {{Thermal Hydraulic Models}} for {{Thermal Power Dispatch}} into a {{PWR Power Plant Simulator}}},
+  author = {Hancock, Stephen G. and Westover, Tyler L. and Luo, Yusheng},
+  date = {2021-07-31},
+  number = {INL/EXT-21-63226-Rev000},
+  institution = {Idaho National Lab. (INL), Idaho Falls, ID (United States)},
+  url = {https://www.osti.gov/biblio/1835110},
+  urldate = {2022-03-30},
+  abstract = {This report describes the development, modeling, and results of a generic pressurized water reactor power plant simulator that incorporates coupled electrical and thermal power dispatch to an industrial process located approximately one kilometer from the nuclear power plant. The simulator is a commercial PWR simulator that has been modified to include thermal power dispatch as described in past milestone reports [ , ]. The commercial PWR simulator is a generic simulator available from GSE SYSTEMS® (Sykesville, MD, USA) that is built using RELAP5-HDTM Real-Time Solution and in-house software developed by GSE Systems. This generic PWR (GPWR) simulator performs real-time simulation of the complete power plant from the reactor neutronics to the electricity generation and distribution. All primary, secondary, and auxiliary systems are modeled including all control logic in order to provide the most accurate representation of actual nuclear power plant (NPP) operation, and the simulator results have been rigorously verified by an actual NPP operating at approximately 1 GWe. This report is a continuation of worked performed in previous years, and supplemental information from previous reports is included in the appendix for reference.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/Q2CKD4KU/Hancock et al. - 2021 - Incorporation of Thermal Hydraulic Models for Ther.pdf;/home/danesabo/Zotero/storage/LWQI27R2/1835110.html}
+}
+
+@online{hanDeepLinkEquating2023,
+  title = {The {{Deep Link Equating Math Proofs}} and {{Computer Programs}}},
+  author = {Han, Sheon},
+  date = {2023-10-11T14:30+00:00},
+  url = {https://www.quantamagazine.org/the-deep-link-equating-math-proofs-and-computer-programs-20231011/},
+  urldate = {2024-01-28},
+  abstract = {Mathematical logic and the code of computer programs are, in an exact way, mirror images of each other.}
+}
+
+@inproceedings{harrisonConstructingCloudBasedIDS2012,
+  title = {Constructing a {{Cloud-Based IDS}} by {{Merging VMI}} with {{FMA}}},
+  booktitle = {2012 {{IEEE}} 11th {{International Conference}} on {{Trust}}, {{Security}} and {{Privacy}} in {{Computing}} and {{Communications}}},
+  author = {Harrison, Christopher and Cook, Devin and McGraw, Robert and Hamilton Jr., John A.},
+  date = {2012-06},
+  pages = {163--169},
+  issn = {2324-9013},
+  doi = {10.1109/TrustCom.2012.113},
+  url = {https://ieeexplore.ieee.org/abstract/document/6295971?casa_token=QsolkvO1g_AAAAAA:SonsQYxySS_Sn65nJ2R6k1IBzNQXmsqWhnWG6fr47VkZIZaYD6nE6_UxBllmtLP7BEpHbIihP4E},
+  urldate = {2023-10-25},
+  abstract = {Cloud computing has emerged in recent years as a major segment of the IT industry; however, security concerns remain the primary impediment to full-scale adoption. Leveraging properties of virtualization, virtual machine introspection (VMI) has yielded promising research for cloud security yet adoption of these approaches in production environments remains minimal due to a semantic gap: the extraction of high-level knowledge of the guest operating system's state from low-level artifacts collected out-of-VM. Within the field of forensic memory analysis (FMA), a similar semantic gap exists from the reconstruction of physical memory dumps. We implement a production oriented prototype utilizing designs that combines and narrows these semantic gaps in a modular framework to function as an intrusion detection system (IDS) detecting and defeating post-exploitation activity.},
+  eventtitle = {2012 {{IEEE}} 11th {{International Conference}} on {{Trust}}, {{Security}} and {{Privacy}} in {{Computing}} and {{Communications}}},
+  file = {/home/danesabo/Zotero/storage/GTVZD7X7/Harrison et al. - 2012 - Constructing a Cloud-Based IDS by Merging VMI with.pdf;/home/danesabo/Zotero/storage/VTB449XC/6295971.html}
+}
+
+@online{hartnettHackerProofCodeConfirmed2016,
+  title = {Hacker-{{Proof Code Confirmed}}},
+  author = {Hartnett, Kevin},
+  date = {2016-09-20T16:06+00:00},
+  url = {https://www.quantamagazine.org/formal-verification-creates-hacker-proof-code-20160920/},
+  urldate = {2024-01-28},
+  abstract = {Computer scientists can prove certain programs to be error-free with the same certainty that mathematicians prove theorems.}
+}
+
+@inproceedings{hartonas-garmhausenAutomaticVerificationIndustrial1995,
+  title = {Automatic Verification of Industrial Designs},
+  booktitle = {Proceedings of 1995 {{IEEE Workshop}} on {{Industrial-Strength Formal Specification Techniques}}},
+  author = {Hartonas-Garmhausen, V. and Kurfess, T. and Clarke, E.M. and Long, D.},
+  date = {1995},
+  pages = {88--96},
+  publisher = {IEEE Comput. Soc. Press},
+  location = {Boca Raton, FL, USA},
+  doi = {10.1109/WIFT.1995.515481},
+  url = {http://ieeexplore.ieee.org/document/515481/},
+  urldate = {2023-11-08},
+  eventtitle = {1995 {{IEEE Workshop}} on {{Industrial-Strength Formal Specification Techniques}}},
+  isbn = {978-0-8186-7005-3}
+}
+
+@inproceedings{haspalamutgilAdaptiveSwitchingMethod2017,
+  title = {Adaptive Switching Method for {{Adaptive Cruise Control}}},
+  booktitle = {2017 21st {{International Conference}} on {{System Theory}}, {{Control}} and {{Computing}} ({{ICSTCC}})},
+  author = {Haspalamutgıl, Kadir and Adali, Erkan},
+  date = {2017-10},
+  pages = {140--145},
+  doi = {10.1109/ICSTCC.2017.8107024},
+  url = {https://ieeexplore.ieee.org/abstract/document/8107024?casa_token=GCbUxFFrhDUAAAAA:JfMiJhBzXxVfq4N_RsCHdnGSyMHKux4ZovytCx9BfEycz4bQe5BvdfZQcq9syGy3lVpk28NV2Q},
+  urldate = {2023-11-20},
+  abstract = {We present an Adaptive Cruise Control (ACC) architecture which is focused on solving repetitive switching issues between two modes of ACC, speed control and distance control. A cascaded controller structure has been used. First controller (upper) includes two modes: a speed controller (PI) and a distance controller (time-gap). Outputs of these controllers are acceleration reference signals. The second controller (lower) is responsible of providing the desired acceleration by controlling throttle. The switching problem occurs in most algorithms between two modes of the upper controller. In the proposed method, additional to the normal switching logic which is checking the distance with the leading vehicle, a set of logical comparisons have been used to prevent repetitive mode changing at the exact desired distance.},
+  eventtitle = {2017 21st {{International Conference}} on {{System Theory}}, {{Control}} and {{Computing}} ({{ICSTCC}})},
+  file = {/home/danesabo/Zotero/storage/CN2BHTK4/Haspalamutgıl and Adali - 2017 - Adaptive switching method for Adaptive Cruise Cont.pdf;/home/danesabo/Zotero/storage/349JHJEW/8107024.html}
+}
+
+@book{hastieElementsStatisticalLearning2009,
+  title = {The {{Elements}} of {{Statistical Learning Data Mining}}, {{Inference}}, and {{Prediction}}, {{Second Edition}}},
+  author = {Hastie, Trevor},
+  namea = {Tibshirani, Robert and Friedman, Jerome},
+  nameatype = {collaborator},
+  date = {2009},
+  series = {Springer {{Series}} in {{Statistics}}},
+  edition = {2nd ed. 2009.},
+  publisher = {Springer New York},
+  location = {New York, NY},
+  doi = {10.1007/978-0-387-84858-7},
+  abstract = {During the past decade there has been an explosion in computation and information technology. With it have come vast amounts of data in a variety of fields such as medicine, biology, finance, and marketing. The challenge of understanding these data has led to the development of new tools in the field of statistics, and spawned new areas such as data mining, machine learning, and bioinformatics. Many of these tools have common underpinnings but are often expressed with different terminology. This book describes the important ideas in these areas in a common conceptual framework. While the approach is statistical, the emphasis is on concepts rather than mathematics. Many examples are given, with a liberal use of color graphics. It is~a valuable resource for statisticians and anyone interested in data mining in science or industry. The book's coverage is broad, from supervised learning (prediction) to unsupervised learning. The many topics include neural networks, support vector machines, classification trees and boosting---the first comprehensive treatment of this topic in any book. This major new edition features many topics not covered in the original, including graphical models, random forests, ensemble methods, least angle regression and path algorithms for the lasso, non-negative matrix factorization, and spectral clustering. There is also a chapter on methods for ``wide'' data (p bigger than n), including multiple testing and false discovery rates. Trevor Hastie, Robert Tibshirani, and Jerome Friedman are professors of statistics at Stanford University. They are prominent researchers in this area: Hastie and Tibshirani developed generalized additive models and wrote a popular book of that title. Hastie co-developed much of the statistical modeling software and environment in R/S-PLUS and invented principal curves and surfaces. Tibshirani proposed the lasso and is co-author of the very successful An Introduction to the Bootstrap. Friedman is the co-inventor of many data-mining tools including CART, MARS, projection pursuit and gradient boosting.},
+  isbn = {978-0-387-84858-7},
+  langid = {english},
+  pagetotal = {757},
+  file = {/home/danesabo/Zotero/storage/AFAY94R6/Hastie - 2009 - The Elements of Statistical Learning Data Mining, .pdf}
+}
+
+@article{hatcherListRecommendedBooks,
+  title = {A {{List}} of {{Recommended Books}} in {{Topology}}},
+  author = {Hatcher, Allen},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/58724NMS/Hatcher - A List of Recommended Books in Topology.pdf}
+}
+
+@article{hauksdottirProvingRouthTheorem2020,
+  title = {Proving {{Routh}}’s {{Theorem}} Using the {{Euclidean Algorithm}} and {{Cauchy}}’s {{Theorem}}⁎},
+  author = {Hauksdóttir, Anna Soffía and Sigurðsson, Sven Þ.},
+  date = {2020-01-01},
+  journaltitle = {IFAC-PapersOnLine},
+  shortjournal = {IFAC-PapersOnLine},
+  series = {21st {{IFAC World Congress}}},
+  volume = {53},
+  number = {2},
+  pages = {4460--4467},
+  issn = {2405-8963},
+  doi = {10.1016/j.ifacol.2020.12.446},
+  url = {https://www.sciencedirect.com/science/article/pii/S2405896320307370},
+  urldate = {2024-03-04},
+  abstract = {This paper presents a proof of Routh’s theorem for polynomials with real coefficients, determining the number of roots in the right half plane (RHP). The proof exploits the relationship of the Routh array to the Euclidean algorithm and applies Cauchy’s theorem in an analogous way to that of applying the Nyquist criterion to investigate the stability of a control system. While a number of papers have been published over the years with different proofs of Routh’s stability criterion or Routh’s theorem, the aim in this paper is to present a proof that may offer most insight to undergraduate students of engineering. Routh’s theorem and his array are introduced without any proof in most undergraduate texts on control theory, whereas the Nyquist criterion is typically treated quite extensively in such texts. As well as presenting a proof for the regular case when all the coefficients in the first column of the Routh array are non-zero, analogous proofs are given for the singular cases when some of the leading coefficients in a row, or the coefficients of the entire row, become zero. In the first case, these result in a statement on the number of roots in the RHP, more explicit than those typically presented in papers on Routh’s theorem. In the second case, the only case where there may be roots on the imaginary axis, use is made of the modified array introduced by Routh, often referred to as the Q-method, to determine the number of such roots, differentiating between simple and multiple roots. One can thus distinguish between exponential stability, marginal stability and polynomial instability, when there are no roots in the RHP, with these results.},
+  file = {/home/danesabo/Zotero/storage/M97ZF4UF/S2405896320307370.html}
+}
+
+@article{heDatadrivenDigitalTwin2019,
+  title = {Data-Driven Digital Twin Technology for Optimized Control in Process Systems},
+  author = {He, Rui and Chen, Guoming and Dong, Che and Sun, Shufeng and Shen, Xiaoyu},
+  date = {2019-12},
+  journaltitle = {ISA Transactions},
+  shortjournal = {ISA Transactions},
+  volume = {95},
+  pages = {221--234},
+  issn = {00190578},
+  doi = {10.1016/j.isatra.2019.05.011},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0019057819302332},
+  urldate = {2023-10-11},
+  abstract = {Due to the installation of various apparatus in process industries, both factors of complex structures and severe operating conditions could result in higher accident frequencies and maintenance challenges. Given the importance of security in process systems, this paper presents a data-driven digital twin system for automatic process applications by integrating virtual modeling, process monitoring, diagnosis, and optimized control into a cooperative architecture. For unknown model parameters, the adaptive system identification is proposed to model closed-loop virtual systems and residual signals with fault-free case data. Performance indices are improved to make the design of robust monitoring and diagnosis system to identify the apparatus status. Soft-sensor, parameterization control, and model-matching reconfiguration are ameliorated and incorporated into the optimized control configuration to guarantee stable and safe control performance under apparatus faults. The effectiveness and performance of the proposed digital twin system are evaluated by using different simulations on the Tennessee Eastman benchmark process in the presence of realistic fault scenarios. © 2019 Published by Elsevier Ltd on behalf of ISA.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/9WU6QA6X/He et al. - 2019 - Data-driven digital twin technology for optimized .pdf}
+}
+
+@book{hehenbergerMechatronicFutures2016,
+  title = {Mechatronic {{Futures}}},
+  editor = {Hehenberger, Peter and Bradley, David},
+  date = {2016},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-319-32156-1},
+  url = {http://link.springer.com/10.1007/978-3-319-32156-1},
+  urldate = {2023-10-11},
+  isbn = {978-3-319-32154-7 978-3-319-32156-1},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/Z9VARVAQ/Hehenberger and Bradley - 2016 - Mechatronic Futures.pdf}
+}
+
+@article{heiserSeL4MicrokernelIntroduction,
+  title = {The {{seL4 Microkernel}} – {{An Introduction}}},
+  author = {Heiser, Gernot},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/4YPNWHUT/Heiser - The seL4 Microkernel – An Introduction.pdf}
+}
+
+@inproceedings{herencia-zapanaPVSLinearAlgebra2012,
+  title = {{{PVS Linear Algebra Libraries}} for {{Verification}} of {{Control Software Algorithms}} in {{C}}/{{ACSL}}},
+  booktitle = {{{NASA Formal Methods}}},
+  author = {Herencia-Zapana, Heber and Jobredeaux, Romain and Owre, Sam and Garoche, Pierre-Loïc and Feron, Eric and Perez, Gilberto and Ascariz, Pablo},
+  editor = {Goodloe, Alwyn E. and Person, Suzette},
+  date = {2012},
+  pages = {147--161},
+  publisher = {Springer},
+  location = {Berlin, Heidelberg},
+  doi = {10.1007/978-3-642-28891-3_15},
+  abstract = {The problem of ensuring control software properties hold on their actual implementation is rarely tackled. While stability proofs are widely used on models, they are never carried to the code. Using program verification techniques requires express these properties at the level of the code but also to have theorem provers that can manipulate the proof elements. We propose to address this challenge by following two phases: first we introduce a way to express stability proofs as C code annotations; second, we propose a PVS linear algebra library that is able to manipulate quadratic invariants, i.e., ellipsoids. Our framework achieves the translation of stability properties expressed on the code to the representation of an associated proof obligation (PO) in PVS. Our library allows us to discharge these POs within PVS.},
+  isbn = {978-3-642-28891-3},
+  langid = {english},
+  keywords = {Important},
+  file = {/home/danesabo/Zotero/storage/X93GMM59/Herencia-Zapana et al. - 2012 - PVS Linear Algebra Libraries for Verification of C.pdf}
+}
+
+@inproceedings{herlockerExplainingCollaborativeFiltering2000,
+  title = {Explaining Collaborative Filtering Recommendations},
+  booktitle = {Proceedings of the 2000 {{ACM}} Conference on {{Computer}} Supported Cooperative Work},
+  author = {Herlocker, Jonathan L. and Konstan, Joseph A. and Riedl, John},
+  date = {2000-12},
+  pages = {241--250},
+  publisher = {ACM},
+  location = {Philadelphia Pennsylvania USA},
+  doi = {10.1145/358916.358995},
+  url = {https://dl.acm.org/doi/10.1145/358916.358995},
+  urldate = {2023-10-11},
+  abstract = {Automated collaborative filtering (ACF) systems predict a person’s affinity for items or information by connecting that person’s recorded interests with the recorded interests of a community of people and sharing ratings between likeminded persons. However, current recommender systems are black boxes, providing no transparency into the working of the recommendation. Explanations provide that transparency, exposing the reasoning and data behind a recommendation. In this paper, we address explanation interfaces for ACF systems – how they should be implemented and why they should be implemented. To explore how, we present a model for explanations based on the user’s conceptual model of the recommendation process. We then present experimental results demonstrating what components of an explanation are the most compelling. To address why, we present experimental evidence that shows that providing explanations can improve the acceptance of ACF systems. We also describe some initial explorations into measuring how explanations can improve the filtering performance of users.},
+  eventtitle = {{{CSCW00}}: {{Computer Supported Cooperative Work}}},
+  isbn = {978-1-58113-222-9},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/LW84M7GS/Herlocker et al. - 2000 - Explaining collaborative filtering recommendations.pdf}
+}
+
+@article{hermansaSensorBasedPredictiveMaintenance2021,
+  title = {Sensor-{{Based Predictive Maintenance}} with {{Reduction}} of {{False Alarms}}—{{A Case Study}} in {{Heavy Industry}}},
+  author = {Hermansa, Marek and Kozielski, Michał and Michalak, Marcin and Szczyrba, Krzysztof and Wróbel, Łukasz and Sikora, Marek},
+  date = {2021-12-29},
+  journaltitle = {Sensors},
+  shortjournal = {Sensors},
+  volume = {22},
+  number = {1},
+  pages = {226},
+  issn = {1424-8220},
+  doi = {10.3390/s22010226},
+  url = {https://www.mdpi.com/1424-8220/22/1/226},
+  urldate = {2023-10-11},
+  abstract = {In this paper, the problem of the identification of undesirable events is discussed. Such events can be poorly represented in the historical data, and it is predominantly impossible to learn from past examples. The discussed issue is considered in the work in the context of two use cases in which vibration and temperature measurements collected by wireless sensors are analysed. These use cases include crushers at a coal-fired power plant and gantries in a steelworks converter. The awareness, resulting from the cooperation with industry, of the need for a system that works in cold start conditions and does not flood the machine operator with alarms was the motivation for proposing a new predictive maintenance method. The proposed solution is based on the methods of outlier identification. These methods are applied to the collected data that was transformed into a multidimensional feature vector. The novelty of the proposed solution stems from the creation of a methodology for the reduction of false positive alarms, which was applied to a system identifying undesirable events. This methodology is based on the adaptation of the system to the analysed data, the interaction with the dispatcher, and the use of the XAI (eXplainable Artificial Intelligence) method. The experiments performed on several data sets showed that the proposed method reduced false alarms by 90.25\% on average in relation to the performance of the stand-alone outlier detection method. The obtained results allowed for the implementation of the developed method to a system operating in a real industrial facility. The conducted research may be valuable for systems with a cold start problem where frequent alarms can lead to discouragement and disregard for the system by the user.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/C475KNYD/Hermansa et al. - 2021 - Sensor-Based Predictive Maintenance with Reduction.pdf}
+}
+
+@article{hespanhaHybridControlSwitched,
+  title = {Hybrid {{Control}} and {{Switched Systems}}},
+  author = {Hespanha, João P},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/XAEA8D7P/Hespanha - Hybrid Control and Switched Systems.pdf}
+}
+
+@inproceedings{heunenConvenientCategoryHigherOrder2017,
+  title = {A {{Convenient Category}} for {{Higher-Order Probability Theory}}},
+  booktitle = {2017 32nd {{Annual ACM}}/{{IEEE Symposium}} on {{Logic}} in {{Computer Science}} ({{LICS}})},
+  author = {Heunen, Chris and Kammar, Ohad and Staton, Sam and Yang, Hongseok},
+  date = {2017-06},
+  eprint = {1701.02547},
+  eprinttype = {arXiv},
+  eprintclass = {cs, math},
+  pages = {1--12},
+  doi = {10.1109/LICS.2017.8005137},
+  url = {http://arxiv.org/abs/1701.02547},
+  urldate = {2024-04-21},
+  abstract = {Higher-order probabilistic programming languages allow programmers to write sophisticated models in machine learning and statistics in a succinct and structured way, but step outside the standard measure-theoretic formalization of probability theory. Programs may use both higher-order functions and continuous distributions, or even define a probability distribution on functions. But standard probability theory does not handle higher-order functions well: the category of measurable spaces is not cartesian closed. Here we introduce quasi-Borel spaces. We show that these spaces: form a new formalization of probability theory replacing measurable spaces; form a cartesian closed category and so support higher-order functions; form a well-pointed category and so support good proof principles for equational reasoning; and support continuous probability distributions. We demonstrate the use of quasi-Borel spaces for higher-order functions and probability by: showing that a well-known construction of probability theory involving random functions gains a cleaner expression; and generalizing de Finetti's theorem, that is a crucial theorem in probability theory, to quasi-Borel spaces.},
+  file = {/home/danesabo/Zotero/storage/2YZFDBEG/Heunen et al. - 2017 - A Convenient Category for Higher-Order Probability.pdf;/home/danesabo/Zotero/storage/2LH7WEX8/1701.html}
+}
+
+@incollection{hincheyIntroductionFormalMethods2006,
+  title = {Introduction to {{Formal Methods}}},
+  booktitle = {Agent {{Technology}} from a {{Formal Perspective}}},
+  author = {Hinchey, Michael and Bowen, Jonathan P. and Rouff, Christopher A.},
+  editor = {Rouff, Christopher A. and Hinchey, Michael and Rash, James and Truszkowski, Walter and Gordon-Spears, Diana},
+  date = {2006},
+  pages = {25--64},
+  publisher = {Springer-Verlag},
+  location = {London},
+  doi = {10.1007/1-84628-271-3_2},
+  url = {http://link.springer.com/10.1007/1-84628-271-3_2},
+  urldate = {2024-07-09},
+  isbn = {978-1-85233-947-0},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/894UYUYD/Hinchey et al. - 2006 - Introduction to Formal Methods.pdf}
+}
+
+@book{hindleyLambdacalculusCombinatorsIntroduction2008,
+  title = {Lambda-Calculus and Combinators: An Introduction},
+  author = {Hindley, J. Roger and Seldin, Jonathan P.},
+  date = {2008},
+  publisher = {Cambridge University Press},
+  isbn = {1-139-47324-7}
+}
+
+@inreference{HoareLogic2023,
+  title = {Hoare Logic},
+  booktitle = {Wikipedia},
+  date = {2023-11-08T17:12:08Z},
+  url = {https://en.wikipedia.org/w/index.php?title=Hoare_logic&oldid=1184150662},
+  urldate = {2024-01-28},
+  abstract = {Hoare logic (also known as Floyd–Hoare logic or Hoare rules) is a formal system with a set of logical rules for reasoning rigorously about the correctness of computer programs. It was proposed in 1969 by the British computer scientist and logician Tony Hoare, and subsequently refined by Hoare and other researchers. The original ideas were seeded by the work of Robert W. Floyd, who had published a similar system for flowcharts.},
+  annotation = {Page Version ID: 1184150662}
+}
+
+@online{hoCascadedDiffusionModels2021,
+  title = {Cascaded {{Diffusion Models}} for {{High Fidelity Image Generation}}},
+  author = {Ho, Jonathan and Saharia, Chitwan and Chan, William and Fleet, David J. and Norouzi, Mohammad and Salimans, Tim},
+  date = {2021-12-17},
+  eprint = {2106.15282},
+  eprinttype = {arXiv},
+  eprintclass = {cs},
+  doi = {10.48550/arXiv.2106.15282},
+  url = {http://arxiv.org/abs/2106.15282},
+  urldate = {2023-10-05},
+  abstract = {We show that cascaded diffusion models are capable of generating high fidelity images on the class-conditional ImageNet generation benchmark, without any assistance from auxiliary image classifiers to boost sample quality. A cascaded diffusion model comprises a pipeline of multiple diffusion models that generate images of increasing resolution, beginning with a standard diffusion model at the lowest resolution, followed by one or more super-resolution diffusion models that successively upsample the image and add higher resolution details. We find that the sample quality of a cascading pipeline relies crucially on conditioning augmentation, our proposed method of data augmentation of the lower resolution conditioning inputs to the super-resolution models. Our experiments show that conditioning augmentation prevents compounding error during sampling in a cascaded model, helping us to train cascading pipelines achieving FID scores of 1.48 at 64x64, 3.52 at 128x128 and 4.88 at 256x256 resolutions, outperforming BigGAN-deep, and classification accuracy scores of 63.02\% (top-1) and 84.06\% (top-5) at 256x256, outperforming VQ-VAE-2.},
+  pubstate = {prepublished},
+  file = {/home/danesabo/Zotero/storage/KDKJ8J9B/Ho et al. - 2021 - Cascaded Diffusion Models for High Fidelity Image .pdf;/home/danesabo/Zotero/storage/KEELK7DP/2106.html}
+}
+
+@online{hoClassifierFreeDiffusionGuidance2022,
+  title = {Classifier-{{Free Diffusion Guidance}}},
+  author = {Ho, Jonathan and Salimans, Tim},
+  date = {2022-07-25},
+  eprint = {2207.12598},
+  eprinttype = {arXiv},
+  eprintclass = {cs},
+  doi = {10.48550/arXiv.2207.12598},
+  url = {http://arxiv.org/abs/2207.12598},
+  urldate = {2023-10-05},
+  abstract = {Classifier guidance is a recently introduced method to trade off mode coverage and sample fidelity in conditional diffusion models post training, in the same spirit as low temperature sampling or truncation in other types of generative models. Classifier guidance combines the score estimate of a diffusion model with the gradient of an image classifier and thereby requires training an image classifier separate from the diffusion model. It also raises the question of whether guidance can be performed without a classifier. We show that guidance can be indeed performed by a pure generative model without such a classifier: in what we call classifier-free guidance, we jointly train a conditional and an unconditional diffusion model, and we combine the resulting conditional and unconditional score estimates to attain a trade-off between sample quality and diversity similar to that obtained using classifier guidance.},
+  pubstate = {prepublished},
+  note = {Comment: A short version of this paper appeared in the NeurIPS 2021 Workshop on Deep Generative Models and Downstream Applications: https://openreview.net/pdf?id=qw8AKxfYbI},
+  file = {/home/danesabo/Zotero/storage/JECHSQTT/Ho and Salimans - 2022 - Classifier-Free Diffusion Guidance.pdf;/home/danesabo/Zotero/storage/VM4L2IMX/2207.html}
+}
+
+@online{hoDenoisingDiffusionProbabilistic2020,
+  title = {Denoising {{Diffusion Probabilistic Models}}},
+  author = {Ho, Jonathan and Jain, Ajay and Abbeel, Pieter},
+  date = {2020-12-16},
+  eprint = {2006.11239},
+  eprinttype = {arXiv},
+  eprintclass = {cs, stat},
+  doi = {10.48550/arXiv.2006.11239},
+  url = {http://arxiv.org/abs/2006.11239},
+  urldate = {2023-10-05},
+  abstract = {We present high quality image synthesis results using diffusion probabilistic models, a class of latent variable models inspired by considerations from nonequilibrium thermodynamics. Our best results are obtained by training on a weighted variational bound designed according to a novel connection between diffusion probabilistic models and denoising score matching with Langevin dynamics, and our models naturally admit a progressive lossy decompression scheme that can be interpreted as a generalization of autoregressive decoding. On the unconditional CIFAR10 dataset, we obtain an Inception score of 9.46 and a state-of-the-art FID score of 3.17. On 256x256 LSUN, we obtain sample quality similar to ProgressiveGAN. Our implementation is available at https://github.com/hojonathanho/diffusion},
+  pubstate = {prepublished},
+  file = {/home/danesabo/Zotero/storage/RFFVZQ88/Ho et al. - 2020 - Denoising Diffusion Probabilistic Models.pdf;/home/danesabo/Zotero/storage/MMSGEYTW/2006.html}
+}
+
+@article{hoElementaryDerivationRouthHurwitz1998,
+  title = {An Elementary Derivation of the {{Routh-Hurwitz}} Criterion},
+  author = {Ho, Ming-Tzu and Datta, A. and Bhattacharyya, S.P.},
+  date = {1998-03},
+  journaltitle = {IEEE Transactions on Automatic Control},
+  volume = {43},
+  number = {3},
+  pages = {405--409},
+  issn = {1558-2523},
+  doi = {10.1109/9.661607},
+  url = {https://ieeexplore.ieee.org/abstract/document/661607?casa_token=_ZTBBI78ASQAAAAA:bq5jusXOvFviT0kmkuMYTAYJQ0uAqdkmDTMjnEo03Q7KVhhp7azmgSqzIFK2r5bTMuIQNTTifg},
+  urldate = {2024-03-04},
+  abstract = {In most undergraduate texts on control systems, the Routh-Hurwitz criterion is usually introduced as a mechanical algorithm for determining the Hurwitz stability of a real polynomial. Unlike many other stability criteria, such as the Nyquist criterion, root locus, etc., no attempt whatsoever is made to even allude to a proof of the Routh-Hurwitz criterion. Recent results using the Hermite-Biehler theorem have, however, succeeded in providing a simple derivation of Routh's algorithm for determining the Hurwitz stability or otherwise of a given real polynomial. However, this derivation fails to capture the fact that Routh's algorithm can also be used to count the number of open right half-plane roots of a given polynomial. This paper shows that by using appropriately generalized versions of the Hermite-Biehler theorem, it is possible to provide a simple derivation of the Routh-Hurwitz criterion which also captures its unstable root counting capability.},
+  eventtitle = {{{IEEE Transactions}} on {{Automatic Control}}},
+  file = {/home/danesabo/Zotero/storage/LXDFETQM/Ho et al. - 1998 - An elementary derivation of the Routh-Hurwitz crit.pdf;/home/danesabo/Zotero/storage/2NANUARD/661607.html}
+}
+
+@article{hoelldoblerInnovationsModelbasedSoftware2019,
+  title = {Innovations in {{Model-based Software And Systems Engineering}}},
+  author = {Hoelldobler, Katrin and Michael, Judith and Ringert, Jan Oliver and Rumpe, Bernhard and Wortmann, Andreas},
+  date = {2019-03},
+  journaltitle = {JOURNAL OF OBJECT TECHNOLOGY},
+  shortjournal = {J. Object Technol.},
+  volume = {18},
+  number = {1},
+  publisher = {Journal Object Technology},
+  location = {Zurich},
+  issn = {1660-1769},
+  doi = {10.5381/jot.2019.18.1.r1},
+  url = {https://www.webofscience.com/wos/woscc/summary/563bee91-8c90-4554-ae8d-46c3ce0028ee-a808dfa0/relevance/1},
+  urldate = {2023-10-03},
+  abstract = {Engineering software and software intensive systems has become increasingly complex over the last decades. In the ongoing digitalization of all aspects of our lives in almost every domain, including, e.g., mechanical engineering, electrical engineering, medicine, entertainment, or jurisdiction, software is not only used to enable low-level controls of machines, but also to understand system conditions and optimizations potentials. To remain in control of all these heterogeneous systems of systems, a precise, but abstract understanding of these systems is necessary. To this end, models in their various forms are an important prerequisite to gain this understanding. In this article, we summarize research activities focusing on the development and use of models in software and systems engineering. This research has been carried out by the working group of Bernhard Rumpe, which started 25 years ago in Munich, continued in Braunschweig, and since 10 years carries on at RWTH Aachen University.},
+  langid = {english},
+  pagetotal = {60},
+  annotation = {Web of Science ID: WOS:000473335400001},
+  file = {/home/danesabo/Zotero/storage/XKNKBTGT/Hoelldobler et al. - 2019 - Innovations in Model-based Software And Systems En.pdf}
+}
+
+@inproceedings{hosseinzadehActiveAttackDetection2021,
+  title = {Active {{Attack Detection}} and {{Control}} in {{Constrained Cyber-Physical Systems Under Prevented Actuation Attack}}},
+  booktitle = {2021 {{American Control Conference}} ({{ACC}})},
+  author = {Hosseinzadeh, Mehdi and Sinopoli, Bruno},
+  date = {2021-05},
+  pages = {3242--3247},
+  issn = {2378-5861},
+  doi = {10.23919/ACC50511.2021.9483322},
+  url = {https://ieeexplore.ieee.org/abstract/document/9483322?casa_token=etSNFI1RR-UAAAAA:LRARzvbUxXqEaWa7yA7CCYYeeOeo-a6bYbasgkN7hW_KG23z08aFlAHos33wMuccwrqkfmOX9g},
+  urldate = {2023-09-27},
+  abstract = {This paper proposes an active attack detection scheme for constrained cyber-physical systems. Despite passive approaches where the detection is based on the analysis of the input-output data, active approaches interact with the system by designing the control input so to improve detection. This paper focuses on the prevented actuation attack, where the attacker prevents the exchange of information between the controller and actuators. The proposed scheme consists of two units: 1) detection, and 2) control. The detection unit includes a set of parallel detectors, which are designed based on the multiple-model adaptive estimation approach to detect the attack and to identify the attacked actuator(s). For what regards the control unit, a constrained optimization approach is developed to determine the control input such that the control and detection aims are achieved. In the formulation of the detection and control objective functions, a probabilistic approach is used to reap the benefits of the a priori information availability. The effectiveness of the proposed scheme is demonstrated through a simulation study on an irrigation channel.},
+  eventtitle = {2021 {{American Control Conference}} ({{ACC}})},
+  keywords = {detection},
+  file = {/home/danesabo/Zotero/storage/YJ5PJ47W/Hosseinzadeh and Sinopoli - 2021 - Active Attack Detection and Control in Constrained.pdf}
+}
+
+@book{hristu-varsakelisHandbookNetworkedEmbedded2005,
+  title = {Handbook of Networked and Embedded Control Systems},
+  author = {Hristu-Varsakelis, Dimitrios and Levine, William S.},
+  date = {2005},
+  series = {Control Engineering},
+  publisher = {Birkhäuser},
+  location = {Boston},
+  isbn = {978-0-8176-3239-7},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/482BIYI7/Hristu-Varsakelis and Levine - 2005 - Handbook of networked and embedded control systems.pdf}
+}
+
+@book{hsuCelltocellMappingMethod2013,
+  title = {Cell-to-Cell Mapping: A Method of Global Analysis for Nonlinear Systems},
+  author = {Hsu, Chieh Su},
+  date = {2013},
+  volume = {64},
+  publisher = {Springer Science \& Business Media},
+  isbn = {1-4757-3892-7}
+}
+
+@online{HttpsEnergySandia,
+  title = {{{https://energy.sandia.gov/wp-content/uploads/2024/01/Maccarone\_DCSA-FY23-M2.pdf}}},
+  url = {https://energy.sandia.gov/wp-content/uploads/2024/01/Maccarone_DCSA-FY23-M2.pdf},
+  urldate = {2024-08-08}
+}
+
+@online{HttpsWwwWhitehouse,
+  title = {{{https://www.whitehouse.gov/wp-content/uploads/2024/02/Final-ONCD-Technical-Report.pdf}}},
+  url = {https://www.whitehouse.gov/wp-content/uploads/2024/02/Final-ONCD-Technical-Report.pdf},
+  urldate = {2024-08-14}
+}
+
+@online{HttpsWwwWhitehousea,
+  title = {{{https://www.whitehouse.gov/wp-content/uploads/2024/02/Final-ONCD-Technical-Report.pdf}}},
+  url = {https://www.whitehouse.gov/wp-content/uploads/2024/02/Final-ONCD-Technical-Report.pdf},
+  urldate = {2024-08-14}
+}
+
+@article{huangCyberphysicalSystemSecurity2015,
+  title = {Cyber-Physical System Security for Networked Industrial Processes},
+  author = {Huang, Shuang and Zhou, Chun-Jie and Yang, Shuang-Hua and Qin, Yuan-Qing},
+  date = {2015-12},
+  journaltitle = {International Journal of Automation and Computing},
+  shortjournal = {Int. J. Autom. Comput.},
+  volume = {12},
+  number = {6},
+  pages = {567--578},
+  issn = {1476-8186, 1751-8520},
+  doi = {10.1007/s11633-015-0923-9},
+  url = {http://link.springer.com/10.1007/s11633-015-0923-9},
+  urldate = {2022-09-30},
+  abstract = {Cyber-physical systems (CPSs) are integrations of networks, computation and physical processes, where embedded computing devices continually sense, monitor, and control the physical processes through networks. Networked industrial processes combining internet, real-time computer control systems and industrial processes together are typical CPSs. With the increasingly frequent cyber-attack, security issues have gradually become key problems for CPSs. In this paper, a cyber-physical system security protection approach for networked industrial processes, i.e., industrial CPSs, is proposed. In this approach, attacks are handled layer by layer from general information technology (IT) security protection, to active protection, then to intrusion tolerance and physical security protection. The intrusion tolerance implemented in real-time control systems is the most critical layer because the real time control system directly affects the physical layer. This novel intrusion tolerance scheme with a closed loop defense framework takes into account the special requirements of industrial CPSs. To illustrate the effectiveness of the CPS security protection approach, a networked water level control system is described as a case study in the architecture analysis and design language (AADL) environment. Simulation results show that 3 types of injected attacks can be quickly defended by using the proposed protection approach.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/24PZINTV/Huang et al. - 2015 - Cyber-physical system security for networked indus.pdf}
+}
+
+@article{huangFuzzyModelPredictive2000,
+  title = {Fuzzy Model Predictive Control},
+  author = {Huang, Y.L. and Lou, H.H. and Gong, J.P. and Edgar, T.F.},
+  date = {2000-12},
+  journaltitle = {IEEE Transactions on Fuzzy Systems},
+  volume = {8},
+  number = {6},
+  pages = {665--678},
+  issn = {1941-0034},
+  doi = {10.1109/91.890326},
+  url = {https://ieeexplore.ieee.org/abstract/document/890326},
+  urldate = {2024-07-10},
+  abstract = {A fuzzy model predictive control (FMPC) approach is introduced to design a control system for a highly nonlinear process. In this approach, a process system is described by a fuzzy convolution model that consists of a number of quasi-linear fuzzy implications. In controller design, prediction errors and control energy are minimized through a two-layered iterative optimization process. At the lower layer, optimal local control policies are identified to minimize prediction errors in each subsystem. A near optimum is then identified through coordinating the subsystems to reach an overall minimum prediction error at the upper layer. The two-layered computing scheme avoids extensive online nonlinear optimization and permits the design of a controller based on linear control theory. The efficacy of the FMPC approach is demonstrated through three examples.},
+  eventtitle = {{{IEEE Transactions}} on {{Fuzzy Systems}}},
+  keywords = {Control system synthesis,Convolution,Design optimization,Error correction,Fuzzy control,Fuzzy systems,Nonlinear control systems,Optimal control,Predictive control,Predictive models},
+  file = {/home/danesabo/Zotero/storage/VGID38NW/Huang et al. - 2000 - Fuzzy model predictive control.pdf}
+}
+
+@article{hudakOverviewAADLToolsets2021,
+  title = {An {{Overview}} of {{AADL}} and {{Toolsets}} to {{Support}} the {{Engineering}} of {{Safety-critical Systems}}},
+  author = {Hudak, John and Hugues, Jerome},
+  date = {2021},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/I5QBFXMS/Hudak and Hugues - 2021 - An Overview of AADL and Toolsets to Support the En.pdf}
+}
+
+@misc{huetInductionPrinciplesFormalized2015,
+  title = {Induction {{Principles Formalized}} in the {{Calculus}} of {{Constructions}}},
+  author = {Huet, Gérard},
+  date = {2015-07-01},
+  url = {https://web.archive.org/web/20150701130220/http://yquem.inria.fr/~huet/PUBLIC/induction.pdf},
+  urldate = {2024-02-22},
+  file = {/home/danesabo/Zotero/storage/AZYNMTNW/2015 - Wayback Machine.pdf}
+}
+
+@book{huetLogicalFoundationsFunctional1990,
+  title = {Logical Foundations of Functional Programming},
+  author = {family=Huet, given=Gérard., given-i={{Gérard}}},
+  date = {1990},
+  series = {The {{UT}} Year of Programming Series},
+  publisher = {Addison-Wesley},
+  location = {Reading, Mass},
+  isbn = {0-201-17234-8},
+  keywords = {Functional programming (Computer science)},
+  note = {Includes bibliographical references.}
+}
+
+@article{huffModelbasedSystemsEngineering2019,
+  title = {A Model-Based Systems Engineering Approach to Critical Infrastructure Vulnerability Assessment and Decision Analysis},
+  author = {Huff, Johnathon and Medal, Hugh and Griendling, Kelly},
+  date = {2019-03},
+  journaltitle = {SYSTEMS ENGINEERING},
+  shortjournal = {Syst. Eng.},
+  volume = {22},
+  number = {2},
+  pages = {114--133},
+  publisher = {Wiley},
+  location = {Hoboken},
+  issn = {1098-1241, 1520-6858},
+  doi = {10.1002/sys.21460},
+  url = {https://www.webofscience.com/wos/woscc/summary/563bee91-8c90-4554-ae8d-46c3ce0028ee-a808dfa0/relevance/3},
+  urldate = {2023-10-03},
+  abstract = {Securing critical infrastructure against attack presents significant challenges. As new infrastructure is built and existing infrastructure is maintained, a method to assess the vulnerabilities and support decision makers in determining the best use of security resources is needed. In response to this need, this research develops a methodology for performing vulnerability assessment and decision analysis of critical infrastructure using model-based systems engineering, an approach that has not been applied to this problem. The approach presented allows architects to link regulatory requirements, system architecture, subject matter expert opinion and attack vectors to a Department of Defense Architecture Framework (DoDAF)-based model that allows decision makers to evaluate system vulnerability and determine alternatives to securing their systems based on their budget constraints. The decision analysis is done using an integer linear program that is integrated with DoDAF to provide solutions for how to allocate scarce security resources. Securing an electrical substation is used as an illustrative case study to demonstrate the methodology. The case study shows that the method presented here can be used to answer key questions, for example, what security resources should a decision maker invest in based on their budget constraints? Results show that the modeling and analysis approach provides a means to effectively evaluate the infrastructure vulnerability and presents a set of security alternatives for decision makers to choose from, based on their vulnerabilities and budget profile.},
+  langid = {english},
+  pagetotal = {20},
+  annotation = {Web of Science ID: WOS:000461577200003}
+}
+
+@article{huldtStateofpracticeSurveyModelbased2019,
+  title = {State-of-Practice Survey of Model-Based Systems Engineering},
+  author = {Huldt, T. and Stenius, I.},
+  date = {2019-03},
+  journaltitle = {SYSTEMS ENGINEERING},
+  shortjournal = {Syst. Eng.},
+  volume = {22},
+  number = {2},
+  pages = {134--145},
+  publisher = {Wiley},
+  location = {Hoboken},
+  issn = {1098-1241, 1520-6858},
+  doi = {10.1002/sys.21466},
+  url = {https://www.webofscience.com/wos/woscc/summary/563bee91-8c90-4554-ae8d-46c3ce0028ee-a808dfa0/relevance/1},
+  urldate = {2023-10-03},
+  abstract = {This paper aims to examine and document the current state of practice of model-based systems engineering (MBSE), and how organizations look toward the future. The paper is based on a survey of how MBSE has been applied and factors that influenced the perceived benefits and results. The survey was designed to evaluate the maturity and status of the implementation of MBSE (also called model-centric systems engineering), within industry, academia, and governments. The approach to the survey development is described along with the survey results. The study indicates that one of the main hurdles to introducing a model-based approach is the lack of clear and adopted organizational structures and an understanding of required conditions and needs at a management level. The survey also indicates that 50-75\% of the respondents noted some improvement or a significant improvement across almost all systems engineering tasks.},
+  langid = {english},
+  pagetotal = {12},
+  annotation = {Web of Science ID: WOS:000461577200004}
+}
+
+@unpublished{humayedCyberPhysicalSystemsSecurity2017,
+  title = {Cyber-{{Physical Systems Security}} -- {{A Survey}}},
+  author = {Humayed, Abdulmalik and Lin, Jingqiang and Li, Fengjun and Luo, Bo},
+  date = {2017-01-16},
+  eprint = {1701.04525},
+  eprinttype = {arXiv},
+  eprintclass = {cs},
+  url = {http://arxiv.org/abs/1701.04525},
+  urldate = {2022-03-02},
+  abstract = {With the exponential growth of cyber-physical systems (CPS), new security challenges have emerged. Various vulnerabilities, threats, attacks, and controls have been introduced for the new generation of CPS. However, there lack a systematic study of CPS security issues. In particular, the heterogeneity of CPS components and the diversity of CPS systems have made it very difficult to study the problem with one generalized model. In this paper, we capture and systematize existing research on CPS security under a unified framework. The framework consists of three orthogonal coordinates: (1) from the security perspective, we follow the well-known taxonomy of threats, vulnerabilities, attacks and controls; (2)from the CPS components perspective, we focus on cyber, physical, and cyber-physical components; and (3) from the CPS systems perspective, we explore general CPS features as well as representative systems (e.g., smart grids, medical CPS and smart cars). The model can be both abstract to show general interactions of a CPS application and specific to capture any details when needed. By doing so, we aim to build a model that is abstract enough to be applicable to various heterogeneous CPS applications; and to gain a modular view of the tightly coupled CPS components. Such abstract decoupling makes it possible to gain a systematic understanding of CPS security, and to highlight the potential sources of attacks and ways of protection.},
+  langid = {english},
+  keywords = {DGC read},
+  file = {/home/danesabo/Zotero/storage/KLXWDK5I/Humayed et al. - 2017 - Cyber-Physical Systems Security-A Survey.pdf;/home/danesabo/Zotero/storage/X652UMCD/Humayed17.pdf}
+}
+
+@article{humayedCyberPhysicalSystemsSecurity2017a,
+  title = {Cyber-{{Physical Systems Security}}—{{A Survey}}},
+  author = {Humayed, Abdulmalik and Lin, Jingqiang and Li, Fengjun and Luo, Bo},
+  date = {2017-12},
+  journaltitle = {IEEE Internet of Things Journal},
+  shortjournal = {IEEE Internet Things J.},
+  volume = {4},
+  number = {6},
+  pages = {1802--1831},
+  issn = {2327-4662},
+  doi = {10.1109/JIOT.2017.2703172},
+  url = {http://ieeexplore.ieee.org/document/7924372/},
+  urldate = {2023-10-11},
+  abstract = {With the exponential growth of cyber-physical systems (CPSs), new security challenges have emerged. Various vulnerabilities, threats, attacks, and controls have been introduced for the new generation of CPS. However, there lacks a systematic review of the CPS security literature. In particular, the heterogeneity of CPS components and the diversity of CPS systems have made it difficult to study the problem with one generalized model. In this paper, we study and systematize existing research on CPS security under a unified framework. The framework consists of three orthogonal coordinates: 1) from the security perspective, we follow the well-known taxonomy of threats, vulnerabilities, attacks and controls; 2) from the CPS components perspective, we focus on cyber, physical, and cyberphysical components; and 3) from the CPS systems perspective, we explore general CPS features as well as representative systems (e.g., smart grids, medical CPS, and smart cars). The model can be both abstract to show general interactions of components in a CPS application, and specific to capture any details when needed. By doing so, we aim to build a model that is abstract enough to be applicable to various heterogeneous CPS applications; and to gain a modular view of the tightly coupled CPS components. Such abstract decoupling makes it possible to gain a systematic understanding of CPS security, and to highlight the potential sources of attacks and ways of protection. With this intensive literature review, we attempt to summarize the state-of-the-art on CPS security, provide researchers with a comprehensive list of references, and also encourage the audience to further explore this emerging field.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/DBK4L5AG/Humayed et al. - 2017 - Cyber-Physical Systems Security—A Survey.pdf}
+}
+
+@article{hwangESFDExplainableSensor2021,
+  title = {E-{{SFD}}: {{Explainable Sensor Fault Detection}} in the {{ICS Anomaly Detection System}}},
+  shorttitle = {E-{{SFD}}},
+  author = {Hwang, Chanwoong and Lee, Taejin},
+  date = {2021},
+  journaltitle = {IEEE Access},
+  shortjournal = {IEEE Access},
+  volume = {9},
+  pages = {140470--140486},
+  issn = {2169-3536},
+  doi = {10.1109/ACCESS.2021.3119573},
+  url = {https://ieeexplore.ieee.org/document/9568906/},
+  urldate = {2023-10-11},
+  abstract = {Industrial Control Systems (ICS) are evolving into smart environments with increased interconnectivity by being connected to the Internet. These changes increase the likelihood of security vulnerabilities and accidents. As the risk of cyberattacks on ICS has increased, various anomaly detection studies are being conducted to detect abnormal situations in industrial processes. However, anomaly detection in ICS suffers from numerous false alarms. When false alarms occur, multiple sensors need to be checked, which is impractical. In this study, when an anomaly is detected, sensors displaying abnormal behavior are visually presented through XAI-based analysis to support quick practical actions and operations. Anomaly Detection has designed and applied better anomaly detection technology than the first prize at HAICon2020, an ICS security threat detection AI contest hosted by the National Security Research Institute last year, and explains the anomalies detected in its model. To the best of our knowledge, our work is at the forefront of explainable anomaly detection research in ICS. Therefore, it is expected to increase the utilization of anomaly detection technology in ICS.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/SYTBDVYV/Hwang and Lee - 2021 - E-SFD Explainable Sensor Fault Detection in the I.pdf}
+}
+
+@misc{IBM,
+  year = {date accessed 03/24/2022},
+  url = {https://www.ibm.com/topics/what-is-a-digital-twin}
+}
+
+@online{IEC6113132013,
+  title = {{{IEC}} 61131-3:2013},
+  shorttitle = {{{IEC}} 61131-3},
+  url = {https://webstore.iec.ch/en/publication/4552},
+  urldate = {2024-08-13},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/9DCM4B6F/4552.html}
+}
+
+@online{IEEEXploreFullText,
+  title = {{{IEEE Xplore Full-Text PDF}}:},
+  url = {https://ieeexplore-ieee-org.pitt.idm.oclc.org/stamp/stamp.jsp?tp=&arnumber=8107024},
+  urldate = {2023-11-20},
+  file = {/home/danesabo/Zotero/storage/WLYLUPG2/stamp.html}
+}
+
+@report{IFO-report,
+  title = {Pennsylvania Electricity Update},
+  date = {2022-03},
+  institution = {Independent Fiscal Office}
+}
+
+@inproceedings{immlerNumericalAnalysisOrdinary2012,
+  title = {Numerical {{Analysis}} of {{Ordinary Differential Equations}} in {{Isabelle}}/{{HOL}}},
+  booktitle = {Interactive {{Theorem Proving}}},
+  author = {Immler, Fabian and Hölzl, Johannes},
+  editor = {Beringer, Lennart and Felty, Amy},
+  date = {2012},
+  pages = {377--392},
+  publisher = {Springer},
+  location = {Berlin, Heidelberg},
+  doi = {10.1007/978-3-642-32347-8_26},
+  abstract = {Many ordinary differential equations (ODEs) do not have a closed solution, therefore approximating them is an important problem in numerical analysis. This work formalizes a method to approximate solutions of ODEs in Isabelle/HOL.},
+  isbn = {978-3-642-32347-8},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/2DSV7HJE/Immler and Hölzl - 2012 - Numerical Analysis of Ordinary Differential Equati.pdf}
+}
+
+@online{ImpossibleAsylum,
+  title = {An {{Impossible Asylum}}},
+  issn = {0002-9890},
+  url = {https://www.tandfonline.com/doi/epdf/10.1080/00029890.2023.2176668?needAccess=true},
+  urldate = {2024-04-21},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/YXH6RCU8/An Impossible Asylum.pdf;/home/danesabo/Zotero/storage/XSLV4JNS/00029890.2023.html}
+}
+
+@article{inghamSpecialIssueModelbased2019,
+  title = {Special Issue on Model-Based Systems Engineering},
+  author = {Ingham, Michel D.},
+  date = {2019-03},
+  journaltitle = {SYSTEMS ENGINEERING},
+  shortjournal = {Syst. Eng.},
+  volume = {22},
+  number = {2},
+  pages = {97--97},
+  publisher = {Wiley},
+  location = {Hoboken},
+  issn = {1098-1241, 1520-6858},
+  doi = {10.1002/sys.21483},
+  url = {https://www.webofscience.com/wos/woscc/summary/563bee91-8c90-4554-ae8d-46c3ce0028ee-a808dfa0/relevance/1},
+  urldate = {2023-10-03},
+  langid = {english},
+  pagetotal = {1},
+  annotation = {Web of Science ID: WOS:000461577200001}
+}
+
+@book{instituteofelectricalandelectronicsengineers2014IEEE53rd2014,
+  title = {2014 {{IEEE}} 53rd {{Annual Conference}} on {{Decision}} and {{Control}} ({{CDC}} 2014): {{Los Angeles}}, {{California}}, {{USA}}, 15 - 17 {{December}} 2014},
+  shorttitle = {2014 {{IEEE}} 53rd {{Annual Conference}} on {{Decision}} and {{Control}} ({{CDC}} 2014)},
+  editor = {Institute of Electrical {and} Electronics Engineers and IEEE Control Systems Society},
+  date = {2014},
+  publisher = {IEEE},
+  location = {Piscataway, NJ},
+  isbn = {978-1-4673-6090-6 978-1-4673-6089-0},
+  langid = {english}
+}
+
+@book{instituteofelectricalandelectronicsengineersProceedings35thIEEE1996,
+  title = {Proceedings of the 35th {{IEEE Conference}} on {{Decision}} and {{Control}}: {{December}} 11 - 13, 1996, {{Portopia Hotel}} and {{International Convention Center}}, {{Kobe}}, {{Japan}}},
+  shorttitle = {Proceedings of the 35th {{IEEE Conference}} on {{Decision}} and {{Control}}},
+  editor = {Institute of Electrical {and} Electronics Engineers and IEEE Control Systems Society},
+  date = {1996},
+  publisher = {IEEE Service Center},
+  location = {Piscataway, NJ},
+  eventtitle = {Conference on {{Decision}} and {{Control}}},
+  isbn = {978-0-7803-3590-5 978-0-7803-3591-2 978-0-7803-3592-9 978-0-7803-3593-6},
+  langid = {english},
+  note = {IEEE catalog number 96CH35989, 96CB35989}
+}
+
+@online{InteractionRoundoffNoise,
+  title = {On the {{Interaction}} of {{Roundoff Noise}} and {{Dynamic Range}} in {{Digital Filters}}* - {{Jackson}} - 1970 - {{Bell System Technical Journal}} - {{Wiley Online Library}}},
+  url = {https://onlinelibrary-wiley-com.pitt.idm.oclc.org/doi/abs/10.1002/j.1538-7305.1970.tb01763.x},
+  urldate = {2024-02-08},
+  file = {/home/danesabo/Zotero/storage/QGRVUY42/j.1538-7305.1970.tb01763.html}
+}
+
+@book{international2007iaea,
+  title = {Assessment and Management of Ageing of Major Nuclear Power Plant Components Important to Safety: {{PWR}} Vessel Internals},
+  date = {2007},
+  series = {{{TECDOC}} Series},
+  number = {1557},
+  publisher = {INTERNATIONAL ATOMIC ENERGY AGENCY},
+  location = {Vienna},
+  url = {https://www.iaea.org/publications/7740/assessment-and-management-of-ageing-of-major-nuclear-power-plant-components-important-to-safety-pwr-vessel-internals},
+  isbn = {978-92-0-105107-3}
+}
+
+@online{IntroductionDiffusionModels2022,
+  title = {Introduction to {{Diffusion Models}} for {{Machine Learning}}},
+  date = {2022-05-12T15:19:03},
+  url = {https://www.assemblyai.com/blog/diffusion-models-for-machine-learning-introduction/},
+  urldate = {2024-07-23},
+  abstract = {The meteoric rise of Diffusion Models is one of the biggest developments in Machine Learning in the past several years. Learn everything you need to know about Diffusion Models in this easy-to-follow guide.},
+  langid = {english},
+  organization = {News, Tutorials, AI Research},
+  file = {/home/danesabo/Zotero/storage/YRRXJPJQ/diffusion-models-for-machine-learning-introduction.html}
+}
+
+@online{IntroductionModelBasedSystems2020,
+  title = {An {{Introduction}} to {{Model-Based Systems Engineering}} ({{MBSE}})},
+  date = {2020-12-21},
+  url = {https://insights.sei.cmu.edu/blog/introduction-model-based-systems-engineering-mbse/},
+  urldate = {2023-10-06},
+  abstract = {Model-based systems engineering (MBSE) is a formalized methodology that is used to support the requirements, design, analysis, verification, and validation associated with the development of complex systems. In this blog post, I provide a brief introduction to MBSE.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/EQGZXJYS/introduction-model-based-systems-engineering-mbse.html}
+}
+
+@article{ioannouAutonomousIntelligentCruise1993,
+  title = {Autonomous Intelligent Cruise Control},
+  author = {Ioannou, P.A. and Chien, C.C.},
+  date = {1993-11},
+  journaltitle = {IEEE Transactions on Vehicular Technology},
+  volume = {42},
+  number = {4},
+  pages = {657--672},
+  issn = {1939-9359},
+  doi = {10.1109/25.260745},
+  url = {https://ieeexplore.ieee.org/document/260745},
+  urldate = {2023-11-20},
+  abstract = {Vehicle following and its effects on traffic flow has been an active area of research. Human driving involves reaction times, delays, and human errors that affect traffic flow adversely. One way to eliminate human errors and delays in vehicle following is to replace the human driver with a computer control system and sensors. The purpose of this paper is to develop an autonomous intelligent cruise control (AICC) system for automatic vehicle following, examine its effect on traffic flow, and compare its performance with that of the human driver models. The AICC system developed is not cooperative; i.e., it does not exchange information with other vehicles and yet is not susceptible to oscillations and "slinky" effects. The elimination of the "slinky" effect is achieved by using a safety distance separation rule that is proportional to the vehicle velocity (constant time headway) and by designing the control system appropriately. The performance of the AICC system is found to be superior to that of the human driver models considered. It has a faster and better transient response that leads to a much smoother and faster traffic flow. Computer simulations are used to study the performance of the proposed AICC system and analyze vehicle following in a single lane, without passing, under manual and automatic control. In addition, several emergency situations that include emergency stopping and cut-in cases were simulated. The simulation results demonstrate the effectiveness of the AICC system and its potentially beneficial effects on traffic flow.{$<>$}},
+  eventtitle = {{{IEEE Transactions}} on {{Vehicular Technology}}},
+  file = {/home/danesabo/Zotero/storage/AM6D6UCR/Ioannou and Chien - 1993 - Autonomous intelligent cruise control.pdf}
+}
+
+@online{IsabelleUTP,
+  title = {Isabelle/{{UTP}}},
+  url = {https://isabelle-utp.york.ac.uk/},
+  urldate = {2024-04-29},
+  abstract = {Isabelle/UTP is a collection of tools, built on top of the Isabelle/HOL proof assistant, for building practical verification tools. It applies the principles of Hoare and He's Unifying Theories of Programming semantic framework to support formal semantics for a host of heterogeneous languages and},
+  langid = {american},
+  file = {/home/danesabo/Zotero/storage/RUPKZ4JG/isabelle-utp.york.ac.uk.html}
+}
+
+@online{ISAIEC62443,
+  title = {{{ISA}}/{{IEC}} 62443 {{Series}} of {{Standards}} - {{ISA}}},
+  url = {https://www.isa.org/standards-and-publications/isa-standards/isa-iec-62443-series-of-standards},
+  urldate = {2024-02-29},
+  abstract = {The ISA/IEC 62443 standards set best practices for cybersecurity and provide a way to assess the level of security performance.},
+  langid = {english},
+  organization = {isa.org},
+  file = {/home/danesabo/Zotero/storage/VQYZ7YWF/isa-iec-62443-series-of-standards.html}
+}
+
+@online{ISAIEC62443a,
+  title = {{{ISA}}/{{IEC}} 62443 {{Series}} of {{Standards}} - {{ISA}}},
+  url = {https://www.isa.org/standards-and-publications/isa-standards/isa-iec-62443-series-of-standards},
+  urldate = {2023-10-03},
+  abstract = {These standards set best practices for cybersecurity and provide a way to assess the level of security performance.},
+  langid = {english},
+  organization = {isa.org}
+}
+
+@misc{IT-def,
+  date = {2021},
+  note = {Definition from National Institute of Standards and Technology: “Information Technology: any equipment or interconnected system or subsystem of equipment that is used in the automatic acquisition, storage, manipulation, management, movement, control, display, switching, interchange, transmission, or reception of data or information by the executive agency.”}
+}
+
+@inproceedings{jackyPyModelModelbasedTesting2011,
+  title = {{{PyModel}}: {{Model-based}} Testing in {{Python}}},
+  shorttitle = {{{PyModel}}},
+  author = {Jacky, Jonathan},
+  date = {2011},
+  pages = {48--52},
+  location = {Austin, Texas},
+  doi = {10.25080/Majora-ebaa42b7-008},
+  url = {https://conference.scipy.org/proceedings/scipy2011/jacky.html},
+  urldate = {2023-11-27},
+  abstract = {In unit testing, the programmer codes the test cases, and also codes assertions that check whether each test case passed. In model-based testing, the programmer codes a "model" that generates as many test cases as desired and also acts as the oracle that checks the cases. Model-based testing is recommended where so many test cases are needed that it is not feasible to code them all by hand. This need arises when testing behaviors that exhibit history-dependence and nondeterminism, so that many variations (data values, interleavings, etc.) should be tested for each scenario (or use case). Examples include communication protocols, web applications, control systems, and user interfaces. PyModel is a model-based testing framework in Python. PyModel supports on-the-fly testing, which can generate indefinitely long nonrepeating tests as the test run executes. PyModel can focus test cases on scenarios of interest by composition, a versatile technique that combines models by synchronizing shared actions and interleaving unshared actions. PyModel can guide test coverage according to programmable strategies coded by the programmer.},
+  eventtitle = {Python in {{Science Conference}}},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/QGZYQVCE/Jacky - 2011 - PyModel Model-based testing in Python.pdf}
+}
+
+@article{jagvaralUnifiedFrameworkDiffusion2024,
+  title = {Unified {{Framework}} for {{Diffusion Generative Models}} in {{SO}}(3): {{Applications}} in {{Computer Vision}} and {{Astrophysics}}},
+  shorttitle = {Unified {{Framework}} for {{Diffusion Generative Models}} in {{SO}}(3)},
+  author = {Jagvaral, Yesukhei and Lanusse, Francois and Mandelbaum, Rachel},
+  date = {2024-03-24},
+  journaltitle = {Proceedings of the AAAI Conference on Artificial Intelligence},
+  shortjournal = {AAAI},
+  volume = {38},
+  number = {11},
+  pages = {12754--12762},
+  issn = {2374-3468, 2159-5399},
+  doi = {10.1609/aaai.v38i11.29171},
+  url = {https://ojs.aaai.org/index.php/AAAI/article/view/29171},
+  urldate = {2024-05-20},
+  abstract = {Diffusion-based generative models represent the current state-of-the-art for image generation. However, standard diffusion models are based on Euclidean geometry and do not translate directly to manifold-valued data. In this work, we develop extensions of both score-based generative models (SGMs) and Denoising Diffusion Probabilistic Models (DDPMs) to the Lie group of 3D rotations, SO(3). SO(3) is of particular interest in many disciplines such as robotics, biochemistry and astronomy/cosmology science. Contrary to more general Riemannian manifolds, SO(3) admits a tractable solution to heat diffusion, and allows us to implement efficient training of diffusion models. We apply both SO(3) DDPMs and SGMs to synthetic densities on SO(3) and demonstrate state-of-the-art results. Additionally, we demonstrate the practicality of our model on pose estimation tasks and in predicting correlated galaxy orientations for astrophysics/cosmology.},
+  file = {/home/danesabo/Zotero/storage/IIZ4QAYT/Jagvaral et al. - 2024 - Unified Framework for Diffusion Generative Models .pdf}
+}
+
+@inproceedings{jasimFormalProofsFeedback2017,
+  title = {Towards Formal Proofs of Feedback Control Theory},
+  booktitle = {2017 21st {{International Conference}} on {{System Theory}}, {{Control}} and {{Computing}} ({{ICSTCC}})},
+  author = {Jasim, Omar A. and Veres, Sandor M.},
+  date = {2017-10},
+  pages = {43--48},
+  doi = {10.1109/ICSTCC.2017.8107009},
+  abstract = {Control theory can establish properties of systems which hold with all signals within the system and hence cannot be proven by simulation. The most basic of such property is the stability of a control subsystem or the overall system. Other examples are statements on robust control performance in the face of dynamical uncertainties and disturbances in sensing and actuation. Until now these theories were developed and checked for their correctness by control scientist manually using their mathematical knowledge. With the emergence of formal methods, there is now the possibility to derive and prove robust control theory by symbolic computation on computers. There is a demand for this approach from industry for the verification of practical control systems with concrete numerical values where the applicability of a control theorem is specialised to an application with given numerical boundaries of parameter variations. The paper gives an overview of the challenges of the area and illustrates them on a computer-based formal proof of the Small-gain theorem and conclusions are drawn from these initial experiences.},
+  eventtitle = {2017 21st {{International Conference}} on {{System Theory}}, {{Control}} and {{Computing}} ({{ICSTCC}})},
+  file = {/home/danesabo/Zotero/storage/QHPSTMRE/Jasim and Veres - 2017 - Towards formal proofs of feedback control theory.pdf;/home/danesabo/Zotero/storage/H7EQGGX9/8107009.html}
+}
+
+@article{jenkinsUseResidueNumber1977,
+  title = {The Use of Residue Number Systems in the Design of Finite Impulse Response Digital Filters},
+  author = {Jenkins, W. and Leon, B.},
+  date = {1977-04},
+  journaltitle = {IEEE Transactions on Circuits and Systems},
+  volume = {24},
+  number = {4},
+  pages = {191--201},
+  issn = {1558-1276},
+  doi = {10.1109/TCS.1977.1084321},
+  url = {https://ieeexplore.ieee.org/abstract/document/1084321?casa_token=XdjpccSTFRAAAAAA:9ru-8Uhyn9WqOU4VH0OlAEYlffdomoTZs2ktv-lTXPPeMi8w3_JXeS8dd5pZwLxapTQdLb0Q9A},
+  urldate = {2024-02-08},
+  abstract = {A technique is presented for implementing a finite impulse response (FIR) digital filter in a residue number system (RNS). For many years residue number coding has been recognized as a system which provides a capability for the implementation of high speed multiplication and addition. The advantages of residue coding for the design of high speed FIR filters result from the fact that an FIR requires only the high speed residue operations, i.e., addition and multiplication, while not requiring the slower RNS operations of division or sign detection. A new hardware implementation of the Chinese Remainder Theorem is proposed for an efficient translation of residue coded outputs into natural numbers. A numerical example illustrates the principles of residue encoding, residue arithmetic, and residue decoding for FIR filters. An RNS implementation of a 64th-order dual bandpass filter is compared with several alternative filter structures to illustrate tradeoffs between speed and hardware complexity.},
+  eventtitle = {{{IEEE Transactions}} on {{Circuits}} and {{Systems}}},
+  file = {/home/danesabo/Zotero/storage/QXLHCVRK/Jenkins and Leon - 1977 - The use of residue number systems in the design of.pdf;/home/danesabo/Zotero/storage/4LS9LL59/1084321.html}
+}
+
+@article{jiangIndustrialApplicationsDigital2021,
+  title = {Industrial Applications of Digital Twins},
+  author = {Jiang, Yuchen and Yin, Shen and Li, Kuan and Luo, Hao and Kaynak, Okyay},
+  date = {2021-10-04},
+  journaltitle = {Philosophical Transactions of the Royal Society a-Mathematical Physical and Engineering Sciences},
+  shortjournal = {Philos. Trans. R. Soc. A-Math. Phys. Eng. Sci.},
+  volume = {379},
+  number = {2207},
+  pages = {20200360},
+  publisher = {Royal Soc},
+  location = {London},
+  issn = {1364-503X},
+  doi = {10.1098/rsta.2020.0360},
+  url = {http://www.webofscience.com/wos/woscc/summary/marked/relevance/1},
+  urldate = {2022-03-08},
+  abstract = {A digital twin (DT) is classically defined as the virtual replica of a real-world product, system, being, communities, even cities that are continuously updated with data from its physical counterpart, as well as its environment. It bridges the virtual cyberspace with the physical entities and, as such, is considered to be the pillar of Industry 4.0 and the innovation backbone of the future. A DT is created and used throughout the whole life cycle of the entity it replicates, from cradle to grave, so to speak. This article focuses on the present state of the art of DTs, concentrating on the use of DTs in industry in the context of smart manufacturing, especially from the point of view of plantwide optimization. The main capabilities of DTs (mirroring, shadowing and threading) are discussed in this context. The article concludes with a perspective on the future. This article is part of the theme issue 'Towards symbiotic autonomous systems'.},
+  langid = {english},
+  keywords = {maybe},
+  annotation = {WOS:000685707500016},
+  file = {/home/danesabo/Zotero/storage/ABXW4VHP/Jiang et al. - 2021 - Industrial applications of digital twins.pdf}
+}
+
+@inproceedings{jinModelingPROFINETActions2015,
+  title = {Modeling \{\vphantom\}{{PROFINET}}\vphantom\{\} Actions with Timing Pi-Calculus},
+  booktitle = {First {{International Conference}} on {{Information Sciences}}, {{Machinery}}, {{Materials}} and {{Energy}}},
+  author = {Jin, Wei and Gao, Xin and Li, Jing},
+  date = {2015},
+  pages = {397--402},
+  publisher = {Atlantis Press},
+  isbn = {94-6252-067-4},
+  file = {/home/danesabo/Zotero/storage/4ARXNH3I/Jin et al. - Modeling PROFINET actions with timing pi-calculus.pdf}
+}
+
+@article{joExplorationZeroKnowledgeProofs,
+  title = {An {{Exploration}} of {{Zero-Knowledge Proofs}} and Zk-{{SNARKs}}},
+  author = {Jo, Terrence},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/RGPBR2H4/Jo - An Exploration of Zero-Knowledge Proofs and zk-SNA.pdf}
+}
+
+@inproceedings{jonesAnomalyDetectionCyberphysical2014,
+  title = {Anomaly Detection in Cyber-Physical Systems: {{A}} Formal Methods Approach},
+  shorttitle = {Anomaly Detection in Cyber-Physical Systems},
+  booktitle = {53rd {{IEEE Conference}} on {{Decision}} and {{Control}}},
+  author = {Jones, Austin and Kong, Zhaodan and Belta, Calin},
+  date = {2014-12},
+  pages = {848--853},
+  publisher = {IEEE},
+  location = {Los Angeles, CA, USA},
+  doi = {10.1109/CDC.2014.7039487},
+  url = {http://ieeexplore.ieee.org/document/7039487/},
+  urldate = {2023-11-03},
+  eventtitle = {2014 {{IEEE}} 53rd {{Annual Conference}} on {{Decision}} and {{Control}} ({{CDC}})},
+  isbn = {978-1-4673-6090-6 978-1-4799-7746-8 978-1-4799-7745-1}
+}
+
+@article{juarezDigitalTwinsReview2021,
+  title = {Digital {{Twins}}: {{Review}} and {{Challenges}}},
+  shorttitle = {Digital {{Twins}}},
+  author = {Juarez, Maria G. and Botti, Vicente J. and Giret, Adriana S.},
+  date = {2021-06-01},
+  journaltitle = {Journal of Computing and Information Science in Engineering},
+  shortjournal = {J. Comput. Inf. Sci. Eng.},
+  volume = {21},
+  number = {3},
+  pages = {030802},
+  publisher = {Asme},
+  location = {New York},
+  issn = {1530-9827},
+  doi = {10.1115/1.4050244},
+  url = {http://www.webofscience.com/wos/woscc/summary/marked/relevance/1},
+  urldate = {2022-03-08},
+  abstract = {With the arises of Industry 4.0, numerous concepts have emerged; one of the main concepts is the digital twin (DT). DT is being widely used nowadays, however, as there are several uses in the existing literature; the understanding of the concept and its functioning can be diffuse. The main goal of this paper is to provide a review of the existing literature to clarify the concept, operation, and main characteristics of DT, to introduce the most current operating, communication, and usage trends related to this technology, and to present the performance of the synergy between DT and multi-agent system (MAS) technologies through a computer science approach.},
+  langid = {english},
+  keywords = {DGC read,key},
+  annotation = {WOS:000651510900012},
+  file = {/home/danesabo/Zotero/storage/2UI8QV8E/Juarez et al. - 2021 - Digital Twins Review and Challenges.pdf}
+}
+
+@article{julierUnscentedFilteringNonlinear2004,
+  title = {Unscented {{Filtering}} and {{Nonlinear Estimation}}},
+  author = {Julier, S.J. and Uhlmann, J.K.},
+  date = {2004},
+  journaltitle = {Proceedings of the IEEE},
+  shortjournal = {Proceedings of the IEEE},
+  volume = {92},
+  number = {3},
+  pages = {401--422},
+  publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}},
+  issn = {0018-9219},
+  doi = {10.1109/jproc.2003.823141},
+  url = {https://dx.doi.org/10.1109/jproc.2003.823141}
+}
+
+@article{jyotishPerformanceMeasurementSafetycritical2023,
+  title = {Performance Measurement of Safety-Critical Systems Based on Ordinary Differential Equations and {{Petri}} Nets: {{A}} Case Study of Nuclear Power Plant},
+  shorttitle = {Performance Measurement of Safety-Critical Systems Based on Ordinary Differential Equations and {{Petri}} Nets},
+  author = {Jyotish, Nand Kumar and Singh, Lalit Kumar and Kumar, Chiranjeev},
+  date = {2023-03},
+  journaltitle = {Nuclear Engineering and Technology},
+  shortjournal = {Nuclear Engineering and Technology},
+  volume = {55},
+  number = {3},
+  pages = {861--869},
+  issn = {17385733},
+  doi = {10.1016/j.net.2022.11.015},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S1738573322005411},
+  urldate = {2024-02-15},
+  abstract = {This article proposes a novel approach to measure the performance of Safety-Critical Systems (SCS). Such systems contain multiple processing nodes that communicate with each other is modeled by a Petri nets (PN). The paper uses the PN for the performance evaluation of SCS. A set of ordinary differential equations (ODEs) is derived from the Petri net model that represent the state of the system, and the solutions can be used to measure the system's performance. The proposed method can avoid the state space explosion problem and also introduces new metrics of performance, along with their measurement: deadlock, liveness, stability, boundedness, and steady state. The proposed technique is applied to Shutdown System (SDS) of Nuclear Power Plant (NPP). We obtained 99.887\% accuracy of performance measurement, which proves the effectiveness of our approach.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/QIQWIAJ6/Jyotish et al. - 2023 - Performance measurement of safety-critical systems.pdf}
+}
+
+@article{kabirNeuralNetworkBasedUncertainty2018,
+  title = {Neural {{Network-Based Uncertainty Quantification}}: {{A Survey}} of {{Methodologies}} and {{Applications}}},
+  shorttitle = {Neural {{Network-Based Uncertainty Quantification}}},
+  author = {Kabir, H. M. Dipu and Khosravi, Abbas and Hosen, Mohammad Anwar and Nahavandi, Saeid},
+  date = {2018},
+  journaltitle = {IEEE Access},
+  volume = {6},
+  pages = {36218--36234},
+  issn = {2169-3536},
+  doi = {10.1109/ACCESS.2018.2836917},
+  abstract = {Uncertainty quantification plays a critical role in the process of decision making and optimization in many fields of science and engineering. The field has gained an overwhelming attention among researchers in recent years resulting in an arsenal of different methods. Probabilistic forecasting and in particular prediction intervals (PIs) are one of the techniques most widely used in the literature for uncertainty quantification. Researchers have reported studies of uncertainty quantification in critical applications such as medical diagnostics, bioinformatics, renewable energies, and power grids. The purpose of this survey paper is to comprehensively study neural network-based methods for construction of prediction intervals. It will cover how PIs are constructed, optimized, and applied for decision-making in presence of uncertainties. Also, different criteria for unbiased PI evaluation are investigated. The paper also provides some guidelines for further research in the field of neural network-based uncertainty quantification.},
+  eventtitle = {{{IEEE Access}}},
+  file = {/home/danesabo/Zotero/storage/EA8FH385/Kabir et al. - 2018 - Neural Network-Based Uncertainty Quantification A.pdf}
+}
+
+@article{kamwaBuzzwordSolutionsDigital2024,
+  title = {From {{Buzzword To Solutions}}: {{Digital Twins}} in {{Power Systems}} [{{Editor}}’s {{Voice}}]},
+  shorttitle = {From {{Buzzword To Solutions}}},
+  author = {Kamwa, Innocent and Badrzadeh, Babak},
+  date = {2024-01},
+  journaltitle = {IEEE Power and Energy Magazine},
+  volume = {22},
+  number = {1},
+  pages = {4--11},
+  issn = {1558-4216},
+  doi = {10.1109/MPE.2023.3331189},
+  url = {https://ieeexplore.ieee.org/document/10398547/},
+  urldate = {2024-03-13},
+  abstract = {The digital twin concept has been around for a while—as early as 2002, according to Wikipedia and the authors in this issue. However, my first encounter with this concept was just about five or six years ago. Around that time, Gartner reported the entering of digital twins into mainstream use: 75\% of companies implementing the Internet of Things were already using digital twins or planned to within a year. My organization was contemplating digital twins as an enabling technology for grid modernization. During the process of road mapping the strategic innovation, we were asked how/where to position and prioritize this emerging research field in the transmission portfolio. We had two camps: networks versus assets. In the end, upper management, advised probably by consulting firms, such as McKinsey or Gartner, assigned the digital twin track to the asset group and excluded it from network research activities. Applying the digital twin buzzword to “networks” was deemed an abuse of language—a source of confusion in use case definitions and business value analyses of digital twins.},
+  eventtitle = {{{IEEE Power}} and {{Energy Magazine}}},
+  file = {/home/danesabo/Zotero/storage/5F638YMS/Kamwa and Badrzadeh - 2024 - From Buzzword To Solutions Digital Twins in Power.pdf;/home/danesabo/Zotero/storage/ZDQ6X7RG/10398547.html}
+}
+
+@inproceedings{kapinskiSimulationguidedApproachesVerification2015,
+  title = {Simulation-Guided Approaches for Verification of Automotive Powertrain Control Systems},
+  booktitle = {2015 {{American Control Conference}} ({{ACC}})},
+  author = {Kapinski, James and Deshmukh, Jyotirmoy and Jin, Xiaoqing and Ito, Hisahiro and Butts, Ken},
+  date = {2015-07},
+  pages = {4086--4095},
+  issn = {2378-5861},
+  doi = {10.1109/ACC.2015.7171968},
+  url = {https://ieeexplore.ieee.org/abstract/document/7171968},
+  urldate = {2024-07-10},
+  abstract = {Automotive embedded control systems are a vital aspect of modern automotive development, but the considerable complexity of these systems has made quality checking a challenging endeavor. Simulation-based checking approaches are attractive, as they often scale well with the complexity of the system design. This paper presents an overview of simulation-guided techniques that can be used to increase the confidence in the quality of an automotive powertrain control system design. We discuss the relationship between simulation-based approaches and the broader areas of verification and powertrain control design. Also, we discuss new software tools that use simulation-guided approaches to address various aspects of automotive powertrain control design verification. We conclude by considering ongoing challenges in developing new simulation-guided tools and applying them in a powertrain control development context.},
+  eventtitle = {2015 {{American Control Conference}} ({{ACC}})},
+  keywords = {Automotive engineering,Computational modeling,Control systems,Engines,Mathematical model,Numerical models,Testing},
+  file = {/home/danesabo/Zotero/storage/WGJ4F98E/Kapinski et al. - 2015 - Simulation-guided approaches for verification of a.pdf;/home/danesabo/Zotero/storage/9AR9TXRT/7171968.html}
+}
+
+@inproceedings{kapinskiSimulationguidedLyapunovAnalysis2014,
+  title = {Simulation-Guided Lyapunov Analysis for Hybrid Dynamical Systems},
+  booktitle = {Proceedings of the 17th International Conference on {{Hybrid}} Systems: Computation and Control},
+  author = {Kapinski, James and Deshmukh, Jyotirmoy V. and Sankaranarayanan, Sriram and Arechiga, Nikos},
+  date = {2014-04-15},
+  series = {{{HSCC}} '14},
+  pages = {133--142},
+  publisher = {Association for Computing Machinery},
+  location = {New York, NY, USA},
+  doi = {10.1145/2562059.2562139},
+  url = {https://doi.org/10.1145/2562059.2562139},
+  urldate = {2024-07-10},
+  abstract = {Lyapunov functions are used to prove stability and to obtain performance bounds on system behaviors for nonlinear and hybrid dynamical systems, but discovering Lyapunov functions is a difficult task in general. We present a technique for discovering Lyapunov functions and barrier certificates for nonlinear and hybrid dynamical systems using a search-based approach. Our approach uses concrete executions, such as those obtained through simulation, to formulate a series of linear programming (LP) optimization problems; the solution to each LP creates a candidate Lyapunov function. Intermediate candidates are iteratively improved using a global optimizer guided by the Lie derivative of the candidate Lyapunov function. The analysis is refined using counterexamples from a Satisfiability Modulo Theories (SMT) solver. When no counterexamples are found, the soundness of the analysis is verified using an arithmetic solver. The technique can be applied to a broad class of nonlinear dynamical systems, including hybrid systems and systems with polynomial and even transcendental dynamics. We present several examples illustrating the efficacy of the technique, including two automotive powertrain control examples.},
+  isbn = {978-1-4503-2732-9},
+  file = {/home/danesabo/Zotero/storage/CHU4P2B4/Kapinski et al. - 2014 - Simulation-guided lyapunov analysis for hybrid dyn.pdf}
+}
+
+@online{kapteynPhysicsBasedModelsPredictive2020,
+  title = {From {{Physics-Based Models}} to {{Predictive Digital Twins}} via {{Interpretable Machine Learning}}},
+  author = {Kapteyn, Michael G. and Willcox, Karen E.},
+  date = {2020-04-28},
+  eprint = {2004.11356},
+  eprinttype = {arXiv},
+  eprintclass = {cs},
+  url = {http://arxiv.org/abs/2004.11356},
+  urldate = {2023-10-11},
+  abstract = {This work develops a methodology for creating a data-driven digital twin from a library of physics-based models representing various asset states. The digital twin is updated using interpretable machine learning. Specifically, we use optimal trees---a recently developed scalable machine learning method---to train an interpretable data-driven classifier. Training data for the classifier are generated offline using simulated scenarios solved by the library of physics-based models. These data can be further augmented using experimental or other historical data. In operation, the classifier uses observational data from the asset to infer which physics-based models in the model library are the best candidates for the updated digital twin. The approach is demonstrated through the development of a structural digital twin for a 12ft wingspan unmanned aerial vehicle. This digital twin is built from a library of reduced-order models of the vehicle in a range of structural states. The data-driven digital twin dynamically updates in response to structural damage or degradation and enables the aircraft to replan a safe mission accordingly. Within this context, we study the performance of the optimal tree classifiers and demonstrate how their interpretability enables explainable structural assessments from sparse sensor measurements, and also informs optimal sensor placement.},
+  langid = {english},
+  pubstate = {prepublished},
+  note = {Comment: 20 pages, 13 figures, submitted to AIAA Journal},
+  file = {/home/danesabo/Zotero/storage/ACPJQ3GN/Kapteyn and Willcox - 2020 - From Physics-Based Models to Predictive Digital Tw.pdf}
+}
+
+@article{karatzasSystemTheoreticProcessAnalysis2020,
+  title = {System-{{Theoretic Process Analysis}} ({{STPA}}) for {{Hazard Analysis}} in {{Complex Systems}}: {{The Case}} of “{{Demand-Side Management}} in a {{Smart Grid}}”},
+  shorttitle = {System-{{Theoretic Process Analysis}} ({{STPA}}) for {{Hazard Analysis}} in {{Complex Systems}}},
+  author = {Karatzas, Stylianos and Chassiakos, Athanasios},
+  date = {2020-09-18},
+  journaltitle = {Systems},
+  shortjournal = {Systems},
+  volume = {8},
+  number = {3},
+  pages = {33},
+  issn = {2079-8954},
+  doi = {10.3390/systems8030033},
+  url = {https://www.mdpi.com/2079-8954/8/3/33},
+  urldate = {2023-11-03},
+  abstract = {Inelasticity of demand along with the distributed energy sources and energy market democratization pose significant challenges which have considerable negative impacts on overall grid balance. The need for increased capacity and flexibility in the era of energy market digitalization has introduced new requirements in the energy supply network which could not be satisfied without continuous and costly local power network upgrades. Additionally, with the emergence of Smart Homes (SHs) and Home Energy Management (HEM) systems for monitoring and operating household appliances, opportunities have arisen for automated Demand Response (DR). DR is exploited for the modification of the consumer energy demand, in response to the specific conditions within the electricity system (e.g., peak period network congestion). In order to optimally integrate DR in the broader Smart Grid (SG) system, modelling of the system parameters and safety analysis is required. In this paper, the implementation of STPA (System-Theoretic Process Analysis) structured method, as a relatively new hazard analysis technique for complex systems is presented and the feasibility of STPA implementation for loss prevention on a Demand Response system for home energy management, and within the complex SG context, is examined. The applied method delivers a mechanism useful in understanding where gaps in current operational risk structures may exist. The STPA findings in terms of loss scenarios can be used to generate a variety of safeguards to ensure secure operational control and in implementing targeted strategies through standard approaches of risk assessment.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/82RCGKD8/Karatzas and Chassiakos - 2020 - System-Theoretic Process Analysis (STPA) for Hazar.pdf}
+}
+
+@book{karimipourSecurityCyberPhysicalSystems2020,
+  title = {Security of {{Cyber-Physical Systems}}: {{Vulnerability}} and {{Impact}}},
+  shorttitle = {Security of {{Cyber-Physical Systems}}},
+  editor = {Karimipour, Hadis and Srikantha, Pirathayini and Farag, Hany and Wei-Kocsis, Jin},
+  date = {2020},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-030-45541-5},
+  url = {http://link.springer.com/10.1007/978-3-030-45541-5},
+  urldate = {2023-09-27},
+  isbn = {978-3-030-45540-8 978-3-030-45541-5},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/YGY8BYUJ/Karimipour et al. - 2020 - Security of Cyber-Physical Systems Vulnerability .pdf}
+}
+
+@article{kayanCybersecurityIndustrialCyberPhysical2022,
+  title = {Cybersecurity of {{Industrial Cyber-Physical Systems}}: {{A Review}}},
+  shorttitle = {Cybersecurity of {{Industrial Cyber-Physical Systems}}},
+  author = {Kayan, Hakan and Nunes, Matthew and Rana, Omer and Burnap, Pete and Perera, Charith},
+  date = {2022-01-31},
+  journaltitle = {ACM Computing Surveys},
+  shortjournal = {ACM Comput. Surv.},
+  volume = {54},
+  pages = {1--35},
+  issn = {0360-0300, 1557-7341},
+  doi = {10.1145/3510410},
+  url = {https://dl.acm.org/doi/10.1145/3510410},
+  urldate = {2022-09-30},
+  abstract = {Industrial cyber-physical systems               (               ICPSs               ) manage critical infrastructures by controlling the processes based on the “physics” data gathered by edge sensor networks. Recent innovations in ubiquitous computing and communication technologies have prompted the rapid integration of highly interconnected systems to ICPSs. Hence, the “security by obscurity” principle provided by air-gapping is no longer followed. As the interconnectivity in ICPSs increases, so does the attack surface. Industrial vulnerability assessment reports have shown that a variety of new vulnerabilities have occurred due to this transition. Although there are existing surveys in this context, very little is mentioned regarding the outputs of these reports. While these reports show that the most exploited vulnerabilities occur due to weak boundary protection, these vulnerabilities also occur due to limited or ill-defined security policies. However, current literature focuses on               intrusion detection systems               (               IDSs               ),               network traffic analysis               (               NTA               ) methods, or anomaly detection techniques. Hence, finding a solution for the problems mentioned in these reports is relatively hard. We bridge this gap by defining and reviewing ICPSs from a cybersecurity perspective. In particular, multi-dimensional adaptive attack taxonomy is presented and utilized for evaluating real-life ICPS cyber incidents. Finally, we identify the general shortcomings and highlight the points that cause a gap in existing literature while defining future research directions.},
+  issue = {11s},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/D45MW8IV/Kayan et al. - 2022 - Cybersecurity of Industrial Cyber-Physical Systems.pdf}
+}
+
+@article{kaysDigitalTwinNew2024,
+  title = {The Digital Twin: {{New}} Species, Evolution, or Revolution? [{{In}} My View]},
+  shorttitle = {The Digital Twin},
+  author = {Kays, Jan},
+  date = {2024-01},
+  journaltitle = {IEEE Power and Energy Magazine},
+  volume = {22},
+  number = {1},
+  pages = {90--92},
+  issn = {1558-4216},
+  doi = {10.1109/MPE.2023.3328292},
+  url = {https://ieeexplore.ieee.org/document/10398573/},
+  urldate = {2024-03-13},
+  abstract = {In studying the agendas of conferences and listening to research institutes or consultants, a new phrase has arisen in recent years: the digital twin. Assuming an answer to some everyday challenges, this topic made me curious. There are many interpretations and definitions of a digital twin in the research as well as the professional community. Depending on the individual focus, people assume that a digital twin is a dynamic model of a power grid, an energy management system simulation of a high-voltage dc converter station, or a 3D model of substations, and so on. In general, it is seen as a digital representation of the reality. My own picture of a digital twin got sharper after spending time on research and listening to interesting talks and presentations.},
+  eventtitle = {{{IEEE Power}} and {{Energy Magazine}}},
+  file = {/home/danesabo/Zotero/storage/TMGV4GSA/Kays - 2024 - The digital twin New species, evolution, or revol.pdf;/home/danesabo/Zotero/storage/BV39AE4U/10398573.html}
+}
+
+@article{kemmlerOneclassClassificationGaussian2013,
+  title = {One-Class Classification with {{Gaussian}} Processes},
+  author = {Kemmler, Michael and Rodner, Erik and Wacker, Esther-Sabrina and Denzler, Joachim},
+  date = {2013-12},
+  journaltitle = {Pattern Recognition},
+  shortjournal = {Pattern Recognition},
+  volume = {46},
+  number = {12},
+  pages = {3507--3518},
+  issn = {00313203},
+  doi = {10.1016/j.patcog.2013.06.005},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0031320313002574},
+  urldate = {2022-04-21},
+  abstract = {Detecting instances of unknown categories is an important task for a multitude of problems such as object recognition, event detection, and defect localization. This article investigates the use of Gaussian process (GP) priors for this area of research. Focusing on the task of one-class classification, we analyze different measures derived from GP regression and approximate GP classification. We also study important theoretical connections to other approaches and discuss their underlying assumptions. Experiments are performed using a large number of datasets and different image kernel functions. Our findings show that our approaches can outperform the well-known support vector data description approach indicating the high potential of Gaussian processes for one-class classification. Furthermore, we show the suitability of our methods in the area of attribute prediction, defect localization, bacteria recognition, and background subtraction. These applications and experiments highlight the easy applicability of our method as well as its state-of-the-art performance compared to established methods. \& 2013 Elsevier Ltd. All rights reserved.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/FFDXNVSK/Kemmler et al. - 2013 - One-class classification with Gaussian processes.pdf}
+}
+
+@article{kennedyBayesianCalibrationComputer2001,
+  title = {Bayesian {{Calibration}} of {{Computer Models}}},
+  author = {Kennedy, Marc C. and O'Hagan, Anthony},
+  date = {2001-09-01},
+  journaltitle = {Journal of the Royal Statistical Society Series B: Statistical Methodology},
+  shortjournal = {Journal of the Royal Statistical Society Series B: Statistical Methodology},
+  volume = {63},
+  number = {3},
+  pages = {425--464},
+  issn = {1369-7412},
+  doi = {10.1111/1467-9868.00294},
+  url = {https://doi.org/10.1111/1467-9868.00294},
+  urldate = {2024-05-21},
+  abstract = {We consider prediction and uncertainty analysis for systems which are approximated using complex mathematical models. Such models, implemented as computer codes, are often generic in the sense that by a suitable choice of some of the model's input parameters the code can be used to predict the behaviour of the system in a variety of specific applications. However, in any specific application the values of necessary parameters may be unknown. In this case, physical observations of the system in the specific context are used to learn about the unknown parameters. The process of fitting the model to the observed data by adjusting the parameters is known as calibration. Calibration is typically effected by ad hoc fitting, and after calibration the model is used, with the fitted input values, to predict the future behaviour of the system. We present a Bayesian calibration technique which improves on this traditional approach in two respects. First, the predictions allow for all sources of uncertainty, including the remaining uncertainty over the fitted parameters. Second, they attempt to correct for any inadequacy of the model which is revealed by a discrepancy between the observed data and the model predictions from even the best-fitting parameter values. The method is illustrated by using data from a nuclear radiation release at Tomsk, and from a more complex simulated nuclear accident exercise.},
+  file = {/home/danesabo/Zotero/storage/2E45R2EF/Kennedy and O'Hagan - 2001 - Bayesian Calibration of Computer Models.pdf;/home/danesabo/Zotero/storage/VUNWFU89/7083367.html}
+}
+
+@article{kernFormalVerificationHardware1999,
+  title = {Formal Verification in Hardware Design: A Survey},
+  shorttitle = {Formal Verification in Hardware Design},
+  author = {Kern, Christoph and Greenstreet, Mark R.},
+  date = {1999-04-01},
+  journaltitle = {ACM Transactions on Design Automation of Electronic Systems},
+  shortjournal = {ACM Trans. Des. Autom. Electron. Syst.},
+  volume = {4},
+  number = {2},
+  pages = {123--193},
+  issn = {1084-4309},
+  doi = {10.1145/307988.307989},
+  url = {https://dl.acm.org/doi/10.1145/307988.307989},
+  urldate = {2024-02-17},
+  abstract = {In recent years, formal methods have emerged as an alternative approach to ensuring the quality and correctness of hardware designs, overcoming some of the limitations of traditional validation techniques such as simulation and testing. There are two main aspects to the application of formal methods in a design process: the formal framework used to specify desired properties of a design and the verification techniques and tools used to reason about the relationship between a specification and a corresponding implementation. We survey a variety of frameworks and techniques proposed in the literature and applied to actual designs. The specification frameworks we describe include temporal logics, predicate logic, abstraction and refinement, as well as containment between ω-regular languages. The verification techniques presented include model checking, automata-theoretic techniques, automated theorem proving, and approaches that integrate the above methods. In order to provide insight into the scope and limitations of currently available techniques, we present a selection of case studies where formal methods were applied to industrial-scale designs, such as microprocessors, floating-point hardware, protocols, memory subsystems, and communications hardware.},
+  file = {/home/danesabo/Zotero/storage/ZE4R2AF4/Kern and Greenstreet - 1999 - Formal verification in hardware design a survey.pdf}
+}
+
+@incollection{khalidOverviewSecuritySmart2020,
+  title = {Overview of {{Security}} for {{Smart Cyber-Physical Systems}}},
+  booktitle = {Security of {{Cyber-Physical Systems}}: {{Vulnerability}} and {{Impact}}},
+  author = {Khalid, Faiq and Rehman, Semeen and Shafique, Muhammad},
+  editor = {Karimipour, Hadis and Srikantha, Pirathayini and Farag, Hany and Wei-Kocsis, Jin},
+  date = {2020},
+  pages = {5--24},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-030-45541-5_2},
+  url = {https://doi.org/10.1007/978-3-030-45541-5_2},
+  urldate = {2023-09-27},
+  abstract = {The tremendous growth of interconnectivity and dependencies of physical and cyber domains in cyber-physical systems (CPS) makes them vulnerable to several security threats like remote cyber-attacks, hardware, and software-based side-channel attacks, especially in safety-critical applications, i.e., healthcare, autonomous driving, etc. Though traditional software or hardware security measures can address these attacks in the respective domains due to enormous data and interdependencies of the physical-world and cyber-world, these techniques cannot be used directly. Therefore, to address these challenges, machine learning-based security measures have been proposed. This chapter first presents a brief overview of various security threats at different CPS layers, their respective threat models, and associated research challenges towards developing robust security measures. Towards the end, we briefly discuss and present a preliminary analysis of the state-of-the-art online anomaly detection techniques that leverage the machine learning algorithms and property-specific language, respectively.},
+  isbn = {978-3-030-45541-5},
+  langid = {english},
+  keywords = {survey},
+  file = {/home/danesabo/Zotero/storage/DDTJ7GSV/Khalid et al. - 2020 - Overview of Security for Smart Cyber-Physical Syst.pdf}
+}
+
+@article{khanIDEAIntrusionDetection2021,
+  title = {{{IDEA}}: {{Intrusion Detection}} through {{Electromagnetic-Signal Analysis}} for {{Critical Embedded}} and {{Cyber-Physical Systems}}},
+  shorttitle = {{{IDEA}}},
+  author = {Khan, Haider Adnan and Sehatbakhsh, Nader and Nguyen, Luong N. and Callan, Robert L. and Yeredor, Arie and Prvulovic, Milos and Zajić, Alenka},
+  date = {2021-05},
+  journaltitle = {IEEE Transactions on Dependable and Secure Computing},
+  volume = {18},
+  number = {3},
+  pages = {1150--1163},
+  issn = {1941-0018},
+  doi = {10.1109/TDSC.2019.2932736},
+  url = {https://ieeexplore.ieee.org/abstract/document/8786207?casa_token=QhKm6TQJknAAAAAA:mnt3qtOGbc0DatEXNTOzKkA5HfPk4JctZOjFAx2mF5xcuEsJFY4E3-vQ6-3maSAsIAsfG9il2Q},
+  urldate = {2023-09-27},
+  abstract = {We propose a novel framework called IDEA that exploits electromagnetic (EM) side-channel signals to detect malicious activity on embedded and cyber-physical systems (CPS). IDEA first records EM emanations from an uncompromised reference device to establish a baseline of reference EM patterns. IDEA then monitors the target device's EM emanations. When the observed EM emanations deviate from the reference patterns, IDEA reports this as an anomalous or malicious activity. IDEA does not require any resource or infrastructure on, or any modification to, the monitored system itself. In fact, IDEA is isolated from the target device, and monitors the device without any physical contact. We evaluate IDEA by monitoring the target device while it is executing embedded applications with malicious code injections such as Distributed Denial of Service (DDoS), Ransomware and code modification. We further implement a control-flow hijack attack, an advanced persistent threat, and a firmware modification on three CPSs: an embedded medical device called SyringePump, an industrial Proportional-Integral-Derivative (PID) Controller, and a Robotic Arm, using a popular embedded system, Arduino UNO. The results demonstrate that IDEA can detect different attacks with excellent accuracy (AUC {$>$} 99.5\%, and 100 percent detection with less than 1 percent false positives) from distances up to 3 m.},
+  eventtitle = {{{IEEE Transactions}} on {{Dependable}} and {{Secure Computing}}},
+  file = {/home/danesabo/Zotero/storage/EEM9BV5D/Khan et al. - 2021 - IDEA Intrusion Detection through Electromagnetic-.pdf}
+}
+
+@article{khanRequirementsDigitalTwindriven2020,
+  title = {On the Requirements of Digital Twin-Driven Autonomous Maintenance},
+  author = {Khan, Samir and Farnsworth, Michael and McWilliam, Richard and Erkoyuncu, John},
+  date = {2020},
+  journaltitle = {Annual Reviews in Control},
+  shortjournal = {Annu. Rev. Control},
+  volume = {50},
+  pages = {13--28},
+  publisher = {Pergamon-Elsevier Science Ltd},
+  location = {Oxford},
+  issn = {1367-5788},
+  doi = {10.1016/j.arcontrol.2020.08.003},
+  url = {http://www.webofscience.com/wos/woscc/summary/marked/relevance/1},
+  urldate = {2022-03-08},
+  abstract = {Autonomy has become a focal point for research and development in many industries. Whilst this was traditionally achieved by modelling self-engineering behaviours at the component-level, efforts are now being focused on the sub-system and system-level through advancements in artificial intelligence. Exploiting its benefits requires some innovative thinking to integrate overarching concepts from big data analysis, digitisation, sensing, optimisation, information technology, and systems engineering. With recent developments in Industry 4.0, machine learning and digital twin, there has been a growing interest in adapting these concepts to achieve autonomous maintenance; the automation of predictive maintenance scheduling directly from operational data and for in-built repair at the systems-level. However, there is still ambiguity whether state-of-the-art developments are truly autonomous or they simply automate a process. In light of this, it is important to present the current perspectives about where the technology stands today and indicate possible routes for the future. As a result, this effort focuses on recent trends in autonomous maintenance before moving on to discuss digital twin as a vehicle for decision making from the viewpoint of requirements, whilst the role of AI in assisting with this process is also explored. A suggested framework for integrating digital twin strategies within maintenance models is also discussed. Finally, the article looks towards future directions on the likely evolution and implications for its development as a sustainable technology.},
+  langid = {english},
+  annotation = {WOS:000600551200002},
+  file = {/home/danesabo/Zotero/storage/NPQ338UH/Khan et al. - 2020 - On the requirements of digital twin-driven autonom.pdf}
+}
+
+@article{khattakReviewCyberSecurity2017,
+  title = {Review of Cyber Security Applications in Nuclear Power Plants},
+  author = {Khattak, Muhammad Adil and Shaharuddin, Muhammad Khairy Harmaini and Haris, Muhammad Saiful Islam and Aminuddin, Muhammad Zuhaili Mohammad and Azhar, Nik Mohamad Amirul Nik and Ahmad, Nik Muhammad Hakimi Nik},
+  date = {2017},
+  journaltitle = {Journal of Advanced Research in Applied Sciences and Engineering Technology},
+  volume = {7},
+  number = {1},
+  pages = {43--54},
+  isbn = {2462-1943},
+  file = {/home/danesabo/Zotero/storage/22SMP5EI/Review of cyber security applications in nuclear power plants.pdf}
+}
+
+@article{kimCyberAttackTaxonomy2020,
+  title = {Cyber Attack Taxonomy for Digital Environment in Nuclear Power Plants},
+  author = {Kim, Seungmin and Heo, Gyunyoung and Zio, Enrico and Shin, Jinsoo and Song, Jae-gu},
+  date = {2020-05},
+  journaltitle = {Nuclear Engineering and Technology},
+  shortjournal = {Nuclear Engineering and Technology},
+  volume = {52},
+  number = {5},
+  pages = {995--1001},
+  issn = {17385733},
+  doi = {10.1016/j.net.2019.11.001},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S1738573319305443},
+  urldate = {2022-09-30},
+  abstract = {With the development of digital instrumentation and control (I\&C) devices, cyber security at nuclear power plants (NPPs) has become a hot issue. The Stuxnet, which destroyed Iran's uranium enrichment facility in 2010, suggests that NPPs could even lead to an accident involving the release of radioactive materials cyber-attacks.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/62DY99RU/Kim et al. - 2020 - Cyber attack taxonomy for digital environment in n.pdf}
+}
+
+@online{kimInterpretabilityFeatureAttribution2018,
+  title = {Interpretability {{Beyond Feature Attribution}}: {{Quantitative Testing}} with {{Concept Activation Vectors}} ({{TCAV}})},
+  shorttitle = {Interpretability {{Beyond Feature Attribution}}},
+  author = {Kim, Been and Wattenberg, Martin and Gilmer, Justin and Cai, Carrie and Wexler, James and Viegas, Fernanda and Sayres, Rory},
+  date = {2018-06-07},
+  eprint = {1711.11279},
+  eprinttype = {arXiv},
+  eprintclass = {stat},
+  url = {http://arxiv.org/abs/1711.11279},
+  urldate = {2023-10-11},
+  abstract = {The interpretation of deep learning models is a challenge due to their size, complexity, and often opaque internal state. In addition, many systems, such as image classifiers, operate on low-level features rather than high-level concepts. To address these challenges, we introduce Concept Activation Vectors (CAVs), which provide an interpretation of a neural net’s internal state in terms of human-friendly concepts. The key idea is to view the high-dimensional internal state of a neural net as an aid, not an obstacle. We show how to use CAVs as part of a technique, Testing with CAVs (TCAV), that uses directional derivatives to quantify the degree to which a user-defined concept is important to a classification result–for example, how sensitive a prediction of zebra is to the presence of stripes. Using the domain of image classification as a testing ground, we describe how CAVs may be used to explore hypotheses and generate insights for a standard image classification network as well as a medical application.},
+  langid = {english},
+  pubstate = {prepublished},
+  file = {/home/danesabo/Zotero/storage/QYN2BG7D/Kim et al. - 2018 - Interpretability Beyond Feature Attribution Quant.pdf}
+}
+
+@article{kimNuDEFormalMethodbased2017,
+  title = {{{NuDE}} 2.0: {{A Formal Method-based Software Development}}, {{Verification}} and {{Safety Analysis Environment}} for {{Digital I}}\&{{Cs}} in {{NPPs}}},
+  shorttitle = {{{NuDE}} 2.0},
+  author = {Kim, Eui-Sub and Lee, Dong-Ah and Jung, Sejin and Yoo, Junbeom and Choi, Jong-Gyun and Lee, Jang-Soo},
+  date = {2017-03-30},
+  journaltitle = {Journal of Computing Science and Engineering},
+  shortjournal = {Journal of Computing Science and Engineering},
+  volume = {11},
+  number = {1},
+  pages = {9--23},
+  issn = {1976-4677},
+  doi = {10.5626/JCSE.2017.11.1.9},
+  url = {http://koreascience.or.kr/journal/view.jsp?kj=E1EIKI&py=2017&vnc=v11n1&sp=9},
+  urldate = {2023-11-03},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/3SUWT244/Kim et al. - 2017 - NuDE 2.0 A Formal Method-based Software Developme.pdf}
+}
+
+@article{kimNuDEFormalMethodbased2017a,
+  title = {{{NuDE}} 2.0: {{A Formal Method-based Software Development}}, {{Verification}} and {{Safety Analysis Environment}} for {{Digital I}}\&{{Cs}} in {{NPPs}}},
+  shorttitle = {{{NuDE}} 2.0},
+  author = {Kim, Eui-Sub and Lee, Dong-Ah and Jung, Sejin and Yoo, Junbeom and Choi, Jong-Gyun and Lee, Jang-Soo},
+  date = {2017-03-30},
+  journaltitle = {Journal of Computing Science and Engineering},
+  shortjournal = {Journal of Computing Science and Engineering},
+  volume = {11},
+  number = {1},
+  pages = {9--23},
+  issn = {1976-4677},
+  doi = {10.5626/JCSE.2017.11.1.9},
+  url = {http://koreascience.or.kr/journal/view.jsp?kj=E1EIKI&py=2017&vnc=v11n1&sp=9},
+  urldate = {2023-10-10},
+  abstract = {NuDE 2.0 (Nuclear Development Environment 2.0) is a formal-method-based software development, verification and safety analysis environment for safety-critical digital I\&Cs implemented with programmable logic controller (PLC) and field-programmable gate array (FPGA). It simultaneously develops PLC/FPGA software implementations from one requirement/design specification and also helps most of the development, verification, and safety analysis to be performed mechanically and in sequence. The NuDE 2.0 now consists of 25 CASE tools and also includes an in-depth solution for indirect commercial off-the-shelf (COTS) software dedication of new FPGA-based digital I\&Cs. We expect that the NuDE 2.0 will be widely used as a means of diversifying software design/implementation and model-based software development methodology.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/DCL886HK/Kim et al. - 2017 - NuDE 2.0 A Formal Method-based Software Developme.pdf}
+}
+
+@inproceedings{kimSignoffBoundedFormal2014,
+  title = {Sign-off with {{Bounded Formal Verification Proofs}}},
+  booktitle = {Design and {{Verification Conference}}},
+  author = {Kim, NamDo and Park, Junhyuk and Singh, HarGovind and Singhal, Vigyan},
+  date = {2014},
+  file = {/home/danesabo/Zotero/storage/MWZM2L3R/Kim et al. - Sign-off with Bounded Formal Verification Proofs.pdf}
+}
+
+@article{kimSurveyMachineLearningBased2021,
+  title = {A {{Survey}} on {{Machine-Learning Based Security Design}} for {{Cyber-Physical Systems}}},
+  author = {Kim, Sangjun and Park, Kyung-Joon},
+  date = {2021-06},
+  journaltitle = {Applied Sciences-Basel},
+  shortjournal = {Appl. Sci.-Basel},
+  volume = {11},
+  number = {12},
+  pages = {5458},
+  publisher = {Mdpi},
+  location = {Basel},
+  doi = {10.3390/app11125458},
+  url = {http://www.webofscience.com/wos/woscc/summary/marked/relevance/1},
+  urldate = {2022-03-08},
+  abstract = {A cyber-physical system (CPS) is the integration of a physical system into the real world and control applications in a computing system, interacting through a communications network. Network technology connecting physical systems and computing systems enables the simultaneous control of many physical systems and provides intelligent applications for them. However, enhancing connectivity leads to extended attack vectors in which attackers can trespass on the network and launch cyber-physical attacks, remotely disrupting the CPS. Therefore, extensive studies into cyber-physical security are being conducted in various domains, such as physical, network, and computing systems. Moreover, large-scale and complex CPSs make it difficult to analyze and detect cyber-physical attacks, and thus, machine learning (ML) techniques have recently been adopted for cyber-physical security. In this survey, we provide an extensive review of the threats and ML-based security designs for CPSs. First, we present a CPS structure that classifies the functions of the CPS into three layers: the physical system, the network, and software applications. Then, we discuss the taxonomy of cyber-physical attacks on each layer, and in particular, we analyze attacks based on the dynamics of the physical system. We review existing studies on detecting cyber-physical attacks with various ML techniques from the perspectives of the physical system, the network, and the computing system. Furthermore, we discuss future research directions for ML-based cyber-physical security research in the context of real-time constraints, resiliency, and dataset generation to learn about the possible attacks.},
+  langid = {english},
+  annotation = {WOS:000666134100001},
+  file = {/home/danesabo/Zotero/storage/Y2LF649M/Kim and Park - 2021 - A Survey on Machine-Learning Based Security Design.pdf}
+}
+
+@online{kingmaAutoEncodingVariationalBayes2022,
+  title = {Auto-{{Encoding Variational Bayes}}},
+  author = {Kingma, Diederik P. and Welling, Max},
+  date = {2022-12-10},
+  eprint = {1312.6114},
+  eprinttype = {arXiv},
+  eprintclass = {cs, stat},
+  doi = {10.48550/arXiv.1312.6114},
+  url = {http://arxiv.org/abs/1312.6114},
+  urldate = {2023-10-05},
+  abstract = {How can we perform efficient inference and learning in directed probabilistic models, in the presence of continuous latent variables with intractable posterior distributions, and large datasets? We introduce a stochastic variational inference and learning algorithm that scales to large datasets and, under some mild differentiability conditions, even works in the intractable case. Our contributions are two-fold. First, we show that a reparameterization of the variational lower bound yields a lower bound estimator that can be straightforwardly optimized using standard stochastic gradient methods. Second, we show that for i.i.d. datasets with continuous latent variables per datapoint, posterior inference can be made especially efficient by fitting an approximate inference model (also called a recognition model) to the intractable posterior using the proposed lower bound estimator. Theoretical advantages are reflected in experimental results.},
+  pubstate = {prepublished},
+  note = {Comment: Fixes a typo in the abstract, no other changes},
+  file = {/home/danesabo/Zotero/storage/VCZMGLBD/Kingma and Welling - 2022 - Auto-Encoding Variational Bayes.pdf;/home/danesabo/Zotero/storage/5PDKNG4K/1312.html}
+}
+
+@article{kirschSurvivableSCADAIntrusionTolerant2014,
+  title = {Survivable {{SCADA Via Intrusion-Tolerant Replication}}},
+  author = {Kirsch, Jonathan and Goose, Stuart and Amir, Yair and Wei, Dong and Skare, Paul},
+  date = {2014-01},
+  journaltitle = {IEEE Transactions on Smart Grid},
+  volume = {5},
+  number = {1},
+  pages = {60--70},
+  issn = {1949-3061},
+  doi = {10.1109/TSG.2013.2269541},
+  abstract = {Providers of critical infrastructure services strive to maintain the high availability of their SCADA systems. This paper reports on our experience designing, architecting, and evaluating the first survivable SCADA system-one that is able to ensure correct behavior with minimal performance degradation even during cyber attacks that compromise part of the system. We describe the challenges we faced when integrating modern intrusion-tolerant protocols with a conventional SCADA architecture and present the techniques we developed to overcome these challenges. The results illustrate that our survivable SCADA system not only functions correctly in the face of a cyber attack, but that it also processes in excess of 20 000 messages per second with a latency of less than 30 ms, making it suitable for even large-scale deployments managing thousands of remote terminal units.},
+  eventtitle = {{{IEEE Transactions}} on {{Smart Grid}}},
+  file = {/home/danesabo/Zotero/storage/S2IDWZTW/Kirsch et al. - 2014 - Survivable SCADA Via Intrusion-Tolerant Replicatio.pdf;/home/danesabo/Zotero/storage/UW52ABP8/6576306.html}
+}
+
+@article{kirshnerModelBasedSystemsEngineering2023,
+  title = {Model-{{Based Systems Engineering Cybersecurity}} for {{Space Systems}}},
+  author = {Kirshner, Mitchell},
+  date = {2023-02},
+  journaltitle = {AEROSPACE},
+  shortjournal = {Aerospace},
+  volume = {10},
+  number = {2},
+  pages = {116},
+  publisher = {MDPI},
+  location = {Basel},
+  issn = {2226-4310},
+  doi = {10.3390/aerospace10020116},
+  url = {https://www.webofscience.com/wos/woscc/summary/563bee91-8c90-4554-ae8d-46c3ce0028ee-a808dfa0/relevance/1},
+  urldate = {2023-10-03},
+  abstract = {As industries in various sectors increasingly adopt model-based systems engineering (MBSE) for system lifecycle design and development, engineers can manage and describe systems of higher complexity than ever before. This is especially true for the field of space systems; while past missions have developed using document-based planning, it is only in the last several years that NASA and other organizations in the space industry have begun using MBSE. One crucial factor of space systems development that is often overlooked is cybersecurity. As space systems become more complex and cyberphysical in nature, cybersecurity requirements become more difficult to capture, especially through document-based methods; a need for a means by which to continuously verify and validate systems cybersecurity for cyberphysical space missions arises. By expanding upon a National Institute of Standards and Technology (NIST) framework for cyber resiliency, this work proposes a methodology that uses MBSE traceability functionality to demonstrate adequate cybersecurity for cyberphysical space systems using SysML requirements modeling capabilities. Key goals, objectives, and strategic principles leading to achieving cybersecurity at all levels of the system's architectural hierarchy are presented. Recommendations for the future of space cybersecurity include the addition of the space sector to the Department of Homeland Security Cybersecurity \& Infrastructure Security Agency's list of critical infrastructure sectors to improve standardization and control of space cyberinfrastructure.},
+  langid = {english},
+  pagetotal = {17},
+  annotation = {Web of Science ID: WOS:000938268900001},
+  file = {/home/danesabo/Zotero/storage/P6YLUP6I/Kirshner - 2023 - Model-Based Systems Engineering Cybersecurity for .pdf}
+}
+
+@article{kleinComprehensiveFormalVerification2014,
+  title = {Comprehensive {{Formal Verification}} of an {{OS Microkernel}}},
+  author = {Klein, Gerwin and Andronick, June and Elphinstone, Kevin and Murray, Toby and Sewell, Thomas and Kolanski, Rafal and Heiser, Gernot},
+  date = {2014-02},
+  journaltitle = {ACM TRANSACTIONS ON COMPUTER SYSTEMS},
+  shortjournal = {ACM Trans. Comput. Syst.},
+  volume = {32},
+  number = {1},
+  pages = {2},
+  publisher = {Assoc Computing Machinery},
+  location = {New York},
+  issn = {0734-2071, 1557-7333},
+  doi = {10.1145/2560537},
+  url = {https://www.webofscience.com/api/gateway?GWVersion=2&SrcAuth=DOISource&SrcApp=WOS&KeyAID=10.1145%2F2560537&DestApp=DOI&SrcAppSID=USW2EC0EC1PuWMCSXOYkyOwTcd6Fm&SrcJTitle=ACM+TRANSACTIONS+ON+COMPUTER+SYSTEMS&DestDOIRegistrantName=Association+for+Computing+Machinery},
+  urldate = {2023-12-13},
+  abstract = {We present an in-depth coverage of the comprehensive machine-checked formal verification of seL4, a general-purpose operating system microkernel. We discuss the kernel design we used to make its verification tractable. We then describe the functional correctness proof of the kernel's C implementation and we cover further steps that transform this result into a comprehensive formal verification of the kernel: a formally verified IPC fastpath, a proof that the binary code of the kernel correctly implements the C semantics, a proof of correct access-control enforcement, a proof of information-flow noninterference, a sound worst-case execution time analysis of the binary, and an automatic initialiser for user-level systems that connects kernel-level access-control enforcement with reasoning about system behaviour. We summarise these results and show how they integrate to form a coherent overall analysis, backed by machine-checked, end-to-end theorems. The seL4 microkernel is currently not just the only general-purpose operating system kernel that is fully formally verified to this degree. It is also the only example of formal proof of this scale that is kept current as the requirements, design and implementation of the system evolve over almost a decade. We report on our experience in maintaining this evolving formally verified code base.},
+  langid = {english},
+  pagetotal = {70},
+  annotation = {Web of Science ID: WOS:000332125400002},
+  file = {/home/danesabo/Zotero/storage/8WDLRDB8/Klein et al. - 2014 - Comprehensive Formal Verification of an OS Microke.pdf}
+}
+
+@article{kleinFormallyVerifiedSoftware2018,
+  title = {Formally Verified Software in the Real World},
+  author = {Klein, Gerwin and Andronick, June and Fernandez, Matthew and Kuz, Ihor and Murray, Toby and Heiser, Gernot},
+  date = {2018-09-26},
+  journaltitle = {Commun. ACM},
+  volume = {61},
+  number = {10},
+  pages = {68--77},
+  issn = {0001-0782},
+  doi = {10.1145/3230627},
+  url = {https://dl.acm.org/doi/10.1145/3230627},
+  urldate = {2024-08-12},
+  abstract = {Verified software secures the Unmanned Little Bird autonomous helicopter against mid-flight cyber attacks.},
+  keywords = {Control systems,Cybersecurity,Formal methods,formal verification,penetration testing},
+  file = {/home/danesabo/Zotero/storage/XNCF39K8/Klein et al. - 2018 - Formally verified software in the real world.pdf}
+}
+
+@inproceedings{kleinSeL4FormalVerification2009,
+  title = {{{seL4}}: Formal Verification of an {{OS}} Kernel},
+  shorttitle = {{{seL4}}},
+  booktitle = {Proceedings of the {{ACM SIGOPS}} 22nd Symposium on {{Operating}} Systems Principles},
+  author = {Klein, Gerwin and Elphinstone, Kevin and Heiser, Gernot and Andronick, June and Cock, David and Derrin, Philip and Elkaduwe, Dhammika and Engelhardt, Kai and Kolanski, Rafal and Norrish, Michael and Sewell, Thomas and Tuch, Harvey and Winwood, Simon},
+  date = {2009-10-11},
+  pages = {207--220},
+  publisher = {ACM},
+  location = {Big Sky Montana USA},
+  doi = {10.1145/1629575.1629596},
+  url = {https://dl.acm.org/doi/10.1145/1629575.1629596},
+  urldate = {2023-11-03},
+  eventtitle = {{{SOSP09}}: {{ACM SIGOPS}} 22nd {{Symposium}} on {{Operating Systems Principles}}},
+  isbn = {978-1-60558-752-3},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/P6TTYKPW/Klein et al. - 2009 - seL4 formal verification of an OS kernel.pdf}
+}
+
+@article{kochunasDigitalTwinConcepts2021,
+  title = {Digital {{Twin Concepts}} with {{Uncertainty}} for {{Nuclear Power Applications}}},
+  author = {Kochunas, Brendan and Huan, Xun},
+  date = {2021-07-14},
+  journaltitle = {Energies},
+  shortjournal = {Energies},
+  volume = {14},
+  number = {14},
+  pages = {4235},
+  issn = {1996-1073},
+  doi = {10.3390/en14144235},
+  url = {https://www.mdpi.com/1996-1073/14/14/4235},
+  urldate = {2022-03-02},
+  abstract = {Digital Twins (DTs) are receiving considerable attention from multiple disciplines. Much of the literature at this time is dedicated to the conceptualization of digital twins, and associated enabling technologies and challenges. In this paper, we consider these propositions for the specific application of nuclear power. Our review finds that the current DT concepts are amenable to nuclear power systems, but benefit from some modifications and enhancements. Further, some areas of the existing modeling and simulation infrastructure around nuclear power systems are adaptable to DT development, while more recent efforts in advanced modeling and simulation are less suitable at this time. For nuclear power applications, DT development should rely first on mechanistic model-based methods to leverage the extensive experience and understanding of these systems. Model-free techniques can then be adopted to selectively, and correctively, augment limitations in the model-based approaches. Challenges to the realization of a DT are also discussed, with some being unique to nuclear engineering, however most are broader. A challenging aspect we discuss in detail for DTs is the incorporation of uncertainty quantification (UQ). Forward UQ enables the propagation of uncertainty from the digital representations to predict behavior of the physical asset. Similarly, inverse UQ allows for the incorporation of data from new measurements obtained from the physical asset back into the DT. Optimization under uncertainty facilitates decision support through the formal methods of optimal experimental design and design optimization that maximize information gain, or performance, of the physical asset in an uncertain environment.},
+  langid = {english},
+  keywords = {DGC read,uncertainty quantification},
+  file = {/home/danesabo/Zotero/storage/RCXS8AQS/DT concepts with uncertainty for NP applications.pdf}
+}
+
+@article{koGPBayesFiltersBayesianFiltering2009,
+  title = {{{GP-BayesFilters}}: {{Bayesian}} Filtering Using {{Gaussian}} Process Prediction and Observation Models},
+  shorttitle = {{{GP-BayesFilters}}},
+  author = {Ko, Jonathan and Fox, Dieter},
+  date = {2009-07-01},
+  journaltitle = {Autonomous Robots},
+  shortjournal = {Auton Robot},
+  volume = {27},
+  number = {1},
+  pages = {75--90},
+  issn = {1573-7527},
+  doi = {10.1007/s10514-009-9119-x},
+  url = {https://doi.org/10.1007/s10514-009-9119-x},
+  urldate = {2022-04-21},
+  abstract = {Bayesian filtering is a general framework for recursively estimating the state of a dynamical system. Key components of each Bayes filter are probabilistic prediction and observation models. This paper shows how non-parametric Gaussian process (GP) regression can be used for learning such models from training data. We also show how Gaussian process models can be integrated into different versions of Bayes filters, namely particle filters and extended and unscented Kalman filters. The resulting GP-BayesFilters can have several advantages over standard (parametric) filters. Most importantly, GP-BayesFilters do not require an accurate, parametric model of the system. Given enough training data, they enable improved tracking accuracy compared to parametric models, and they degrade gracefully with increased model uncertainty. These advantages stem from the fact that GPs consider both the noise in the system and the uncertainty in the model. If an approximate parametric model is available, it can be incorporated into the GP, resulting in further performance improvements. In experiments, we show different properties of GP-BayesFilters using data collected with an autonomous micro-blimp as well as synthetic data.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/SQPJYKLF/Ko and Fox - 2009 - GP-BayesFilters Bayesian filtering using Gaussian.pdf}
+}
+
+@article{kohlerCloudBasedDigitalTwin2024,
+  title = {Cloud-{{Based Digital Twin}} for {{Distribution Grids}}: {{What Is Already Available Today}}},
+  shorttitle = {Cloud-{{Based Digital Twin}} for {{Distribution Grids}}},
+  author = {Köhler, Christian and Kersten, René and Schöpf, Michael},
+  date = {2024-01},
+  journaltitle = {IEEE Power and Energy Magazine},
+  volume = {22},
+  number = {1},
+  pages = {72--80},
+  issn = {1558-4216},
+  doi = {10.1109/MPE.2023.3336255},
+  url = {https://ieeexplore.ieee.org/document/10398568/},
+  urldate = {2024-03-13},
+  abstract = {The increase in decentralized fluctuating feed-in at low-, medium-, and high-voltage levels associated with the expansion of renewable energies and the emergence of new volatile loads and storage systems is increasingly influencing the overall system behavior of the energy supply and therefore requires a more proactive role for the distribution system operator (DSO). Low and medium grid voltage levels in particular have a pivotal role here, as a significant part of renewable energy feed-in, and almost any new volatile loads, such as heat pumps and electric vehicles, are connected on these levels. Thus far, especially on the low-voltage level, most grid operators encounter a lack of transparency and controllability. It is essential for the integration of renewable energies and volatile loads to have information on power flows and power quality. Hence, massive investments in grid, measurement, and telecontrol infrastructure would be necessary. Using intelligent software technology for grid management can significantly decrease these necessary investments.},
+  eventtitle = {{{IEEE Power}} and {{Energy Magazine}}},
+  file = {/home/danesabo/Zotero/storage/VSNPRAN8/Köhler et al. - 2024 - Cloud-Based Digital Twin for Distribution Grids W.pdf;/home/danesabo/Zotero/storage/LWGT8HRD/10398568.html}
+}
+
+@online{kongDiffWaveVersatileDiffusion2020,
+  title = {{{DiffWave}}: {{A Versatile Diffusion Model}} for {{Audio Synthesis}}},
+  shorttitle = {{{DiffWave}}},
+  author = {Kong, Zhifeng and Ping, Wei and Huang, Jiaji and Zhao, Kexin and Catanzaro, Bryan},
+  date = {2020},
+  doi = {10.48550/ARXIV.2009.09761},
+  url = {https://arxiv.org/abs/2009.09761},
+  urldate = {2024-05-20},
+  abstract = {In this work, we propose DiffWave, a versatile diffusion probabilistic model for conditional and unconditional waveform generation. The model is non-autoregressive, and converts the white noise signal into structured waveform through a Markov chain with a constant number of steps at synthesis. It is efficiently trained by optimizing a variant of variational bound on the data likelihood. DiffWave produces high-fidelity audios in different waveform generation tasks, including neural vocoding conditioned on mel spectrogram, class-conditional generation, and unconditional generation. We demonstrate that DiffWave matches a strong WaveNet vocoder in terms of speech quality (MOS: 4.44 versus 4.43), while synthesizing orders of magnitude faster. In particular, it significantly outperforms autoregressive and GAN-based waveform models in the challenging unconditional generation task in terms of audio quality and sample diversity from various automatic and human evaluations.},
+  pubstate = {prepublished},
+  version = {3},
+  keywords = {Audio and Speech Processing (eess.AS),Computation and Language (cs.CL),FOS: Computer and information sciences,FOS: Electrical engineering electronic engineering information engineering,Machine Learning (cs.LG),Machine Learning (stat.ML),Sound (cs.SD)},
+  note = {\subsection{Other}
+
+ICLR 2021 (oral)}
+}
+
+@incollection{kongDReachDReachabilityAnalysis2015,
+  title = {{{dReach}}: δ-{{Reachability Analysis}} for {{Hybrid Systems}}},
+  shorttitle = {{{dReach}}},
+  booktitle = {Tools and {{Algorithms}} for the {{Construction}} and {{Analysis}} of {{Systems}}},
+  author = {Kong, Soonho and Gao, Sicun and Chen, Wei and Clarke, Edmund},
+  editor = {Baier, Christel and Tinelli, Cesare},
+  date = {2015},
+  volume = {9035},
+  pages = {200--205},
+  publisher = {Springer Berlin Heidelberg},
+  location = {Berlin, Heidelberg},
+  doi = {10.1007/978-3-662-46681-0_15},
+  url = {http://link.springer.com/10.1007/978-3-662-46681-0_15},
+  urldate = {2023-11-02},
+  isbn = {978-3-662-46680-3 978-3-662-46681-0},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/PC3HFWNV/Kong et al. - 2015 - dReach δ-Reachability Analysis for Hybrid Systems.pdf}
+}
+
+@inproceedings{kottlerFormalVerificationLadder2017,
+  title = {Formal Verification of Ladder Logic Programs Using {{NuSMV}}},
+  booktitle = {{{SoutheastCon}} 2017},
+  author = {Kottler, Sam and Khayamy, Mehdy and Hasan, Syed Rafay and Elkeelany, Omar},
+  date = {2017-03},
+  pages = {1--5},
+  publisher = {IEEE},
+  location = {Concord, NC, USA},
+  doi = {10.1109/SECON.2017.7925390},
+  url = {http://ieeexplore.ieee.org/document/7925390/},
+  urldate = {2023-10-10},
+  abstract = {Programmable logic controllers (PLCs) are heavyduty computers used to control industrial systems. For many years these systems were physically separated from any other network making attacks extremely difficult. However, these increasingly connected systems have not improved much in terms of security, leaving them vulnerable to attacks. This paper attempts to show that ladder logic programs for PLCs can be modeled in NuSMV and verified using computational tree logic (CTL) specifications. This paper also shows how simple changes to the ladder logic program can cause catastrophic damage to the PLC system. This intruded code can be difficult to detect by looking at the ladder logic program because the change is so small. However, the intruded code can be modeled in NuSMV and identified by properly written CTL specifications.},
+  eventtitle = {{{SoutheastCon}} 2017},
+  isbn = {978-1-5386-1539-3},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/FSKKZK3C/Kottler et al. - 2017 - Formal verification of ladder logic programs using.pdf}
+}
+
+@inproceedings{kovacsFrameworkUsingFormal2010,
+  title = {A {{Framework}} for {{Using Formal Methods}} in {{Process Control}}},
+  booktitle = {Proceedings of the 1st {{ISW}} on {{DCS}}},
+  author = {Kovacs, Gabor and Pietrac, Laurent},
+  date = {2010},
+  pages = {66--76},
+  url = {http://lpietrac.free.fr/publis/Kovacs-2010-iswdcs.pdf},
+  urldate = {2022-06-20},
+  eventtitle = {1st {{ISW}} on {{DCS}}},
+  isbn = {978-963-661-950-3},
+  file = {/home/danesabo/Zotero/storage/7BGPLBH2/Kovacs-2010-iswdcs.pdf}
+}
+
+@article{krauseCybersecurityPowerGrids2021,
+  title = {Cybersecurity in {{Power Grids}}: {{Challenges}} and {{Opportunities}}},
+  shorttitle = {Cybersecurity in {{Power Grids}}},
+  author = {Krause, Tim and Ernst, Raphael and Klaer, Benedikt and Hacker, Immanuel and Henze, Martin},
+  date = {2021-09-16},
+  journaltitle = {Sensors},
+  shortjournal = {Sensors},
+  volume = {21},
+  number = {18},
+  eprint = {2105.00013},
+  eprinttype = {arXiv},
+  pages = {6225},
+  issn = {1424-8220},
+  doi = {10.3390/s21186225},
+  url = {http://arxiv.org/abs/2105.00013},
+  urldate = {2022-03-22},
+  abstract = {Increasing volatilities within power transmission and distribution force power grid operators to amplify their use of communication infrastructure to monitor and control their grid. The resulting increase in communication creates a larger attack surface for malicious actors. Indeed, cyber attacks on power grids have already succeeded in causing temporary, large-scale blackouts in the recent past. In this paper, we analyze the communication infrastructure of power grids to derive resulting fundamental challenges of power grids with respect to cybersecurity. Based on these challenges, we identify a broad set of resulting attack vectors and attack scenarios that threaten the security of power grids. To address these challenges, we propose to rely on a defense-in-depth strategy, which encompasses measures for (i) device and application security, (ii) network security, (iii) physical security, as well as (iv) policies, procedures, and awareness. For each of these categories, we distill and discuss a comprehensive set of state-of-the art approaches, and identify further opportunities to strengthen cybersecurity in interconnected power grids.},
+  keywords = {DGC read},
+  note = {Comment: 19 pages, 2 figures, 1 table},
+  file = {/home/danesabo/Zotero/storage/4G3A2ZG6/Krause et al. - 2021 - Cybersecurity in Power Grids Challenges and Oppor.pdf;/home/danesabo/Zotero/storage/6M69ML7H/2105.html}
+}
+
+@article{krishnamurthyGeneralisedResilienceModels2020,
+  title = {Generalised Resilience Models for Power Systems and Dependent Infrastructure during Extreme Events},
+  author = {Krishnamurthy, Vaidyanathan and Huang, Bing and Kwasinski, Alexis and Pierce, Evan and Baldick, Ross},
+  date = {2020},
+  journaltitle = {IET Smart Grid},
+  volume = {3},
+  number = {2},
+  pages = {194--206},
+  issn = {2515-2947},
+  doi = {10.1049/iet-stg.2019.0170},
+  url = {https://onlinelibrary.wiley.com/doi/abs/10.1049/iet-stg.2019.0170},
+  urldate = {2022-03-25},
+  abstract = {This study presents a generalised critical infrastructures resilience model for extreme events with a focus on power grids. Infrastructures are modelled as three domains – physical, cyber, and human. Each domain is described with respect to the services it provides. Each domain is represented by geometric graphs for each service it provides. The resilience models use geometric graphs with each graph's nodes and edges characterised based on relevant attributes. This study also discusses various applied aspects related to resilience models including the impact of changing operating environment, human-driven processes, such as logistics, and service buffers. Due to their stated particular importance in the U.S. Presidential Policy Directive 21, particular attention is placed on the power infrastructure and its impact on the public communication infrastructures as a main critical load. This study focuses on the multi-time scale power system operation to capture cascading outages within, and subsequently to its dependent infrastructure – the public communication system (e.g. wireless or ‘cellular’ communication networks) as a main critical load. This study illustrates the merits of the proposed models in calculating resilience in extreme events and derives physical domain representation for electric and communication systems using cell tower and substation data from the USA.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/5Q83LXXE/Krishnamurthy et al. - 2020 - Generalised resilience models for power systems an.pdf}
+}
+
+@online{Kry10TechnicalOverview,
+  title = {Kry10 {{Technical Overview}}},
+  url = {https://uploads-ssl.webflow.com/635675151c946163c2012450/66395a8a675c74f82097a749_kry10-technical-overview.pdf},
+  urldate = {2024-08-12},
+  abstract = {Kry10 provides a secure operating system and other software for smart machines and other connected industrial systems. Built on a secure foundation which is mathematically proven to be functionally correct, the OS removes many classes of vulnerabilities that most common operating systems are susceptible to. While software backed by formal methods has been available for several decades, formal methods have not been adopted at scale because they weren’t usable. The Kry10 suite of developer tools and libraries has solved the usability problem. Developers can now code on a secure OS easily and efficiently. The Kry10 tools include familiar languages and development tools: • Support common languages such as Rust and C • Include build systems and libraries of reusable, attestable code.}
+}
+
+@online{Kry10TechnicalOverviewa,
+  title = {Kry10 {{Technical Overview}}},
+  url = {https://uploads-ssl.webflow.com/635675151c946163c2012450/66395a8a675c74f82097a749_kry10-technical-overview.pdf},
+  urldate = {2024-08-12},
+  file = {/home/danesabo/Zotero/storage/LEU7QMKH/66395a8a675c74f82097a749_kry10-technical-overview.pdf}
+}
+
+@online{kulikSurveyPracticalFormal2021,
+  title = {A {{Survey}} of {{Practical Formal Methods}} for {{Security}}},
+  author = {Kulik, Tomas and Dongol, Brijesh and Larsen, Peter Gorm and Macedo, Hugo Daniel and Schneider, Steve and Tran-Jørgensen, Peter Würtz Vinther and Woodcock, Jim},
+  date = {2021-09-03},
+  eprint = {2109.01362},
+  eprinttype = {arXiv},
+  eprintclass = {cs},
+  url = {http://arxiv.org/abs/2109.01362},
+  urldate = {2023-10-10},
+  abstract = {In today’s world, critical infrastructure is often controlled by computing systems. This introduces new risks for cyber attacks, which can compromise the security and disrupt the functionality of these systems. It is therefore necessary to build such systems with strong guarantees of resiliency against cyber attacks. One way to achieve this level of assurance is using formal verification, which provides proofs of system compliance with desired cyber security properties. The use of Formal Methods (FM) in aspects of cyber security and safety-critical systems are reviewed in this article. We split FM into the three main classes: theorem proving, model checking and lightweight FM. To allow the different uses of FM to be compared, we define a common set of terms. We further develop categories based on the type of computing system FM are applied in. Solutions in each class and category are presented, discussed, compared and summarised. We describe historical highlights and developments and present a state-of-the-art review in the area of FM in cyber security. This review is presented from the point of view of FM practitioners and researchers, commenting on the trends in each of the classes and categories. This is achieved by considering all types of FM, several types of security and safety critical systems and by structuring the taxonomy accordingly. The article hence provides a comprehensive overview of FM and techniques available to system designers of security-critical systems, simplifying the process of choosing the right tool for the task. The article concludes by summarising the discussion of the review, focusing on best practices, challenges, general future trends and directions of research within this field.},
+  langid = {english},
+  pubstate = {prepublished},
+  note = {Comment: Technical Report, Long survey version},
+  file = {/home/danesabo/Zotero/storage/DE5L3BKT/Kulik et al. - 2021 - A Survey of Practical Formal Methods for Security.pdf}
+}
+
+@inproceedings{kumarModelingVerificationTimed2016,
+  title = {Modeling and Verification of Timed Automaton Based Hybrid Systems Using Spin Model Checker},
+  booktitle = {2016 {{IEEE Annual India Conference}} ({{INDICON}})},
+  author = {Kumar, N Suresh and Kumar, G Santhosh},
+  date = {2016-12},
+  pages = {1--8},
+  publisher = {IEEE},
+  location = {Bangalore, India},
+  doi = {10.1109/INDICON.2016.7839011},
+  url = {http://ieeexplore.ieee.org/document/7839011/},
+  urldate = {2023-10-10},
+  abstract = {Cyber Physical Systems are composition of physical processes and discrete computational elements. Modeling and verification of such systems require mechanisms that incorporate continuos behaviour for monitoring physical events and descrete behaviour for computational elements. Passage of time is a fundamental property to be modelled and hybrid systems incorporate this aspect directly in the automaton of the model. In this paper a validation model for a timed automata is modeled using PROMELA and is verified using Spin model checker. The novelty of the proposed work is an attempt to model timed automata based hybrid systems using the basic constructs of PROMELA. Verification of safety and correctness properties of a traffic controller modeled as a hybrid system is attempted. Further a traffic light controller protocol consisting of four such controllers are introduced,their interactions and properties were verified. The proposed work provide an easy and effective way to build protocols for timed automaton based systems using Spin Model Checker.},
+  eventtitle = {2016 {{IEEE Annual India Conference}} ({{INDICON}})},
+  isbn = {978-1-5090-3646-2},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/QNFRW5ZK/Kumar and Kumar - 2016 - Modeling and verification of timed automaton based.pdf}
+}
+
+@article{kunzFormalMethodologyAccomplishing2017,
+  title = {A {{Formal Methodology}} for {{Accomplishing IEC}} 61850 {{Real-Time Communication Requirements}}},
+  author = {Kunz, Guilherme and Machado, Jose and Perondi, Eduardo and Vyatkin, Valeriy},
+  date = {2017-08},
+  journaltitle = {IEEE Transactions on Industrial Electronics},
+  shortjournal = {IEEE Trans. Ind. Electron.},
+  volume = {64},
+  number = {8},
+  pages = {6582--6590},
+  issn = {0278-0046, 1557-9948},
+  doi = {10.1109/TIE.2017.2682042},
+  url = {http://ieeexplore.ieee.org/document/7878522/},
+  urldate = {2023-10-10},
+  abstract = {Reliability is extremely important for control systems of energy distribution and generation. The IEC 61850 standard specifies an open architecture and communication protocols for such applications. The standard defines an open control architecture for networked control systems composed by intelligent electronic devices, stating some requirements that must be accomplished when developing reliable controllers for such systems. In this paper, we present a systematic and formal methodology to be adopted to achieve the correct implementation of the communication requirements of this standard. The methodology consists in five steps: modeling of real-time communication requirements defined by the standard; simulation of the obtained model; formal verification of the model, improved in the previous step; translation of the global model (simulated and verified) into the input language of the real controller; and finally, application of conformance testing technique to the computational routine implemented in the real controller. Presented research deals with the proposition of a strategy to synthesize and validate models of systems developed under IEC61850 real-time requirements (GOOSE and SMV) through simple operational conditions cases that, once validated, can be used in performance and conformance testing of more complex systems. The proposed methodology allows designers to synthesize reliable systems under IEC61850 real-time communication requirements.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/LK3YVJ4H/Kunz et al. - 2017 - A Formal Methodology for Accomplishing IEC 61850 R.pdf}
+}
+
+@article{kushnerRealStoryStuxnet2013,
+  title = {The Real Story of Stuxnet},
+  author = {Kushner, David},
+  date = {2013-03},
+  journaltitle = {IEEE Spectrum},
+  volume = {50},
+  number = {3},
+  pages = {48--53},
+  issn = {1939-9340},
+  doi = {10.1109/MSPEC.2013.6471059},
+  url = {https://ieeexplore.ieee.org/document/6471059},
+  urldate = {2024-08-13},
+  abstract = {The paper discusses how Kaspersky Lab tracked down the malware that stymied Iran's nuclear-fuel enrichment program.},
+  eventtitle = {{{IEEE Spectrum}}},
+  keywords = {Companies,Computer hacking,Computer security,Computer viruses,Cryptography,Malware},
+  file = {/home/danesabo/Zotero/storage/EITGZ842/Kushner - 2013 - The real story of stuxnet.pdf;/home/danesabo/Zotero/storage/EYIA8T2A/6471059.html}
+}
+
+@incollection{kusmenkoModelingArchitecturesCyberPhysical2017,
+  title = {Modeling {{Architectures}} of {{Cyber-Physical Systems}}},
+  booktitle = {Modelling {{Foundations}} and {{Applications}}},
+  author = {Kusmenko, Evgeny and Roth, Alexander and Rumpe, Bernhard and Von Wenckstern, Michael},
+  editor = {Anjorin, Anthony and Espinoza, Huáscar},
+  date = {2017},
+  volume = {10376},
+  pages = {34--50},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-319-61482-3_3},
+  url = {http://link.springer.com/10.1007/978-3-319-61482-3_3},
+  urldate = {2023-11-08},
+  abstract = {Cyber-physical systems (CPS) in automotive or robotics industry comprise many different specific features, e.g., trajectory planning, lane correction, battery management or engine control, requiring a steady interaction with their environment over sensors and actuators. Assembling all these different features is one of the key challenges in the development of such complex systems. Component and connector (C\&C) models are widely used for the design and development of CPS to represent features and their logical interaction. An advantage of C\&C models is that complex features can be hierarchically decomposed into subfeatures, developed and managed by different domain experts. In this paper, we present the textual modeling family MontiCAR, Modeling and Testing of Cyber-Physical Architectures. It is based on the C\&C paradigm and increases development efficiency of CPS by incorporating (i) component and connector arrays, (ii) name and index based autoconnections, (iii) a strict type system with unit and accuracy support, as well as (iv) an advanced Math language supporting BLAS operations and matrix classifications. Arrays and their autoconnection modes allow an efficient way of modeling redundant components such as front and rear park sensors or an LED matrix system containing hundreds of single dimmable lights. The strict type system and matrix classification provide means for integrated static verification of C\&C architectures at compile time minimizing bug-fixing related costs. The capabilities and benefits of the proposed language family are demonstrated by a running example of a parking assistance system.},
+  isbn = {978-3-319-61481-6 978-3-319-61482-3},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/EBGSC6L2/Kusmenko et al. - 2017 - Modeling Architectures of Cyber-Physical Systems.pdf}
+}
+
+@report{kwasinskiConceptualFrameworkAssessing2016,
+  title = {A {{Conceptual Framework}} for {{Assessing Resilience}} at the {{Community Scale}}},
+  author = {Kwasinski, Alexis and Trainor, Joseph and Wolshon, Brian and Lavelle, Francis M.},
+  date = {2016-01},
+  number = {NIST GCR 16-001},
+  pages = {NIST GCR 16-001},
+  institution = {{National Institute of Standards and Technology}},
+  doi = {10.6028/NIST.GCR.16-001},
+  url = {https://nvlpubs.nist.gov/nistpubs/gcr/2016/NIST.GCR.16-001.pdf},
+  urldate = {2022-03-25},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/E4R2PHQ2/Kwasinski et al. - 2016 - A Conceptual Framework for Assessing Resilience at.pdf}
+}
+
+@inproceedings{kwasinskiGeneralizedIntegratedFramework2017,
+  title = {Generalized Integrated Framework for Modelling Communications and Electric Power Infrastructure Resilience},
+  booktitle = {2017 {{IEEE International Telecommunications Energy Conference}} ({{IN}}℡{{EC}})},
+  author = {Kwasinski, Alexis and Krishnamurthy, Vaidyanathan},
+  date = {2017-10},
+  pages = {99--106},
+  issn = {0275-0473},
+  doi = {10.1109/INTLEC.2017.8211686},
+  abstract = {This paper presents a quantitative framework for modeling electric power and communications infrastructures resilience. While in the past, resilience models applied to these infrastructures have focused on technological aspects, a fundamental novel aspect of the herein presented framework is the integral inclusion of models for human-driven processes, such as logistics, that influences recovery speed. Another fundamental novel aspect of the presented modeling framework is the generalized representation of dependencies and the characterization of the role that service buffers, such as energy storage, have on representing dependencies of associated services. Infrastructure system models combine three interconnected domains, each mathematically represented by at least one graph: a physical domain, a human/organizational domain, and a cyber domain. Each of the graphs that form the proposed framework represent the provision of a service. Thus, modeling of functional dependencies is inherently part of the developed models.},
+  eventtitle = {2017 {{IEEE International Telecommunications Energy Conference}} ({{IN}}℡{{EC}})},
+  file = {/home/danesabo/Zotero/storage/5VKLB6R2/Kwasinski and Krishnamurthy - 2017 - Generalized integrated framework for modelling com.pdf}
+}
+
+@inproceedings{kwasinskiModelingCyberPhysicalIntraDependencies2020,
+  title = {Modeling of {{Cyber-Physical Intra-Dependencies}} in {{Electric Power Grids}} and {{Their Effect}} on {{Resilience}}},
+  booktitle = {2020 8th {{Workshop}} on {{Modeling}} and {{Simulation}} of {{Cyber-Physical Energy Systems}}},
+  author = {Kwasinski, Alexis},
+  date = {2020-04},
+  pages = {1--6},
+  doi = {10.1109/MSCPES49613.2020.9133702},
+  abstract = {This paper studies the modeling of cyber-physical dependencies observed within power grids and the effects of these intra-dependencies, on power grid resilience, which is evaluated quantitatively. A fundamental contribution of this paper is the description of the critically important role played by cyber-physical buffers as key components to limit the negative effect of intra-dependencies on power grids resilience. Although resilience issues in the electric power provision service could be limited thanks to the use of local energy storage devices as the realization of service buffers, minimal to no autonomy in data connectivity buffers make cyber vulnerabilities specially critical in terms of resilience. This paper also explains how these models can be used for improved power grids resilience planning considering internal cyber-physical interactions.},
+  eventtitle = {2020 8th {{Workshop}} on {{Modeling}} and {{Simulation}} of {{Cyber-Physical Energy Systems}}},
+  file = {/home/danesabo/Zotero/storage/KVH4THGY/Kwasinski - 2020 - Modeling of Cyber-Physical Intra-Dependencies in E.pdf}
+}
+
+@article{kwonReachabilityAnalysisSafety2018,
+  title = {Reachability {{Analysis}} for {{Safety Assurance}} of {{Cyber-Physical Systems Against Cyber Attacks}}},
+  author = {Kwon, Cheolhyeon and Hwang, Inseok},
+  date = {2018-07},
+  journaltitle = {IEEE Transactions on Automatic Control},
+  shortjournal = {IEEE Trans. Automat. Contr.},
+  volume = {63},
+  number = {7},
+  pages = {2272--2279},
+  issn = {0018-9286, 1558-2523, 2334-3303},
+  doi = {10.1109/TAC.2017.2761762},
+  url = {https://ieeexplore.ieee.org/document/8063959/},
+  urldate = {2023-11-03}
+}
+
+@article{kyoung-daekimCyberPhysicalSystems2012,
+  title = {Cyber–{{Physical Systems}}: {{A Perspective}} at the {{Centennial}}},
+  shorttitle = {Cyber–{{Physical Systems}}},
+  author = {{Kyoung-Dae Kim} and Kumar, P. R.},
+  date = {2012-05},
+  journaltitle = {Proceedings of the IEEE},
+  shortjournal = {Proc. IEEE},
+  volume = {100},
+  pages = {1287--1308},
+  issn = {0018-9219, 1558-2256},
+  doi = {10.1109/JPROC.2012.2189792},
+  url = {http://ieeexplore.ieee.org/document/6176187/},
+  urldate = {2023-09-27},
+  abstract = {Cyber–physical systems (CPSs) are the next generation of engineered systems in which computing, communication, and control technologies are tightly integrated. Research on CPSs is fundamentally important for engineered systems in many important application domains such as transportation, energy, and medical systems. We overview CPS research from both a historical point of view in terms of technologies developed for early generations of control systems, as well as recent results on CPSs in many relevant research domains such as networked control, hybrid systems, real-time computing, real-time networking, wireless sensor networks, security, and model-driven development. We outline the potential for CPSs in many societally important application domains.},
+  issue = {Special Centennial Issue},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/NC537RQV/Kyoung-Dae Kim and Kumar - 2012 - Cyber–Physical Systems A Perspective at the Cente.pdf}
+}
+
+@article{langFormalVerificationApplied,
+  title = {Formal {{Verification Applied}} to {{Autonomous Spacecraft Attitude Control}}},
+  author = {Lang, Kendra and Klett, Corbin and Hawkins, Kelsey and Feron, Eric and Tsiotras, Panagiotis and Phillips, Sean},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/3QW8ACK8/Lang et al. - Formal Verification Applied to Autonomous Spacecraf.pdf}
+}
+
+@article{langFormalVerificationApplied2021,
+  title = {Formal Verification Applied to Autonomous Spacecraft Attitude Control},
+  author = {Lang, Kendra and Klett, Corbin and Hawkins, Kelsey and Feron, Eric and Tsiotras, Panagiotis and Phillips, Sean},
+  date = {2021-01-01},
+  journaltitle = {AIAA Scitech 2021 Forum},
+  pages = {1--14},
+  publisher = {{American Institute of Aeronautics and Astronautics Inc, AIAA}},
+  issn = {9781624106095},
+  doi = {10.2514/6.2021-1126},
+  url = {https://arc.aiaa.org/doi/10.2514/6.2021-1126},
+  urldate = {2023-11-03},
+  abstract = {Formal verification tools are cited as an essential component to enable more widespread development and adoption of advanced autonomous systems. While numerous techniques and tools exist, the applicability of these tools to actual systems under development is currently uncertain. There are myriad reasons for such uncertainty, mostly stemming from assumptions necessary for such tools to work, such as: 1) The assumption that an underlying dynamics model or Simulink model is available, 2) The assumption that the dynamics are low-dimensional, 3) The assumption that the dynamics are linear or linearizable without sacrificing accuracy, and 4) The assumption that the underlying controllers and autonomy algorithms are available and easily modeled. This paper first presents a novel satellite benchmark that incorporates autonomous switching between multiple modes of operation related to attitude control. The result is a hybrid system with nonlinear rotational dynamics restricted to a manifold within each mode. Several open source verification tools are then applied to this benchmark to determine any results that can be drawn about the stability of the overall system. We provide a thorough comparison and discussion of the benefits and drawbacks of those tools we tested, none of which were capable of completely verifying stability requirements over the entire benchmark to the best of our efforts. We also discuss the significant hurdles that remain to implementing these tools on realistic autonomous systems, and the techniques we have found to be the most applicable. The contributions of this paper are: 1) a challenging benchmark on which developers can test their verification tools, and 2) a useful starting point to anyone who wants to apply formal methods to autonomous aerospace systems and to advance the conversation on what remains to be accomplished for these tools to be of practical use.},
+  note = {Generated from Scopus record by KAUST IRTS on 2021-02-18},
+  file = {/home/danesabo/Zotero/storage/3VGFTA43/Lang et al. - 2021 - Formal verification applied to autonomous spacecra.pdf}
+}
+
+@online{LangleyFormalMethods,
+  title = {Langley {{Formal Methods}}},
+  url = {https://shemesh.larc.nasa.gov/fm/index.html},
+  organization = {Langley Formal Methods}
+}
+
+@misc{latex-primer,
+  title = {{{LaTeX Primer}}},
+  file = {/home/danesabo/Zotero/storage/VS3WVQJB/ltxprimer-1.0.pdf}
+}
+
+@inproceedings{lattmannComponentbasedModelingDynamic2012,
+  title = {Component-Based Modeling of Dynamic Systems Using Heterogeneous Composition},
+  booktitle = {Proceedings of the 6th {{International Workshop}} on {{Multi-Paradigm Modeling}}},
+  author = {Lattmann, Zsolt and Nagel, Adam and Levendovszky, Tihamer and Bapty, Ted and Neema, Sandeep and Karsai, Gabor},
+  date = {2012-10},
+  pages = {73--78},
+  publisher = {ACM},
+  location = {Innsbruck Austria},
+  doi = {10.1145/2508443.2508456},
+  url = {https://dl.acm.org/doi/10.1145/2508443.2508456},
+  urldate = {2023-11-08},
+  abstract = {Cyber-Physical Systems (CPS) are composed of computational and physical components, which includes various types of physical phenomena such as electrical and mechanical domains. Many modeling paradigms exist to model the static properties and dynamic behavior of such components. However, there is no unified modeling framework to compose components that use different paradigms and/or tools. In this paper, we present the syntax and semantics of such an integration language and its component-based design, where components can embed models from different tools, formalisms, and paradigms such as Bond Graphs and Modelica models. Our framework is built around common set of interface concepts to support heterogeneous composition and interchangeability among modeling paradigms.},
+  eventtitle = {{{MODELS}} '12: {{ACM}}/{{IEEE}} 15th {{International Conference}} on {{Model Driven Engineering Languages}} and {{Systems}}},
+  isbn = {978-1-4503-1805-1},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/KZ967K4F/Lattmann et al. - 2012 - Component-based modeling of dynamic systems using .pdf}
+}
+
+@online{LeanCuriousMathematician,
+  title = {Lean for the {{Curious Mathematician}} 2020 - {{YouTube}}},
+  url = {https://www.youtube.com/playlist?list=PLlF-CfQhukNlxexiNJErGJd2dte_J1t1N},
+  urldate = {2024-01-27}
+}
+
+@online{LeanGameServer,
+  title = {Lean {{Game Server}}},
+  url = {https://adam.math.hhu.de/},
+  urldate = {2024-03-20},
+  file = {/home/danesabo/Zotero/storage/KW86DCFW/adam.math.hhu.de.html}
+}
+
+@online{LearnYouHaskell,
+  title = {Learn {{You}} a {{Haskell}} for {{Great Good}}!},
+  url = {http://learnyouahaskell.com/},
+  organization = {Learn You a Haskell for Great Good!}
+}
+
+@article{leeCyberPhysicalSystems,
+  title = {Cyber {{Physical Systems}}: {{Design Challenges}}},
+  author = {Lee, Edward A},
+  abstract = {Cyber-Physical Systems (CPS) are integrations of computation and physical processes. Embedded computers and networks monitor and control the physical processes, usually with feedback loops where physical processes affect computations and vice versa. The economic and societal potential of such systems is vastly greater than what has been realized, and major investments are being made worldwide to develop the technology. There are considerable challenges, particularly because the physical components of such systems introduce safety and reliability requirements qualitatively different from those in generalpurpose computing. Moreover, physical components are qualitatively different from object-oriented software components. Standard abstractions based on method calls and threads do not work. This paper examines the challenges in designing such systems, and in particular raises the question of whether today’s computing and networking technologies provide an adequate foundation for CPS. It concludes that it will not be sufficient to improve design processes, raise the level of abstraction, or verify (formally or otherwise) designs that are built on today’s abstractions. To realize the full potential of CPS, we will have to rebuild computing and networking abstractions. These abstractions will have to embrace physical dynamics and computation in a unified way.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/LQPU663P/Lee - Cyber Physical Systems Design Challenges.pdf}
+}
+
+@article{leeExplainableAIDomain2021,
+  title = {Explainable {{AI}} for Domain Experts: A Post {{Hoc}} Analysis of Deep Learning for Defect Classification of {{TFT}}–{{LCD}} Panels},
+  author = {Lee, Minyoung and Jeon, Joohyoung and Lee, Hongchul},
+  date = {2021},
+  journaltitle = {Journal of Intelligent Manufacturing},
+  pages = {1--13},
+  publisher = {Springer},
+  isbn = {0956-5515},
+  file = {/home/danesabo/Zotero/storage/9IRNBAQZ/storage:storage:Explainable AI for domain experts: a post Hoc analysis of deep learning
+for defect classification of TFT–LCD panels.pdf}
+}
+
+@book{leeIntroductionEmbeddedSystems2017,
+  title = {Introduction to Embedded Systems: A Cyber-Physical Systems Approach},
+  shorttitle = {Introduction to Embedded Systems},
+  author = {Lee, Edward A. and Seshia, Sanjit A.},
+  date = {2017},
+  edition = {Second edition},
+  publisher = {MIT Press},
+  location = {Cambridge, Massachuetts},
+  isbn = {978-0-262-53381-2},
+  langid = {english},
+  pagetotal = {537},
+  file = {/home/danesabo/Zotero/storage/H9MK8VB7/Lee and Seshia - 2017 - Introduction to embedded systems a cyber-physical.pdf}
+}
+
+@article{leePresentFutureCyberPhysical2015,
+  title = {The {{Past}}, {{Present}} and {{Future}} of {{Cyber-Physical Systems}}: {{A Focus}} on {{Models}}},
+  shorttitle = {The {{Past}}, {{Present}} and {{Future}} of {{Cyber-Physical Systems}}},
+  author = {Lee, Edward},
+  date = {2015-02-26},
+  journaltitle = {Sensors},
+  shortjournal = {Sensors},
+  volume = {15},
+  number = {3},
+  pages = {4837--4869},
+  issn = {1424-8220},
+  doi = {10.3390/s150304837},
+  url = {http://www.mdpi.com/1424-8220/15/3/4837},
+  urldate = {2023-11-08},
+  abstract = {This paper is about better engineering of cyber-physical systems (CPSs) through better models. Deterministic models have historically proven extremely useful and arguably form the kingpin of the industrial revolution and the digital and information technology revolutions. Key deterministic models that have proven successful include differential equations, synchronous digital logic and single-threaded imperative programs. Cyber-physical systems, however, combine these models in such a way that determinism is not preserved. Two projects show that deterministic CPS models with faithful physical realizations are possible and practical. The first project is PRET, which shows that the timing precision of synchronous digital logic can be practically made available at the software level of abstraction. The second project is Ptides (programming temporally-integrated distributed embedded systems), which shows that deterministic models for distributed cyber-physical systems have practical faithful realizations. These projects are existence proofs that deterministic CPS models are possible and practical.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/KQQY8C38/Lee - 2015 - The Past, Present and Future of Cyber-Physical Sys.pdf}
+}
+
+@online{leeQuantifyingGeneralizingCAP2021,
+  title = {Quantifying and {{Generalizing}} the {{CAP Theorem}}},
+  author = {Lee, Edward A. and Bateni, Soroush and Lin, Shaokai and Lohstroh, Marten and Menard, Christian},
+  date = {2021-09-16},
+  eprint = {2109.07771},
+  eprinttype = {arXiv},
+  eprintclass = {cs},
+  url = {http://arxiv.org/abs/2109.07771},
+  urldate = {2023-11-08},
+  abstract = {In distributed applications, Brewer’s CAP theorem tells us that when networks become partitioned, there is a tradeoff between consistency and availability. Consistency is agreement on the values of shared variables across a system, and availability is the ability to respond to reads and writes accessing those shared variables. We quantify these concepts, giving numerical values to inconsistency and unavailability. Recognizing that network partitioning is not an all-or-nothing proposition, we replace the P in CAP with L, a numerical measure of apparent latency, and derive the CAL theorem, an algebraic relation between inconsistency, unavailability, and apparent latency. This relation shows that if latency becomes unbounded (e.g., the network becomes partitioned), then one of inconsistency and unavailability must also become unbounded, and hence the CAP theorem is a special case of the CAL theorem. We describe two distributed coordination mechanisms, which we have implemented as an extension of the Lingua Franca coordination language, that support arbitrary tradeoffs between consistency and availability as apparent latency varies. With centralized coordination, inconsistency remains bounded by a chosen numerical value at the cost that unavailability becomes unbounded under network partitioning. With decentralized coordination, unavailability remains bounded by a chosen numerical quantity at the cost that inconsistency becomes unbounded under network partitioning. Our centralized coordination mechanism is an extension of techniques that have historically been used for distributed simulation, an application where consistency is paramount. Our decentralized coordination mechanism is an extension of techniques that have been used in distributed databases when availability is paramount.},
+  langid = {english},
+  pubstate = {prepublished},
+  file = {/home/danesabo/Zotero/storage/UJTW62B6/Lee et al. - 2021 - Quantifying and Generalizing the CAP Theorem.pdf}
+}
+
+@article{leibrandtGuideSystemsEngineering2002,
+  title = {A {{Guide}} to the {{Systems Engineering Body}} of {{Knowledge}} ({{SEBoK}}) {{Introduction}}},
+  author = {Leibrandt, Rob},
+  date = {2002-04},
+  journaltitle = {INSIGHT},
+  volume = {5},
+  number = {1},
+  pages = {7--7},
+  issn = {2156485X},
+  doi = {10.1002/inst.2002517},
+  url = {https://onlinelibrary.wiley.com/doi/10.1002/inst.2002517},
+  urldate = {2023-10-06},
+  langid = {english}
+}
+
+@inproceedings{lernerUsingHighlevelSynthesis2014,
+  title = {Using High-Level Synthesis and Formal Analysis to Predict and Preempt Attacks on Industrial Control Systems},
+  booktitle = {Proceedings of the 2014 {{ACM}}/{{SIGDA}} International Symposium on {{Field-programmable}} Gate Arrays},
+  author = {Lerner, Lee W. and Franklin, Zane R. and Baumann, William T. and Patterson, Cameron D.},
+  date = {2014-02-26},
+  pages = {209--212},
+  publisher = {ACM},
+  location = {Monterey California USA},
+  doi = {10.1145/2554688.2554759},
+  url = {https://dl.acm.org/doi/10.1145/2554688.2554759},
+  urldate = {2023-10-10},
+  abstract = {Industrial control systems (ICSes) have the conflicting requirements of security and network access. In the event of large-scale hostilities, factories and infrastructure would more likely be targeted by computer viruses than the bomber squadrons used in WWII. ICS zero-day exploits are now a commodity sold on brokerages to interested parties including nations. We mitigate these threats not by bolstering perimeter security, but rather by assuming that potentially all layers of ICS software have already been compromised and are capable of launching a latent attack while reporting normal system status to human operators. In our approach, application-specific configurable hardware is the final authority for scrutinizing controller commands and process sensors, and can monitor and override operations at the lowest (I/O pin) level of a configurable system-on-chip platform. The process specifications, stability-preserving backup controller, and switchover logic are specified and formally verified as C code, and synthesized into hardware to resist software reconfiguration attacks. To provide greater assurance that the backup controller can be invoked before the physical process becomes unstable, copies of the production controller task and plant model are accelerated to preview the controller’s behavior in the near future.},
+  eventtitle = {{{FPGA}}'14: {{The}} 2014 {{ACM}}/{{SIGDA International Symposium}} on {{Field-Programmable Gate Arrays}}},
+  isbn = {978-1-4503-2671-1},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/9RA66F7I/Lerner et al. - 2014 - Using high-level synthesis and formal analysis to .pdf}
+}
+
+@inproceedings{leroyFormalCertificationCompiler2006,
+  title = {Formal Certification of a Compiler Back-End or: Programming a Compiler with a Proof Assistant},
+  shorttitle = {Formal Certification of a Compiler Back-End Or},
+  booktitle = {Conference Record of the 33rd {{ACM SIGPLAN-SIGACT}} Symposium on {{Principles}} of Programming Languages},
+  author = {Leroy, Xavier},
+  date = {2006-01-11},
+  series = {{{POPL}} '06},
+  pages = {42--54},
+  publisher = {Association for Computing Machinery},
+  location = {New York, NY, USA},
+  doi = {10.1145/1111037.1111042},
+  url = {https://dl.acm.org/doi/10.1145/1111037.1111042},
+  urldate = {2024-03-25},
+  abstract = {This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a C-like imperative language) to PowerPC assembly code, using the Coq proof assistant both for programming the compiler and for proving its correctness. Such a certified compiler is useful in the context of formal methods applied to the certification of critical software: the certification of the compiler guarantees that the safety properties proved on the source code hold for the executable compiled code as well.},
+  isbn = {978-1-59593-027-9},
+  file = {/home/danesabo/Zotero/storage/4U4QE9F7/Leroy - 2006 - Formal certification of a compiler back-end or pr.pdf}
+}
+
+@online{LevelSetMethods,
+  title = {Level Set Methods for Computing Reachable Sets of Systems with Differential Algebraic Equation Dynamics | {{IEEE Conference Publication}} | {{IEEE Xplore}}},
+  url = {https://ieeexplore-ieee-org.pitt.idm.oclc.org/document/4586828},
+  urldate = {2023-10-27}
+}
+
+@inproceedings{levesonHighpressureSteamEngines1992,
+  title = {High-Pressure Steam Engines and Computer Software},
+  booktitle = {Proceedings of the 14th International Conference on {{Software}} Engineering},
+  author = {Leveson, Nancy G.},
+  date = {1992},
+  pages = {2--14},
+  file = {/home/danesabo/Zotero/storage/78F7AYKB/steam.pdf}
+}
+
+@article{levesonImprovedDesignProcess2019,
+  title = {An {{Improved Design Process}} for {{Complex Control-Based Systems Using STPA}} and a {{Conceptual Architecture}}},
+  author = {Leveson, Nancy},
+  date = {2019},
+  journaltitle = {Massachusetts Institute of Technology, White Paper},
+  file = {/home/danesabo/Zotero/storage/TH8TQZIS/Leveson - An Improved Design Process for Complex, Control-Ba.pdf}
+}
+
+@book{levesonSTPAHandbook,
+  title = {{{STPA Handbook}}},
+  author = {Leveson, Nancy and Thomas, John},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/Z3NMIDYF/Leveson - This handbook is intended for those interested in .pdf}
+}
+
+@book{lewisOptimalControl2012,
+  title = {Optimal Control},
+  author = {Lewis, Frank L. and Vrabie, Draguna L. and Syrmos, Vassilis L.},
+  date = {2012},
+  edition = {3rd ed},
+  publisher = {Wiley},
+  location = {Hoboken},
+  isbn = {978-0-470-63349-6},
+  pagetotal = {540},
+  keywords = {DAS Get from Library},
+  note = {Static optimization -- Optimal control of discrete-time systems -- Optimal control of continuous-time systems -- The tracking problem and other lqr extensions -- Final-time-free and constrained input control -- Dynamic programming -- Optimal control for polynomial systems -- Output feedback and structured control -- Robustness and multivariable frequency-domain techniques -- Differential games -- Reinforcement learning and optimal adaptive control}
+}
+
+@article{liDynamicBayesianNetwork2017,
+  title = {Dynamic {{Bayesian Network}} for {{Aircraft Wing Health Monitoring Digital Twin}}},
+  author = {Li, Chenzhao and Mahadevan, Sankaran and Ling, You and Choze, Sergio and Wang, Liping},
+  date = {2017-03},
+  journaltitle = {AIAA Journal},
+  shortjournal = {AIAA Journal},
+  volume = {55},
+  number = {3},
+  pages = {930--941},
+  issn = {0001-1452, 1533-385X},
+  doi = {10.2514/1.J055201},
+  url = {https://arc.aiaa.org/doi/10.2514/1.J055201},
+  urldate = {2022-03-02},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/84GMPWDD/DBN for aircraft wing health monitoring DT.pdf}
+}
+
+@article{linUncertaintyQuantificationSoftware2021,
+  title = {Uncertainty Quantification and Software Risk Analysis for Digital Twins in the Nearly Autonomous Management and Control Systems: {{A}} Review},
+  shorttitle = {Uncertainty Quantification and Software Risk Analysis for Digital Twins in the Nearly Autonomous Management and Control Systems},
+  author = {Lin, Linyu and Bao, Han and Dinh, Nam},
+  date = {2021-09},
+  journaltitle = {Annals of Nuclear Energy},
+  shortjournal = {Annals of Nuclear Energy},
+  volume = {160},
+  pages = {108362},
+  issn = {03064549},
+  doi = {10.1016/j.anucene.2021.108362},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0306454921002383},
+  urldate = {2022-03-02},
+  abstract = {A nearly autonomous management and control (NAMAC) system is designed to furnish recommendations to operators for achieving particular goals based on NAMAC’s knowledge base. As a critical component in a NAMAC system, digital twins (DTs) are used to extract information from the knowledge base to support decision-making in reactor control and management during all modes of plant operations. With the advancement of artificial intelligence and data-driven methods, machine learning algorithms are used to build DTs of various functions in the NAMAC system. To evaluate the uncertainty of DTs and its impacts on the reactor digital instrumentation and control systems, uncertainty quantification (UQ) and software risk analysis is needed. As a comprehensive overview of prior research and a starting point for new investigations, this study selects and reviews relevant UQ techniques and software hazard and software risk analysis methods that may be suitable for DTs in the NAMAC system.},
+  langid = {english},
+  keywords = {DGC read},
+  file = {/home/danesabo/Zotero/storage/D9QQKU9R/Uncertainty quantification and doftware risk analysis for DTs in control systems.pdf}
+}
+
+@article{lionsHamiltonJacobiBellmanEquations1983,
+  title = {On the {{Hamilton-Jacobi-Bellman}} Equations},
+  author = {Lions, P. L.},
+  date = {1983-03},
+  journaltitle = {Acta Applicandae Mathematicae},
+  shortjournal = {Acta Appl Math},
+  volume = {1},
+  number = {1},
+  pages = {17--41},
+  issn = {0167-8019, 1572-9036},
+  doi = {10.1007/BF02433840},
+  url = {http://link.springer.com/10.1007/BF02433840},
+  urldate = {2023-11-22},
+  langid = {english}
+}
+
+@inproceedings{liStochasticContractsCyberphysical2017,
+  title = {Stochastic Contracts for Cyber-Physical System Design under Probabilistic Requirements},
+  booktitle = {Proceedings of the 15th {{ACM-IEEE International Conference}} on {{Formal Methods}} and {{Models}} for {{System Design}}},
+  author = {Li, Jiwei and Nuzzo, Pierluigi and Sangiovanni-Vincentelli, Alberto and Xi, Yugeng and Li, Dewei},
+  date = {2017-09-29},
+  pages = {5--14},
+  publisher = {ACM},
+  location = {Vienna Austria},
+  doi = {10.1145/3127041.3127045},
+  url = {https://dl.acm.org/doi/10.1145/3127041.3127045},
+  urldate = {2023-11-08},
+  abstract = {We develop an assume-guarantee contract framework for the design of cyber-physical systems, modeled as closed-loop control systems, under probabilistic requirements. We use a variant of signal temporal logic, namely, Stochastic Signal Temporal Logic (StSTL) to specify system behaviors as well as contract assumptions and guarantees, thus enabling automatic reasoning about requirements of stochastic systems. Given a stochastic linear system representation and a set of requirements captured by bounded StSTL contracts, we propose algorithms that can check contract compatibility, consistency, and refinement, and generate a controller to guarantee that a contract is satisfied, following a stochastic model predictive control approach. Our algorithms leverage encodings of the verification and control synthesis tasks into mixed integer optimization problems, and conservative approximations of probabilistic constraints that produce both sound and tractable problem formulations. We illustrate the effectiveness of our approach on a few examples, including the design of embedded controllers for aircraft power distribution networks.},
+  eventtitle = {{{MEMOCODE}} '17: 15th {{ACM-IEEE International Conference}} on {{Formal Methods}} and {{Models}} for {{System Design}}},
+  isbn = {978-1-4503-5093-8},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/QYRP483B/Li et al. - 2017 - Stochastic contracts for cyber-physical system des.pdf}
+}
+
+@article{liSyntheticLagrangianTurbulence2024,
+  title = {Synthetic {{Lagrangian}} Turbulence by Generative Diffusion Models},
+  author = {Li, T. and Biferale, L. and Bonaccorso, F. and Scarpolini, M. A. and Buzzicotti, M.},
+  date = {2024-04-17},
+  journaltitle = {Nature Machine Intelligence},
+  shortjournal = {Nat Mach Intell},
+  volume = {6},
+  number = {4},
+  pages = {393--403},
+  issn = {2522-5839},
+  doi = {10.1038/s42256-024-00810-0},
+  url = {https://www.nature.com/articles/s42256-024-00810-0},
+  urldate = {2024-05-20},
+  abstract = {Abstract             Lagrangian turbulence lies at the core of numerous applied and fundamental problems related to the physics of dispersion and mixing in engineering, biofluids, the atmosphere, oceans and astrophysics. Despite exceptional theoretical, numerical and experimental efforts conducted over the past 30 years, no existing models are capable of faithfully reproducing statistical and topological properties exhibited by particle trajectories in turbulence. We propose a machine learning approach, based on a state-of-the-art diffusion model, to generate single-particle trajectories in three-dimensional turbulence at high Reynolds numbers, thereby bypassing the need for direct numerical simulations or experiments to obtain reliable Lagrangian data. Our model demonstrates the ability to reproduce most statistical benchmarks across time scales, including the fat-tail distribution for velocity increments, the anomalous power law and the increased intermittency around the dissipative scale. Slight deviations are observed below the dissipative scale, particularly in the acceleration and flatness statistics. Surprisingly, the model exhibits strong generalizability for extreme events, producing events of higher intensity and rarity that still match the realistic statistics. This paves the way for producing synthetic high-quality datasets for pretraining various downstream applications of Lagrangian turbulence.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/A6FPHV6L/Li et al. - 2024 - Synthetic Lagrangian turbulence by generative diff.pdf}
+}
+
+@online{liuSecurebyConstructionSynthesisCyberPhysical2022,
+  title = {Secure-by-{{Construction Synthesis}} of {{Cyber-Physical Systems}}},
+  author = {Liu, Siyuan and Trivedi, Ashutosh and Yin, Xiang and Zamani, Majid},
+  date = {2022-02-14},
+  eprint = {2202.06677},
+  eprinttype = {arXiv},
+  eprintclass = {cs, eess},
+  url = {http://arxiv.org/abs/2202.06677},
+  urldate = {2023-10-10},
+  abstract = {Correct-by-construction synthesis is a cornerstone of the confluence of formal methods and control theory towards designing safety-critical systems. Instead of following the time-tested, albeit laborious (re)design-verify-validate loop, correct-by-construction methodology advocates the use of continual refinements of formal requirements—connected by chains of formal proofs—to build a system that assures the correctness by design. A remarkable progress has been made in scaling the scope of applicability of correct-byconstruction synthesis—with a focus on cyber-physical systems that tie discrete-event control with continuous environment—to enlarge control systems by combining symbolic approaches with principled state-space reduction techniques. Unfortunately, in the security-critical control systems, the security properties are verified ex post facto the design process in a way that undermines the correct-by-construction paradigm. We posit that, to truly realize the dream of correct-by-construction synthesis for security-critical systems, security considerations must take center-stage with the safety considerations. Moreover, catalyzed by the recent progress on the opacity sub-classes of security properties and the notion of hyperproperties capable of combining security with safety properties, we believe that the time is ripe for the research community to holistically target the challenge of secure-by-construction synthesis. This paper details our vision by highlighting the recent progress and open challenges that may serve as bricks for providing a solid foundation for secure-by-construction synthesis of cyber-physical systems.},
+  langid = {english},
+  pubstate = {prepublished},
+  file = {/home/danesabo/Zotero/storage/9XUH6A6I/Liu et al. - 2022 - Secure-by-Construction Synthesis of Cyber-Physical.pdf}
+}
+
+@article{lopez-miguelPLCverifStatusFormal2022,
+  title = {{{PLCverif}}: {{Status}} of a {{Formal Verification Tool}} for {{Programmable Logic Controller}}},
+  shorttitle = {{{PLCverif}}},
+  author = {Lopez-Miguel, Ignacio D. and Tournier, Jean-Charles and Adiego, Borja Fernandez},
+  date = {2022},
+  journaltitle = {Proceedings of the 18th International Conference on Accelerator and Large Experimental Physics Control Systems},
+  volume = {ICALEPCS2021},
+  eprint = {2203.17253},
+  eprinttype = {arXiv},
+  eprintclass = {cs},
+  pages = {5 pages, 0.147 MB},
+  issn = {2226-0358},
+  doi = {10.18429/JACoW-ICALEPCS2021-MOPV042},
+  url = {http://arxiv.org/abs/2203.17253},
+  urldate = {2024-08-08},
+  abstract = {Programmable Logic Controllers (PLC) are widely used for industrial automation including safety systems at CERN. The incorrect behaviour of the PLC control system logic can cause significant financial losses by damage of property or the environment or even injuries in some cases, therefore ensuring their correct behaviour is essential. While testing has been for many years the traditional way of validating the PLC control system logic, CERN developed a model checking platform to go one step further and formally verify PLC logic. This platform, called PLCverif, first released internally for CERN usage in 2019, is now available to anyone since September 2020 via an open source licence. In this paper, we will first give an overview of the PLCverif platform capabilities before focusing on the improvements done since 2019 such as the larger support coverage of the Siemens PLC programming languages, the better support of the C Bounded Model Checker backend (CBMC) and the process of releasing PLCverif as an open-source software.},
+  keywords = {Computer Science - Software Engineering},
+  note = {Comment: 18th International Conference on Accelerator and Large Experimental Physics Control Systems (ICALEPCS2021)},
+  file = {/home/danesabo/Zotero/storage/XAG39WDC/Lopez-Miguel et al. - 2022 - PLCverif Status of a Formal Verification Tool for.pdf;/home/danesabo/Zotero/storage/AKP5GGFY/2203.html}
+}
+
+@article{lozadaLetterReportTLRRES,
+  title = {Letter {{Report}} - {{TLR-RES}}/{{DE}}/{{REB-2021-17}}, {{Technical Challenges}} and {{Gaps}} in {{Digital Twin Enabling Technologies}} for {{Nuclear Reactor Applications}}},
+  author = {Lozada, Gascot},
+  pages = {42},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/Z43GNMME/Lozada - Letter Report - TLR-RESDEREB-2021-17, Technical .pdf}
+}
+
+@article{luciaSetpointAttackDetection2021,
+  title = {Setpoint {{Attack Detection}} in {{Cyber-Physical Systems}}},
+  author = {Lucia, Walter and Gheitasi, Kian and Ghaderi, Mohsen},
+  date = {2021-05},
+  journaltitle = {IEEE Transactions on Automatic Control},
+  volume = {66},
+  number = {5},
+  pages = {2332--2338},
+  issn = {1558-2523},
+  doi = {10.1109/TAC.2020.3004326},
+  url = {https://ieeexplore.ieee.org/abstract/document/9123676?casa_token=OOTq8eZpEU4AAAAA:5yEr0KRgtpHHwEKZLTBmo0W4gMgsmUYS34RrRbmTgDc8IJvzQONedC2AMG_ws0mGOOtV2xTeTw},
+  urldate = {2023-09-27},
+  abstract = {In this article, we face the problem of detecting setpoint attacks in networked control systems. We consider a setup where the reference signal (also known as setpoint) is generated by a control center remotely located with respect to a standard feedback controller. In this scenario, an attacker with sufficient resources can exploit the communication channel to alter the setpoint signal and ultimately affect the tracking performance of the control system. With respect to this problem, we propose a novel distributed control architecture that, taking advantage of peculiar capabilities of the command governor control paradigm, enables the detection of reference attacks. We formally prove that for constrained linear systems such detector exists. Moreover, by limiting the attacker's disclosure resources with superimposed cryptographically secure pseudorandom signals, we show that the absence of advanced stealthy attacks is also ensured. Finally, a solid numerical simulation investigating setpoint attacks on the flight control system of a single-engine fighter is presented to provide tangible evidence of the features of the presented methodology.},
+  eventtitle = {{{IEEE Transactions}} on {{Automatic Control}}},
+  file = {/home/danesabo/Zotero/storage/LHZD6PTJ/Lucia et al. - 2021 - Setpoint Attack Detection in Cyber-Physical System.pdf}
+}
+
+@article{luDetectionIdentificationSparse2023,
+  title = {Detection and {{Identification}} of {{Sparse Sensor Attacks}} in {{Cyber-Physical Systems With Side Information}}},
+  author = {Lu, An-Yang and Yang, Guang-Hong},
+  date = {2023-09},
+  journaltitle = {IEEE Transactions on Automatic Control},
+  volume = {68},
+  number = {9},
+  pages = {5349--5364},
+  issn = {1558-2523},
+  doi = {10.1109/TAC.2022.3218545},
+  url = {https://ieeexplore.ieee.org/abstract/document/9933841?casa_token=GQHa-q6eXQcAAAAA:k-CtF5gsoXIEF9Lo2AQEp-j-9Xr2kaweVGewjVYZk9qyJi21C_roFNSL8HC3AqemtGve_y83LA},
+  urldate = {2023-09-27},
+  abstract = {This article investigates the attack detection and identification problem for cyber-physical systems under sparse sensor attacks. A novel candidate set construction algorithm, where only partial combinations of different channels are checked, is proposed to efficiently generate the candidate set containing all the possible sets of corrupted channels under stealthy attacks. Besides, through introducing a unified attack model that precisely characterizes the attack performance and stealthiness, necessary and sufficient conditions for the existence of undetectable/unidentifiable attacks are proposed. Based on the obtained conditions, a novel attack detection and identification strategy is proposed. Compared with the existing methods focusing only on the measurements, more attacks can be detected/identified through introducing side information and the reliability of detector is enhanced through making full use of the attack performance analysis result. Finally, a numerical simulation is provided to illustrate the correctness and effectiveness of the proposed conditions and methods.},
+  eventtitle = {{{IEEE Transactions}} on {{Automatic Control}}},
+  file = {/home/danesabo/Zotero/storage/5VNJEGPR/Lu and Yang - 2023 - Detection and Identification of Sparse Sensor Atta.pdf}
+}
+
+@online{lundbergConsistentIndividualizedFeature2019,
+  title = {Consistent {{Individualized Feature Attribution}} for {{Tree Ensembles}}},
+  author = {Lundberg, Scott M. and Erion, Gabriel G. and Lee, Su-In},
+  date = {2019-03-06},
+  eprint = {1802.03888},
+  eprinttype = {arXiv},
+  eprintclass = {cs, stat},
+  url = {http://arxiv.org/abs/1802.03888},
+  urldate = {2023-10-11},
+  abstract = {Interpreting predictions from tree ensemble methods such as gradient boosting machines and random forests is important, yet feature attribution for trees is often heuristic and not individualized for each prediction. Here we show that popular feature attribution methods are inconsistent, meaning they can lower a feature’s assigned importance when the true impact of that feature actually increases. This is a fundamental problem that casts doubt on any comparison between features. To address it we turn to recent applications of game theory and develop fast exact tree solutions for SHAP (SHapley Additive exPlanation) values, which are the unique consistent and locally accurate attribution values. We then extend SHAP values to interaction effects and define SHAP interaction values. We propose a rich visualization of individualized feature attributions that improves over classic attribution summaries and partial dependence plots, and a unique “supervised” clustering (clustering based on feature attributions). We demonstrate better agreement with human intuition through a user study, exponential improvements in run time, improved clustering performance, and better identification of influential features. An implementation of our algorithm has also been merged into XGBoost and LightGBM, see http://github.com/slundberg/shap for details.},
+  langid = {english},
+  pubstate = {prepublished},
+  note = {Comment: Follow-up to 2017 ICML Workshop arXiv:1706.06060},
+  file = {/home/danesabo/Zotero/storage/IX57CTJX/Lundberg et al. - 2019 - Consistent Individualized Feature Attribution for .pdf}
+}
+
+@online{lundbergUnifiedApproachInterpreting2017,
+  title = {A {{Unified Approach}} to {{Interpreting Model Predictions}}},
+  author = {Lundberg, Scott and Lee, Su-In},
+  date = {2017-11-24},
+  eprint = {1705.07874},
+  eprinttype = {arXiv},
+  eprintclass = {cs, stat},
+  url = {http://arxiv.org/abs/1705.07874},
+  urldate = {2023-10-11},
+  abstract = {Understanding why a model makes a certain prediction can be as crucial as the prediction’s accuracy in many applications. However, the highest accuracy for large modern datasets is often achieved by complex models that even experts struggle to interpret, such as ensemble or deep learning models, creating a tension between accuracy and interpretability. In response, various methods have recently been proposed to help users interpret the predictions of complex models, but it is often unclear how these methods are related and when one method is preferable over another. To address this problem, we present a unified framework for interpreting predictions, SHAP (SHapley Additive exPlanations). SHAP assigns each feature an importance value for a particular prediction. Its novel components include: (1) the identification of a new class of additive feature importance measures, and (2) theoretical results showing there is a unique solution in this class with a set of desirable properties. The new class unifies six existing methods, notable because several recent methods in the class lack the proposed desirable properties. Based on insights from this unification, we present new methods that show improved computational performance and/or better consistency with human intuition than previous approaches.},
+  langid = {english},
+  pubstate = {prepublished},
+  note = {Comment: To appear in NIPS 2017},
+  file = {/home/danesabo/Zotero/storage/NGGDHXKJ/Lundberg and Lee - 2017 - A Unified Approach to Interpreting Model Predictio.pdf}
+}
+
+@article{maccaroneADVANCEDREACTORCYBER,
+  title = {{{ADVANCED REACTOR CYBER ANALYSIS AND DEVELOPMENT ENVIRONMENT}} ({{ARCADE}}) {{FOR UNIVERSITY RESEARCH}}},
+  author = {Maccarone, L T and Hahn, A S and Valme, R and Rowland, M T and Kapuria, A and Zhang, Y and Cole, D G},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/UKVJXBAU/Maccarone et al. - ADVANCED REACTOR CYBER ANALYSIS AND DEVELOPMENT EN.pdf}
+}
+
+@book{mackenzieMechanizingProofComputing2004,
+  title = {Mechanizing Proof: Computing, Risk, and Trust},
+  author = {MacKenzie, Donald},
+  date = {2004},
+  publisher = {MIT Press},
+  isbn = {0-262-63295-0}
+}
+
+@article{madniModelbasedSystemsEngineering2018,
+  title = {Model-Based Systems Engineering: {{Motivation}}, Current Status, and Research Opportunities},
+  shorttitle = {Model-Based Systems Engineering},
+  author = {Madni, Azad M. and Sievers, Michael},
+  date = {2018-05},
+  journaltitle = {SYSTEMS ENGINEERING},
+  shortjournal = {Syst. Eng.},
+  volume = {21},
+  number = {3},
+  pages = {172--190},
+  publisher = {Wiley},
+  location = {Hoboken},
+  issn = {1098-1241, 1520-6858},
+  doi = {10.1002/sys.21438},
+  url = {https://www.webofscience.com/wos/woscc/summary/563bee91-8c90-4554-ae8d-46c3ce0028ee-a808dfa0/relevance/1},
+  urldate = {2023-10-03},
+  abstract = {As systems continue to grow in scale and complexity, the Systems Engineering community has turned to Model-Based Systems Engineering (MBSE) tomanage complexity, maintain consistency, and assure traceability during system development. It is different from "engineering with models," which has been a common practice in the engineering profession for decades. MBSE is a holistic, systems engineering approach centered on the evolving system model, which serves as the "sole source of truth" about the system. It comprises system specification, design, validation, and configuration management. Even though MBSE is beginning to see a fair amount of use in multiple industries, specific advances are needed on multiple fronts to realize its full benefits. This paper discusses the motivation for MBSE, and its current state of maturity. It presents systems modeling methodologies and the role of ontologies and metamodels in MBSE. It presents model-based verification and validation (V\&V) as an example of MBSE use. An illustrative example of the use of MBSE for design synthesis is presented to demonstrate an important MBSE capability. The paper concludes with a discussion of challenges to widescale adoption and offers promising research directions to fully realize the potential benefits of MBSE.},
+  langid = {english},
+  pagetotal = {19},
+  annotation = {Web of Science ID: WOS:000435285700004}
+}
+
+@article{maExploringEdgeComputing2020,
+  title = {Exploring {{Edge Computing}} for {{Multitier Industrial Control}}},
+  author = {Ma, Yehan and Lu, Chenyang and Sinopoli, Bruno and Zeng, Shen},
+  date = {2020-11},
+  journaltitle = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
+  shortjournal = {IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.},
+  volume = {39},
+  number = {11},
+  pages = {3506--3518},
+  issn = {0278-0070, 1937-4151},
+  doi = {10.1109/TCAD.2020.3012648},
+  url = {https://ieeexplore.ieee.org/document/9211472/},
+  urldate = {2022-09-30},
+  abstract = {Industrial automation traditionally relies on local controllers implemented on microcontrollers or programmable logic controllers. With the emergence of edge computing, however, industrial automation evolves into a distributed two-tier computing architecture comprising local controllers and edge servers that communicate over wireless networks. Compared to local controllers, edge servers provide larger computing capacity at the cost of data loss over wireless networks. This article presents switching multitier control (SMC) to exploit edge computing for industrial control. SMC dynamically optimizes control performance by switching between local and edge controllers in response to changing network conditions. SMC employs a data-driven approach to derive switching policies based on classification models trained based on simulations while guaranteeing system stability based on an extended Simplex approach tailored for two-tier platforms. To evaluate the performance of industrial control over edge computing platforms, we have developed WCPS-EC, a real-time hybrid simulator that integrates simulated plants, real computing platforms, and real or simulated wireless networks. In a case study of an industrial robotic control system, SMC significantly outperformed both a local controller and an edge controller in face of varying data loss in a wireless network.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/AVDI2CW7/Ma et al. - 2020 - Exploring Edge Computing for Multitier Industrial .pdf}
+}
+
+@article{magerPreparingInstructionalObjectives1962,
+  title = {Preparing Instructional Objectives.},
+  author = {Mager, Robert F.},
+  date = {1962},
+  publisher = {ERIC}
+}
+
+@article{mahboubiFormallyVerifiedApproximations2019,
+  title = {Formally {{Verified Approximations}} of {{Definite Integrals}}},
+  author = {Mahboubi, Assia and Melquiond, Guillaume and Sibut-Pinote, Thomas},
+  date = {2019},
+  journaltitle = {Journal of Automated Reasoning},
+  volume = {62},
+  number = {2},
+  pages = {281},
+  doi = {10.1007/s10817-018-9463-7},
+  url = {https://inria.hal.science/hal-01630143},
+  urldate = {2024-01-16},
+  abstract = {Finding an elementary form for an antiderivative is often a difficult task, so numerical integration has become a common tool when it comes to making sense of a definite integral. Some of the numerical integration methods can even be made rigorous: not only do they compute an approximation of the integral value but they also bound its inaccuracy. Yet numerical integration is still missing from the toolbox when performing formal proofs in analysis. This paper presents an efficient method for automatically computing and proving bounds on some definite integrals inside the Coq formal system. Our approach is not based on traditional quadrature methods such as Newton-Cotes formulas. Instead, it relies on computing and evaluating antiderivatives of rigorous polynomial approximations, combined with an adaptive domain splitting. Our approach also handles improper integrals, provided that a factor of the integrand belongs to a catalog of identified integrable functions. This work has been integrated to the CoqInterval library.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/WN8BJBC6/Mahboubi et al. - 2019 - Formally Verified Approximations of Definite Integ.pdf}
+}
+
+@inproceedings{malechaFoundationalVerificationCyberphysical2016,
+  title = {Towards Foundational Verification of Cyber-Physical Systems},
+  booktitle = {2016 {{Science}} of {{Security}} for {{Cyber-Physical Systems Workshop}} ({{SOSCYPS}})},
+  author = {Malecha, Gregory and Ricketts, Daniel and Alvarez, Mario M. and Lerner, Sorin},
+  date = {2016-04},
+  pages = {1--5},
+  doi = {10.1109/SOSCYPS.2016.7580000},
+  url = {https://ieeexplore.ieee.org/document/7580000},
+  urldate = {2024-03-19},
+  abstract = {The safety-critical aspects of cyber-physical systems motivate the need for rigorous analysis of these systems. In the literature this work is often done using idealized models of systems where the analysis can be carried out using high-level reasoning techniques such as Lyapunov functions and model checking. In this paper we present VERIDRONE, a foundational framework for reasoning about cyber-physical systems at all levels from high-level models to C code that implements the system. VERIDRONE is a library within the Coq proof assistant enabling us to build on its foundational implementation, its interactive development environments, and its wealth of libraries capturing interesting theories ranging from real numbers and differential equations to verified compilers and floating point numbers. These features make proof assistants in general, and Coq in particular, a powerful platform for unifying foundational results about safety-critical systems and ensuring interesting properties at all levels of the stack.},
+  eventtitle = {2016 {{Science}} of {{Security}} for {{Cyber-Physical Systems Workshop}} ({{SOSCYPS}})},
+  file = {/home/danesabo/Zotero/storage/K8QCKAMR/Malecha et al. - 2016 - Towards foundational verification of cyber-physica.pdf;/home/danesabo/Zotero/storage/JSRG9GY2/7580000.html}
+}
+
+@inproceedings{marinoDesignWorldFIPIndustrial1999,
+  title = {Design of {{WorldFIP}}'s Industrial Communication Systems Based on Formal Methods},
+  booktitle = {{{ISIE}} '99. {{Proceedings}} of the {{IEEE International Symposium}} on {{Industrial Electronics}} ({{Cat}}. {{No}}.{{99TH8465}})},
+  author = {Marino, P. and Poza, F. and Dominguez, M.A. and Nogueira, J.B.},
+  date = {1999},
+  volume = {3},
+  pages = {1427--1432},
+  publisher = {IEEE},
+  location = {Bled, Slovenia},
+  doi = {10.1109/ISIE.1999.796924},
+  url = {http://ieeexplore.ieee.org/document/796924/},
+  urldate = {2023-10-10},
+  eventtitle = {{{ISIE}} '99. {{IEEE International Symposium}} on {{Industrial Electronics}}},
+  isbn = {978-0-7803-5662-7},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/TTWPVD64/Marino et al. - 1999 - Design of WorldFIP's industrial communication syst.pdf}
+}
+
+@article{marinoPROFIBUSFormalSpecification2001,
+  title = {The {{PROFIBUS}} Formal Specification: A Comparison between Two {{FDTs}}},
+  author = {Marino, P and Nogueira, J and Sigu, C},
+  date = {2001},
+  journaltitle = {Computer Networks},
+  abstract = {Formal description languages, like ESTELLE [7], Language Temporary Of Ordering Speci®cation (LOTOS) [8] or Speci®cation Description Language (SDL) [9], allow us to specify complex system requirements in an ambiguities free and complete way [26]. The choice of what formal language to use in a particular system speci®cation must be taken a priori by the system designer [5]. It would be useful to have comparative information about systems described with some of these languages, to know which one would ®t better to that system. The literature published on this topic [1,14,22] compares too simple systems. This paper deals with this aspect and compares the formal speci®cation of the PROcess FIeld BUS (PROFIBUS) communications protocol in both languages LOTOS and SDL. Ó 2001 Elsevier Science B.V. All rights reserved.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/NI2HU9JG/Marino et al. - 2001 - The PROFIBUS formal speci®cation a comparison bet.pdf}
+}
+
+@article{martin-dorelEnablingFloatingPointArithmetic2023,
+  title = {Enabling {{Floating-Point Arithmetic}} in the {{Coq Proof Assistant}}},
+  author = {Martin-Dorel, Érik and Melquiond, Guillaume and Roux, Pierre},
+  date = {2023-09-16},
+  journaltitle = {Journal of Automated Reasoning},
+  shortjournal = {J Autom Reasoning},
+  volume = {67},
+  number = {4},
+  pages = {33},
+  issn = {1573-0670},
+  doi = {10.1007/s10817-023-09679-x},
+  url = {https://doi.org/10.1007/s10817-023-09679-x},
+  urldate = {2024-01-16},
+  abstract = {Floating-point arithmetic is a well-known and extremely efficient way of performing approximate computations over the real numbers. Although it requires some careful considerations, floating-point numbers are nowadays routinely used to prove mathematical theorems. Numerical computations have been applied in the context of formal proofs too, as illustrated by the CoqInterval library. But these computations do not benefit from the powerful floating-point units available in modern processors, since they are emulated inside the logic of the formal system. This paper experiments with the use of hardware floating-point numbers for numerically intensive proofs verified by the Coq proof assistant. This gives rise to various questions regarding the formalization, the implementation, the usability, and the level of trust. This approach has been applied to the CoqInterval and ValidSDP libraries, which demonstrates a speedup of at least one order of magnitude.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/82P2G29A/Martin-Dorel et al. - 2023 - Enabling Floating-Point Arithmetic in the Coq Proo.pdf}
+}
+
+@article{martinFormalMethodsScale2022,
+  title = {Formal {{Methods}} at {{Scale}}},
+  author = {Martin, William and Lincoln, Patrick and Scherlis, William},
+  date = {2022-05},
+  journaltitle = {IEEE Security \& Privacy},
+  shortjournal = {IEEE Secur. Privacy},
+  volume = {20},
+  number = {3},
+  pages = {22--23},
+  issn = {1540-7993, 1558-4046},
+  doi = {10.1109/MSEC.2022.3158842},
+  url = {https://ieeexplore.ieee.org/document/9782881/},
+  urldate = {2024-01-26},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/X7F3C93K/Martin et al. - 2022 - Formal Methods at Scale.pdf}
+}
+
+@article{masoodAssessmentCyberSecurity,
+  title = {Assessment of {{Cyber Security Challenges}} in {{Nuclear Power Plants}}},
+  author = {Masood, Rahat},
+  pages = {43},
+  abstract = {Nuclear power plants play an important role in electricity production for many countries. They supply power to industries, centers, government facilities, and residential areas. Yet, upon review, several cases reveal that even a small-scale attack on a nuclear power plant could lead to catastrophic consequences for a country’s citizens, economy, infrastructure, and security. In recent years, there has been increased attention to the area of nuclear cybersecurity due to attacks or incidents designed to disrupt NPP operations. In spite of this rise of nuclear-related cyber attacks, the security for NPPs has not been holistically addressed. Literature review reveals the lack of a comprehensive information security framework to secure nuclear power plants from internal and external threats.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/GDSXZ79Y/Masood - Assessment of Cyber Security Challenges in Nuclear.pdf}
+}
+
+@article{massotWhyFormalizeMathematics,
+  title = {Why Formalize Mathematics?},
+  author = {Massot, Patrick},
+  abstract = {We’ve been doing mathematics for more than two thousand years with remarkable success. Hence it is natural to be puzzled by people investing a lot of time and energy into a very new and weird way of doing mathematics: the formalized way where human beings explain mathematical definitions and proofs to computers. Beyond puzzlement, some people are wary. They think the traditional way may disappear, or maybe even mathematicians may disappear, being replaced by AI agents. These events are extremely unlikely and they are not the goals of the mathematical formalization community. We want to add to our tool set, without loosing anything we already have. In this text I’ll explain what we want to add, distinguishing what already partially exists and what is currently science fiction. Examples will use Lean, a proof assistant software developed mostly by Leonardo de Moura at Microsoft Research, but everything I’ll write applies to other proof assistants such as Coq or Isabelle.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/J6A3C387/Massot - Why formalize mathematics.pdf}
+}
+
+@online{MathlibStatistics,
+  title = {Mathlib Statistics},
+  url = {https://leanprover-community.github.io/mathlib_stats.html},
+  urldate = {2024-01-28}
+}
+
+@article{mattosLatentAutoregressiveGaussian2016,
+  title = {Latent {{Autoregressive Gaussian Processes Models}} for {{Robust System Identification}}},
+  author = {Mattos, César Lincoln C. and Damianou, Andreas and Barreto, Guilherme A. and Lawrence, Neil D.},
+  date = {2016},
+  journaltitle = {IFAC-PapersOnLine},
+  shortjournal = {IFAC-PapersOnLine},
+  volume = {49},
+  number = {7},
+  pages = {1121--1126},
+  issn = {24058963},
+  doi = {10.1016/j.ifacol.2016.07.353},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S2405896316305602},
+  urldate = {2022-04-21},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/3VH79UFV/Mattos et al. - 2016 - Latent Autoregressive Gaussian Processes Models fo.pdf}
+}
+
+@article{mazeikaMBSEsecModelBasedSystems2020,
+  title = {{{MBSEsec}}: {{Model-Based Systems Engineering Method}} for {{Creating Secure Systems}}},
+  shorttitle = {{{MBSEsec}}},
+  author = {Mazeika, Donatas and Butleris, Rimantas},
+  date = {2020-04},
+  journaltitle = {APPLIED SCIENCES-BASEL},
+  shortjournal = {Appl. Sci.-Basel},
+  volume = {10},
+  number = {7},
+  pages = {2574},
+  publisher = {MDPI},
+  location = {Basel},
+  issn = {2076-3417},
+  doi = {10.3390/app10072574},
+  url = {https://www.webofscience.com/wos/woscc/summary/563bee91-8c90-4554-ae8d-46c3ce0028ee-a808dfa0/relevance/1},
+  urldate = {2023-10-03},
+  abstract = {This paper presents how Model-Based System Engineering (MBSE) could be leveraged in order to mitigate security risks at an early stage of system development. Primarily, MBSE was used to manage complex engineering projects in terms of system requirements, design, analysis, verification, and validation activities, leaving security aspects aside. However, previous research showed that security requirements and risks could be tackled in the MBSE model, and powerful MBSE tools such as simulation, change impact analysis, automated document generation, validation, and verification could be successfully reused in the multidisciplinary field. This article analyzes various security-related techniques and then clarifies how these techniques can be represented in the Systems Modeling Language (SysML) model and then further exploited with MBSE tools. The paper introduces the MBSEsec method, which gives guidelines for the security analysis process, the SysML/UML-based security profile, and recommendations on what security technique is needed at each security process phase. The MBSEsec method was verified by creating an application case study that reflects real-world problems and running an experiment where systems and security engineers evaluated the feasibility of our approach.},
+  langid = {english},
+  pagetotal = {18},
+  annotation = {Web of Science ID: WOS:000533356200373},
+  file = {/home/danesabo/Zotero/storage/MQPTV3QX/Mazeika and Butleris - 2020 - MBSEsec Model-Based Systems Engineering Method fo.pdf}
+}
+
+@inproceedings{mclaughlinControllerawareFalseData2014,
+  title = {Controller-Aware False Data Injection against Programmable Logic Controllers},
+  booktitle = {2014 {{IEEE International Conference}} on {{Smart Grid Communications}} ({{SmartGridComm}})},
+  author = {McLaughlin, Stephen and Zonouz, Saman},
+  date = {2014-11},
+  pages = {848--853},
+  doi = {10.1109/SmartGridComm.2014.7007754},
+  url = {https://ieeexplore.ieee.org/abstract/document/7007754?casa_token=5fHXmr3Mw0gAAAAA:MwJ9mQcpKC7sgnJWqqUnn8wpx4Xs3qWnul5Vmski8Q9Key0ZrsnuqOPyxXKzONdiNpv7Dc_Oews},
+  urldate = {2024-08-08},
+  abstract = {Control systems rely on accurate sensor measurements to safely regulate physical processes. In False Data Injection (FDI) attacks, adversaries inject forged sensor measurements into a control system in hopes of misguiding control algorithms into taking dangerous actions. Traditional FDI attacks mostly require adversaries to know the full system topology, i.e., hundreds or thousands of lines and buses, while having unpredictable consequences. In this paper, we present a new class of FDI attacks directly against individual Programmable Logic Controllers (PLCs), which are ubiquitous in power generation and distribution. Our attack allows the adversary to have only partial information about the victim subsystem, and produces a predictable malicious result. Our attack tool analyzes an I/O trace of the compromised PLCs to produce a set of inputs to achieve the desired PLC outputs, i.e., the system behavior. It proceeds in two steps. First, our tool constructs a model of the PLC's internal logic from the I/O traces. Second, it searches for a set of inputs that cause the model to calculate the desired malicious behavior. We evaluate our tool against a set of representative control systems and show that it is a practical threat against insecure sensor configurations.},
+  eventtitle = {2014 {{IEEE International Conference}} on {{Smart Grid Communications}} ({{SmartGridComm}})},
+  keywords = {Automata,Control systems,Power systems,Process control,Servers,State estimation,Vectors},
+  file = {/home/danesabo/Zotero/storage/XRHNBS62/McLaughlin and Zonouz - 2014 - Controller-aware false data injection against prog.pdf;/home/danesabo/Zotero/storage/Q2LEVUCB/7007754.html}
+}
+
+@thesis{medeirosFaultIntrusionTolerant2011,
+  type = {mathesis},
+  title = {A Fault - and Intrusion - Tolerant Architecture for {{EDP Distribuição SCADA}} System},
+  author = {Medeiros, Nuno André Carnido},
+  date = {2011},
+  institution = {University of Lisbon},
+  url = {https://repositorio.ul.pt/handle/10451/8812},
+  urldate = {2022-03-31},
+  langid = {english},
+  annotation = {Accepted: 2013-07-16T11:03:46Z},
+  file = {/home/danesabo/Zotero/storage/Q96Y5J5L/Medeiros - 2011 - A fault - and intrusion - tolerant architecture fo.pdf;/home/danesabo/Zotero/storage/CF2UFJ88/8812.html}
+}
+
+@article{meinsmaElementaryProofRouthHurwitz1995,
+  title = {Elementary Proof of the {{Routh-Hurwitz}} Test},
+  author = {Meinsma, Gjerrit},
+  date = {1995-07},
+  journaltitle = {Systems \& Control Letters},
+  shortjournal = {Systems \& Control Letters},
+  volume = {25},
+  number = {4},
+  pages = {237--242},
+  issn = {01676911},
+  doi = {10.1016/0167-6911(94)00089-E},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/016769119400089E},
+  urldate = {2024-03-04},
+  abstract = {This note presents an elementary proof of the familiar Routh-Hurwitz test. The proof is basically one continuity argument, it does not rely on Sturm chains, Cauchy index and the principle of the argument and it is fully self-contained. In the same style an extended Routh-Hurwitz test is derived, which finds the inertia of polynomials.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/MBKYJJGI/Meinsma - 1995 - Elementary proof of the Routh-Hurwitz test.pdf}
+}
+
+@article{mendelsonIntroductionMathematicalLogic,
+  title = {Introduction to {{Mathematical Logic}}, {{Sixth Edition}}},
+  author = {Mendelson, Elliott},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/D6ICBWW3/Mendelson - Introduction to Mathematical Logic, Sixth Edition.pdf}
+}
+
+@article{mengODERUDynamicalSystem2022,
+  title = {{{ODE-RU}}: A Dynamical System View on Recurrent Neural Networks},
+  shorttitle = {{{ODE-RU}}},
+  author = {Meng, Pinchao and Wang, Xinyu and Yin, Weishi},
+  date = {2022},
+  journaltitle = {Electronic Research Archive},
+  shortjournal = {era},
+  volume = {30},
+  number = {1},
+  pages = {257--271},
+  issn = {2688-1594},
+  doi = {10.3934/era.2022014},
+  url = {http://www.aimspress.com/article/doi/10.3934/era.2022014},
+  urldate = {2024-01-30},
+  abstract = {{$<$}abstract{$><$}p{$>$}The core of the demonstration of this paper is to interpret the forward propagation process of machine learning as a parameter estimation problem of nonlinear dynamical systems. This process is to establish a connection between the Recurrent Neural Network and the discrete differential equation, so as to construct a new network structure: ODE-RU. At the same time, under the inspiration of the theory of ordinary differential equations, we propose a new forward propagation mode. In a large number of simulations and experiments, the forward propagation not only shows the trainability of the new architecture, but also achieves a low training error on the basis of main-taining the stability of the network. For the problem requiring long-term memory, we specifically study the obstacle shape reconstruction problem using the backscattering far-field features data set, and demonstrate the effectiveness of the proposed architecture using the data set. The results show that the network can effectively reduce the sensitivity to small changes in the input feature. And the error generated by the ordinary differential equation cyclic unit network in inverting the shape and position of obstacles is less than \$ 10\textasciicircum\{-2\} \$.{$<$}/p{$><$}/abstract{$>$}}
+}
+
+@inproceedings{mercaldoRealTimeSCADAAttack2019,
+  title = {Real-{{Time SCADA Attack Detection}} by {{Means}} of {{Formal Methods}}},
+  booktitle = {2019 {{IEEE}} 28th {{International Conference}} on {{Enabling Technologies}}: {{Infrastructure}} for {{Collaborative Enterprises}} ({{WETICE}})},
+  author = {Mercaldo, Francesco and Martinelli, Fabio and Santone, Antonella},
+  date = {2019-06},
+  pages = {231--236},
+  publisher = {IEEE},
+  location = {Napoli, Italy},
+  doi = {10.1109/WETICE.2019.00057},
+  url = {https://ieeexplore.ieee.org/document/8795430/},
+  urldate = {2023-10-10},
+  abstract = {SCADA control systems use programmable logic controller to interface with critical machines. SCADA systems are used in critical infrastructures, for instance, to control smart grid, oil pipelines, water distribution and chemical manufacturing plants: an attacker taking control of a SCADA system could cause various damages, both to the infrastructure but also to people (for instance, adding chemical substances into a water distribution systems). In this paper we propose a method to detect attacks targeting SCADA systems. We exploit model checking, in detail we model logs from SCADA systems into a network of timed automata and, through timed temporal logic, we characterize the behaviour of a SCADA system under attack. Experiments performed on a SCADA water distribution system confirmed the effectiveness of the proposed method.},
+  eventtitle = {2019 {{IEEE}} 28th {{International Conference}} on {{Enabling Technologies}}: {{Infrastructure}} for {{Collaborative Enterprises}} ({{WETICE}})},
+  isbn = {978-1-72810-676-2},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/VRHTCPS3/Mercaldo et al. - 2019 - Real-Time SCADA Attack Detection by Means of Forma.pdf}
+}
+
+@article{mercerSynthesizingVerifiedComponents2023,
+  title = {Synthesizing Verified Components for Cyber Assured Systems Engineering},
+  author = {Mercer, Eric and Slind, Konrad and Amundson, Isaac and Cofer, Darren and Babar, Junaid and Hardin, David},
+  date = {2023-10},
+  journaltitle = {SOFTWARE AND SYSTEMS MODELING},
+  shortjournal = {Softw. Syst. Model.},
+  volume = {22},
+  number = {5},
+  pages = {1451--1471},
+  publisher = {Springer Heidelberg},
+  location = {Heidelberg},
+  issn = {1619-1366, 1619-1374},
+  doi = {10.1007/s10270-023-01096-3},
+  url = {https://www.webofscience.com/api/gateway?GWVersion=2&SrcAuth=DynamicDOIArticle&SrcApp=UA&KeyAID=10.1007%2Fs10270-023-01096-3&DestApp=DOI&SrcAppSID=USW2EC0EC1PuWMCSXOYkyOwTcd6Fm&SrcJTitle=SOFTWARE+AND+SYSTEMS+MODELING&DestDOIRegistrantName=Springer-Verlag},
+  urldate = {2023-12-13},
+  abstract = {Safety-critical systems such as avionics need to be engineered to be cyber resilient meaning that systems are able to detect and recover from attacks or safely shutdown. As there are few development tools for cyber resiliency, designers rely on guidelines and checklists, sometimes missing vulnerabilities until late in the process where remediation is expensive. Our solution is a model-based approach with cyber resilience-improving transforms that insert high-assurance components such as filters to block malicious data or monitors to detect and alarm anomalous behavior. Novel is our use of model checking and a verified compiler to specify, verify, and synthesize these components. We define code contracts as formal specifications that designers write for high-assurance components, and test contracts as tests to validate their behavior. A model checker proves whether or not code contracts satisfy test contracts in an iterative development cycle. The same model checker also proves whether or not a system with the inserted components, assuming they adhere to their code contracts, provides the desired cyber resiliency for the system. We define an algorithm to synthesize implementations for code contracts in a semantics-preserving way that is backed by a verified compiler. The entire workflow is implemented as part of the open source BriefCASE toolkit. We report on our experience using BriefCASE with a case study on a UAV system that is transformed to be cyber resilient to communication and supply chain cyber attacks. Our case study demonstrates that writing code contracts and then synthesizing correct implementations from them are feasible in real-world systems engineering for cyber resilience.},
+  langid = {english},
+  pagetotal = {21},
+  keywords = {Important},
+  annotation = {Web of Science ID: WOS:000953658900001}
+}
+
+@article{meskeDesigningImplementingDigital2021,
+  title = {Designing and {{Implementing Digital Twins}} in the {{Energy Grid Sector}}},
+  author = {Meske, Christian and Osmundsen, Karen S. and Junglas, Iris},
+  date = {2021-09},
+  journaltitle = {Mis Quarterly Executive},
+  shortjournal = {MIS Q. Exec.},
+  volume = {20},
+  number = {3},
+  pages = {183--198},
+  publisher = {Indiana Univ, Oper \& Decision Technol Dept},
+  location = {Bloomington},
+  issn = {1540-1960},
+  doi = {10.17705/2msqe.00048},
+  url = {http://www.webofscience.com/wos/woscc/summary/marked/relevance/1?markedListId=List%202},
+  urldate = {2022-03-08},
+  abstract = {Digital twins, which replicate physical assets, are perceived as enablers of digital transformation. But implementations of digital twins are still rare, and there is little advice on how to successfully develop them. We describe how a Norwegian power grid company and its technology partners designed and implemented a digital twin of its grid network, and show that a digital twin's unique characteristics are a crucial source of organizational learning that require innovative co-creation efforts and effective data governance. We also provide recommendations for designing and implementing digital twins.(1, 2)},
+  langid = {english},
+  keywords = {DGC read},
+  annotation = {WOS:000694715100003},
+  file = {/home/danesabo/Zotero/storage/6442XE53/Meske et al. - 2021 - Designing and Implementing Digital Twins in the En.pdf}
+}
+
+@online{MethodQuantifyingProgram,
+  title = {A {{Method}} of {{Quantifying Program}} and {{Course Performances}} against {{ABET Criteria}} - {{Knovel}}},
+  url = {https://app-knovel-com.pitt.idm.oclc.org/web/view/khtml/show.v/rcid:kpANTECPS4/cid:kt003RZTC2/viewerType:khtml//root_slug:antec-2005-plastics-annual/url_slug:method-quantifying-program?b-q=designing%20and%20teaching%20courses%20to%20satisfy%20the%20abet%20engineering%20criteria&include_synonyms=no&s_page_no=0&sort_on=default&view=collapsed&zoom=1&page=1&q=designing%20and%20teaching%20courses%20to%20satisfy%20the%20abet%20engineering%20criteria},
+  urldate = {2024-01-30},
+  file = {/home/danesabo/Zotero/storage/RL3C8W53/A Method of Quantifying Program and Course Perform.pdf;/home/danesabo/Zotero/storage/JU5QLJ9F/url_slugmethod-quantifying-program.html}
+}
+
+@online{micaliCompactCertificatesCollective2020,
+  title = {Compact {{Certificates}} of {{Collective Knowledge}}},
+  author = {Micali, Silvio and Reyzin, Leonid and Vlachos, Georgios and Wahby, Riad S. and Zeldovich, Nickolai},
+  date = {2020},
+  number = {2020/1568},
+  url = {https://eprint.iacr.org/2020/1568},
+  urldate = {2024-04-01},
+  abstract = {We introduce compact certificate schemes, which allow any party to take a large number of signatures on a message M, by many signers of different weights, and compress them to a much shorter certificate. This certificate convinces the verifiers that signers with sufficient total weight signed M, even though the verifier will not see---let alone verify---all of the signatures. Thus, for example, a compact certificate can be used to prove that parties who jointly have a sufficient total account balance have attested to a given block in a blockchain. After defining compact certificates, we demonstrate an efficient compact certificate scheme. We then show how to implement such a scheme in a decentralized setting over an unreliable network and in the presence of adversarial parties who wish to disrupt certificate creation. Our evaluation shows that compact certificates are 50-280× smaller and 300-4000× cheaper to verify than a natural baseline approach.},
+  pubstate = {prepublished},
+  annotation = {Publication info: Published elsewhere. IEEE S\&P 2021},
+  file = {/home/danesabo/Zotero/storage/WPMWJK8Q/Micali et al. - 2020 - Compact Certificates of Collective Knowledge.pdf}
+}
+
+@article{micchelliLearningVectorValuedFunctions2005,
+  title = {On {{Learning Vector-Valued Functions}}},
+  author = {Micchelli, Charles A. and Pontil, Massimiliano},
+  date = {2005-01-01},
+  journaltitle = {Neural Computation},
+  shortjournal = {Neural Computation},
+  volume = {17},
+  number = {1},
+  pages = {177--204},
+  issn = {0899-7667, 1530-888X},
+  doi = {10.1162/0899766052530802},
+  url = {https://direct.mit.edu/neco/article/17/1/177-204/6909},
+  urldate = {2022-04-20},
+  abstract = {In this letter, we provide a study of learning in a Hilbert space of vector-valued functions. We motivate the need for extending learning theory of scalar-valued functions by practical considerations and establish some basic results for learning vector-valued functions that should prove useful in applications. Specifically, we allow an output space Y to be a Hilbert space, and we consider a reproducing kernel Hilbert space of functions whose values lie in Y. In this setting, we derive the form of the minimal norm interpolant to a finite set of data and apply it to study some regularization functionals that are important in learning theory. We consider specific examples of such functionals corresponding to multiple-output regularization networks and support vector machines, for both regression and classification. Finally, we provide classes of operator-valued kernels of the dot product and translation-invariant type.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/56WYVS4J/Micchelli and Pontil - 2005 - On Learning Vector-Valued Functions.pdf}
+}
+
+@article{michaelFormalMethodsCyberphysical2021,
+  title = {Formal {{Methods}} in {{Cyberphysical Systems}}},
+  author = {Michael, James Bret and Drusinsky, Doron and Wijesekera, Duminda},
+  date = {2021-09},
+  journaltitle = {Computer},
+  shortjournal = {Computer},
+  volume = {54},
+  number = {9},
+  pages = {25--29},
+  issn = {0018-9162, 1558-0814},
+  doi = {10.1109/MC.2021.3089267},
+  url = {https://ieeexplore.ieee.org/document/9524651/},
+  urldate = {2023-10-10},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/7B6RY3FU/Michael et al. - 2021 - Formal Methods in Cyberphysical Systems.pdf}
+}
+
+@book{michelStabilityDynamicalSystems2008,
+  title = {Stability of Dynamical Systems: Continuous, Discontinuous, and Discrete Systems},
+  shorttitle = {Stability of Dynamical Systems},
+  author = {Michel, Anthony N. and Hou, Ling and Liu, Derong},
+  date = {2008},
+  series = {Systems \& Control: Foundations \& Applications},
+  publisher = {Birkhäuser},
+  location = {Boston Basel Berlin},
+  isbn = {978-0-8176-4486-4},
+  langid = {english},
+  pagetotal = {501},
+  keywords = {DAS Get from Library},
+  note = {Literaturverz. S. 486 - 488},
+  file = {/home/danesabo/Zotero/storage/LRYF79TY/Michel et al. - 2008 - Stability of dynamical systems continuous, discon.pdf}
+}
+
+@article{mihalicHardwareintheLoopSimulationsHistorical2022,
+  title = {Hardware-in-the-{{Loop Simulations}}: {{A Historical Overview}} of {{Engineering Challenges}}},
+  shorttitle = {Hardware-in-the-{{Loop Simulations}}},
+  author = {Mihalič, Franc and Truntič, Mitja and Hren, Alenka},
+  date = {2022-01},
+  journaltitle = {Electronics},
+  volume = {11},
+  number = {15},
+  pages = {2462},
+  publisher = {Multidisciplinary Digital Publishing Institute},
+  issn = {2079-9292},
+  doi = {10.3390/electronics11152462},
+  url = {https://www.mdpi.com/2079-9292/11/15/2462},
+  urldate = {2024-08-08},
+  abstract = {The design of modern industrial products is further improved through the hardware-in-the-loop (HIL) simulation. Realistic simulation is enabled by the closed loop between the hardware under test (HUT) and real-time simulation. Such a system involves a field programmable gate array (FPGA) and digital signal processor (DSP). An HIL model can bypass serious damage to the real object, reduce debugging cost, and, finally, reduce the comprehensive effort during the testing. This paper provides a historical overview of HIL simulations through different engineering challenges, i.e., within automotive, power electronics systems, and different industrial drives. Various platforms, such as National Instruments, dSPACE, Typhoon HIL, or MATLAB Simulink Real-Time toolboxes and Speedgoat hardware systems, offer a powerful tool for efficient and successful investigations in different fields. Therefore, HIL simulation practice must begin already during the university’s education process to prepare the students for professional engagements in the industry, which was also verified experimentally at the end of the paper.},
+  issue = {15},
+  langid = {english},
+  keywords = {automotive,controller-in-the-loop (CIL),DC-DC converters,electric drives,grid applications,hardware-in-the-loop (HIL),inverter systems,power hardware-in-the-loop (PHIL),railway systems},
+  file = {/home/danesabo/Zotero/storage/NBUPXUBL/Mihalič et al. - 2022 - Hardware-in-the-Loop Simulations A Historical Ove.pdf}
+}
+
+@inproceedings{millerDistributedTrustedWeb2020,
+  title = {A {{Distributed}} and {{Trusted Web}} of~{{Formal Proofs}}},
+  booktitle = {Distributed {{Computing}} and {{Internet Technology}}},
+  author = {Miller, Dale},
+  editor = {Hung, Dang Van and D´Souza, Meenakshi},
+  date = {2020},
+  pages = {21--40},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-030-36987-3_2},
+  abstract = {Most computer checked proofs are tied to the particular technology of a prover’s software. While sharing results between proof assistants is a recognized and desirable goal, the current organization of theorem proving tools makes such sharing an exception instead of the rule. In this talk, I argue that we need to turn the current architecture of proof assistants and formal proofs inside-out. That is, instead of having a few mature theorem provers include within them their formally checked theorems and proofs, I propose that proof assistants should sit on the edge of a web of formal proofs and that proof assistant should be exporting their proofs so that they can exist independently of any theorem prover. While it is necessary to maintain the dependencies between definitions, theories, and theorems, no explicit library structure should be imposed on this web of formal proofs. Thus a theorem and its proofs should not necessarily be located at a particular URL or within a particular prover’s library. While the world of symbolic logic and proof theory certainly allows for proofs to be seen as global and permanent objects, there is a lot of research and engineering work that is needed to make this possible. I describe some of the required research and development that must be done to achieve this goal.},
+  isbn = {978-3-030-36987-3},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/URRHF3FX/Miller et al. - 2020 - A Distributed and Trusted Web of Formal Proofs.pdf}
+}
+
+@article{millerExplanationArtificialIntelligence2019,
+  title = {Explanation in Artificial Intelligence: {{Insights}} from the Social Sciences},
+  author = {Miller, Tim},
+  date = {2019},
+  journaltitle = {Artificial intelligence},
+  volume = {267},
+  pages = {1--38},
+  publisher = {Elsevier},
+  isbn = {0004-3702},
+  file = {/home/danesabo/Zotero/storage/87FCQ2AA/storage:storage:Explanation in Artificial Intelligence:
+Insights from the Social Sciences.pdf}
+}
+
+@article{miPredictionMaintenanceIntegrated2021,
+  title = {Prediction Maintenance Integrated Decision-Making Approach Supported by Digital Twin-Driven Cooperative Awareness and Interconnection Framework},
+  author = {Mi, Shanghua and Feng, Yixiong and Zheng, Hao and Wang, Yong and Gao, Yicong and Tan, Jianrong},
+  date = {2021-01},
+  journaltitle = {Journal of Manufacturing Systems},
+  shortjournal = {Journal of Manufacturing Systems},
+  volume = {58},
+  pages = {329--345},
+  issn = {02786125},
+  doi = {10.1016/j.jmsy.2020.08.001},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0278612520301345},
+  urldate = {2022-03-02},
+  abstract = {Predictive maintenance is one of the important technical means to guarantee and improve the normal industrial production. The existing bottlenecks for popularization and application are analyzed. In order to solve these problems, a cooperative awareness and interconnection framework across multiple organizations for total factors that affect prediction maintenance decision-making is discussed. Initially, the structure and operation mecha­ nism of this framework are proposed. It is designed to support the sharing of data, knowledge and resources. As a key supporting technology, the digital twin is also integrated into it to improve the accuracy of fault diagnosis and prediction and support making a maintenance plan with higher accuracy and reliability. Then, under this framework, an integrated mathematical programming model is established with considering the parameter uncertainty and an NSGA-II hybrid algorithm is utilized to solve it. Moreover, an adjustment strategy for a maintenance plan is discussed in response to the dynamic characteristics of the actual maintenance environment. Finally, a case, prediction maintenance decision-making for bearings in grinding rolls of the large vertical mill, is studied. Analysis results verify the advantage of the integrated solving mechanism based on the proposed framework. The framework and integrated decision-making approach can guide the implementation of predic­ tive maintenance with higher accuracy and reliability for industrial enterprises.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/BPP4UBBQ/Predicition maintenance intgrated DM supported by DT.pdf}
+}
+
+@online{MissionAccomplishedIntroduction,
+  title = {Mission {{Accomplished}}: {{An Introduction}} to {{Formal Methods}} in {{Mobile Robot Motion Planning}} and {{Control}} | {{Unmanned Systems}}},
+  url = {https://www.worldscientific.com/doi/abs/10.1142/S2301385014300029},
+  urldate = {2022-06-20},
+  file = {/home/danesabo/Zotero/storage/X6N9DR6A/S2301385014300029.html}
+}
+
+@video{mitcbmmDiffusionScoreBasedGenerative2023,
+  entrysubtype = {video},
+  title = {Diffusion and {{Score-Based Generative Models}}},
+  editor = {{MITCBMM}},
+  editortype = {director},
+  date = {2023-01-17},
+  url = {https://www.youtube.com/watch?v=wMmqCMwuM2Q},
+  urldate = {2023-10-10},
+  abstract = {Yang Song, Stanford University Generating data with complex patterns, such as images, audio, and molecular structures, requires fitting very flexible statistical models to the data distribution. Even in the age of deep neural networks, building such models is difficult because they typically require an intractable normalization procedure to represent a probability distribution. To address this challenge, we consider modeling the vector field of gradients of the data distribution (known as the score function), which does not require normalization and therefore can take full advantage of the flexibility of deep neural networks. I will show how to (1) estimate the score function from data with flexible deep neural networks and efficient statistical methods, (2) generate new data using stochastic differential equations and Markov chain Monte Carlo, and even (3) evaluate probability values accurately as in a traditional statistical model. The resulting method, called score-based generative modeling or diffusion modeling, achieves record performance in applications including image synthesis, text-to-speech generation, time series prediction, and point cloud generation, challenging the long-time dominance of generative adversarial networks (GANs) on many of these tasks. Furthermore, score-based generative models are particularly suitable for Bayesian reasoning tasks such as solving ill-posed inverse problems, yielding superior performance on several tasks in medical image reconstruction.}
+}
+
+@article{mitchellFlexibleExtensibleEfficient2008,
+  title = {The {{Flexible}}, {{Extensible}} and {{Efficient Toolbox}} of~{{Level~Set Methods}}},
+  author = {Mitchell, Ian M.},
+  date = {2008-06-01},
+  journaltitle = {Journal of Scientific Computing},
+  shortjournal = {J Sci Comput},
+  volume = {35},
+  number = {2},
+  pages = {300--329},
+  issn = {1573-7691},
+  doi = {10.1007/s10915-007-9174-4},
+  url = {https://doi.org/10.1007/s10915-007-9174-4},
+  urldate = {2023-10-12},
+  abstract = {Level set methods are a popular and powerful class of numerical algorithms for dynamic implicit surfaces and solution of Hamilton-Jacobi PDEs. While the advanced level set schemes combine both efficiency and accuracy, their implementation complexity makes it difficult for the community to reproduce new results and make quantitative comparisons between methods. This paper describes the Toolbox of Level Set Methods, a collection of Matlab routines implementing the basic level set algorithms on fixed Cartesian grids for rectangular domains in arbitrary dimension. The Toolbox’s code and interface are designed to permit flexible combinations of different schemes and PDE forms, allow easy extension through the addition of new algorithms, and achieve efficient execution despite the fact that the code is entirely written as m-files. The current contents of the Toolbox and some coding patterns important to achieving its flexibility, extensibility and efficiency are briefly explained, as is the process of adding two new algorithms. Code for both the Toolbox and the new algorithms is available from the Web.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/EVFD54ZF/Mitchell - 2008 - The Flexible, Extensible and Efficient Toolbox of .pdf}
+}
+
+@article{mitchellOverapproximatingReachableSets2003,
+  title = {Overapproximating {{Reachable Sets}} by {{Hamilton-Jacobi Projections}}},
+  author = {Mitchell, Ian M and Tomlin, Claire J},
+  date = {2003},
+  journaltitle = {Journal of Scientific Computing},
+  volume = {19},
+  number = {1--3},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/DYQGKXFC/Mitchell and Tomlin - Overapproximating Reachable Sets by Hamilton-Jacob.pdf}
+}
+
+@article{mitchellTimedependentHamiltonJacobiFormulation2005,
+  title = {A Time-Dependent {{Hamilton-Jacobi}} Formulation of Reachable Sets for Continuous Dynamic Games},
+  author = {Mitchell, I.M. and Bayen, A.M. and Tomlin, C.J.},
+  date = {2005-07},
+  journaltitle = {IEEE Transactions on Automatic Control},
+  shortjournal = {IEEE Trans. Automat. Contr.},
+  volume = {50},
+  number = {7},
+  pages = {947--957},
+  issn = {0018-9286},
+  doi = {10.1109/TAC.2005.851439},
+  url = {http://ieeexplore.ieee.org/document/1463302/},
+  urldate = {2023-10-27},
+  abstract = {We describe and implement an algorithm for computing the set of reachable states of a continuous dynamic game. The algorithm is based on a proof that the reachable set is the zero sublevel set of the viscosity solution of a particular time-dependent Hamilton–Jacobi–Isaacs partial differential equation. While alternative techniques for computing the reachable set have been proposed, the differential game formulation allows treatment of nonlinear systems with inputs and uncertain parameters. Because the time-dependent equation’s solution is continuous and defined throughout the state space, methods from the level set literature can be used to generate more accurate approximations than are possible for formulations with potentially discontinuous solutions. A numerical implementation of our formulation is described and has been released on the web. Its correctness is verified through a two vehicle, three dimensional collision avoidance example for which an analytic solution is available.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/HAFH38LK/Mitchell et al. - 2005 - A time-dependent Hamilton-Jacobi formulation of re.pdf}
+}
+
+@inproceedings{mitchellToolboxHamiltonJacobiSolvers2005,
+  title = {A {{Toolbox}} of {{Hamilton-Jacobi Solvers}} for {{Analysis}} of {{Nondeterministic Continuous}} and {{Hybrid Systems}}},
+  booktitle = {A {{Toolbox}} of {{Hamilton-Jacobi Solvers}} for {{Analysis}} of {{Nondeterministic Continuous}} and {{Hybrid Systems}}",},
+  author = {Mitchell, Ian M. and Templeton, Jeremy A.},
+  date = {2005},
+  pages = {480--494},
+  publisher = {Springer Berlin Heidelberg},
+  isbn = {978-3-540-31954-2},
+  file = {/home/danesabo/Zotero/storage/RVKB6TAB/_.pdf}
+}
+
+@article{mitchellToolboxLevelSet2005,
+  title = {A {{Toolbox}} of {{Level Set Methods}}},
+  author = {Mitchell, Ian},
+  date = {2005},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/NMEYXZEP/Mitchell - 2005 - A Toolbox of Level Set Methods.pdf}
+}
+
+@inproceedings{mitraFormalizedTheoryVerifying2008,
+  title = {A {{Formalized Theory}} for {{Verifying Stability}} and {{Convergence}} of {{Automata}} in {{PVS}}},
+  booktitle = {Theorem {{Proving}} in {{Higher Order Logics}}},
+  author = {Mitra, Sayan and Chandy, K. Mani},
+  editor = {Mohamed, Otmane Ait and Muñoz, César and Tahar, Sofiène},
+  date = {2008},
+  pages = {230--245},
+  publisher = {Springer},
+  location = {Berlin, Heidelberg},
+  doi = {10.1007/978-3-540-71067-7_20},
+  abstract = {Correctness of many hybrid and distributed systems require stability and convergence guarantees. Unlike the standard induction principle for verifying invariance, a theory for verifying stability or convergence of automata is currently not available. In this paper, we formalize one such theory proposed by Tsitsiklis [27]. We build on the existing PVS metatheory for untimed, timed, and hybrid input/output automata, and incorporate the concepts about fairness, stability, Lyapunov-like functions, and convergence. The resulting theory provides two sets of sufficient conditions, which when instantiated and verified for particular automata, guarantee convergence and stability, respectively.},
+  isbn = {978-3-540-71067-7},
+  langid = {english},
+  keywords = {Important},
+  file = {/home/danesabo/Zotero/storage/JBSEDF23/Mitra and Chandy - 2008 - A Formalized Theory for Verifying Stability and Co.pdf}
+}
+
+@online{MizarHomePage,
+  title = {Mizar {{Home Page}}},
+  url = {http://mizar.org/},
+  urldate = {2024-03-20},
+  file = {/home/danesabo/Zotero/storage/W9TGRJZ9/mizar.org.html}
+}
+
+@online{ModelBasedSystemsEngineering,
+  title = {Model-{{Based Systems Engineering}}},
+  url = {https://scaledagileframework.com/model-based-systems-engineering/},
+  urldate = {2023-10-06},
+  abstract = {All models are wrong, but some are useful. —George E. P. Box ~ Model-Based Systems Engineering MBSE is the application of modeling systems as a cost-effective way to explore and document system characteristics. By testing and validating system characteristics early, models facilitate timely learning of properties and behaviors, enabling fast feedback on requirements and design decisions. Models provide an efficient way to explore, update, and communicate system aspects to stakeholders while significantly reducing or eliminating dependence on traditional documents. MBSERead more},
+  langid = {american},
+  organization = {Scaled Agile Framework},
+  note = {\begin{quotation}
+https://www.mdpi.com/2079-8954/7/1/7/pdf
+
+\end{quotation}
+
+\par
+\begin{quotation}
+https://www.sebokwiki.org/wiki/INCOSE\_Systems\_Engineering\_Handbook
+
+\end{quotation}
+
+\par
+\begin{quotation}
+The Digital Transformation of the Product Management Process: Conception of Digital Twin Impacts for the Different Stages
+
+\end{quotation}},
+  file = {/home/danesabo/Zotero/storage/MLK9H74Z/model-based-systems-engineering.html;/home/danesabo/Zotero/storage/XZ8D7XM8/model-based-systems-engineering.html}
+}
+
+@online{ModelBasedSystemsEngineeringa,
+  title = {Model-{{Based Systems Engineering}} ({{MBSE}})},
+  url = {https://www.mathworks.com/solutions/model-based-systems-engineering.html},
+  urldate = {2023-10-06},
+  abstract = {Manage system complexity, improve communication, and produce optimized systems with Model-Based System Engineering.},
+  langid = {english}
+}
+
+@online{ModelFreePlantTuning,
+  title = {Model-{{Free Plant Tuning}} | {{IEEE Journals}} \& {{Magazine}} | {{IEEE Xplore}}},
+  url = {https://ieeexplore.ieee.org/abstract/document/7586127},
+  urldate = {2024-07-10}
+}
+
+@inproceedings{mohanS3ASecureSystem2013,
+  title = {{{S3A}}: Secure System Simplex Architecture for Enhanced Security and Robustness of Cyber-Physical Systems},
+  shorttitle = {{{S3A}}},
+  booktitle = {Proceedings of the 2nd {{ACM}} International Conference on {{High}} Confidence Networked Systems},
+  author = {Mohan, Sibin and Bak, Stanley and Betti, Emiliano and Yun, Heechul and Sha, Lui and Caccamo, Marco},
+  date = {2013-04-09},
+  series = {{{HiCoNS}} '13},
+  pages = {65--74},
+  publisher = {Association for Computing Machinery},
+  location = {New York, NY, USA},
+  doi = {10.1145/2461446.2461456},
+  url = {https://dl.acm.org/doi/10.1145/2461446.2461456},
+  urldate = {2023-09-27},
+  abstract = {The recently discovered 'W32.Stuxnet' worm has drastically changed the perception that systems managing critical infrastructure are invulnerable to software security attacks. Here we present an architecture that enhances the security of safety-critical cyber-physical systems despite the presence of such malware. Our architecture uses the property that control systems have deterministic real-time) execution behavior to detect an intrusion within 0.6 μs while still guaranteeing the safety of the plant. We also show that even if an attacker is successful (or gains access to the operating system's administrative privileges), the overall state of the physical system still remains safe.},
+  isbn = {978-1-4503-1961-4},
+  file = {/home/danesabo/Zotero/storage/LM7GC5CP/Mohan et al. - 2013 - S3A secure system simplex architecture for enhanc.pdf}
+}
+
+@article{molnarInterpretableMachineLearning,
+  title = {Interpretable {{Machine Learning}}},
+  author = {Molnar, Christoph},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/TB28329T/Molnar - Interpretable Machine Learning.pdf}
+}
+
+@article{montalvoFirstEvidencePivotal2016,
+  title = {First Evidence of the Pivotal Motion ("tilting Mode") of the Core {{Barrel}} in the {{RINGHALS-4 PWR}}},
+  author = {Montalvo, C. and Pazsit, Imre and Nylén, H. and Dykin, Victor},
+  date = {2016},
+  pages = {2571},
+  issn = {1510825738},
+  abstract = {The Division of Subatomic Physics and Plasma Physics (formerly Division of Nuclear Engineering) in Chalmers, Göteborg, and the Ringhals Nuclear Plant have investigated the core barrel vibrations in the Ringhals PWRs over the last 20 years. Based on the different symmetry properties of the vibration modes, a mode separation technique was developed to enhance the contributions from the different modes. Recent observations of wear at both the lower and upper core-barrel-support structures in the Ringhals PWRs indicated that vibration modes of the core barrel other than pendular (beam mode) and shell mode are likely to occur. A beam mode type movement alone is not able to explain such a wear, and therefore, it is fair to assume that the vibration mode in question is a small amplitude periodic tilting movement of the core barrel around a horizontal, diagonal pivot at the half height of the core. In this work, ex-core data taken in the Ringhals-4 PWR were analyzed in order to find evidence of such a tilting movement. First, cross spectra between various ex-core detectors were calculated and analyzed to locate the frequency range of the new vibrational mode. Then, a model based on symmetry considerations was derived in order to extract the sought mode from the spectra. The measurements were evaluated by the new mode enhancement technique. The results show that it is possible to enhance such a mode and find it in the spectra by properly combining the signals in the time domain.}
+}
+
+@inproceedings{montalvomartinSurveillanceDiagnosticsBeam2012,
+  title = {Surveillance and Diagnostics of the Beam Mode Vibrations of the Ringhals Pwrs},
+  author = {Montalvo Martín, Cristina and Pázsit, Imre and Nylén, Henrik},
+  date = {2012},
+  publisher = {E.T.S.I. Minas (UPM)},
+  abstract = {Surveillance of core barrel vibrations has been performed in the Swedish Ringhals PWRs for several years. This surveillance is focused mainly on the pendular motion of the core barrel, which is known as the beam mode. The monitoring of the beam mode has suggested that its amplitude increases along the cycle and decreases after refuelling. In the last 5 years several measurements have been taken in order to understand this behaviour. Besides, a non-linear fitting procedure has been implemented in order to better distinguish the different components of vibration. By using this fitting procedure, two modes of vibration have been identified in the frequency range of the beam mode. Several results coming from the trend analysis performed during these years indicate that one of the modes is due to the core barrel motion itself and the other is due to the individual flow induced vibrations of the fuel elements. In this work, the latest results of this monitoring are presented.},
+  note = {http://oa.upm.es/22878/1/INVE\_MEM\_2012\_153417.pdf | http://meetingsandconferences.com/physor2012/}
+}
+
+@online{Montreat360App2022,
+  title = {Montreat 360° | {{App}} for {{Students}} at {{Montreat College}}},
+  date = {2022-09-29T12:14:19-04:00},
+  url = {https://www.montreat.edu/student-life/montreat-360/},
+  urldate = {2023-11-07},
+  abstract = {Montreat 360° is an app for Montreat College students that helps track experiential learning - real-life experience - through campus involvement.},
+  langid = {american},
+  file = {/home/danesabo/Zotero/storage/9FJP5RP9/montreat-360.html}
+}
+
+@article{moratoOptimalInspectionMaintenance2022,
+  title = {Optimal {{Inspection}} and {{Maintenance Planning}} for {{Deteriorating Structural Components}} through {{Dynamic Bayesian Networks}} and {{Markov Decision Processes}}},
+  author = {Morato, P. G. and Papakonstantinou, K. G. and Andriotis, C. P. and Nielsen, J. S. and Rigo, P.},
+  date = {2022-01},
+  journaltitle = {Structural Safety},
+  shortjournal = {Structural Safety},
+  volume = {94},
+  eprint = {2009.04547},
+  eprinttype = {arXiv},
+  pages = {102140},
+  issn = {01674730},
+  doi = {10.1016/j.strusafe.2021.102140},
+  url = {http://arxiv.org/abs/2009.04547},
+  urldate = {2022-02-11},
+  abstract = {Civil and maritime engineering systems, among others, from bridges to offshore platforms and wind turbines, must be efficiently managed as they are exposed to deterioration mechanisms throughout their operational life, such as fatigue or corrosion. Identifying optimal inspection and maintenance policies demands the solution of a complex sequential decision-making problem under uncertainty, with the main objective of efficiently controlling the risk associated with structural failures. Addressing this complexity, risk-based inspection planning methodologies, supported often by dynamic Bayesian networks, evaluate a set of pre-defined heuristic decision rules to reasonably simplify the decision problem. However, the resulting policies may be compromised by the limited space considered in the definition of the decision rules. Avoiding this limitation, Partially Observable Markov Decision Processes (POMDPs) provide a principled mathematical methodology for stochastic optimal control under uncertain action outcomes and observations, in which the optimal actions are prescribed as a function of the entire, dynamically updated, state probability distribution. In this paper, we combine dynamic Bayesian networks with POMDPs in a joint framework for optimal inspection and maintenance planning, and we provide the relevant formulation for developing both infinite and finite horizon POMDPs in a structural reliability context. The proposed methodology is implemented and tested for the case of a structural component subject to fatigue deterioration, demonstrating the capability of state-of-the-art point-based POMDP solvers for solving the underlying planning optimization problem. Within the numerical experiments, POMDP and heuristic-based policies are thoroughly compared, and results showcase that POMDPs achieve substantially lower costs as compared to their counterparts, even for traditional problem settings.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/DY5RDTUF/Morato et al. - 2022 - Optimal Inspection and Maintenance Planning for De.pdf}
+}
+
+@article{morrisTOPOLOGYTEARS,
+  title = {{{TOPOLOGY WITHOUT TEARS}}},
+  author = {Morris, Sidney A},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/XW2TWDNT/Morris - TOPOLOGY WITHOUT TEARS.pdf}
+}
+
+@incollection{mouraLeanTheoremProver2021,
+  title = {The {{Lean}} 4 {{Theorem Prover}} and {{Programming Language}}},
+  booktitle = {Automated {{Deduction}} – {{CADE}} 28},
+  author = {Moura, Leonardo De and Ullrich, Sebastian},
+  editor = {Platzer, André and Sutcliffe, Geoff},
+  date = {2021},
+  volume = {12699},
+  pages = {625--635},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-030-79876-5_37},
+  url = {https://link.springer.com/10.1007/978-3-030-79876-5_37},
+  urldate = {2024-03-28},
+  abstract = {Lean 4 is a reimplementation of the Lean interactive theorem prover (ITP) in Lean itself. It addresses many shortcomings of the previous versions and contains many new features. Lean 4 is fully extensible: users can modify and extend the parser, elaborator, tactics, decision procedures, pretty printer, and code generator. The new system has a hygienic macro system custom-built for ITPs. It contains a new typeclass resolution procedure based on tabled resolution, addressing significant performance problems reported by the growing user base. Lean 4 is also an efficient functional programming language based on a novel programming paradigm called functional but in-place. Efficient code generation is crucial for Lean users because many write custom proof automation procedures in Lean itself.},
+  isbn = {978-3-030-79875-8 978-3-030-79876-5},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/3T2YF7EE/Moura and Ullrich - 2021 - The Lean 4 Theorem Prover and Programming Language.pdf}
+}
+
+@article{moyaDigitalTwinsThat2020,
+  title = {Digital Twins That Learn and Correct Themselves},
+  author = {Moya, Beatriz and Badías, Alberto and Alfaro, Icíar and Chinesta, Francisco and Cueto, Elías},
+  date = {2020-09-24},
+  journaltitle = {International Journal for Numerical Methods in Engineering},
+  shortjournal = {Int J Numer Methods Eng},
+  pages = {nme.6535},
+  issn = {0029-5981, 1097-0207},
+  doi = {10.1002/nme.6535},
+  url = {https://onlinelibrary.wiley.com/doi/10.1002/nme.6535},
+  urldate = {2022-03-02},
+  abstract = {Digital twins can be defined as digital representations of physical entities that employ real-time data to enable understanding of the operating conditions of these entities. Here we present a particular type of digital twin that involves a combination of computer vision, scientific machine learning, and augmented reality. This novel digital twin is able, therefore, to see, to interpret what it sees—and, if necessary, to correct the model it is equipped with—and presents the resulting information in the form of augmented reality. The computer vision capabilities allow the twin to receive data continuously. As any other digital twin, it is equipped with one or more models so as to assimilate data. However, if persistent deviations from the predicted values are found, the proposed methodology is able to correct on the fly the existing models, so as to accommodate them to the measured reality. Finally, the suggested methodology is completed with augmented reality capabilities so as to render a completely new type of digital twin. These concepts are tested against a proof-of-concept model consisting on a nonlinear, hyperelastic beam subjected to moving loads whose exact position is to be determined.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/DRTJ6ZXC/Digital twins that learn to correct themselves.pdf}
+}
+
+@inreference{MultipleIndependentLevels2022,
+  title = {Multiple {{Independent Levels}} of {{Security}}},
+  booktitle = {Wikipedia},
+  date = {2022-11-10T17:31:06Z},
+  url = {https://en.wikipedia.org/w/index.php?title=Multiple_Independent_Levels_of_Security&oldid=1121130466},
+  urldate = {2023-10-03},
+  abstract = {Multiple Independent Levels of Security/Safety (MILS) is a high-assurance security architecture based on the concepts of separation and controlled information flow. It is implemented by separation mechanisms that support both untrusted and trustworthy components; ensuring that the total security solution is non-bypassable, evaluatable, always invoked, and tamperproof.},
+  langid = {english},
+  annotation = {Page Version ID: 1121130466},
+  file = {/home/danesabo/Zotero/storage/ZYURWFPB/Multiple_Independent_Levels_of_Security.html}
+}
+
+@article{murakamiRecursiveRealizationFinite1977,
+  title = {Recursive Realization of Finite Impulse Filters Using Finite Field Arithmetic},
+  author = {Murakami, H. and Reed, I.},
+  date = {1977-03},
+  journaltitle = {IEEE Transactions on Information Theory},
+  volume = {23},
+  number = {2},
+  pages = {232--242},
+  issn = {1557-9654},
+  doi = {10.1109/TIT.1977.1055697},
+  url = {https://ieeexplore.ieee.org/abstract/document/1055697?casa_token=WxaCaYsb6t0AAAAA:sIXU77P4LJE4QYM_kf0nh2-nMmhNE1hRY63bzbXShn4DLd3XMuXZDv3t-wUU7VU3bV9rrEsVAQ},
+  urldate = {2024-02-08},
+  abstract = {Recursive filter design techniques are described and developed for finite impulse filters using finite field arithmetic. The finite fields considered have the formGF(q\textasciicircum 2), the Galois field ofq\textasciicircum 2elements, and are analogous to the field of complex numbers whenqis a prime such that(-1)is not a quadratic residue. These filters can be designed to yield either a desired finite impulse or finite frequency response function. This filtering technique has other possible applications, including the encoding or decoding of information and signal design. Infinite signal trains can be decomposed naturally into orthogonal sequences which may be useful in the encoding and decoding process and may provide another approach to convolutional coding. Since the recursive filters developed here do not have the accumulation of round-off or truncation error that one might expect in recursive computations, such filters are noise-free transducers in the sense of Shannon.},
+  eventtitle = {{{IEEE Transactions}} on {{Information Theory}}},
+  file = {/home/danesabo/Zotero/storage/LMURGEVV/Murakami and Reed - 1977 - Recursive realization of finite impulse filters us.pdf;/home/danesabo/Zotero/storage/KXMXCNTI/1055697.html}
+}
+
+@article{murataStateEquationControllability1977,
+  title = {State Equation, Controllability, and Maximal Matchings of Petri Nets},
+  author = {Murata, T.},
+  date = {1977-06},
+  journaltitle = {IEEE Transactions on Automatic Control},
+  volume = {22},
+  number = {3},
+  pages = {412--416},
+  issn = {1558-2523},
+  doi = {10.1109/TAC.1977.1101509},
+  url = {https://ieeexplore.ieee.org/abstract/document/1101509?casa_token=6Kx_Rj-ypzoAAAAA:FZk0V_DlefIBBBex-k6BgT11teKCHnusMDOVUOQCcYM_ABsm9Zn7DyDnzTwyo9X_TN-5QFJwAg},
+  urldate = {2024-02-15},
+  abstract = {Petri nets are a versatile modeling device for studying the structure and control of concurrent systems. Petri nets and related graph models have been used for modeling a wide variety of systems from computers to social systems. In order to introduce this interesting modeling device to the researcher in control theory, this paper discusses Petri nets in the context of the state equation for a linear discrete-time system. The controllability concept of dynamic systems is applied to Petri nets for the first time. It is also shown that the controllability and reachability of a Petri net are related to maximal matchings of its bipartite graph.},
+  eventtitle = {{{IEEE Transactions}} on {{Automatic Control}}},
+  file = {/home/danesabo/Zotero/storage/TZXPTX4X/Murata - 1977 - State equation, controllability, and maximal match.pdf}
+}
+
+@article{murdochDefinitionsMethodsApplications2019,
+  title = {Definitions, Methods, and Applications in Interpretable Machine Learning},
+  author = {Murdoch, W. James and Singh, Chandan and Kumbier, Karl and Abbasi-Asl, Reza and Yu, Bin},
+  date = {2019-10-29},
+  journaltitle = {Proceedings of the National Academy of Sciences},
+  shortjournal = {Proc. Natl. Acad. Sci. U.S.A.},
+  volume = {116},
+  number = {44},
+  pages = {22071--22080},
+  issn = {0027-8424, 1091-6490},
+  doi = {10.1073/pnas.1900654116},
+  url = {https://pnas.org/doi/full/10.1073/pnas.1900654116},
+  urldate = {2023-10-11},
+  abstract = {Significance             The recent surge in interpretability research has led to confusion on numerous fronts. In particular, it is unclear what it means to be interpretable and how to select, evaluate, or even discuss methods for producing interpretations of machine-learning models. We aim to clarify these concerns by defining interpretable machine learning and constructing a unifying framework for existing methods which highlights the underappreciated role played by human audiences. Within this framework, methods are organized into 2 classes: model based and post hoc. To provide guidance in selecting and evaluating interpretation methods, we introduce 3 desiderata: predictive accuracy, descriptive accuracy, and relevancy. Using our framework, we review existing work, grounded in real-world studies which exemplify our desiderata, and suggest directions for future work.           ,              Machine-learning models have demonstrated great success in learning complex patterns that enable them to make predictions about unobserved data. In addition to using models for prediction, the ability to interpret what a model has learned is receiving an increasing amount of attention. However, this increased focus has led to considerable confusion about the notion of interpretability. In particular, it is unclear how the wide array of proposed interpretation methods are related and what common concepts can be used to evaluate them. We aim to address these concerns by defining interpretability in the context of machine learning and introducing the predictive, descriptive, relevant (PDR) framework for discussing interpretations. The PDR framework provides 3 overarching desiderata for evaluation: predictive accuracy, descriptive accuracy, and relevancy, with relevancy judged relative to a human audience. Moreover, to help manage the deluge of interpretation methods, we introduce a categorization of existing techniques into model-based and post hoc categories, with subgroups including sparsity, modularity, and simulatability. To demonstrate how practitioners can use the PDR framework to evaluate and understand interpretations, we provide numerous real-world examples. These examples highlight the often underappreciated role played by human audiences in discussions of interpretability. Finally, based on our framework, we discuss limitations of existing methods and directions for future work. We hope that this work will provide a common vocabulary that will make it easier for both practitioners and researchers to discuss and choose from the full range of interpretation methods.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/XDEBM7CF/Murdoch et al. - 2019 - Definitions, methods, and applications in interpre.pdf}
+}
+
+@online{MysteriousNewRansomware,
+  title = {Mysterious {{New Ransomware Targets Industrial Control Systems}} | {{WIRED}}},
+  url = {https://www.wired.com/story/ekans-ransomware-industrial-control-systems/},
+  urldate = {2022-04-02},
+  file = {/home/danesabo/Zotero/storage/CCBQWWTS/ekans-ransomware-industrial-control-systems.html}
+}
+
+@report{narayananDeterringAttacksPower2020,
+  title = {Deterring {{Attacks Against}} the {{Power Grid}}: {{Two Approaches}} for the {{U}}.{{S}}. {{Department}} of {{Defense}}},
+  shorttitle = {Deterring {{Attacks Against}} the {{Power Grid}}},
+  author = {Narayanan, Anu and Welburn, Jonathan W. and Miller, Benjamin M. and Li, Sheng Tao and Clark-Ginsberg, Aaron},
+  date = {2020-01-06},
+  institution = {RAND Corporation},
+  url = {https://www.rand.org/pubs/research_reports/RR3187.html},
+  urldate = {2022-03-22},
+  abstract = {The U.S. Department of Defense (DoD) increasingly relies on electric power to accomplish critical missions. This report explores two approaches for deterring attacks against the U.S. power grid in a world of increasing cyber aggression: deterrence by denial and deterrence by cost imposition. It is a first step in developing frameworks and context to support DoD decisionmaking in this area.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/5EHCNLSF/Narayanan et al. - 2020 - Deterring Attacks Against the Power Grid Two Appr.pdf}
+}
+
+@inproceedings{nardoneFormalSecurityAssessment2016,
+  title = {Formal Security Assessment of {{Modbus}} Protocol},
+  booktitle = {2016 11th {{International Conference}} for {{Internet Technology}} and {{Secured Transactions}} ({{ICITST}})},
+  author = {Nardone, Roberto and Rodriguez, Ricardo J. and Marrone, Stefano},
+  date = {2016-12},
+  pages = {142--147},
+  publisher = {IEEE},
+  location = {Barcelona, Spain},
+  doi = {10.1109/ICITST.2016.7856685},
+  url = {http://ieeexplore.ieee.org/document/7856685/},
+  urldate = {2023-10-10},
+  abstract = {Critical infrastructures as water treatment, power distribution, or telecommunications, provide daily services essential to our lifestyle. Any service discontinuity can have a high impact into our society and even into our safety. Thus, security of these systems against intentional threats must be guaranteed. However, many of these systems are based on protocols initially designed to operate on closed, unroutable networks, making them an easy target for cybercriminals. In this regard, Modbus is a widely adopted protocol in control systems. Modbus protocol, however, lacks for security properties and is vulnerable to plenty of attacks (as spoofing, flooding, or replay, to name a few). In this paper, we propose a formal modeling of Modbus protocol using an extension of hierarchical state-machines that is automatically transformed to a Promela model. This model allows us to find counterexamples of security properties by model-checking. In particular, the original contribution of this paper is the formal demonstration of the existence of man-inthe-middle attacks in Modbus-based systems. Our approach also allows to formally evaluate security properties in future extensions of Modbus protocols.},
+  eventtitle = {2016 11th {{International Conference}} for {{Internet Technology}} and {{Secured Transactions}} ({{ICITST}})},
+  isbn = {978-1-908320-73-5},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/QRG7CDE9/Nardone et al. - 2016 - Formal security assessment of Modbus protocol.pdf}
+}
+
+@article{natbib,
+  title = {Natbib},
+  author = {Daly, Patrick W},
+  pages = {26},
+  abstract = {The natbib package is a reimplementation of the LATEX \textbackslash cite command, to work with both author–year and numerical citations. It is compatible with the standard bibliographic style files, such as plain.bst, as well as with those for harvard, apalike, chicago, astron, authordate, and of course natbib.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/3PY4547M/Daly - Natural Sciences Citations and References.pdf}
+}
+
+@online{NationalCentersAcademic,
+  title = {National {{Centers}} of {{Academic Excellence}}},
+  url = {https://www.nsa.gov/Academics/Centers-of-Academic-Excellence/},
+  urldate = {2023-11-07},
+  file = {/home/danesabo/Zotero/storage/RR2T9T7R/Centers-of-Academic-Excellence.html}
+}
+
+@misc{NationalCyberInformedEngineering2022,
+  title = {National {{Cyber-Informed Engineering Strategy}}},
+  date = {2022-06},
+  url = {https://inl.gov/content/uploads/2023/07/FINAL-DOE-National-CIE-Strategy-June-2022_0.pdf},
+  file = {/home/danesabo/Zotero/storage/NZCYT7EW/FINAL DOE National CIE Strategy - June 2022_0.pdf}
+}
+
+@misc{NationalCyberSecurity2023,
+  title = {National {{Cyber Security Strategy}}},
+  date = {2023-03},
+  url = {https://www.whitehouse.gov/wp-content/uploads/2023/03/National-Cybersecurity-Strategy-2023.pdf},
+  file = {/home/danesabo/Zotero/storage/QMSLB5F7/National-Cybersecurity-Strategy-2023.pdf}
+}
+
+@book{nationalmaterialsandmanufacturingboardVisionFutureCenterBased2016,
+  title = {A {{Vision}} for the {{Future}} of {{Center-Based Multidisciplinary Engineering Research}}: {{Proceedings}} of a {{Symposium}}},
+  shorttitle = {A {{Vision}} for the {{Future}} of {{Center-Based Multidisciplinary Engineering Research}}},
+  author = {{National Materials and Manufacturing Board} and {Division on Engineering and Physical Sciences} and {National Academy of Engineering} and {National Academies of Sciences, Engineering, and Medicine}},
+  editor = {Alper, Joe},
+  date = {2016},
+  pages = {23645},
+  publisher = {National Academies Press},
+  location = {Washington, D.C.},
+  doi = {10.17226/23645},
+  url = {http://www.nap.edu/catalog/23645},
+  urldate = {2024-01-26},
+  isbn = {978-0-309-44970-0},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/NXSJH9UD/National Materials and Manufacturing Board et al. - 2016 - A Vision for the Future of Center-Based Multidisci.pdf}
+}
+
+@online{nccic2017,
+  title = {{{NCCIC Year}} in {{Review}} 2017},
+  date = {2017},
+  url = {https://www.cisa.gov/uscert/sites/default/files/Annual_Reports/NCCIC_Year_in_Review_2017_Final.pdf},
+  urldate = {2022-03-25},
+  file = {/home/danesabo/Zotero/storage/KNAKW7F6/NCCIC_Year_in_Review_2017_Final.pdf}
+}
+
+@report{NCEES2022Annual2022,
+  title = {{{NCEES}} 2022 {{Annual Report}}},
+  date = {2022},
+  institution = {National Council of Examiners for Engineering an Surveying},
+  file = {/home/danesabo/Zotero/storage/2DSKLL2B/Annual-report-2022-flip.pdf}
+}
+
+@report{neemaCyPhyMLLanguageMETA,
+  title = {{{CyPhyML Language}} in the {{META Toolchain}}.Pdf},
+  author = {Neema, Sandeep and Scott, Jason and Bapty, Ted},
+  number = {ISIS-15-104},
+  file = {/home/danesabo/Zotero/storage/J9AQG6EV/CyPhyML Language in the META Toolchain.pdf}
+}
+
+@book{nekrashevychGroupsTopologicalDynamics2022,
+  title = {Groups and {{Topological Dynamics}}},
+  author = {Nekrashevych, Volodymyr},
+  date = {2022},
+  publisher = {American Mathematical Society},
+  location = {Providence, UNITED STATES},
+  url = {http://ebookcentral.proquest.com/lib/pitt-ebooks/detail.action?docID=29731920},
+  urldate = {2024-01-17},
+  isbn = {978-1-4704-7119-4},
+  file = {/home/danesabo/Zotero/storage/YAM3TMUI/reader.html}
+}
+
+@article{nemouchiFormallyVerifiedZTA2023,
+  title = {Formally {{Verified ZTA Requirements}} for {{OT}}/{{ICS Environments}} with {{Isabelle}}/{{HOL}}: {{Preprint}}},
+  author = {Nemouchi, Yakoub and Etigowni, Sriharsha and Zolan, Alexander and Macwan, Richard},
+  date = {2023},
+  journaltitle = {Renewable Energy},
+  abstract = {The clean energy transformation led to the integration of distributed energy resources on a top of the grid, and so a substantial increase in the complexity of power grids infrastructure and the underlying operational technology environment. Operational technology environments are becoming a system of systems, integrating heterogeneous devices which are software/hardware intensive, have ever increasing demands to exploit advances in commodity of software/hardware infrastructures, and this for good reasons – improving energy systems requirements such as cybersecurity and resilience. In such a setting, system requirements at different levels mix, thus undesirable outcomes will surely happen. The use of formal methods will remove ambiguity, increase automation and provide high levels of assurance and reliability. In this paper, we contribute a methodology and a framework for the system level verification of zero trust architecture requirements in operational technology environments. We define a formal specification for the core functionalities of operational technology environments, the corresponding invariants, and security proofs. Of particular note is our modular approach for the formal verification of asynchronous interactions in operational technology environments. The formal specification and the proofs have been mechanized using the interactive theorem proving environment Isabelle/HOL.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/63N6XVPW/Nemouchi et al. - 2023 - Formally Verified ZTA Requirements for OTICS Envi.pdf}
+}
+
+@report{nemouchiFormallyVerifiedZTA2023a,
+  title = {Formally {{Verified ZTA Requirements}} for {{OT}}/{{ICS Environments}} with {{Isabelle}}/{{HOL}}: {{Preprint}}},
+  shorttitle = {Formally {{Verified ZTA Requirements}} for {{OT}}/{{ICS Environments}} with {{Isabelle}}/{{HOL}}},
+  author = {Nemouchi, Yakoub and Etigowni, Sriharsha and Zolan, Alexander and Macwan, Richard},
+  date = {2023-11-29},
+  number = {NREL/CP-5R00-86154},
+  institution = {National Renewable Energy Laboratory (NREL), Golden, CO (United States)},
+  url = {https://www.osti.gov/biblio/2228660},
+  urldate = {2024-04-29},
+  abstract = {The clean energy transformation led to the integration of distributed energy resources on a top of the grid, and so a substantial increase in the complexity of power grids infrastructure and the underlying operational technology environment. Operational technology environments are becoming a system of systems, integrating heterogeneous devices which are software/hardware intensive, have ever increasing demands to exploit advances in commodity of software/hardware infrastructures, and this for good reasons - improving energy systems requirements such as cybersecurity and resilience. In such a setting, system requirements at different levels mix, thus undesirable outcomes will surely happen. The use of formal methods will remove ambiguity, increase automation and provide high levels of assurance and reliability. In this paper, we contribute a methodology and a framework for the system level verification of zero trust architecture requirements in operational technology environments. We define a formal specification for the core functionalities of operational technology environments, the corresponding invariants, and security proofs. Of particular note is our modular approach for the formal verification of asynchronous interactions in operational technology environments. The formal specification and the proofs have been mechanized using the interactive theorem proving environment Isabelle/HOL.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/MFCB2KR9/Nemouchi et al. - 2023 - Formally Verified ZTA Requirements for OTICS Envi.pdf}
+}
+
+@article{nestlerCompetencyCybersecurityEducation,
+  title = {Competency in {{Cybersecurity Education}}:},
+  author = {Nestler, Vincent and Fowler, Zoe},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/GSD9XMAQ/Nestler and Fowler - Competency in Cybersecurity Education.pdf}
+}
+
+@article{netlSystemsViewModern2007,
+  title = {A Systems View of the Modern Grid},
+  author = {family=NETL, given=US, given-i=US},
+  date = {2007},
+  journaltitle = {White Paper, Jan},
+  file = {/home/danesabo/Zotero/storage/PZIF5KHC/NETL - 2007 - A systems view of the modern grid.pdf}
+}
+
+@article{neureiterDomainSpecificModelBased2022,
+  title = {A {{Domain-Specific}}, {{Model Based Systems Engineering Approach}} for {{Cyber-Physical Systems}}},
+  author = {Neureiter, Christian and Binder, Christoph},
+  date = {2022-04},
+  journaltitle = {SYSTEMS},
+  shortjournal = {Systems-Basel},
+  volume = {10},
+  number = {2},
+  pages = {42},
+  publisher = {MDPI},
+  location = {Basel},
+  issn = {2079-8954},
+  doi = {10.3390/systems10020042},
+  url = {https://www.webofscience.com/wos/woscc/summary/563bee91-8c90-4554-ae8d-46c3ce0028ee-a808dfa0/relevance/2},
+  urldate = {2023-10-03},
+  abstract = {Model Based Systems Engineering as a scientific discipline tries to address the increasing complexity of today's cyber-physical systems by utilizing different kinds of models. In practical application, however, this approach is often constrained to SysML-based object modeling. Even though this appears to be a suitable approach for dealing with complexity, various restrictions limit stakeholder acceptance. Considering scientific discussions in the context of modeling shows two different schools of thought. On the one hand, arguments for more formalized and rigorous concepts can be found, where on the other hand, the need for more stakeholder-oriented and easier-to-understand concepts is postulated. As both are reasonable, the question of integration arises. To address this aspect, we developed the concept of Domain Specific Systems Engineering. Our research in this field lasted for nearly a decade, and different aspects have been investigated. This paper contributes a summary of the overall approach that integrates the various aspects investigated so far. Thus, the underlying concepts are explained, and the corresponding modeling stack and tool-chain are described in more detail. Further, the practical experiences from various case studies are summarized, and identified shortcomings are discussed.},
+  langid = {english},
+  pagetotal = {27},
+  annotation = {Web of Science ID: WOS:000786858800001},
+  file = {/home/danesabo/Zotero/storage/LLE4QGNK/Neureiter and Binder - 2022 - A Domain-Specific, Model Based Systems Engineering.pdf}
+}
+
+@article{newellTranslationIEC6113132018,
+  title = {Translation of {{IEC}} 61131-3 {{Function Block Diagrams}} to {{PVS}} for {{Formal Verification}} with {{Real-Time Nuclear Application}}},
+  author = {Newell, Josh and Pang, Linna and Tremaine, David and Wassyng, Alan and Lawford, Mark},
+  date = {2018-01},
+  journaltitle = {Journal of Automated Reasoning},
+  shortjournal = {J Autom Reasoning},
+  volume = {60},
+  number = {1},
+  pages = {63--84},
+  issn = {0168-7433, 1573-0670},
+  doi = {10.1007/s10817-017-9415-7},
+  url = {http://link.springer.com/10.1007/s10817-017-9415-7},
+  urldate = {2023-10-10},
+  abstract = {The trip computers for the two reactor shutdown systems of the Ontario Power Generation (OPG) Darlington Nuclear Power Generating Station are being refurbished due to hardware obsolescence. For one of the systems, the general purpose computer originally used is being replaced by a programmable logic controller (PLC). The trip computer application software has been rewritten using function block diagrams (FBDs), a commonly used PLC programming language defined in the IEC 61131-3 standard. The replacement project’s quality assurance program requires that formal verification be performed to compare the FBDs against a formal software requirements specification written using tabular expressions (TEs). The PVS theorem proving tool is used in formal verification. Custom tools developed for OPG are used to translate TEs and FBDs into PVS code. In this paper, we present a method to rigorously translate the graphical FBD language to a mathematical model in PVS using an abstract syntax to represent the FBD constructs. We use an example from the replacement project to demonstrate the use of the model to translate a FBD module into a PVS specification. We then extend that example to demonstrate the method’s applicability to a Simulink-based design.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/67NML3RN/Newell et al. - 2018 - Translation of IEC 61131-3 Function Block Diagrams.pdf}
+}
+
+@article{newmanWidespreadLogicController,
+  entrysubtype = {magazine},
+  title = {A {{Widespread Logic Controller Flaw Raises}} the {{Specter}} of {{Stuxnet}}},
+  author = {Newman, Lily Hay},
+  journaltitle = {Wired},
+  issn = {1059-1028},
+  url = {https://www.wired.com/story/siemens-s7-1500-logic-controller-flaw/},
+  urldate = {2024-04-04},
+  abstract = {More than 120 models of Siemens' S7-1500 PLCs contain a serious vulnerability—and no fix is on the way.},
+  langid = {american}
+}
+
+@inproceedings{nghiemMontecarloTechniquesFalsification2010,
+  title = {Monte-Carlo Techniques for Falsification of Temporal Properties of Non-Linear Hybrid Systems},
+  booktitle = {Proceedings of the 13th {{ACM}} International Conference on {{Hybrid}} Systems: Computation and Control},
+  author = {Nghiem, Truong and Sankaranarayanan, Sriram and Fainekos, Georgios and Ivancić, Franjo and Gupta, Aarti and Pappas, George J.},
+  date = {2010-04-12},
+  series = {{{HSCC}} '10},
+  pages = {211--220},
+  publisher = {Association for Computing Machinery},
+  location = {New York, NY, USA},
+  doi = {10.1145/1755952.1755983},
+  url = {https://dl.acm.org/doi/10.1145/1755952.1755983},
+  urldate = {2023-11-03},
+  abstract = {We present a Monte-Carlo optimization technique for finding inputs to a system that falsify a given Metric Temporal Logic (MTL) property. Our approach performs a random walk over the space of inputs guided by a robustness metric defined by the MTL property. Robustness can be used to guide our search for a falsifying trajectory by exploring trajectories with smaller robustness values. We show that the notion of robustness can be generalized to consider hybrid system trajectories. The resulting testing framework can be applied to non-linear hybrid systems with external inputs. We show through numerous experiments on complex systems that using our framework can help automatically falsify properties with more consistency as compared to other means such as uniform sampling.},
+  isbn = {978-1-60558-955-8},
+  file = {/home/danesabo/Zotero/storage/XQEMQJB8/Nghiem et al. - 2010 - Monte-carlo techniques for falsification of tempor.pdf}
+}
+
+@article{nguyenDeepReinforcementLearning2021,
+  title = {Deep {{Reinforcement Learning}} for {{Cyber Security}}},
+  author = {Nguyen, Thanh Thi and Reddi, Vijay Janapa},
+  date = {2021},
+  journaltitle = {IEEE Transactions on Neural Networks and Learning Systems},
+  shortjournal = {IEEE Trans. Neural Netw. Learning Syst.},
+  eprint = {1906.05799},
+  eprinttype = {arXiv},
+  pages = {1--17},
+  issn = {2162-237X, 2162-2388},
+  doi = {10.1109/TNNLS.2021.3121870},
+  url = {http://arxiv.org/abs/1906.05799},
+  urldate = {2022-03-02},
+  abstract = {The scale of Internet-connected systems has increased considerably, and these systems are being exposed to cyber attacks more than ever. The complexity and dynamics of cyber attacks require protecting mechanisms to be responsive, adaptive, and scalable. Machine learning, or more specifically deep reinforcement learning (DRL), methods have been proposed widely to address these issues. By incorporating deep learning into traditional RL, DRL is highly capable of solving complex, dynamic, and especially high-dimensional cyber defense problems. This paper presents a survey of DRL approaches developed for cyber security. We touch on different vital aspects, including DRL-based security methods for cyber-physical systems, autonomous intrusion detection techniques, and multiagent DRL-based game theory simulations for defense strategies against cyber attacks. Extensive discussions and future research directions on DRL-based cyber security are also given. We expect that this comprehensive review provides the foundations for and facilitates future studies on exploring the potential of emerging DRL to cope with increasingly complex cyber security problems.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/HCDIHBAG/DRL for cyber security.pdf}
+}
+
+@article{nguyenDigitalTwinApproach2022,
+  title = {A Digital Twin Approach to System-Level Fault Detection and Diagnosis for Improved Equipment Health Monitoring},
+  author = {Nguyen, Tat Nghia and Ponciroli, Roberto and Bruck, Paul and Esselman, Thomas C. and Rigatti, Joseph A. and Vilim, Richard B.},
+  date = {2022-06},
+  journaltitle = {Annals of Nuclear Energy},
+  shortjournal = {Annals of Nuclear Energy},
+  volume = {170},
+  pages = {109002},
+  issn = {03064549},
+  doi = {10.1016/j.anucene.2022.109002},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0306454922000378},
+  urldate = {2023-10-11},
+  abstract = {Automating the task of fault detection and diagnosis is crucial in the effort to reduce the operation and maintenance cost in the nuclear industry. This paper describes a physics-based approach for system-level diagnosis in thermal–hydraulic systems in nuclear power plants. The inclusion of physics information allows for the creation of virtual sensors, which provide improved fault diagnosis capability. The physics information also serves to better constrain diagnostic solutions to the physical domain. As a demonstration, various test cases for fault diagnosis in a high-pressure feedwater system were considered. The use of virtual sensors allows constructing performance models for two first-point feedwater heaters which would not have been possible otherwise due to the limited sensor set. Real-time plant data provided by a utility partner were used to assess the diagnostic approach. The detection of an abnormal event immediate after a plant startup pointed to faulty behaviors in the two first-point feedwater heaters. This double-blind fault diagnosis was subsequently confirmed by the plant operator. In addition, several simulated sensor fault events demonstrated the capability of our algorithms in detecting and discriminating sensor faults.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/CQ86LIZC/Nguyen et al. - 2022 - A digital twin approach to system-level fault dete.pdf}
+}
+
+@article{nguyenFuzzyControlSystems2019,
+  title = {Fuzzy {{Control Systems}}: {{Past}}, {{Present}} and {{Future}}},
+  shorttitle = {Fuzzy {{Control Systems}}},
+  author = {Nguyen, Anh-Tu and Taniguchi, Tadanari and Eciolaza, Luka and Campos, Victor and Palhares, Reinaldo and Sugeno, Michio},
+  date = {2019-02},
+  journaltitle = {IEEE Computational Intelligence Magazine},
+  volume = {14},
+  number = {1},
+  pages = {56--68},
+  issn = {1556-6048},
+  doi = {10.1109/MCI.2018.2881644},
+  url = {https://ieeexplore.ieee.org/abstract/document/8610273},
+  urldate = {2024-07-10},
+  abstract = {More than 40 years after fuzzy logic control appeared as an effective tool to deal with complex processes, the research on fuzzy control systems has constantly evolved. Mamdani fuzzy control was originally introduced as a model-free control approach based on expert?s experience and knowledge. Due to the lack of a systematic framework to study Mamdani fuzzy systems, we have witnessed growing interest in fuzzy model-based approaches with Takagi-Sugeno fuzzy systems and singleton-type fuzzy systems (also called piecewise multiaffine systems) over the past decades. This paper reviews the key features of the three above types of fuzzy systems. Through these features, we point out the historical rationale for each type of fuzzy systems and its current research mainstreams. However, the focus is put on fuzzy model-based approaches developed via Lyapunov stability theorem and linear matrix inequality (LMI) formulations. Finally, our personal viewpoint on the perspectives and challenges of the future fuzzy control research is discussed.},
+  eventtitle = {{{IEEE Computational Intelligence Magazine}}},
+  keywords = {Analytical models,Fuzzy control,Fuzzy logic,Fuzzy systems,Linguistics,Nonlinear systems,Stability analysis,Zadeh Lotfi},
+  file = {/home/danesabo/Zotero/storage/ZKLBNTQI/Nguyen et al. - 2019 - Fuzzy Control Systems Past, Present and Future.pdf;/home/danesabo/Zotero/storage/WGCQAM84/8610273.html}
+}
+
+@article{nguyenModelBasedDiagnosticFrameworks,
+  title = {Model-{{Based Diagnostic Frameworks}} for {{Fault Detection}} and {{System Monitoring}} in {{Nuclear Engineering Systems}}},
+  author = {Nguyen, Tat Nghia},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/D9GHLNPC/Nguyen - Model-Based Diagnostic Frameworks for Fault Detect.pdf}
+}
+
+@article{nguyenModelbasedSecurityEngineering2017,
+  title = {Model-Based Security Engineering for Cyber-Physical Systems: {{A}} Systematic Mapping Study},
+  shorttitle = {Model-Based Security Engineering for Cyber-Physical Systems},
+  author = {Nguyen, Phu H. and Ali, Shaukat and Yue, Tao},
+  date = {2017-03},
+  journaltitle = {INFORMATION AND SOFTWARE TECHNOLOGY},
+  shortjournal = {Inf. Softw. Technol.},
+  volume = {83},
+  pages = {116--135},
+  publisher = {Elsevier},
+  location = {Amsterdam},
+  issn = {0950-5849, 1873-6025},
+  doi = {10.1016/j.infsof.2016.11.004},
+  url = {https://www.webofscience.com/wos/woscc/summary/563bee91-8c90-4554-ae8d-46c3ce0028ee-a808dfa0/relevance/2},
+  urldate = {2023-10-03},
+  abstract = {Context: Cyber-physical systems (CPSs) have emerged to be the next generation of engineered systems driving the so-called fourth industrial revolution. CPSs are becoming more complex, open and more prone to security threats, which urges security to be engineered systematically into CPSs. Model-Based Security Engineering (MBSE) could be a key means to tackle this challenge via security by design, abstraction, and automation. Objective: We aim at providing an initial assessment of the state of the art in MBSE for CPSs (MBSE4CPS). Specifically, this work focuses on finding out I) the publication statistics of MBSE4CPS studies; 2) the characteristics of MBSE4CPS studies; and 3) the open issues of MBSE4CPS research. Method: We conducted a systematic mapping study (SMS) following a rigorous protocol that was developed based on the state-of-the-art SMS and systematic review guidelines. From thousands of relevant publications, we systematically identified 48 primary MBSE4CPS studies for data extraction and synthesis to answer predefined research questions. Results: SMS results show that for three recent years (2014-2016) the number of primary MBSE4CPS studies has increased significantly. Within the primary studies, the popularity of using Domain-Specific Languages (DSLs) is comparable with the use of the standardised UML modelling notation. Most primary studies do not explicitly address specific security concerns (e.g., confidentiality, integrity) but rather focus on security analyses in general on threats, attacks or vulnerabilities. Few primary studies propose to engineer security solutions for CPSs. Many focus on the early stages of development lifecycle such as security requirement engineering or analysis. Conclusion: The SMS does not only provide the state of the art in MBSE4CPS, but also points out several open issues that would deserve more investigation, e.g., the lack of engineering security solutions for CPSs, limited tool support, too few industrial case studies, and the challenge of bridging DSLs in engineering secure CPSs. (C) 2016 Elsevier B.V. All rights reserved.},
+  langid = {english},
+  pagetotal = {20},
+  annotation = {Web of Science ID: WOS:000393006700007}
+}
+
+@inproceedings{nguyenPrivacyfirstManufacturingData2023,
+  title = {Towards {{Privacy-first Manufacturing Data Exchange Platform}}},
+  booktitle = {Proceedings of the 12th {{International Symposium}} on {{Information}} and {{Communication Technology}}},
+  author = {Nguyen, Thanh-Hai and Heron, Olivier and Riou, Olivier},
+  date = {2023-12-07},
+  series = {{{SOICT}} '23},
+  pages = {801--807},
+  publisher = {Association for Computing Machinery},
+  location = {New York, NY, USA},
+  doi = {10.1145/3628797.3628913},
+  url = {https://dl.acm.org/doi/10.1145/3628797.3628913},
+  urldate = {2024-02-01},
+  abstract = {Reducing their operating costs and optimizing manufacturing processes are main challenges for manufacturers that need no-doubt help from machine suppliers-OEMs. However, like 64\% of Business entities, they do not intend to collaborate as long as their confidential data can be seen by anyone. Until now, some solutions on market using technologies like Confidential Computing, Differential Privacy, Multi Party Computation cannot completely fit to industrial requirements, data are sometimes partially encrypted or using trust execution environment (a bunker) to analyse in clear format. For this reason, until now, no secure computation and no solution for privacy-preserving data analysis are yet completely satisfactory (in terms of privacy and security constraints) and moreover they are often tested for different applications and on different datasets. Fully Homomorphic Encryption (FHE) technology is going to change the game. FHE allows service providers to work directly on encrypted data without ever decrypting it, which offers a privacy data protection for both customers and OEMs. In the collaboration with Siemens France, we provide FHE-based manufacturing data exchange space which is a part of RaiseSens© Data eXchange Platform (RS-DXP). In this respect, API-driven RS-DXP architecture allows the practical and easy integration of FHE techniques combined with optimisation engine, and non-moving data techniques applied in lightweight yet real-world manufacturing applications and deploying them in Cloud computing environment to offer a solution at low software engineering cost. This will pave the way for a wide deployment, boosting data-enabled manufacturing services.},
+  isbn = {9798400708916},
+  file = {/home/danesabo/Zotero/storage/599XHCEU/Nguyen et al. - 2023 - Towards Privacy-first Manufacturing Data Exchange .pdf}
+}
+
+@inproceedings{nguyenSurveyPaperDigital2021,
+  title = {Survey {{Paper}} of {{Digital Twins}} and Their {{Integration}} into {{Electric Power Systems}}},
+  booktitle = {2021 {{IEEE Power Energy Society General Meeting}} ({{PESGM}})},
+  author = {Nguyen, Sabrina and Abdelhakim, Mai and Kerestes, Robert},
+  date = {2021-07},
+  pages = {01--05},
+  issn = {1944-9933},
+  doi = {10.1109/PESGM46819.2021.9638011},
+  abstract = {Digital twins are introduced as a solution for various power distribution system applications and security. Power distribution systems engineers lack the capability of knowing the real time status of the system and potential vulnerabilities that can harm it. The digital twin's ability to perform real time calculations and analyses make them a unique tool that can strengthen our understanding of current functions within the power grid, mitigate threats, and perform analyses to improve decision making. The goal of this paper is to introduce digital twins and demonstrate how their application in power systems can help improve efficiency, reliability, and functionality.},
+  eventtitle = {2021 {{IEEE Power Energy Society General Meeting}} ({{PESGM}})},
+  file = {/home/danesabo/Zotero/storage/9JC4DQCW/Nguyen et al. - 2021 - Survey Paper of Digital Twins and their Integratio.pdf;/home/danesabo/Zotero/storage/D8V56ARH/9638011.html}
+}
+
+@online{nicholGLIDEPhotorealisticImage2022,
+  title = {{{GLIDE}}: {{Towards Photorealistic Image Generation}} and {{Editing}} with {{Text-Guided Diffusion Models}}},
+  shorttitle = {{{GLIDE}}},
+  author = {Nichol, Alex and Dhariwal, Prafulla and Ramesh, Aditya and Shyam, Pranav and Mishkin, Pamela and McGrew, Bob and Sutskever, Ilya and Chen, Mark},
+  date = {2022-03-08},
+  eprint = {2112.10741},
+  eprinttype = {arXiv},
+  eprintclass = {cs},
+  doi = {10.48550/arXiv.2112.10741},
+  url = {http://arxiv.org/abs/2112.10741},
+  urldate = {2023-10-05},
+  abstract = {Diffusion models have recently been shown to generate high-quality synthetic images, especially when paired with a guidance technique to trade off diversity for fidelity. We explore diffusion models for the problem of text-conditional image synthesis and compare two different guidance strategies: CLIP guidance and classifier-free guidance. We find that the latter is preferred by human evaluators for both photorealism and caption similarity, and often produces photorealistic samples. Samples from a 3.5 billion parameter text-conditional diffusion model using classifier-free guidance are favored by human evaluators to those from DALL-E, even when the latter uses expensive CLIP reranking. Additionally, we find that our models can be fine-tuned to perform image inpainting, enabling powerful text-driven image editing. We train a smaller model on a filtered dataset and release the code and weights at https://github.com/openai/glide-text2im.},
+  pubstate = {prepublished},
+  note = {Comment: 20 pages, 18 figures},
+  file = {/home/danesabo/Zotero/storage/3J4B8WWE/Nichol et al. - 2022 - GLIDE Towards Photorealistic Image Generation and.pdf;/home/danesabo/Zotero/storage/9D62GJKI/2112.html}
+}
+
+@online{nicholImprovedDenoisingDiffusion2021,
+  title = {Improved {{Denoising Diffusion Probabilistic Models}}},
+  author = {Nichol, Alex and Dhariwal, Prafulla},
+  date = {2021-02-18},
+  eprint = {2102.09672},
+  eprinttype = {arXiv},
+  eprintclass = {cs, stat},
+  doi = {10.48550/arXiv.2102.09672},
+  url = {http://arxiv.org/abs/2102.09672},
+  urldate = {2023-10-05},
+  abstract = {Denoising diffusion probabilistic models (DDPM) are a class of generative models which have recently been shown to produce excellent samples. We show that with a few simple modifications, DDPMs can also achieve competitive log-likelihoods while maintaining high sample quality. Additionally, we find that learning variances of the reverse diffusion process allows sampling with an order of magnitude fewer forward passes with a negligible difference in sample quality, which is important for the practical deployment of these models. We additionally use precision and recall to compare how well DDPMs and GANs cover the target distribution. Finally, we show that the sample quality and likelihood of these models scale smoothly with model capacity and training compute, making them easily scalable. We release our code at https://github.com/openai/improved-diffusion},
+  pubstate = {prepublished},
+  file = {/home/danesabo/Zotero/storage/UGGXMX32/Nichol and Dhariwal - 2021 - Improved Denoising Diffusion Probabilistic Models.pdf;/home/danesabo/Zotero/storage/BGVIKW43/2102.html}
+}
+
+@article{nicolCommonWeaknessEnumerations2023,
+  title = {Toward {{Common Weakness Enumerations}} in {{Industrial Control Systems}}},
+  author = {Nicol, David M. and Shannon, Gregory and Akbar, Monika and Bishop, Matt and Chaney, Michael and Luallen, Matthew},
+  date = {2023-07},
+  journaltitle = {IEEE Security \& Privacy},
+  volume = {21},
+  number = {4},
+  pages = {84--93},
+  issn = {1558-4046},
+  doi = {10.1109/MSEC.2023.3279515},
+  url = {https://ieeexplore.ieee.org/abstract/document/10194510},
+  urldate = {2024-02-29},
+  abstract = {The storyline of MITRE’s common weakness enumeration framework illustrates how the security and privacy technical community can collaborate/cooperate with policy makers to advance policy, giving it specifics and filling gaps of technical knowledge to improve security and resilience of critical infrastructure.},
+  eventtitle = {{{IEEE Security}} \& {{Privacy}}},
+  file = {/home/danesabo/Zotero/storage/G8AYVU6X/Nicol et al. - 2023 - Toward Common Weakness Enumerations in Industrial .pdf}
+}
+
+@inproceedings{nigamFormalSecurityVerification2019,
+  title = {Formal {{Security Verification}} of {{Industry}} 4.0 {{Applications}}},
+  booktitle = {2019 24th {{IEEE International Conference}} on {{Emerging Technologies}} and {{Factory Automation}} ({{ETFA}})},
+  author = {Nigam, Vivek and Talcott, Carolyn},
+  date = {2019-09},
+  pages = {1043--1050},
+  publisher = {IEEE},
+  location = {Zaragoza, Spain},
+  doi = {10.1109/ETFA.2019.8869428},
+  url = {https://ieeexplore.ieee.org/document/8869428/},
+  urldate = {2023-10-10},
+  abstract = {Without appropriate counter-measures, cyber-attacks can exploit the increased system connectivity provided by Industry 4.0 (I4.0) to cause catastrophic events, by, e.g., injecting or tampering with messages. The solution supported by standards, such as, OPC-UA, is to sign or encrypt messages. However, given the limited resources of devices, instead of encrypting all messages in the network, it is better to encrypt only the messages that if tampered with or injected, could lead to undesired configurations. This paper describes the use of formal verification to analyse the security of I4.0 applications. We formalize in Rewriting Logic, I4.0 applications and systems, i.e., networked sets of devices, and a symbolic intruder model. Our formalization can be executed by the tool Maude to automate such security analysis, e.g., determine which messages are sufficient to sign in order avoid injection and tampering attacks.},
+  eventtitle = {2019 24th {{IEEE International Conference}} on {{Emerging Technologies}} and {{Factory Automation}} ({{ETFA}})},
+  isbn = {978-1-72810-303-7},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/M2B575DV/Nigam and Talcott - 2019 - Formal Security Verification of Industry 4.0 Appli.pdf}
+}
+
+@article{nilssonCorrectbyConstructionAdaptiveCruise2016,
+  title = {Correct-by-{{Construction Adaptive Cruise Control}}: {{Two Approaches}}},
+  shorttitle = {Correct-by-{{Construction Adaptive Cruise Control}}},
+  author = {Nilsson, Petter and Hussien, Omar and Balkan, Ayca and Chen, Yuxiao and Ames, Aaron D. and Grizzle, Jessy W. and Ozay, Necmiye and Peng, Huei and Tabuada, Paulo},
+  date = {2016-07},
+  journaltitle = {IEEE Transactions on Control Systems Technology},
+  shortjournal = {IEEE Trans. Contr. Syst. Technol.},
+  volume = {24},
+  number = {4},
+  pages = {1294--1307},
+  issn = {1063-6536, 1558-0865},
+  doi = {10.1109/TCST.2015.2501351},
+  url = {http://ieeexplore.ieee.org/document/7349170/},
+  urldate = {2023-11-20},
+  abstract = {Motivated by the challenge of developing control software provably meeting specifications for real-world problems, this paper applies formal methods to adaptive cruise control (ACC). Starting from a linear temporal logic specification for ACC, obtained by interpreting relevant ACC standards, we discuss in this paper two different control software synthesis methods. Each method produces a controller that is correctby-construction, meaning that trajectories of the closed-loop systems provably meet the specification. Both methods rely on fixed-point computations of certain set-valued mappings. However, one of the methods performs these computations on the continuous state space whereas the other method operates on a finite-state abstraction. While controller synthesis is based on a low-dimensional model, each controller is tested on CarSim, an industry-standard vehicle simulator. Our results demonstrate several advantages over classical control design techniques. First, a formal approach to control design removes potential ambiguity in textual specifications by translating them into precise mathematical requirements. Second, because the resulting closedloop system is known a priori to satisfy the specification, testing can then focus on the validity of the models used in control design and whether the specification captures the intended requirements. Finally, the set from where the specification (e.g., safety) can be enforced is explicitly computed and thus conditions for passing control to an emergency controller are clearly defined.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/DRAMUAGA/Nilsson et al. - 2016 - Correct-by-Construction Adaptive Cruise Control T.pdf}
+}
+
+@book{nipkowConcreteSemanticsIsabelle2014,
+  title = {Concrete {{Semantics}}: {{With Isabelle}}/{{HOL}}},
+  shorttitle = {Concrete {{Semantics}}},
+  author = {Nipkow, Tobias and Klein, Gerwin},
+  date = {2014},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-319-10542-0},
+  url = {https://link.springer.com/10.1007/978-3-319-10542-0},
+  urldate = {2024-05-03},
+  isbn = {978-3-319-10541-3 978-3-319-10542-0},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/M9WMR8M5/Nipkow and Klein - 2014 - Concrete Semantics With IsabelleHOL.pdf}
+}
+
+@inproceedings{nitscheSatisfactionCheckingPower2014,
+  title = {Towards Satisfaction Checking of Power Contracts in {{Uppaal}}},
+  booktitle = {Proceedings of the 2014 {{Forum}} on {{Specification}} and {{Design Languages}} ({{FDL}})},
+  author = {Nitsche, Gregor and Gruttner, Kim and Nebel, Wolfgang},
+  date = {2014-10},
+  pages = {1--8},
+  publisher = {IEEE},
+  location = {Munich, Germany},
+  doi = {10.1109/FDL.2014.7119364},
+  url = {http://ieeexplore.ieee.org/document/7119364/},
+  urldate = {2023-11-08},
+  abstract = {Since energy consumption is one of the most limiting factors for embedded and integrated systems, today’s microelectronic design demands urgently for power-aware methodologies for early specification, design-space exploration and verification of the designs’ power properties. To this end, we currently develop a contract- and component-based design concept for power properties, called Power Contracts, to provide a formal link between the bottom-up power characterization of low-level system components and the top-down specification of the systems’ high-level power intent. In this paper, we present a first proof of concept for the verification of the leaf-component power contracts of a hierarchical system design w. r. t. their implementation in UPPAAL. Building on these, we can provide assured power contracts for the hierarchical Virtual Integration (VI) of the leafcomponents to a compound power contract of the integrated final system and thus allow for a sound and traceable bottom-up integration and verification methodology for power properties.},
+  eventtitle = {2014 {{Forum}} on {{Specification}} and {{Design Languages}} ({{FDL}})},
+  isbn = {978-2-9530504-9-3},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/HDESADN4/Nitsche et al. - 2014 - Towards satisfaction checking of power contracts i.pdf}
+}
+
+@inproceedings{nogueiraIntrusionTolerantEclipseSCADA2017,
+  title = {Intrusion-{{Tolerant Eclipse SCADA}}},
+  author = {Nogueira, André and Bessani, Alysson and Neves, Nuno},
+  date = {2017},
+  pages = {2},
+  location = {Vienna, Austria},
+  abstract = {The paper describes an open-source SCADA system that was enhanced with intrusion-tolerant capabilities, focusing on the aspects related to the challenges that were addressed and the architecture of the solution. Some preliminary performance results are also included.},
+  eventtitle = {Symposium on {{Innovative Smart Grid Cybersecurity Solutions}}},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/PVGPS3M4/Nogueira et al. - Intrusion-Tolerant Eclipse SCADA.pdf}
+}
+
+@online{normey-ricoTeachingControlBasic2023,
+  title = {Teaching Control with {{Basic Maths}}: {{Introduction}} to {{Process Control}} Course as a Novel Educational Approach for Undergraduate Engineering Programs},
+  shorttitle = {Teaching Control with {{Basic Maths}}},
+  author = {Normey-Rico, Julio Elias and Morato, Marcelo Menezes},
+  date = {2023-10-09},
+  eprint = {2310.06001},
+  eprinttype = {arXiv},
+  eprintclass = {physics},
+  url = {http://arxiv.org/abs/2310.06001},
+  urldate = {2024-01-16},
+  abstract = {In this article, we discuss a novel education approach to control theory in undergraduate engineering programs. In particular, we elaborate on the inclusion of an introductory course on process control during the first years of the program, to appear right after the students undergo basic calculus and physics courses. Our novel teaching proposal comprises debating the basic elements of control theory without requiring any background on advanced mathematical frameworks from the part of the students. The methodology addresses, conceptually, the majority of the steps required for the analysis and design of simple control systems. Herein, we thoroughly detail this educational guideline, as well as tools that can be used in the classroom. Furthermore, we propose a cheap test-bench kit and an open-source numerical simulator that can be used to carry out experiments during the proposed course. Most importantly, we also assess on how the Introduction to process control course has affected the undergraduate program on Control and Automation Engineering at Universidade Federal de Santa Catarina (UFSC, Brazil). Specifically, we debate the outcomes of implementing our education approach at UFSC from 2016 to 2023, considering students' rates of success in other control courses and perspectives on how the chair helped them throughout the course of their program. Based on randomised interviews, we indicate that our educational approach has had good teaching-learning results: students tend to be more motivated for other control-related subjects, while exhibiting higher rates of success.},
+  langid = {english},
+  pubstate = {prepublished},
+  note = {Comment: 55 pages, 13 figures, Screening at the Journal of Control, Automation and Electrical Systems},
+  file = {/home/danesabo/Zotero/storage/LT33TIEF/Normey-Rico and Morato - 2023 - Teaching control with Basic Maths Introduction to.pdf}
+}
+
+@misc{NOTES,
+  title = {{{NOTES}}},
+  file = {/home/danesabo/Zotero/storage/CE399FII/Doc2.pdf;/home/danesabo/Zotero/storage/H4WDX5YE/email.pdf;/home/danesabo/Zotero/storage/TD5FNZ3U/notes.pdf;/home/danesabo/Zotero/storage/V68WKVC6/Doc.pdf}
+}
+
+@online{nsa2020,
+  title = {{{NSA Cybersecurity}} 2020 {{Year}} in {{Review}}},
+  url = {https://media.defense.gov/2021/Jan/08/2002561651/-1/-1/0/NSA%20CYBERSECURITY%202020%20YEAR%20IN%20REVIEW.PDF/NSA%20CYBERSECURITY%202020%20YEAR%20IN%20REVIEW.PDF},
+  urldate = {2022-03-25},
+  file = {/home/danesabo/Zotero/storage/PJVIYQFD/NSA CYBERSECURITY 2020 YEAR IN REVIEW.pdf}
+}
+
+@misc{NSF,
+  date = {2016-03-04},
+  note = {Definition from National Science Foundation, “Cyber-Physical Systems,” program solicitation 16-549, https://www.nsf.gov/publications/pub\_summ.jsp?ods\_key=nsf16549}
+}
+
+@online{NUARIAddressingNational,
+  title = {{{NUARI}}: {{Addressing National Cyber Security Issues}}},
+  shorttitle = {{{NUARI}}},
+  url = {https://nuari.org},
+  urldate = {2023-11-09},
+  abstract = {More than a think tank, the Norwich University Applied Research Institutes are driven to develop effective solutions for national cyber security threats.},
+  langid = {english}
+}
+
+@online{nuskenSolvingHighdimensionalHamiltonJacobiBellman2023,
+  title = {Solving High-Dimensional {{Hamilton-Jacobi-Bellman PDEs}} Using Neural Networks: Perspectives from the Theory of Controlled Diffusions and Measures on Path Space},
+  shorttitle = {Solving High-Dimensional {{Hamilton-Jacobi-Bellman PDEs}} Using Neural Networks},
+  author = {Nüsken, Nikolas and Richter, Lorenz},
+  date = {2023-01-29},
+  eprint = {2005.05409},
+  eprinttype = {arXiv},
+  eprintclass = {cs, math, stat},
+  doi = {10.48550/arXiv.2005.05409},
+  url = {http://arxiv.org/abs/2005.05409},
+  urldate = {2023-10-27},
+  abstract = {Optimal control of diffusion processes is intimately connected to the problem of solving certain Hamilton-Jacobi-Bellman equations. Building on recent machine learning inspired approaches towards high-dimensional PDEs, we investigate the potential of \$\textbackslash textit\{iterative diffusion optimisation\}\$ techniques, in particular considering applications in importance sampling and rare event simulation, and focusing on problems without diffusion control, with linearly controlled drift and running costs that depend quadratically on the control. More generally, our methods apply to nonlinear parabolic PDEs with a certain shift invariance. The choice of an appropriate loss function being a central element in the algorithmic design, we develop a principled framework based on divergences between path measures, encompassing various existing methods. Motivated by connections to forward-backward SDEs, we propose and study the novel \$\textbackslash textit\{log-variance\}\$ divergence, showing favourable properties of corresponding Monte Carlo estimators. The promise of the developed approach is exemplified by a range of high-dimensional and metastable numerical examples.},
+  pubstate = {prepublished},
+  file = {/home/danesabo/Zotero/storage/Q8DSFC8E/Nüsken and Richter - 2023 - Solving high-dimensional Hamilton-Jacobi-Bellman P.pdf;/home/danesabo/Zotero/storage/XMHJ8Z5G/2005.html}
+}
+
+@inproceedings{nuzzoContractbasedDesignControl2014,
+  title = {Contract-Based Design of Control Protocols for Safety-Critical Cyber-Physical Systems},
+  booktitle = {Design, {{Automation}} \& {{Test}} in {{Europe Conference}} \& {{Exhibition}} ({{DATE}}), 2014},
+  author = {Nuzzo, Pierluigi and Finn, John B. and Iannopollo, Antonio and Sangiovanni-Vincentelli, Alberto L.},
+  date = {2014},
+  pages = {1--4},
+  publisher = {IEEE Conference Publications},
+  location = {Dresden, Germany},
+  doi = {10.7873/DATE.2014.072},
+  url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6800273},
+  urldate = {2023-11-08},
+  abstract = {We introduce a platform-based design methodology that addresses the complexity and heterogeneity of cyber-physical systems by using assume-guarantee contracts to formalize the design process and enable realization of control protocols in a hierarchical and compositional manner. Given the architecture of the physical plant to be controlled, the design is carried out as a sequence of refinement steps from an initial specification to a final implementation, including synthesis from requirements and mapping of higher-level functional and nonfunctional models into a set of candidate solutions built out of a library of components at the lower level. Initial top-level requirements are captured as contracts and expressed using linear temporal logic (LTL) and signal temporal logic (STL) formulas to enable requirement analysis and early detection of inconsistencies. Requirements are then refined into a controller architecture by combining reactive synthesis steps from LTL specifications with simulation-based design space exploration steps. We demonstrate our approach on the design of embedded controllers for aircraft electric power distribution.},
+  eventtitle = {Design {{Automation}} and {{Test}} in {{Europe}}},
+  isbn = {978-3-9815370-2-4},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/NCQGWXT7/Nuzzo et al. - 2014 - Contract-based design of control protocols for saf.pdf}
+}
+
+@inproceedings{nuzzoContractbasedDesignControl2014a,
+  title = {Contract-Based Design of Control Protocols for Safety-Critical Cyber-Physical Systems},
+  booktitle = {Design, {{Automation}} \& {{Test}} in {{Europe Conference}} \& {{Exhibition}} ({{DATE}}), 2014},
+  author = {Nuzzo, Pierluigi and Finn, John B. and Iannopollo, Antonio and Sangiovanni-Vincentelli, Alberto L.},
+  date = {2014},
+  pages = {1--4},
+  publisher = {IEEE Conference Publications},
+  location = {Dresden, Germany},
+  doi = {10.7873/DATE.2014.072},
+  url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6800273},
+  urldate = {2023-10-10},
+  abstract = {We introduce a platform-based design methodology that addresses the complexity and heterogeneity of cyber-physical systems by using assume-guarantee contracts to formalize the design process and enable realization of control protocols in a hierarchical and compositional manner. Given the architecture of the physical plant to be controlled, the design is carried out as a sequence of refinement steps from an initial specification to a final implementation, including synthesis from requirements and mapping of higher-level functional and nonfunctional models into a set of candidate solutions built out of a library of components at the lower level. Initial top-level requirements are captured as contracts and expressed using linear temporal logic (LTL) and signal temporal logic (STL) formulas to enable requirement analysis and early detection of inconsistencies. Requirements are then refined into a controller architecture by combining reactive synthesis steps from LTL specifications with simulation-based design space exploration steps. We demonstrate our approach on the design of embedded controllers for aircraft electric power distribution.},
+  eventtitle = {Design {{Automation}} and {{Test}} in {{Europe}}},
+  isbn = {978-3-9815370-2-4},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/CR5VXJYU/Nuzzo et al. - 2014 - Contract-based design of control protocols for saf.pdf}
+}
+
+@article{nuzzoMethodologyToolsNext2015,
+  title = {Methodology and {{Tools}} for {{Next Generation Cyber}}‐{{Physical Systems}}: {{The iCyPhy Approach}}},
+  shorttitle = {Methodology and {{Tools}} for {{Next Generation Cyber}}‐{{Physical Systems}}},
+  author = {Nuzzo, Pierluigi and Sangiovanni‐Vincentelli, Alberto L. and Murray, Richard M.},
+  date = {2015-10},
+  journaltitle = {INCOSE International Symposium},
+  shortjournal = {INCOSE International Symp},
+  volume = {25},
+  number = {1},
+  pages = {235--249},
+  issn = {2334-5837, 2334-5837},
+  doi = {10.1002/j.2334-5837.2015.00060.x},
+  url = {https://incose.onlinelibrary.wiley.com/doi/10.1002/j.2334-5837.2015.00060.x},
+  urldate = {2023-11-08},
+  abstract = {The realization of complex, cyber-physical “systems of systems” can substantially benefit from model-based hierarchical and compositional methodologies to make their design possible let alone optimal. In this paper, we introduce the methodology being developed within the industrial Cyber-Physical (iCyPhy) research consortium, which addresses the complexity and heterogeneity of cyber-physical systems by formalizing the design process in a hierarchical and compositional way, and provides a unifying framework where different modeling, analysis and synthesis tools can seamlessly interconnect. We use assume-guarantee contracts and their algebra (e.g. composition, conjunction, refinement) to provide formal support to the entire design flow. The design is carried out as a sequence of refinement steps from a high-level specification (top-down phase) to an implementation built out of a library of components at the lower level (bottom-up phase). At each step, the design is refined by combining synthesis from requirements, optimization and simulation-based design space exploration methods. We illustrate our approach on design examples of embedded controllers for aircraft power distribution and air management systems.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/HXRYB4NQ/Nuzzo et al. - 2015 - Methodology and Tools for Next Generation Cyber‐Ph.pdf}
+}
+
+@article{nuzzoStochasticAssumeGuaranteeContracts2019,
+  title = {Stochastic {{Assume-Guarantee Contracts}} for {{Cyber-Physical System Design}}},
+  author = {Nuzzo, Pierluigi and Li, Jiwei and Sangiovanni-Vincentelli, Alberto L. and Xi, Yugeng and Li, Dewei},
+  date = {2019-01-31},
+  journaltitle = {ACM Transactions on Embedded Computing Systems},
+  shortjournal = {ACM Trans. Embed. Comput. Syst.},
+  volume = {18},
+  number = {1},
+  pages = {1--26},
+  issn = {1539-9087, 1558-3465},
+  doi = {10.1145/3243216},
+  url = {https://dl.acm.org/doi/10.1145/3243216},
+  urldate = {2023-11-08},
+  abstract = {We present an assume-guarantee contract framework for cyber-physical system design under probabilistic requirements. Given a stochastic linear system and a set of requirements captured by bounded Stochastic Signal Temporal Logic (StSTL) contracts, we propose algorithms to check contract compatibility, consistency, and refinement, and generate a sequence of control inputs that satisfies a contract. We leverage encodings of the verification and control synthesis tasks into mixed integer optimization problems, and conservative approximations of probabilistic constraints that produce sound and tractable problem formulations. We illustrate the effectiveness of our approach on three case studies, including the design of controllers for aircraft power distribution networks.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/YWXM7VYD/Nuzzo et al. - 2019 - Stochastic Assume-Guarantee Contracts for Cyber-Ph.pdf}
+}
+
+@article{NYT-colonial,
+  title = {Colonial {{Pipeline}} Chief Says an Oversight Let Hackers into Its System},
+  author = {Krauss, Clifford},
+  year = {date accessed 02/13/2022},
+  journaltitle = {The New York Times},
+  url = {https://www.nytimes.com/2021/06/08/business/colonial-pipeline-hack.html}
+}
+
+@article{obeidFormalVerificationSecurity2019,
+  title = {Formal {{Verification}} of {{Security Pattern Composition}}: {{Application}} to {{SCADA}}},
+  shorttitle = {Formal {{Verification}} of {{Security Pattern Composition}}},
+  author = {Obeid, Fadi and Dhaussy, Philippe},
+  date = {2019},
+  journaltitle = {Computing and Informatics},
+  shortjournal = {cai},
+  volume = {38},
+  number = {5},
+  pages = {1149--1180},
+  issn = {2585-8807},
+  doi = {10.31577/cai_2019_5_1149},
+  url = {http://www.cai.sk/ojs/index.php/cai/article/view/2019_5_1149},
+  urldate = {2023-10-10},
+  abstract = {Information security was initially required in specific applications, however, nowadays, most companies and even individuals are interested in securing their information assets. The new requirement can be costly, especially with the high demand on security solutions and security experts. Security patterns are reusable security solutions that prove to be efficient and can help developers achieve some security goals without the need for expertise in the security domain. Some security pattern combinations can be beneficial while others are inconsistent. Model checking can be used to verify the production of combining multiple security patterns with an architecture. Supervisory control and data acquisition (SCADA) systems control many of our critical industrial infrastructures. Due to their limitations, and their augmented connectivity, SCADA systems have many unresolved security issues. In this paper, we demonstrate how we can automatically generate a secure SCADA model based on an insecure one and how to verify the generated model.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/U324MFYG/Obeid and Dhaussy - 2019 - Formal Verification of Security Pattern Compositio.pdf}
+}
+
+@article{oberkampfVerificationValidationPredictive2004,
+  title = {Verification, Validation, and Predictive Capability in Computational Engineering and Physics},
+  author = {Oberkampf, William L and Trucano, Timothy G and Hirsch, Charles},
+  date = {2004-12-21},
+  journaltitle = {Applied Mechanics Reviews},
+  shortjournal = {Applied Mechanics Reviews},
+  volume = {57},
+  number = {5},
+  pages = {345--384},
+  issn = {0003-6900},
+  doi = {10.1115/1.1767847},
+  url = {https://doi.org/10.1115/1.1767847},
+  urldate = {2024-05-21},
+  abstract = {Developers of computer codes, analysts who use the codes, and decision makers who rely on the results of the analyses face a critical question: How should confidence in modeling and simulation be critically assessed? Verification and validation (V\&amp;V) of computational simulations are the primary methods for building and quantifying this confidence. Briefly, verification is the assessment of the accuracy of the solution to a computational model. Validation is the assessment of the accuracy of a computational simulation by comparison with experimental data. In verification, the relationship of the simulation to the real world is not an issue. In validation, the relationship between computation and the real world, ie, experimental data, is the issue. This paper presents our viewpoint of the state of the art in V\&amp;V in computational physics. (In this paper we refer to all fields of computational engineering and physics, eg, computational fluid dynamics, computational solid mechanics, structural dynamics, shock wave physics, computational chemistry, etc, as computational physics.) We describe our view of the framework in which predictive capability relies on V\&amp;V, as well as other factors that affect predictive capability. Our opinions about the research needs and management issues in V\&amp;V are very practical: What methods and techniques need to be developed and what changes in the views of management need to occur to increase the usefulness, reliability, and impact of computational physics for decision making about engineering systems? We review the state of the art in V\&amp;V over a wide range of topics, for example, prioritization of V\&amp;V activities using the Phenomena Identification and Ranking Table (PIRT), code verification, software quality assurance (SQA), numerical error estimation, hierarchical experiments for validation, characteristics of validation experiments, the need to perform nondeterministic computational simulations in comparisons with experimental data, and validation metrics. We then provide an extensive discussion of V\&amp;V research and implementation issues that we believe must be addressed for V\&amp;V to be more effective in improving confidence in computational predictive capability. Some of the research topics addressed are development of improved procedures for the use of the PIRT for prioritizing V\&amp;V activities, the method of manufactured solutions for code verification, development and use of hierarchical validation diagrams, and the construction and use of validation metrics incorporating statistical measures. Some of the implementation topics addressed are the needed management initiatives to better align and team computationalists and experimentalists in conducting validation activities, the perspective of commercial software companies, the key role of analysts and decision makers as code customers, obstacles to the improved effectiveness of V\&amp;V, effects of cost and schedule constraints on practical applications in industrial settings, and the role of engineering standards committees in documenting best practices for V\&amp;V. There are 207 references cited in this review article.},
+  file = {/home/danesabo/Zotero/storage/HZLXFU2F/Oberkampf et al. - 2004 - Verification, validation, and predictive capabilit.pdf;/home/danesabo/Zotero/storage/T59DSDXT/Verification-validation-and-predictive-capability.html}
+}
+
+@book{ogataFormalMethodsSoftware2016,
+  title = {Formal {{Methods}} and {{Software Engineering}}: 18th {{International Conference}} on {{Formal Engineering Methods}}, {{ICFEM}} 2016, {{Tokyo}}, {{Japan}}, {{November}} 14-18, 2016, {{Proceedings}}},
+  shorttitle = {Formal {{Methods}} and {{Software Engineering}}},
+  editor = {Ogata, Kazuhiro and Lawford, Mark and Liu, Shaoying},
+  date = {2016},
+  series = {Lecture {{Notes}} in {{Computer Science}}},
+  volume = {10009},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-319-47846-3},
+  url = {http://link.springer.com/10.1007/978-3-319-47846-3},
+  urldate = {2022-09-30},
+  isbn = {978-3-319-47845-6 978-3-319-47846-3},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/DUETMFJL/Ogata et al. - 2016 - Formal Methods and Software Engineering 18th Inte.pdf}
+}
+
+@article{ohaganBayesianAnalysisComputer2006,
+  title = {Bayesian Analysis of Computer Code Outputs: {{A}} Tutorial},
+  shorttitle = {Bayesian Analysis of Computer Code Outputs},
+  author = {O’Hagan, A.},
+  date = {2006-10},
+  journaltitle = {Reliability Engineering \& System Safety},
+  shortjournal = {Reliability Engineering \& System Safety},
+  volume = {91},
+  number = {10-11},
+  pages = {1290--1300},
+  issn = {09518320},
+  doi = {10.1016/j.ress.2005.11.025},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0951832005002383},
+  urldate = {2022-04-21},
+  abstract = {The Bayesian approach to quantifying, analysing and reducing uncertainty in the application of complex process models is attracting increasing attention amongst users of such models. The range and power of the Bayesian methods is growing and there is already a sizeable literature on these methods. However, most of it is in specialist statistical journals. The purpose of this tutorial is to introduce the more general reader to the Bayesian approach.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/A7IHS3AJ/O’Hagan - 2006 - Bayesian analysis of computer code outputs A tuto.pdf}
+}
+
+@article{olivares-rojasCybersecuritySmartGrid2021,
+  title = {Towards {{Cybersecurity}} of the {{Smart Grid}} Using {{Digital Twins}}},
+  author = {Olivares-Rojas, Juan C. and Reyes-Archundia, Enrique and Gutierrez-Gnecchi, Jose A. and Molina-Moreno, Ismael and Cerda-Jacobo, Jaime and Mendez-Patino, Arturo},
+  date = {2021},
+  journaltitle = {IEEE Internet Computing},
+  shortjournal = {IEEE Internet Comput.},
+  pages = {1--1},
+  issn = {1089-7801, 1941-0131},
+  doi = {10.1109/MIC.2021.3063674},
+  url = {https://ieeexplore.ieee.org/document/9368968/},
+  urldate = {2022-03-02},
+  abstract = {The proliferation of cyber-physical systems is bringing with it the growing need to link these systems with virtual environments. Particularly in the smart grid, the high costs of some devices and especially the imminent need to not be able to manipulate these devices in production environments make necessary mechanisms that allow the manipulation of these physical objects in virtual environments; this has been called a digital twin. On the other hand, cyberattacks are growing in all cyber-physical systems, and in the smart grid, cybersecurity is essential due to the smart grid is a critical infrastructure. This work shows a small implementation of a digital twin system for smart metering systems in a smart home environment for testing cybersecurity issues. The results show that the use of digital twins is feasible in various contexts of the smart grid in particularly in cybersecurity testing.},
+  langid = {english},
+  keywords = {DGC read,key},
+  file = {/home/danesabo/Zotero/storage/CKZJXNNS/Towards_Cybersecurity_of_the_Smart_Grid_using_Digital_Twins.pdf}
+}
+
+@inproceedings{oortwijnFormalVerificationIndustrial2019,
+  title = {Formal Verification of an Industrial Safety-Critical Traffic Tunnel Control System},
+  booktitle = {Integrated {{Formal Methods}}: 15th {{International Conference}}, {{IFM}} 2019, {{Bergen}}, {{Norway}}, {{December}} 2–6, 2019, {{Proceedings}} 15},
+  author = {Oortwijn, Wytse and Huisman, Marieke},
+  date = {2019},
+  pages = {418--436},
+  publisher = {Springer},
+  isbn = {3-030-34967-5},
+  file = {/home/danesabo/Zotero/storage/ETG23NE6/FV of an industrial safety critical traffic tunnel control system.pdf}
+}
+
+@software{OperatingSystemDevelopment2024,
+  title = {Operating {{System}} Development Tutorials in {{Rust}} on the {{Raspberry Pi}}},
+  date = {2024-01-02T19:27:42Z},
+  origdate = {2018-03-31T17:08:56Z},
+  url = {https://github.com/rust-embedded/rust-raspberrypi-OS-tutorials},
+  urldate = {2024-01-02},
+  abstract = {:books: Learn to write an embedded OS in Rust :crab:},
+  organization = {Rust Embedded}
+}
+
+@article{oppenheimEffectsFiniteRegister1972,
+  title = {Effects of Finite Register Length in Digital Filtering and the Fast {{Fourier}} Transform},
+  author = {Oppenheim, A.V. and Weinstein, C.J.},
+  date = {1972-08},
+  journaltitle = {Proceedings of the IEEE},
+  volume = {60},
+  number = {8},
+  pages = {957--976},
+  issn = {1558-2256},
+  doi = {10.1109/PROC.1972.8820},
+  url = {https://ieeexplore.ieee.org/abstract/document/1450750?casa_token=kAczMhD2oroAAAAA:GjI24f6aTAdM8lKXQE0tQ6p-6g7wJ4divWdNyJY1VX9m6NnZcPmnlaWOLfl0grGcvpHxcFV7JQ},
+  urldate = {2024-02-08},
+  abstract = {When digital signal processing operations are implemented on a computer or with special-purpose hardware, errors and constraints due to finite word length are unavoidable. The main categories of finite register length effects are errors due to A/D conversion, errors due to roundoffs in the arithmetic, constraints on signal levels imposed by the need to prevent overflow, and quantization of system coefficients. The effects of finite register length on implementations of linear recursive difference equation digital filters, and the fast Fourier transform (FFT), are discussed in some detail. For these algorithms, the differing quantization effects of fixed point, floating point, and block floating point arithmetic are examined and compared. The paper is intended primarily as a tutorial review of a subject which has received considerable attention over the past few years. The groundwork is set through a discussion of the relationship between the binary representation of numbers and truncation or rounding, and a formulation of a statistical model for arithmetic roundoff. The analyses presented here are intended to illustrate techniques of working with particular models. Results of previous work are discussed and summarized when appropriate. Some examples are presented to indicate how the results developed for simple digital filters and the FFT can be applied to the analysis of more complicated systems which use these algorithms as building blocks.},
+  eventtitle = {Proceedings of the {{IEEE}}},
+  file = {/home/danesabo/Zotero/storage/ZW4396UZ/Oppenheim and Weinstein - 1972 - Effects of finite register length in digital filte.pdf}
+}
+
+@article{oppenheimRealizationDigitalFilters1970,
+  title = {Realization of Digital Filters Using Block-Floating-Point Arithmetic},
+  author = {Oppenheim, A.},
+  date = {1970-06},
+  journaltitle = {IEEE Transactions on Audio and Electroacoustics},
+  volume = {18},
+  number = {2},
+  pages = {130--136},
+  issn = {1558-2582},
+  doi = {10.1109/TAU.1970.1162085},
+  url = {https://ieeexplore.ieee.org/abstract/document/1162085?casa_token=Ah4FKuW8dWsAAAAA:sY06mnCtOtw44rCWhPiuSFDyipuJoHikB-SMO_-NAvYxEbwQtggd2pWmez3Xl6ztTcfeKRWdhA},
+  urldate = {2024-02-08},
+  abstract = {Recently, statistical models for the effects of roundoff noise in fixed-point and floating-point realizations of digital filters have been proposed and verified, and a comparison between these realizations presented. In this paper a structure for implementing digital filters using block-floating-point arithmetic is proposed and a statistical analysis of the effects of roundoff noise is carried out. On the basis of this analysis, block-floating-point is compared to fixed-point and floating-point arithmetic with regard to roundoff noise effects.},
+  eventtitle = {{{IEEE Transactions}} on {{Audio}} and {{Electroacoustics}}},
+  file = {/home/danesabo/Zotero/storage/J3ZGI8I5/Oppenheim - 1970 - Realization of digital filters using block-floatin.pdf;/home/danesabo/Zotero/storage/W4RD4ZZA/1162085.html}
+}
+
+@incollection{oquendoDealingUncertaintySoftware2019,
+  title = {Dealing with {{Uncertainty}} in {{Software Architecture}} on the {{Internet-of-Things}} with {{Digital Twins}}},
+  booktitle = {Computational {{Science}} and {{Its Applications}} – {{ICCSA}} 2019},
+  author = {Oquendo, Flavio},
+  editor = {Misra, Sanjay and Gervasi, Osvaldo and Murgante, Beniamino and Stankova, Elena and Korkhov, Vladimir and Torre, Carmelo and Rocha, Ana Maria A.C. and Taniar, David and Apduhan, Bernady O. and Tarantino, Eufemia},
+  date = {2019},
+  volume = {11619},
+  pages = {770--786},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-030-24289-3_57},
+  url = {http://link.springer.com/10.1007/978-3-030-24289-3_57},
+  urldate = {2022-03-02},
+  abstract = {When architecting Software-intensive Systems-of-Systems (SoS) on the Internet-of-Things (IoT), architects face two sorts of uncertainties. First, they have only limited knowledge about the operational environment where the SoS will actually be deployed. Second, the constituent systems which will compose the SoS might not be known a priori (at design-time) or their availability (at runtime) is affected by dynamic factors, due to the openness of the IoT. The consequent research question is thereby how to deal with uncertainty in the design of an SoS architecture on the IoT. To tackle this challenging issue, this paper addresses the notion of uncertainty due to partial information in SoS and proposes an enhanced SoS Architecture Description language (SosADL) for expressing SoS architectures on the IoT under uncertainty. The core SosADL is extended with concurrent constraints and the concept of digital twins coupling the physical and virtual worlds. This novel approach is supported by an integrated toolset, the SosADL Studio. Validation results demonstrate its effectiveness in an SoS architecture for platooning of self-driving vehicles.},
+  isbn = {978-3-030-24288-6 978-3-030-24289-3},
+  langid = {english},
+  keywords = {DGC read,uncertainty quantification},
+  file = {/home/danesabo/Zotero/storage/PJRYAPFG/Oquendo19.pdf}
+}
+
+@thesis{osborneBayesianGaussianProcesses2010,
+  type = {Ph.D. disseration},
+  title = {Bayesian {{Gaussian Processes}} for {{Sequential Prediction}}, {{Optimisation}} and {{Quadrature}}},
+  author = {Osborne, Michael},
+  date = {2010},
+  institution = {University of Oxford},
+  abstract = {We develop a family of Bayesian algorithms built around Gaussian processes for various problems posed by sensor networks. We firstly introduce an iterative Gaussian process for multi-sensor inference problems, and show how our algorithm is able to cope with data that may be noisy, missing, delayed and/or correlated. Our algorithm can also effectively manage data that features changepoints, such as sensor faults. Extensions to our algorithm allow us to tackle some of the decision problems faced in sensor networks, including observation scheduling. Along these lines, we also propose a general method of global optimisation, Gaussian process global optimisation (GPGO), and demonstrate how it may be used for sensor placement.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/AWHQPUPC/Osborne - Bayesian Gaussian Processes for Sequential Predict.pdf}
+}
+
+@article{osherLevelSetMethods2001,
+  title = {Level {{Set Methods}}: {{An Overview}} and {{Some Recent Results}}},
+  shorttitle = {Level {{Set Methods}}},
+  author = {Osher, Stanley and Fedkiw, Ronald P.},
+  date = {2001-05-20},
+  journaltitle = {Journal of Computational Physics},
+  shortjournal = {Journal of Computational Physics},
+  volume = {169},
+  number = {2},
+  pages = {463--502},
+  issn = {0021-9991},
+  doi = {10.1006/jcph.2000.6636},
+  url = {https://www.sciencedirect.com/science/article/pii/S0021999100966361},
+  urldate = {2023-10-27},
+  abstract = {The level set method was devised by S. Osher and J. A. Sethian (1988, J. Comput. Phys.79, 12–49) as a simple and versatile method for computing and analyzing the motion of an interface Γ in two or three dimensions. Γ bounds a (possibly multiply connected) region Ω. The goal is to compute and analyze the subsequent motion of Γ under a velocity field v. This velocity can depend on position, time, the geometry of the interface, and the external physics. The interface is captured for later time as the zero level set of a smooth (at least Lipschitz continuous) function ϕ (x, t); i.e., Γ(t)=\{x|ϕ(x, t)=0\}. ϕ is positive inside Ω, negative outside Ω, and is zero on Γ(t). Topological merging and breaking are well defined and easily performed. In this review article we discuss recent variants and extensions, including the motion of curves in three dimensions, the dynamic surface extension method, fast methods for steady state problems, diffusion generated motion, and the variational level set approach. We also give a user's guide to the level set dictionary and technology and couple the method to a wide variety of problems involving external physics, such as compressible and incompressible (possibly reacting) flow, Stefan problems, kinetic crystal growth, epitaxial growth of thin films, vortex-dominated flows, and extensions to multiphase motion. We conclude with a discussion of applications to computer vision and image processing.},
+  file = {/home/danesabo/Zotero/storage/MII47KKR/Osher and Fedkiw - 2001 - Level Set Methods An Overview and Some Recent Res.pdf;/home/danesabo/Zotero/storage/LAYPWLCS/S0021999100966361.html}
+}
+
+@misc{OT-def,
+  date = {2021},
+  note = {Definition from National Institute of Standards and Technology: “Operational Technology: programmable systems or devices that interact with the physical environment (or manage devices that interact with the physical environment). These systems/devices detect or cause a direct change through the monitoring and/or control of devices, processes, and events. Examples include industrial control systems, building management systems, fire control systems, and physical access control mechanisms.”}
+}
+
+@article{oudinaModelingTrustCyberPhysical2023,
+  title = {Toward {{Modeling Trust Cyber-Physical Systems}}: {{A Model-based System Engineering Method}}},
+  shorttitle = {Toward {{Modeling Trust Cyber-Physical Systems}}},
+  author = {Oudina, Zina and Derdour, Makhlouf},
+  date = {2023-07},
+  journaltitle = {INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS},
+  shortjournal = {Int. J. Adv. Comput. Sci. Appl.},
+  volume = {14},
+  number = {7},
+  pages = {441--452},
+  publisher = {Science \& Information Sai Organization Ltd},
+  location = {West Yorkshire},
+  issn = {2158-107X, 2156-5570},
+  url = {https://www.webofscience.com/wos/woscc/summary/563bee91-8c90-4554-ae8d-46c3ce0028ee-a808dfa0/relevance/2},
+  urldate = {2023-10-03},
+  abstract = {Developing trust in cyber-physical systems (CPSs) is a challenging task. Trust in CPS is needed for carrying out their intended duties and is reasonably safe from misuse and intrusion; it also enforces the applicable security policy. As an example, medical smart devices, many researches have found that trust is a key factor in explaining the relationship between individual beliefs about technological attributes and their acceptance behavior; and have associated medical device failures with severe patient injuries and deaths. The cyber-physical system is considered a trust system if the principles of security and safety, confidentiality, integrity, availability, and other attributes are assured. However, a lack of sufficient analysis of such systems, as well as appropriate explanation of relevant trust assumptions, may result in systems that fail to completely realize their functionality. The existing research does not provide suitable guidance for a systematic procedure or modeling language to support such trust-based analysis. The most pressing difficulties are achieving trust by design in CPS and systematically incorporating trust engineering into system development from the start of the system life cycle. Still, there is a need for a strategy or standard model to aid in the creation of a safe, secure, and trustworthy CPS. Model-based system engineering (MBSE) approaches for trust cyber-physical systems are a means to address system trustworthiness design challenges. This work proposes a practical and efficient MBSE method for constructing trust CPS, which provides guidance for the process of trustworthiness analysis. The SysML-based profile is supplied, together with recommendations on which approach is required at each process phase. The MBSE method is proven by expanding the autonomous car SysML and UML diagrams, and we show how trust considerations are integrated into the system development life cycle.},
+  langid = {english},
+  pagetotal = {12},
+  annotation = {Web of Science ID: WOS:001047185600001}
+}
+
+@video{outlierDiffusionModelsPaper2022,
+  entrysubtype = {video},
+  title = {Diffusion {{Models}} | {{Paper Explanation}} | {{Math Explained}}},
+  editor = {{Outlier}},
+  editortype = {director},
+  date = {2022-06-06},
+  url = {https://www.youtube.com/watch?v=HoKDTa5jHvg},
+  urldate = {2023-10-10},
+  abstract = {Diffusion Models are generative models just like GANs. In recent times many state-of-the-art works have been released that build on top of diffusion models such as \#dalle or \#imagen. In this video I give a detailed explanation of how they work. At first I explain the fundamental idea of these models and later we dive deep into the math part. I try to explain all of this on a really easy \& intuitive level. After the math derivation, we look at the results from different papers and how they compare to other methods. \#diffusion \#dalle2 \#dalle \#imagen  00:00 Introduction 02:48 Idea \& Theory 07:06 Architecture 09:33 Math Derivation 26:59 Algorithms 28:22 Improvements 29:43 Results 31:34 Summary Further Reading: 1. Paper: https://arxiv.org/pdf/1503.03585.pdf 2. Paper: https://arxiv.org/pdf/2006.11239.pdf 3. Paper: https://arxiv.org/pdf/2102.09672.pdf 4. Paper: https://arxiv.org/pdf/2105.05233.pdf 5. VAE \& Reparam. Trick: https://lilianweng.github.io/posts/20... 6. Written Tutorial: https://lilianweng.github.io/posts/20... PyTorch Implementation Video: ~~~•~Diffusion~Models~|~PyTorch~Implementa...~~ Follow me on instagram lol: https://www.instagram.com/dome271}
+}
+
+@video{outlierDiffusionModelsPyTorch2022,
+  entrysubtype = {video},
+  title = {Diffusion {{Models}} | {{PyTorch Implementation}}},
+  editor = {{Outlier}},
+  editortype = {director},
+  date = {2022-09-20},
+  url = {https://www.youtube.com/watch?v=TBCRlnwJtZU},
+  urldate = {2023-10-11},
+  abstract = {Diffusion Models are generative models just like GANs. In recent times many state-of-the-art works have been released that build on top of diffusion models such as \#dalle , \#imagen or \#stablediffusion . In this video I'm coding a PyTorch implementation of diffusion models in a very easy and straightforward way. At first I'm showing how to implement an unconditional version and subsequently train it. After that I'm explaining 2 popular improvements for diffusion models: classifier free guidance and exponential moving average. I'm also going to implement both updates and train a conditional model on CIFAR-10 and afterwards compare the different results. Code: https://github.com/dome272/Diffusion-... \#diffusion \#dalle2 \#dalle \#imagen \#stablediffusion 00:00 Introduction 02:05 Recap 03:16 Diffusion Tools 07:22 UNet 13:07 Training Loop 15:44 Unconditional Results 16:05 Classifier Free Guidance 19:16 Exponential Moving Average 21:05 Conditional Results 21:51 Github Code \& Outro Further Reading: 1. Paper: https://arxiv.org/pdf/1503.03585.pdf 2. Paper: https://arxiv.org/pdf/2006.11239.pdf 3. Paper: https://arxiv.org/pdf/2102.09672.pdf 4. Paper: https://arxiv.org/pdf/2105.05233.pdf 5. CFG: https://arxiv.org/pdf/2207.12598.pdf 6. Timestep Embedding: https://machinelearningmastery.com/a-... Follow me on instagram lol: https://www.instagram.com/dome271}
+}
+
+@misc{PA-profile,
+  title = {Pennsylvania State Energy Profile},
+  year = {accessed 02/13/2022},
+  url = {https://www.eia.gov/state/?sid=PA},
+  organization = {U.S. Energy Information Administration}
+}
+
+@article{pagettiMultitaskImplementationMultiperiodic2011,
+  title = {Multi-Task {{Implementation}} of {{Multi-periodic Synchronous Programs}}},
+  author = {Pagetti, Claire and Forget, Julien and Boniol, Frédéric and Cordovilla, Mikel and Lesens, David},
+  date = {2011-09},
+  journaltitle = {Discrete Event Dynamic Systems},
+  shortjournal = {Discrete Event Dyn Syst},
+  volume = {21},
+  number = {3},
+  pages = {307--338},
+  issn = {0924-6703, 1573-7594},
+  doi = {10.1007/s10626-011-0107-x},
+  url = {http://link.springer.com/10.1007/s10626-011-0107-x},
+  urldate = {2023-11-02},
+  abstract = {This article presents a complete scheme for the integration and the development of multi-periodic critical embedded systems. A system is formally specified as a modular and hierarchical assembly of several locally mono-periodic synchronous functions into a globally multi-periodic synchronous system. To support this, we introduce a real-time software architecture description language, named Prelude, which is built upon the synchronous languages and which provides a high level of abstraction for describing the functional and the real-time architecture of a multiperiodic control system. A program is translated into a set of real-time tasks that can be executed on a monoprocessor real-time platform with an on-line priority-based scheduler such as Deadline-Monotonic or Earliest-Deadline-First. The compilation is formally proved correct, meaning that the generated code respects the real-time semantics of the original program (respect of periods, deadlines, release dates and precedences) as well as its functional semantics (respect of variable consumption).},
+  langid = {english},
+  keywords = {Important},
+  file = {/home/danesabo/Zotero/storage/PHDK9CNV/Pagetti et al. - 2011 - Multi-task Implementation of Multi-periodic Synchr.pdf}
+}
+
+@article{palenskyCosimulatingIntegratedEnergy2024,
+  title = {Cosimulating {{Integrated Energy Systems With Heterogeneous Digital Twins}}: {{Matching}} a {{Connected World}}},
+  shorttitle = {Cosimulating {{Integrated Energy Systems With Heterogeneous Digital Twins}}},
+  author = {Palensky, Peter and Mancarella, Pierluigi and Hardy, Trevor and Cvetkovic, Milos},
+  date = {2024-01},
+  journaltitle = {IEEE Power and Energy Magazine},
+  volume = {22},
+  number = {1},
+  pages = {52--60},
+  issn = {1558-4216},
+  doi = {10.1109/MPE.2023.3324886},
+  url = {https://ieeexplore.ieee.org/document/10398554/},
+  urldate = {2024-03-13},
+  abstract = {Energy system integration promises in-creased resiliency and the unlocking of synergies, while also contributing to our goal of decarbonization. It is enabled by both old and new technologies, glued together with data and digital services. Hydrolyzers, heat pumps, distributed renewable generation, smart buildings, and the digital grid edge are all currently the subject of integration with the power system and the energy sector at large. To plan and operate such a multidisciplinary and multisectoral system properly, insight, tools, and expertise are all needed. This is exactly where the state of the art fails to deliver: tools for integrated energy systems (IESs) are still in their infancy, and many times, even academia treats these sectors separately, producing experts in each of them but not across.},
+  eventtitle = {{{IEEE Power}} and {{Energy Magazine}}},
+  file = {/home/danesabo/Zotero/storage/WUYLXT7I/Palensky et al. - 2024 - Cosimulating Integrated Energy Systems With Hetero.pdf;/home/danesabo/Zotero/storage/LNNR59EV/10398554.html}
+}
+
+@misc{PAPUC,
+  author = {{Michael Holko, Director, Office of Cybersecurity Compliance and Oversight, Pennsylvania Public Unitily Commission}},
+  date = {2022-02-25},
+  url = {https://www.puc.pa.gov/media/1825/russian-cyber-threats-critical-infrastructure.pdf}
+}
+
+@article{parantModelbasedEngineeringDesigning2023,
+  title = {Model-Based Engineering for Designing Cyber-Physical Systems from Product Specifications},
+  author = {Parant, Alexandre and Gellot, Francois and Zander, Damien and Carre-Menetrier, Veronique and Philippot, Alexandre},
+  date = {2023-02},
+  journaltitle = {COMPUTERS IN INDUSTRY},
+  shortjournal = {Comput. Ind.},
+  volume = {145},
+  pages = {103808},
+  publisher = {Elsevier},
+  location = {Amsterdam},
+  issn = {0166-3615, 1872-6194},
+  doi = {10.1016/j.compind.2022.103808},
+  url = {https://www.webofscience.com/wos/woscc/summary/563bee91-8c90-4554-ae8d-46c3ce0028ee-a808dfa0/relevance/2},
+  urldate = {2023-10-03},
+  abstract = {Cyber-physical systems (CPS) are composed of independent and cooperative elements. Rapid adaptation to disturbances is an essential characteristic of CPS. One of the challenges in designing CPS is considering these specificities. Model-Based Engineering is a method for reducing complexity in system design. This paper presents a methodology for designing CPS and its control system using System Modeling Language (SysML) diagrams and IEC 61499 standard. The product's specifications are the starting point; the methodology focuses on what is produced before determining how to make it. The real-time control system is designed from high-level knowl-edge and tested software components on the plug and produce principle. Task-based structural analysis ensures the elements' synchronization to determine the system's general behavior.},
+  langid = {english},
+  pagetotal = {19},
+  annotation = {Web of Science ID: WOS:000901415100001}
+}
+
+@article{parkReliableIntelligentDiagnostic2022,
+  title = {A Reliable Intelligent Diagnostic Assistant for Nuclear Power Plants Using Explainable Artificial Intelligence of {{GRU-AE}}, {{LightGBM}} and {{SHAP}}},
+  author = {Park, Ji Hun and Jo, Hye Seon and Lee, Sang Hyun and Oh, Sang Won and Na, Man Gyun},
+  date = {2022-04},
+  journaltitle = {Nuclear Engineering and Technology},
+  shortjournal = {Nuclear Engineering and Technology},
+  volume = {54},
+  number = {4},
+  pages = {1271--1287},
+  issn = {17385733},
+  doi = {10.1016/j.net.2021.10.024},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S1738573321006082},
+  urldate = {2023-10-11},
+  abstract = {When abnormal operating conditions occur in nuclear power plants, operators must identify the occurrence cause and implement the necessary mitigation measures. Accordingly, the operator must rapidly and accurately analyze the symptom requirements of more than 200 abnormal scenarios from the trends of many variables to perform diagnostic tasks and implement mitigation actions rapidly. However, the probability of human error increases owing to the characteristics of the diagnostic tasks performed by the operator. Researches regarding diagnostic tasks based on Artificial Intelligence (AI) have been conducted recently to reduce the likelihood of human errors; however, reliability issues due to the black box characteristics of AI have been pointed out. Hence, the application of eXplainable Artificial Intelligence (XAI), which can provide AI diagnostic evidence for operators, is considered. In conclusion, the XAI to solve the reliability problem of AI is included in the AI-based diagnostic algorithm. A reliable intelligent diagnostic assistant based on a merged diagnostic algorithm, in the form of an operator support system, is developed, and includes an interface to efficiently inform operators.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/G75WD4A6/Park et al. - 2022 - A reliable intelligent diagnostic assistant for nu.pdf}
+}
+
+@article{parksNewProofRouthHurwitz1962,
+  title = {A New Proof of the {{Routh-Hurwitz}} Stability Criterion Using the Second Method of {{Liapunov}}},
+  author = {Parks, P. C.},
+  date = {1962-10},
+  journaltitle = {Mathematical Proceedings of the Cambridge Philosophical Society},
+  volume = {58},
+  number = {4},
+  pages = {694--702},
+  issn = {1469-8064, 0305-0041},
+  doi = {10.1017/S030500410004072X},
+  url = {https://www.cambridge.org/core/journals/mathematical-proceedings-of-the-cambridge-philosophical-society/article/new-proof-of-the-routhhurwitz-stability-criterion-using-the-second-method-of-liapunov/15C073E593E77B9A869252AC398F5408},
+  urldate = {2024-03-05},
+  abstract = {The second method of Liapunov is a useful technique for investigating the stability of linear and non-linear ordinary differential equations. It is well known that the second method of Liapunov, when applied to linear differential equations with real constant coefficients, gives rise to sets of necessary and sufficient stability conditions which are alternatives to the well-known Routh-Hurwitz conditions. In this paper a direct proof of the Routh-Hurwitz conditions themselves is given using Liapunov's second method. The new proof is ‘elementary’ in that it depends on the fundamental concept of stability associated with Liapunov's second method, and not on theorems in the complex integral calculus which are required in the usual proofs. A useful by-product of this new proof is a method of determining the coefficients of a linear differential equation with real constant coefficients in terms of its Hurwitz determinants.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/ZEHZS8K8/Parks - 1962 - A new proof of the Routh-Hurwitz stability criteri.pdf}
+}
+
+@article{pasqualettiAttackDetectionIdentification2013,
+  title = {Attack {{Detection}} and {{Identification}} in {{Cyber-Physical Systems}}},
+  author = {Pasqualetti, Fabio and Dörfler, Florian and Bullo, Francesco},
+  date = {2013-11},
+  journaltitle = {IEEE Transactions on Automatic Control},
+  volume = {58},
+  number = {11},
+  pages = {2715--2729},
+  issn = {1558-2523},
+  doi = {10.1109/TAC.2013.2266831},
+  url = {https://ieeexplore.ieee.org/abstract/document/6545301?casa_token=Ft_6X6mCU54AAAAA:r49oFvPbZFAmmqczYO6s2vPybo2lkcGzxgGdX15jUF2abn1cuZ4_6PVXndBQyFhZ4LH04J-nfw},
+  urldate = {2023-09-27},
+  abstract = {Cyber-physical systems are ubiquitous in power systems, transportation networks, industrial control processes, and critical infrastructures. These systems need to operate reliably in the face of unforeseen failures and external malicious attacks. In this paper: (i) we propose a mathematical framework for cyber-physical systems, attacks, and monitors; (ii) we characterize fundamental monitoring limitations from system-theoretic and graph-theoretic perspectives; and (ii) we design centralized and distributed attack detection and identification monitors. Finally, we validate our findings through compelling examples.},
+  eventtitle = {{{IEEE Transactions}} on {{Automatic Control}}},
+  keywords = {detection},
+  file = {/home/danesabo/Zotero/storage/YMJ23ELA/Pasqualetti et al. - 2013 - Attack Detection and Identification in Cyber-Physi.pdf}
+}
+
+@article{pattersonDiagrammaticViewDifferential2022,
+  title = {A Diagrammatic View of Differential Equations in Physics},
+  author = {Patterson, Evan and Baas, Andrew and Hosgood, Timothy and Fairbanks, James},
+  date = {2022},
+  journaltitle = {Mathematics in Engineering},
+  shortjournal = {MINE},
+  volume = {5},
+  number = {2},
+  pages = {1--59},
+  issn = {2640-3501},
+  doi = {10.3934/mine.2023036},
+  url = {http://www.aimspress.com/article/doi/10.3934/mine.2023036},
+  urldate = {2023-12-12},
+  abstract = {{$<$}abstract{$><$}p{$>$}Presenting systems of differential equations in the form of diagrams has become common in certain parts of physics, especially electromagnetism and computational physics. In this work, we aim to put such use of diagrams on a firm mathematical footing, while also systematizing a broadly applicable framework to reason formally about systems of equations and their solutions. Our main mathematical tools are category-theoretic diagrams, which are well known, and morphisms between diagrams, which have been less appreciated. As an application of the diagrammatic framework, we show how complex, multiphysical systems can be modularly constructed from basic physical principles. A wealth of examples, drawn from electromagnetism, transport phenomena, fluid mechanics, and other fields, is included.{$<$}/p{$><$}/abstract{$>$}},
+  file = {/home/danesabo/Zotero/storage/5UGQYQQC/Patterson et al. - 2022 - A diagrammatic view of differential equations in p.pdf}
+}
+
+@article{pattersonFrameworkIntegratedNuclear2016,
+  title = {A Framework for an Integrated Nuclear Digital Environment},
+  author = {Patterson, Eann A. and Taylor, Richard J. and Bankhead, Mark},
+  date = {2016-03},
+  journaltitle = {Progress in Nuclear Energy},
+  shortjournal = {Progress in Nuclear Energy},
+  volume = {87},
+  pages = {97--103},
+  issn = {01491970},
+  doi = {10.1016/j.pnucene.2015.11.009},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0149197015301104},
+  urldate = {2023-10-11},
+  abstract = {A conceptual framework is proposed for a digital environment extending from the prototype design of nuclear plants through operations and decommissioning to storage and waste disposal. The environment consists of a series of interconnected multi-scale, multi-physics computational models linked to the realworld by data acquired during validation of prototypes, in-service monitoring and inspections of plant, post-shut-down inspections of plant and in-situ monitoring of stored waste. The technology gaps for the implementation of the integrated nuclear digital environment (INDE) are identified and discussed together with the advantages to be gained from its implementation. Implementation of INDE will be dependent on future advances in High Performance Computing systems approaching the exascale and parallel advances in the development of algorithms for processing large amounts of data. The data itself will be acquired through innovations in measurement, analysis and uncertainty and will be applied through projects relating to lifetime extension, decommissioning and resurgent national science programmes. It is postulated that the existence of this type of framework might be inevitable given both nuclear-specific and non-nuclear drivers and may be essential for the nuclear industry to deliver current and future challenges from the clean-up of legacy waste sites to time and budget, future generation nuclear reactors and small-scale mass-production of modular nuclear power plants. It is proposed that implementation of INDE will lead to shorten development times, reduced costs and increased credibility, operability, reliability and safety.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/IHX3VDBU/Patterson et al. - 2016 - A framework for an integrated nuclear digital envi.pdf}
+}
+
+@inproceedings{pazsitBeamModeCorebarrel2006,
+  title = {Beam Mode Core-Barrel Vibrations in the {{PWRs Ringhals}} 2-4},
+  author = {Pazsit, M. and Sunde, C. and Pazsit, I.},
+  date = {2006},
+  publisher = {American Nuclear Society - ANS; La Grange Park (United States)},
+  location = {United States},
+  abstract = {Analysis of core-barrel vibrations in the Swedish Ringhals PWRs has been performed by Chalmers since the early 1990's. In the first phase of this work, between 1991 and 1998, the evaluation method has been developed such that it made a consistent comparison between different measurements possible. A trend analysis showed that the beam mode amplitudes have steadily increased between 1991 and 1998 in all three plants. This paper is to report on the second phase of the work, performed during 2005, on measurements made both before and after the summer outage 2005 in all three plants. During the summer outage, the hold-down spring in Ringhals-3 was replaced. The analysis shows that the vibration amplitudes increased in an accelerated rate between 1998 and 2005 in all three plants. In Ringhals 3, however, after the change of the hold-down spring, the beam mode amplitude has reverted to close its original level of 1991. It became also clear that the extraction of the information from the vibration peaks needs to be refined and made less subjective. A new method of algorithmic peak separation was elaborated, which supplies more information than the previous analysis; it gives also the peak width in addition to peak amplitude and peak frequency, while also supplying more accurate estimates for the latter two. (authors)}
+}
+
+@article{pazsitDevelopmentsCoreBarrelMotion2017,
+  title = {Developments in {{Core-Barrel Motion Monitoring}} and {{Applications}} to the {{Ringhals PWR Units}}},
+  author = {Pázsit, Imre and Montalvo, Cristina and Nylén, Henrik and Andersson, Tell and Hernández-Solís, Augusto and Cartemo, Petty Bernitt},
+  date = {2017},
+  journaltitle = {Nuclear Science and Engineering},
+  volume = {182},
+  number = {2},
+  pages = {213--227},
+  issn = {0029-5639 1943-748X},
+  doi = {10.13182/nse15-14},
+  url = {https://www.tandfonline.com/doi/abs/10.13182/NSE15-14},
+  abstract = {Core-barrel motion (CBM) surveillance and diagnostics, based on the amplitude of the peaks of the normalized auto power spectral densities (APSDs) of the ex-core neutron detectors, have been performed and continuously developed in Sweden and were applied for monitoring of the three PWR units, Ringhals 2 to 4. From 2005, multiple measurements were taken during each fuel cycle, and these revealed a periodic behavior of the 8-Hz peak of the beam-mode motion: the amplitude increases within the cycle and returns to a lower value at the beginning of the next cycle. The work reported in this paper aims to clarify the physical reason for this behavior. A combination of a mode separation method in the time domain and a nonlinear curve-fitting procedure of the frequency spectra revealed that two types of vibration phenomena contribute to the beam-mode peak. The lower frequency peak around 7 Hz in the ex-core detector APSDs corresponds to the CBM, whose amplitude does not change during the cycle. The higher frequency peak around 8 Hz arises from the individual vibrations of the fuel assemblies, and its amplitude increases monotonically during the cycle. This paper gives an account of the work that has been made to verify the above hypothesis.}
+}
+
+@article{pazsitDevelopmentsCorebarrelVibration1998,
+  title = {Some Developments in Core-Barrel Vibration Diagnostics},
+  author = {Pázsit, I. and Karlsson, J. and Garis, N. S.},
+  date = {1998},
+  journaltitle = {Annals of Nuclear Energy},
+  volume = {25},
+  number = {13},
+  pages = {1079--1093},
+  issn = {03064549},
+  doi = {10.1016/s0306-4549(98)00012-7},
+  abstract = {Diagnostics of core-barrel motion, and notably that of beam mode vibrations, has been usually performed by two distinct concepts. One strategy is to perform a qualitative analysis in the time domain, using descriptors such as vibration trajectory, probability distributions etc. This approach is rather realistic in the sense that it allows for general anisotropic pendular vibrations. The other strategy is to use frequency analysis with the goal of quantifying certain vibration properties. However, this second approach could so far handle only isotropic and unidirectional vibrations. In this paper we propose a unification of these two approaches by introducing a model by which general anisotropic vibrations can be quantified in the frequency domain. However, when separating the noise components prior to the frequency analysis, we suggest the use of symmetry properties of the noise in the time domain, based on reactor physics assumptions, as opposed to the earlier methods that use statistical independence of the components. Due to the unified approach, a combination of time and frequency domain analysis methods can be used for presentation and maximum information extraction.}
+}
+
+@article{pazsitDiagnosticsSurveillanceMethods2004,
+  title = {Diagnostics and {{Surveillance Methods}} in {{Nuclear Systems}} for {{Real-Time Applications}}},
+  author = {Pázsit, I.},
+  date = {2004},
+  journaltitle = {Real-Time Systems},
+  volume = {27},
+  number = {1},
+  pages = {97--113},
+  issn = {0922-6443},
+  doi = {10.1023/B:TIME.0000019129.88316.c7},
+  url = {https://link.springer.com/content/pdf/10.1023/B:TIME.0000019129.88316.c7.pdf},
+  abstract = {This paper reviews some process signal analysis and representation methods that can be used during reactor operation such that they are suitable for real-time applicatons. All listed methods have been tested on data from operating plant. The objective is to detect and interpret changes in the plant or core status at an early stage, such that appropriate measures can be taken immediately. The methods that are discussed and demonstrated in the paper can be divided into two categories. The first is the use of fast and intelligent computing methods such as neural networks and fast wavelet transform, in combination with a diagnostic unfolding procedure which would be computationally rather demanding with traditional methods. The second type is based on direct representation of the system state through visualization of large complex data, showing the space–time behavior of the system. This latter is not associated with any unfolding procedure, it uses only a moderate signal preprocessing for filtering out redundant information, but otherwise showing the process status directly. Such methods have been made possible with the development of powerful computer visualization techniques. The potentials represented by this second alternative do not seem to have been explored fully yet in reactor diagnostics. Methods corresponding to both categories will be demonstrated and discussed in the paper.}
+}
+
+@article{pazsitNeutronNoiseDiagnostics2017,
+  title = {On the {{Neutron Noise Diagnostics}} of {{Pressurized Water Reactor Control Rod Vibrations}} —{{IV}}: {{Application}} of {{Neural Networks}}},
+  author = {Pázsit, I. and Garis, N. S. and Glöckler, O.},
+  date = {2017},
+  journaltitle = {Nuclear Science and Engineering},
+  volume = {124},
+  number = {1},
+  pages = {167--177},
+  issn = {0029-5639 1943-748X},
+  doi = {10.13182/nse96-a24232},
+  url = {https://www.tandfonline.com/doi/abs/10.13182/NSE96-A24232},
+  abstract = {A neutron noise-based technique for the localization of excessively vibrating control rods is elaborated upon in the previous three papers of this series. The method is based on the inversion of a formula that expresses the auto- and cross spectra of three neutron detector signals through the parameters of the vibrating rod, i.e., equilibrium position and displacement components. Successful tests of the algorithm with both simulated and real data were reported in the previous papers. The algorithm had nevertheless certain drawbacks, namely, that its use requires expert knowledge, the redundancy of extra detectors cannot be utilized, and with realistic transfer functions the calculations are rather lengthy. The use of neural networks offers an alternative way of performing the inversion procedure. This possibility was investigated by constructing a network that was trained to determine the rod position from the detector spectra. It was found that all shortcomings of the traditional localization method can be eliminated. The neural network-based identification was also tested with success.}
+}
+
+@article{pazsitNeutronNoiseDiagnostics2017a,
+  title = {On the {{Neutron Noise Diagnostics}} of {{Pressurized Water Reactor Control Rod Vibrations II}}. {{Stochastic Vibrations}}},
+  author = {Pázsit, I. and Glöckler, O.},
+  date = {2017},
+  journaltitle = {Nuclear Science and Engineering},
+  volume = {88},
+  number = {1},
+  pages = {77--87},
+  issn = {0029-5639 1943-748X},
+  doi = {10.13182/nse84-4},
+  url = {https://www.tandfonline.com/doi/abs/10.13182/NSE84-4},
+  abstract = {In an earlier publication, using the theory of neutron fluctuations induced by a vibrating control rod, a complete formal solution of rod vibration diagnostics based on neutron noise measurements was given in terms of Fourier-transformed neutron detector time signals. The suggested procedure was checked in numerical simulation tests where only periodic vibrations could be considered. The procedure and its numerical testing are elaborated for stochastic two-dimensional vibrations. A simple stochastic theory of two-dimensional flow-induced vibrations is given; then the diagnostic method is formulated in the stochastic case, that is, in terms of neutron detector auto- and cross-power spectra. A previously suggested approximate rod localization technique is also formulated in the stochastic case. Applicability of the methods is then investigated in numerical simulation tests, using the proposed model of stochastic two-dimensional vibrations when generating neutron detector spectra that simulate measured data.}
+}
+
+@article{pazsitNeutronNoiseDiagnostics2017b,
+  title = {On the {{Neutron Noise Diagnostics}} of {{Pressurized Water Reactor Control Rod Vibrations}}. {{III}}. {{Application}} at a {{Power Plant}}},
+  author = {Pázsit, I. and Glöckler, O.},
+  date = {2017},
+  journaltitle = {Nuclear Science and Engineering},
+  volume = {99},
+  number = {4},
+  pages = {313--328},
+  issn = {0029-5639 1943-748X},
+  doi = {10.13182/nse88-a23561},
+  url = {https://www.tandfonline.com/doi/abs/10.13182/NSE88-A23561},
+  abstract = {In the first two papers of this series, a complete algorithm was elaborated and tested for the diagnostics of vibrating control rods in pressurized water reactors (PWRs). Although the method was thoroughly tested in numerical experiments where even the effects of background noise were accounted for, the influence of the several approximations regarding the underlying neutron physical and mechanical model of the applicability of the method in real applications could not be properly estimated. In August 1985, in-core self-powered neutron detector spectra taken at Paks-2, a PWR in Hungary, indicated the presence of an excessively vibrating control rod. With these measured noise data as input, the previously reported localization algorithm was applied in its original form. The algorithm singled out one control rod out of the possible seven, and independent investigations performed before and during the subsequent refueling showed the correctness of the localization results. It is therefore concluded that, at least in this particular application, the approximations used in the model were allowable in a case of practical interest. The algorithm was developed further to facilitate the automatization and reliability of the localization procedure. These developments and the experiences in the application of the algorithm are reported in this paper.}
+}
+
+@article{pazsitNeutronNoiseDiagnostics2017c,
+  title = {On the {{Neutron Noise Diagnostics}} of {{Pressurized Water Reactor Control Rod Vibrations}}. {{I}}. {{Periodic Vibrations}}},
+  author = {Pázsit, I. and Glöckler, O.},
+  date = {2017},
+  journaltitle = {Nuclear Science and Engineering},
+  volume = {85},
+  number = {2},
+  pages = {167--177},
+  issn = {0029-5639 1943-748X},
+  doi = {10.13182/nse83-a27424},
+  url = {https://www.tandfonline.com/doi/abs/10.13182/NSE83-A27424},
+  abstract = {Based on the theory of neutron noise arising from the vibration of a localized absorber, the possibility of rod vibration diagnostics is investigated. It is found that noise source characteristics, namely rod position and vibration trajectory and spectra, can be unfolded from measured neutron noise signals. For the localization process, the first and more difficult part of the diagnostics, a procedure is suggested whose novelty is that it is applicable in case of arbitrary vibration trajectories. Applicability of the method is investigated in numerical experiments where effects of background noise are also accounted for.}
+}
+
+@incollection{pazsitNoiseTechniquesNuclear2010,
+  title = {Noise {{Techniques}} in {{Nuclear Systems}}},
+  booktitle = {Handbook of {{Nuclear Engineering}}},
+  author = {Pázsit, Imre and Demazière, Christophe},
+  date = {2010},
+  pages = {1629--1737},
+  publisher = {Springer US},
+  location = {Boston, MA},
+  doi = {10.1007/978-0-387-98149-9_14},
+  url = {https://link.springer.com/referenceworkentry/10.1007/978-0-387-98149-9_14},
+  abstract = {This chapter deals with neutron fluctuations in nuclear systems. Such neutron fluctuations, or neutron noise, fall into two categories: neutron noise in zero power systems and neutron noise in power reactors. The concepts, the theory, and the methodology of these fluctuations as well as their various applications for extracting information in a nonintrusive way about the system in question are described. A number of specific applications are described, where detection and analysis of zero power and power reactor noise make it possible to extract diagnostic information about the system by determining some parameters of the system during normal operation, or by detecting, identifying, and quantifying developing anomalies at an early stage and determining their severity. This chapter ends with an outline of future developments and actual issues in the~field.},
+  isbn = {978-0-387-98130-7 978-0-387-98149-9}
+}
+
+@article{pazsitREFINEDMETHODSURVEILLANCE2014,
+  title = {{{REFINED METHOD FOR SURVEILLANCE AND DIAGNOSTICS OF THE CORE BARREL VIBRATIONS OF THE RINGHALS PWRs}}},
+  author = {Pazsit, Imre and Nylén, Henrik and Montalvo Martín, Cristina},
+  date = {2014},
+  abstract = {Surveillance and diagnostics of core barrel vibrations has been performed in the Swedish Ringhals PWRs for several years, with main focus on the pendular motion (beam mode). The monitoring of the beam mode showed that the amplitude of the corresponding peak in the ex-core neutron spectra increases along the cycle, and decreases after refueling. Previous investigations on the reason of this behaviour, i.e. whether it is due to the increase of the core barrel vibration amplitude or to the increase of the neutron physics coupling between vibrations and neutron noise, were not decisive. The objective of the work reported here is to clarify this question. From frequency analysis, two modes of vibration have been identi-fied in the frequency range of the beam mode. Several results coming from the trend analysis performed during recent years indicate that one of the modes is due to the core barrel motion itself and remains constant during cycle, and the other is due to the indi-vidual flow induced vibrations of the fuel elements, showing an increasing trend during the cycle. In this work, the method to separate the contributions from the two modes has been refined, and the results of this approach to the latest measurements are presented. The results confirm the origin of the two vibration modes and show constant amplitude of the core barrel motion throughout the cycle.}
+}
+
+@article{pdfpages,
+  title = {Pdfpages {{Package}}},
+  author = {Matthias, Andreas},
+  pages = {12},
+  abstract = {This package simplifies the insertion of external multi-page PDF or PS documents. It supports pdfTeX, VTeX, and XeTeX.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/UWIQHLX6/Matthias - The pdfpages Package.pdf}
+}
+
+@unpublished{peetModernControlSystems,
+  title = {Modern {{Control Systems}}:  {{Small Gain Theorem}}},
+  author = {Peet, Matthew},
+  url = {https://control.asu.edu/Classes/MMAE543/543Lecture15.pdf},
+  file = {/home/danesabo/Zotero/storage/ELHTM2HI/543Lecture15.pdf}
+}
+
+@article{peisertSoftwareInfrastructureDevelop2023,
+  title = {On {{Software Infrastructure}}: {{Develop}}, {{Prove}}, {{Profit}}?},
+  shorttitle = {On {{Software Infrastructure}}},
+  author = {Peisert, Sean},
+  date = {2023-07},
+  journaltitle = {IEEE Security \& Privacy},
+  shortjournal = {IEEE Secur. Privacy},
+  volume = {21},
+  number = {4},
+  pages = {4--8},
+  issn = {1540-7993, 1558-4046},
+  doi = {10.1109/MSEC.2023.3273492},
+  url = {https://ieeexplore.ieee.org/document/10194513/},
+  urldate = {2023-12-19},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/QYTUNVU7/Peisert - 2023 - On Software Infrastructure Develop, Prove, Profit.pdf}
+}
+
+@article{peisertSoftwareInfrastructureDevelop2023a,
+  title = {On {{Software Infrastructure}}: {{Develop}}, {{Prove}}, {{Profit}}?},
+  shorttitle = {On {{Software Infrastructure}}},
+  author = {Peisert, Sean},
+  date = {2023-07},
+  journaltitle = {IEEE Security \& Privacy},
+  volume = {21},
+  number = {4},
+  pages = {4--8},
+  issn = {1558-4046},
+  doi = {10.1109/MSEC.2023.3273492},
+  url = {https://ieeexplore.ieee.org/document/10194513},
+  urldate = {2023-10-25},
+  abstract = {Having infrastructure survive over very long stretches of time is a nontrivial task. This is either because such infrastructure needs to be built extremely well from the outset or because it requires ongoing maintenance. The former may require prohibitively large initial investments. The latter requires ongoing investment from public agencies over the span of decades or centuries despite the pendulum swings of those governments from contrasting political aims. Without either the very high initial or ongoing investment, infrastructure can fail. Physical infrastructure failure is not inevitable—consider railways in Japan, the Panama Canal, and the U.S. Interstate Highway System.},
+  eventtitle = {{{IEEE Security}} \& {{Privacy}}},
+  file = {/home/danesabo/Zotero/storage/U9L65YQ8/Peisert - 2023 - On Software Infrastructure Develop, Prove, Profit.pdf}
+}
+
+@inproceedings{peletiesAsymptoticStabilityMSwitched1991,
+  title = {Asymptotic {{Stability}} of M-{{Switched Systems}} Using {{Lyapunov-Like Functions}}},
+  booktitle = {1991 {{American Control Conference}}},
+  author = {Peleties, Philippos and DeCarlo, Raymond},
+  date = {1991-06},
+  pages = {1679--1684},
+  publisher = {IEEE},
+  location = {Boston, MA, USA},
+  doi = {10.23919/ACC.1991.4791667},
+  url = {https://ieeexplore.ieee.org/document/4791667/},
+  urldate = {2024-03-04},
+  eventtitle = {1991 {{American Control Conference}}},
+  isbn = {978-0-87942-565-4}
+}
+
+@article{perez-cruzGaussianProcessesNonlinear2013,
+  title = {Gaussian {{Processes}} for {{Nonlinear Signal Processing}}: {{An Overview}} of {{Recent Advances}}},
+  shorttitle = {Gaussian {{Processes}} for {{Nonlinear Signal Processing}}},
+  author = {Perez-Cruz, Fernando and Van Vaerenbergh, Steven and Murillo-Fuentes, Juan Jose and Lazaro-Gredilla, Miguel and Santamaria, Ignacio},
+  date = {2013-07},
+  journaltitle = {IEEE Signal Processing Magazine},
+  shortjournal = {IEEE Signal Process. Mag.},
+  volume = {30},
+  number = {4},
+  pages = {40--50},
+  issn = {1053-5888},
+  doi = {10.1109/MSP.2013.2250352},
+  url = {http://ieeexplore.ieee.org/document/6530761/},
+  urldate = {2022-04-21},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/IXLJ8SLK/Perez-Cruz et al. - 2013 - Gaussian Processes for Nonlinear Signal Processing.pdf}
+}
+
+@report{petersenWorkforceFrameworkCybersecurity2020,
+  title = {Workforce {{Framework}} for {{Cybersecurity}} ({{NICE Framework}})},
+  author = {Petersen, Rodney and Santos, Danielle and Wetzel, Karen and Smith, Matthew and Witte, Gregory},
+  date = {2020-11-16},
+  number = {NIST Special Publication (SP) 800-181 Rev. 1},
+  institution = {{National Institute of Standards and Technology}},
+  doi = {10.6028/NIST.SP.800-181r1},
+  url = {https://csrc.nist.gov/pubs/sp/800/181/r1/final},
+  urldate = {2023-11-07},
+  abstract = {This publication from the National Initiative for Cybersecurity Education (NICE) describes the Workforce Framework for Cybersecurity (NICE Framework), a fundamental reference for describing and sharing information about cybersecurity work. It expresses that work as Task statements and describes Knowledge and Skill statements that provide a foundation for learners including students, job seekers, and employees. The use of these statements helps students to develop skills, job seekers to demonstrate competencies, and employees to accomplish tasks. As a common, consistent lexicon that categorizes and describes cybersecurity work, the NICE Framework improves communication about how to identify, recruit, develop, and retain cybersecurity talent. The NICE Framework is a reference source from which organizations or sectors can develop additional publications or tools that meet their needs to define or provide guidance on different aspects of cybersecurity education, training, and workforce...},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/PB94MBA3/Petersen et al. - 2020 - Workforce Framework for Cybersecurity (NICE Framew.pdf}
+}
+
+@article{petersonOverviewMethodologiesCybersecurity2019,
+  title = {An Overview of Methodologies for Cybersecurity Vulnerability Assessments Conducted in Nuclear Power Plants},
+  author = {Peterson, John and Haney, Michael and Borrelli, R.A.},
+  date = {2019-05},
+  journaltitle = {Nuclear Engineering and Design},
+  shortjournal = {Nuclear Engineering and Design},
+  volume = {346},
+  pages = {75--84},
+  issn = {00295493},
+  doi = {10.1016/j.nucengdes.2019.02.025},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0029549319300330},
+  urldate = {2022-09-30},
+  abstract = {Cyber-attacks against critical energy infrastructure have gone from possible to eventual to actual. With electrical generation sources in the United States changing under a wide range of pressures, the current fleet of nuclear power plants in the United States provides a reliable and sustainable source of electrical generation capacity. However, in order to extend the lifetime of the fleet, modernization upgrades to digital instrumentation and control systems are required. While this produces many opportunities for increased efficiency, it introduces a new level of complexity for securing and reliably operating reactors in the presence cyberthreats. The United States Nuclear Regulatory Commission recently began urging stronger cybersecurity efforts at nuclear power plants. As upgrades at nuclear power plants begin, the implementation of digital instrumentation and control systems to monitor and run the power plant introduces new vulnerabilities that must be addressed. This necessitates a more modern discussion of risk. Within this context, we critically review past cyber-vulnerability incidents at nuclear installations and other critical facilities. We then analyze challenges to vulnerabilities within the context of modernization of the current nuclear fleet and propose future research directions needed to resolve these issues.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/JBUTPZWK/Peterson et al. - 2019 - An overview of methodologies for cybersecurity vul.pdf}
+}
+
+@inproceedings{petterssonStabilityRobustnessHybrid1996,
+  title = {Stability and Robustness for Hybrid Systems},
+  booktitle = {Proceedings of 35th {{IEEE Conference}} on {{Decision}} and {{Control}}},
+  author = {Pettersson, S. and Lennartson, B.},
+  date = {1996},
+  volume = {2},
+  pages = {1202--1207},
+  publisher = {IEEE},
+  location = {Kobe, Japan},
+  doi = {10.1109/CDC.1996.572653},
+  url = {http://ieeexplore.ieee.org/document/572653/},
+  urldate = {2024-03-04},
+  eventtitle = {35th {{IEEE Conference}} on {{Decision}} and {{Control}}},
+  isbn = {978-0-7803-3590-5}
+}
+
+@article{pichlerEntropyBasedRisk2020,
+  title = {Entropy Based Risk Measures},
+  author = {Pichler, Alois and Schlotter, Ruben},
+  date = {2020-08},
+  journaltitle = {European Journal of Operational Research},
+  shortjournal = {European Journal of Operational Research},
+  volume = {285},
+  number = {1},
+  pages = {223--236},
+  issn = {03772217},
+  doi = {10.1016/j.ejor.2019.01.016},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0377221719300189},
+  urldate = {2024-01-26},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/HYC7B5I4/Pichler and Schlotter - 2020 - Entropy based risk measures.pdf}
+}
+
+@article{picinbonoSecondorderComplexRandom1996,
+  title = {Second-Order Complex Random Vectors and Normal Distributions},
+  author = {Picinbono, B.},
+  year = {Oct./1996},
+  journaltitle = {IEEE Transactions on Signal Processing},
+  shortjournal = {IEEE Trans. Signal Process.},
+  volume = {44},
+  number = {10},
+  pages = {2637--2640},
+  issn = {1053587X},
+  doi = {10.1109/78.539051},
+  url = {http://ieeexplore.ieee.org/document/539051/},
+  urldate = {2022-04-21},
+  abstract = {We formulate as a deconvolution problem the causalhoncausal non-Gaussian multichannel autoregressive (AR) parameter estimation problem. The super exponential aljporithm presented in a recent paper by Shalvi and Weinstein is generalized to the vector case. We present an adaptive implementation that is very attractive since it is higher order statistics (HOS) based b u t does not present the high comlputational complexity of methods proposed up to now.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/KPPBR7F9/Picinbono - 1996 - Second-order complex random vectors and normal dis.pdf}
+}
+
+@online{PicturingQuantumProcesses,
+  title = {Picturing {{Quantum Processes}} | {{Quantum}} Physics, Quantum Information and Quantum Computation},
+  url = {https://www.cambridge.org/us/academic/subjects/physics/quantum-physics-quantum-information-and-quantum-computation/picturing-quantum-processes-first-course-quantum-theory-and-diagrammatic-reasoning, https://www.cambridge.org/us/academic/subjects/physics/quantum-physics-quantum-information-and-quantum-computation},
+  urldate = {2023-12-12},
+  langid = {english},
+  organization = {Cambridge University Press}
+}
+
+@article{pillitteriGuidelinesSmartGrid2014,
+  title = {Guidelines for {{Smart Grid Cybersecurity}}},
+  author = {Pillitteri, Victoria Y. and Brewer, Tanya L.},
+  date = {2014-09-25T00:09-04:00},
+  url = {https://www.nist.gov/publications/guidelines-smart-grid-cybersecurity},
+  urldate = {2022-03-22},
+  abstract = {This three-volume report, Guidelines for Smart Grid Cybersecurity, presents an analytical framework that organizations can use to develop effective cybersecurit},
+  langid = {english},
+  annotation = {Last Modified: 2018-11-10T10:11-05:00},
+  file = {/home/danesabo/Zotero/storage/5UK8BFE3/Pillitteri and Brewer - 2014 - Guidelines for Smart Grid Cybersecurity.pdf;/home/danesabo/Zotero/storage/HHT75338/guidelines-smart-grid-cybersecurity.html}
+}
+
+@misc{PJM-map,
+  author = {{PJM Corp.}},
+  year = {Date accessed 11/2021},
+  url = {https://www.pjm.com/library/~/media/about-pjm/pjm-zones.ashx}
+}
+
+@article{platzerDifferentialDynamicLogic2008,
+  title = {Differential {{Dynamic Logic}} for {{Hybrid Systems}}},
+  author = {Platzer, André},
+  date = {2008-08},
+  journaltitle = {Journal of Automated Reasoning},
+  shortjournal = {J Autom Reasoning},
+  volume = {41},
+  number = {2},
+  pages = {143--189},
+  issn = {0168-7433, 1573-0670},
+  doi = {10.1007/s10817-008-9103-8},
+  url = {https://link.springer.com/10.1007/s10817-008-9103-8},
+  urldate = {2023-10-10},
+  abstract = {Hybrid systems are models for complex physical systems and are defined as dynamical systems with interacting discrete transitions and continuous evolutions along differential equations. With the goal of developing a theoretical and practical foundation for deductive verification of hybrid systems, we introduce a dynamic logic for hybrid programs, which is a program notation for hybrid systems. As a verification technique that is suitable for automation, we introduce a free variable proof calculus with a novel combination of real-valued free variables and Skolemisation for lifting quantifier elimination for real arithmetic to dynamic logic. The calculus is compositional, i.e., it reduces properties of hybrid programs to properties of their parts. Our main result proves that this calculus axiomatises the transition behaviour of hybrid systems completely relative to differential equations. In a case study with cooperating traffic agents of the European Train Control System, we further show that our calculus is well-suited for verifying realistic hybrid systems with parametric system dynamics.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/6SGTLZ4W/Platzer - 2008 - Differential Dynamic Logic for Hybrid Systems.pdf}
+}
+
+@inproceedings{platzerKeYmaeraHybridTheorem2008,
+  title = {{{KeYmaera}}: {{A Hybrid Theorem Prover}} for {{Hybrid Systems}} ({{System Description}})},
+  shorttitle = {{{KeYmaera}}},
+  booktitle = {Automated {{Reasoning}}},
+  author = {Platzer, André and Quesel, Jan-David},
+  editor = {Armando, Alessandro and Baumgartner, Peter and Dowek, Gilles},
+  date = {2008},
+  pages = {171--178},
+  publisher = {Springer},
+  location = {Berlin, Heidelberg},
+  doi = {10.1007/978-3-540-71070-7_15},
+  abstract = {KeYmaera is a hybrid verification tool for hybrid systems that combines deductive, real algebraic, and computer algebraic prover technologies. It is an automated and interactive theorem prover for a natural specification and verification logic for hybrid systems. KeYmaera supports differential dynamic logic, which is a real-valued first-order dynamic logic for hybrid programs, a program notation for hybrid automata. For automating the verification process, KeYmaera implements a generalized free-variable sequent calculus and automatic proof strategies that decompose the hybrid system specification symbolically. To overcome the complexity of real arithmetic, we integrate real quantifier elimination following an iterative background closure strategy. Our tool is particularly suitable for verifying parametric hybrid systems and has been used successfully for verifying collision avoidance in case studies from train control and air traffic management.},
+  isbn = {978-3-540-71070-7},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/GBPSG5W4/Platzer and Quesel - 2008 - KeYmaera A Hybrid Theorem Prover for Hybrid Syste.pdf}
+}
+
+@book{platzerLogicalFoundationsCyberPhysical2018,
+  title = {Logical {{Foundations}} of {{Cyber-Physical Systems}}},
+  author = {Platzer, André},
+  date = {2018},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-319-63588-0},
+  url = {http://link.springer.com/10.1007/978-3-319-63588-0},
+  urldate = {2023-10-11},
+  isbn = {978-3-319-63587-3 978-3-319-63588-0},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/VTPT3HIX/Platzer - 2018 - Logical Foundations of Cyber-Physical Systems.pdf}
+}
+
+@article{pliatsiosSurveySCADASystems2020,
+  title = {A {{Survey}} on {{SCADA Systems}}: {{Secure Protocols}}, {{Incidents}}, {{Threats}} and {{Tactics}}},
+  shorttitle = {A {{Survey}} on {{SCADA Systems}}},
+  author = {Pliatsios, Dimitrios and Sarigiannidis, Panagiotis and Lagkas, Thomas and Sarigiannidis, Antonios G.},
+  date = {2020-23},
+  journaltitle = {IEEE Communications Surveys \& Tutorials},
+  shortjournal = {IEEE Commun. Surv. Tutorials},
+  volume = {22},
+  number = {3},
+  pages = {1942--1976},
+  issn = {1553-877X, 2373-745X},
+  doi = {10.1109/COMST.2020.2987688},
+  url = {https://ieeexplore.ieee.org/document/9066892/},
+  urldate = {2022-09-30},
+  abstract = {Supervisory Control and Data Acquisition (SCADA) systems are the underlying monitoring and control components of critical infrastructures, such as power, telecommunication, transportation, pipelines, chemicals and manufacturing plants. Legacy SCADA systems operated on isolated networks, that made them less exposed to Internet threats. However, the increasing connection of SCADA systems to the Internet, as well as corporate networks, introduces severe security issues. Security considerations for SCADA systems are gaining higher attention, as the number of security incidents against these critical infrastructures is increasing. In this survey, we provide an overview of the general SCADA architecture, along with a detailed description of the SCADA communication protocols. Additionally, we discuss certain high-impact security incidents, objectives, and threats. Furthermore, we carry out an extensive review of the security proposals and tactics that aim to secure SCADA systems. We also discuss the state of SCADA system security. Finally, we present the current research trends and future advancements of SCADA security.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/36SIUAGM/Pliatsios et al. - 2020 - A Survey on SCADA Systems Secure Protocols, Incid.pdf}
+}
+
+@inproceedings{podelskiModelCheckingHybrid2006,
+  title = {Model {{Checking}} of {{Hybrid Systems}}: {{From Reachability Towards Stability}}},
+  shorttitle = {Model {{Checking}} of {{Hybrid Systems}}},
+  booktitle = {Hybrid {{Systems}}: {{Computation}} and {{Control}}},
+  author = {Podelski, Andreas and Wagner, Silke},
+  editor = {Hespanha, João P. and Tiwari, Ashish},
+  date = {2006},
+  series = {Lecture {{Notes}} in {{Computer Science}}},
+  pages = {507--521},
+  publisher = {Springer},
+  location = {Berlin, Heidelberg},
+  doi = {10.1007/11730637_38},
+  abstract = {We call a hybrid system stable if every trajectory inevitably ends up in a given region. Our notion of stability deviates from classical definitions in control theory. In this paper, we present a model checking algorithm for stability in the new sense. The idea of the algorithm is to reduce the stability proof for the whole system to a set of (smaller) proofs for several one-mode systems.},
+  isbn = {978-3-540-33171-1},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/IM9M5J3J/Podelski and Wagner - 2006 - Model Checking of Hybrid Systems From Reachabilit.pdf}
+}
+
+@article{polaControlCyberPhysicalSystemsLogic2019,
+  title = {Control of {{Cyber-Physical-Systems}} with Logic Specifications: {{A}} Formal Methods Approach},
+  shorttitle = {Control of {{Cyber-Physical-Systems}} with Logic Specifications},
+  author = {Pola, Giordano and Di Benedetto, Maria Domenica},
+  date = {2019},
+  journaltitle = {Annual Reviews in Control},
+  shortjournal = {Annual Reviews in Control},
+  volume = {47},
+  pages = {178--192},
+  issn = {13675788},
+  doi = {10.1016/j.arcontrol.2019.03.010},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S1367578818302153},
+  urldate = {2023-10-10},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/SQ8SI8US/Pola and Di Benedetto - 2019 - Control of Cyber-Physical-Systems with logic speci.pdf}
+}
+
+@article{pollackHowBelieveMachineChecked1997,
+  title = {How to {{Believe}} a {{Machine-Checked Proof}}},
+  author = {Pollack, Robert},
+  date = {1997},
+  file = {/home/danesabo/Zotero/storage/Y67DUZUK/Pollack - 1997 - How to Believe a Machine-Checked Proof.pdf}
+}
+
+@article{poloniQuadraticVectorEquations2013,
+  title = {Quadratic {{Vector Equations}}},
+  author = {Poloni, Federico},
+  date = {2013-02},
+  journaltitle = {Linear Algebra and its Applications},
+  shortjournal = {Linear Algebra and its Applications},
+  volume = {438},
+  number = {4},
+  eprint = {1004.1500},
+  eprinttype = {arXiv},
+  pages = {1627--1644},
+  issn = {00243795},
+  doi = {10.1016/j.laa.2011.05.036},
+  url = {http://arxiv.org/abs/1004.1500},
+  urldate = {2022-04-21},
+  abstract = {We study in a unified fashion several quadratic vector and matrix equations with nonnegativity hypotheses, by seeing them as special cases of the general problem M x = a + b(x, x), where a and the unknown x are componentwise nonnegative vectors, M is a nonsingular M-matrix, and b is a bilinear map from pairs of nonnegative vectors to nonnegative vectors. Specific cases of this equation have been studied extensively in the past by several authors, and include unilateral matrix equations from queuing problems [Bini, Latouche, Meini, 2005], nonsymmetric algebraic Riccati equations [Guo, Laub, 2000], and quadratic matrix equations encountered in neutron transport theory [Lu, 2005]. We present a unified approach which treats the common aspects of their theoretical properties and basic iterative solution algorithms. This has interesting consequences: in some cases, we are able to derive in full generality theorems and proofs appeared in literature only for special cases of the problem; this broader view highlights the role of hypotheses such as the strict positivity of the minimal solution. In an example, we adapt an algorithm derived for one equation of the class to another, with computational advantage with respect to the existing methods. We discuss possible research lines, including the relationship among Newton-type methods and the cyclic reduction algorithm for unilateral quadratic equations.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/8JCG4MUG/Poloni - 2013 - Quadratic Vector Equations.pdf}
+}
+
+@online{poluGenerativeLanguageModeling2020,
+  title = {Generative {{Language Modeling}} for {{Automated Theorem Proving}}},
+  author = {Polu, Stanislas and Sutskever, Ilya},
+  date = {2020-09-07},
+  eprint = {2009.03393},
+  eprinttype = {arXiv},
+  eprintclass = {cs, stat},
+  doi = {10.48550/arXiv.2009.03393},
+  url = {http://arxiv.org/abs/2009.03393},
+  urldate = {2024-03-07},
+  abstract = {We explore the application of transformer-based language models to automated theorem proving. This work is motivated by the possibility that a major limitation of automated theorem provers compared to humans -- the generation of original mathematical terms -- might be addressable via generation from language models. We present an automated prover and proof assistant, GPT-f, for the Metamath formalization language, and analyze its performance. GPT-f found new short proofs that were accepted into the main Metamath library, which is to our knowledge, the first time a deep-learning based system has contributed proofs that were adopted by a formal mathematics community.},
+  pubstate = {prepublished},
+  note = {Comment: 15+5 pages},
+  file = {/home/danesabo/Zotero/storage/DYZKP6NH/Polu and Sutskever - 2020 - Generative Language Modeling for Automated Theorem.pdf;/home/danesabo/Zotero/storage/IQP2QELV/2009.html}
+}
+
+@article{poreskyCyberSecurityNuclear,
+  title = {Cyber {{Security}} in {{Nuclear Power Plants}}},
+  author = {Poresky, Christopher and Andreades, Charalampos and Kendrick, James and Peterson, Per},
+  pages = {15},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/TKLVVLHB/Poresky et al. - Cyber Security in Nuclear Power Plants.pdf}
+}
+
+@inproceedings{porReactorNoiseAnalysis1998,
+  title = {Reactor Noise Analysis Applications and Systems in {{WWER-440}} and {{WWER-1000}} Type {{PWRs}}},
+  author = {Por, G.},
+  date = {1998},
+  pages = {609},
+  publisher = {IAEA},
+  location = {International Atomic Energy Agency (IAEA)},
+  url = {http://inis.iaea.org/search/search.aspx?orig_q=RN:30002930},
+  abstract = {This paper presents an introduction on different types of well selected noise diagnostic methods with their occurrence in WWER reactors with an analysis of their impact on operational safety and aging which affects the installations safety as well The main objective is to attract the attention of NPP management staff dealing with safety, safety culture, maintenance, operation and quality assurance proving that such methods can give benefit not only to economy but impact safety of nuclear installations},
+  eventtitle = {On-Line Testing of Nuclear Plant Temperature and Pressure Instrumentation and Other Critical Plant Equipment {{IAEA}} Regional Workshop {{Working}} Material}
+}
+
+@inproceedings{poschmannExperienceFormalMethods1997,
+  title = {Experience with Formal Methods Implementing the {{PROFIBUS FMS}} and {{DP}} Protocol for Industrial Applications},
+  booktitle = {Proceedings 1997 {{IEEE International Workshop}} on {{Factory Communication Systems}}. {{WFCS}}'97},
+  author = {Poschmann, A. and Hahniche, J. and Deicke, P. and Neumann, P.},
+  date = {1997},
+  pages = {277--286},
+  publisher = {IEEE},
+  location = {Barcelona, Spain},
+  doi = {10.1109/WFCS.1997.634310},
+  url = {http://ieeexplore.ieee.org/document/634310/},
+  urldate = {2023-10-10},
+  abstract = {This paper presents our experience using the formal description technique Estelle for the protocol development cycle in the area of real-time industrial communication systems. A s a real world application the PROFIBUS parts FMS and DP of the European fieldbus standard were completely implemented using formal models. These implementations are successfully used in industrial applications and embedded systems. Our development method, results, and experiences during the development process are discussed in the paper. A closed, tool based method is the overall aim concerning the development life cycle to support the requirement definition as well as the implementation of the product code with final testing, To meet these needs, our approach defines some assumptions and constraints using the syntactic and semantic model of the specif cation language Estelle, aspects of the modelling process concerning the architecture, handling data abstraction and encapsulation of the specification language vs. real-time data pow in the product code implementation, synchronous vs. asynchronous communications to local intefaces (e.g. physical layer or partly data link layer ASIC) and dealing with special local events like timeoutsr and interrupts in the specification and in the real-time execution environment. The paper discusses advantages and also critical points using the formal way of the protocol development cycle. In theory, it is quite clear that formal description techniques enhance quality. Therefore, we discuss this approach under the user’s point of view.},
+  eventtitle = {1997 {{IEEE International Workshop}} on {{Factory Communication Systems}}. {{WFCS}}'97},
+  isbn = {978-0-7803-4182-1},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/KRBSMLW7/Poschmann et al. - 1997 - Experience with formal methods implementing the PR.pdf}
+}
+
+@article{powellOPTIMIZINGSIMULATORMERGINGSIMULATION,
+  title = {{{THE OPTIMIZING-SIMULATOR}}: {{MERGING SIMULATION AND OPTIMIZATION USING APPROXIMATE DYNAMIC PROGRAMMING}}},
+  author = {Powell, Warren B},
+  abstract = {There has long been a competition between simulation and optimization in the modeling of problems in transportation and logistics, machine scheduling and similar highdimensional problems in operations research. Simulation strives to model operations, often using rule-based logic. Optimization strives to find the best possible solution, minimizing costs or maximizing profits. In this tutorial, we show how these two modeling technologies can be brought together, combining the flexibility of simulation with the intelligence of optimization.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/YX23UQKG/Powell - THE OPTIMIZING-SIMULATOR MERGING SIMULATION AND O.pdf}
+}
+
+@report{prestlBMWActiveCruise2000,
+  type = {SAE Technical Paper},
+  title = {The {{BMW Active Cruise Control ACC}}},
+  author = {Prestl, Willibald and Sauer, Thomas and Steinle, Joachim and Tschernoster, Oliver},
+  date = {2000-03-06},
+  number = {2000-01-0344},
+  institution = {SAE International},
+  location = {Warrendale, PA},
+  issn = {0148-7191, 2688-3627},
+  doi = {10.4271/2000-01-0344},
+  url = {https://www.sae.org/publications/technical-papers/content/2000-01-0344/},
+  urldate = {2023-11-20},
+  abstract = {With series introduction of Adaptive Cruise Control (ACC) systems, automotive industry at present makes a step towards a new category of vehicle control systems. For the first time in automotive history these systems make use of information about the surrounding traffic situation. This information i},
+  langid = {english}
+}
+
+@online{PRISMProbabilisticSymbolic,
+  title = {{{PRISM}} - {{Probabilistic Symbolic Model Checker}}},
+  url = {https://www.prismmodelchecker.org/},
+  urldate = {2023-11-03},
+  file = {/home/danesabo/Zotero/storage/QE5WA3CJ/www.prismmodelchecker.org.html}
+}
+
+@online{ProofsArgumentsZeroKnowledge,
+  title = {Proofs, {{Arguments}}, and {{Zero-Knowledge}}},
+  url = {https://people.cs.georgetown.edu/jthaler/ProofsArgsAndZK.html},
+  urldate = {2024-04-01},
+  file = {/home/danesabo/Zotero/storage/P9WJ9L6R/ProofsArgsAndZK.html}
+}
+
+@online{PropositionsTypesExplained,
+  title = {Propositions as Types: Explained (and Debunked)},
+  url = {https://lawrencecpaulson.github.io/2023/08/23/Propositions_as_Types.html},
+  urldate = {2024-02-22},
+  file = {/home/danesabo/Zotero/storage/SLRKAUJZ/Propositions_as_Types.html}
+}
+
+@inreference{PrototypeVerificationSystem2022,
+  title = {Prototype {{Verification System}}},
+  booktitle = {Wikipedia},
+  date = {2022-12-15T01:46:11Z},
+  url = {https://en.wikipedia.org/w/index.php?title=Prototype_Verification_System&oldid=1127497212},
+  urldate = {2024-03-19},
+  abstract = {The Prototype Verification System (PVS) is a specification language integrated with support tools and an automated theorem prover, developed at the Computer Science Laboratory of SRI International in Menlo Park, California.  PVS is based on a kernel consisting of an extension of Church's theory of types with dependent types, and is fundamentally a classical typed higher-order logic. The base types include uninterpreted types that may be introduced by the user, and built-in types such as the booleans, integers, reals, and the ordinals.  Type-constructors include functions, sets, tuples, records, enumerations, and abstract data types. Predicate subtypes and dependent types can be used to introduce constraints; these constrained types may incur proof obligations (called type-correctness conditions or TCCs) during typechecking.  PVS specifications are organized into parameterized theories. The system is implemented in Common Lisp, and is released under the GNU General Public License (GPL).},
+  langid = {english},
+  annotation = {Page Version ID: 1127497212},
+  file = {/home/danesabo/Zotero/storage/4IIQI8ZR/Prototype_Verification_System.html}
+}
+
+@incollection{puysFormalAnalysisSecurity2016,
+  title = {Formal {{Analysis}} of {{Security Properties}} on the {{OPC-UA SCADA Protocol}}},
+  booktitle = {Computer {{Safety}}, {{Reliability}}, and {{Security}}},
+  author = {Puys, Maxime and Potet, Marie-Laure and Lafourcade, Pascal},
+  editor = {Skavhaug, Amund and Guiochet, Jérémie and Bitsch, Friedemann},
+  date = {2016},
+  volume = {9922},
+  pages = {67--75},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-319-45477-1_6},
+  url = {http://link.springer.com/10.1007/978-3-319-45477-1_6},
+  urldate = {2023-10-10},
+  abstract = {Industrial systems are publicly the target of cyberattacks since Stuxnet [1]. Nowadays they are increasingly communicating over insecure media such as Internet. Due to their interaction with the real world, it is crucial to prove the security of their protocols. In this paper, we formally study the security of one of the most used industrial protocols: OPC-UA. Using ProVerif, a well known cryptographic protocol verification tool, we are able to check secrecy and authentication properties. We find several attacks on the protocols and provide countermeasures.},
+  isbn = {978-3-319-45476-4 978-3-319-45477-1},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/RYTWYIRC/Puys et al. - 2016 - Formal Analysis of Security Properties on the OPC-.pdf}
+}
+
+@inproceedings{puysHardwareInTheLoopLabsSCADA2021,
+  title = {Hardware-{{In-The-Loop Labs}} for {{SCADA Cybersecurity Awareness}} and {{Training}}},
+  booktitle = {Proceedings of the 16th {{International Conference}} on {{Availability}}, {{Reliability}} and {{Security}}},
+  author = {Puys, Maxime and Thevenon, Pierre-Henri and Mocanu, Stéphane},
+  date = {2021-08-17},
+  series = {{{ARES}} '21},
+  pages = {1--10},
+  publisher = {Association for Computing Machinery},
+  location = {New York, NY, USA},
+  doi = {10.1145/3465481.3469185},
+  url = {https://dl.acm.org/doi/10.1145/3465481.3469185},
+  urldate = {2024-08-08},
+  abstract = {In this paper, we present a SCADA cybersecurity awareness and training program based on a Hands-On training using two twin cyber-ranges named WonderICS and G-ICS. These labs are built using a Hardware-In-the-Loop simulation system of the physical process developed by the two partners. The cyber-ranges allow replication of realistic Advanced Persistent Threat (APT) attacks and demonstration of known vulnerabilities, as they rely on real industrial control devices and softwares. In this work, we present both the demonstration scenarios used for awareness on WonderICS and the training programs developed for graduate students on G-ICS.},
+  isbn = {978-1-4503-9051-4},
+  file = {/home/danesabo/Zotero/storage/3ZHNNJM9/Puys et al. - 2021 - Hardware-In-The-Loop Labs for SCADA Cybersecurity .pdf}
+}
+
+@inproceedings{qinFormalModelingVerification2017,
+  title = {Formal Modeling and Verification of Flexible Load Control for Power Grid {{CPS}} Based on Differential Dynamic Logic},
+  booktitle = {2017 {{IEEE Conference}} on {{Energy Internet}} and {{Energy System Integration}} ({{EI2}})},
+  author = {Qin, Boya and Liu, Dong and Cao, Min and Zou, Jingxi},
+  date = {2017-11},
+  pages = {1--6},
+  publisher = {IEEE},
+  location = {Beijing},
+  doi = {10.1109/EI2.2017.8245721},
+  url = {http://ieeexplore.ieee.org/document/8245721/},
+  urldate = {2023-10-10},
+  eventtitle = {2017 {{IEEE Conference}} on {{Energy Internet}} and {{Energy System Integration}} ({{EI2}})},
+  isbn = {978-1-5386-1427-3},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/HJ6FT5U9/Qin et al. - 2017 - Formal modeling and verification of flexible load .pdf}
+}
+
+@article{raikwarSoKUsedCryptography2019,
+  title = {{{SoK}} of {{Used Cryptography}} in {{Blockchain}}},
+  author = {Raikwar, Mayank and Gligoroski, Danilo and Kralevska, Katina},
+  date = {2019},
+  journaltitle = {IEEE Access},
+  shortjournal = {IEEE Access},
+  volume = {7},
+  pages = {148550--148575},
+  issn = {2169-3536},
+  doi = {10.1109/ACCESS.2019.2946983},
+  url = {https://ieeexplore.ieee.org/document/8865045/},
+  urldate = {2023-10-04},
+  abstract = {The underlying fundaments of blockchain are cryptography and cryptographic concepts that provide reliable and secure decentralized solutions. Although many recent papers study the use-cases of blockchain in different industrial areas, such as finance, health care, legal relations, IoT, information security, and consensus building systems, only few studies scrutinize the cryptographic concepts used in blockchain. To the best of our knowledge, there is no Systematization of Knowledge (SoK) that gives a complete picture of the existing cryptographic concepts which have been deployed or have the potential to be deployed in blockchain. In this paper, we thoroughly review and systematize all cryptographic concepts which are already used in blockchain. Additionally, we give a list of cryptographic concepts which have not yet been applied but have big potentials to improve the current blockchain solutions. We also include possible instantiations of these cryptographic concepts in the blockchain domain. Last but not least, we explicitly postulate 21 challenging problems that cryptographers interested in blockchain can work on.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/L5IWUWUN/Raikwar et al. - 2019 - SoK of Used Cryptography in Blockchain.pdf}
+}
+
+@online{rajhansVerificationHybridDynamic,
+  title = {Verification of {{Hybrid Dynamic Systems Using Linear Hybrid Automata}}},
+  author = {Rajhans, Akshay},
+  abstract = {This paper concerns the use of linear hybrid automata (LHA) to verify properties of hybrid dynamic systems based on the concept of simulation relations. Following a review of basic concepts and a description of the LHA analysis tool PHAVer, assume-guarantee reasoning is described as a method for compositional verification. The results from the literature are summarized with an example to illustrate the concepts. Finally, the paper outlines some research directions for making this approach more useful.},
+  langid = {english},
+  pubstate = {prepublished},
+  file = {/home/danesabo/Zotero/storage/Z99QTYRM/Rajhans - Verification of Hybrid Dynamic Systems Using Linear.pdf}
+}
+
+@article{rajhansVerificationHybridDynamica,
+  title = {Verification of {{Hybrid Dynamic Systems Using Linear Hybrid Automata}}},
+  author = {Rajhans, Akshay}
+}
+
+@online{rameshHierarchicalTextConditionalImage2022,
+  title = {Hierarchical {{Text-Conditional Image Generation}} with {{CLIP Latents}}},
+  author = {Ramesh, Aditya and Dhariwal, Prafulla and Nichol, Alex and Chu, Casey and Chen, Mark},
+  date = {2022-04-12},
+  eprint = {2204.06125},
+  eprinttype = {arXiv},
+  eprintclass = {cs},
+  doi = {10.48550/arXiv.2204.06125},
+  url = {http://arxiv.org/abs/2204.06125},
+  urldate = {2023-10-05},
+  abstract = {Contrastive models like CLIP have been shown to learn robust representations of images that capture both semantics and style. To leverage these representations for image generation, we propose a two-stage model: a prior that generates a CLIP image embedding given a text caption, and a decoder that generates an image conditioned on the image embedding. We show that explicitly generating image representations improves image diversity with minimal loss in photorealism and caption similarity. Our decoders conditioned on image representations can also produce variations of an image that preserve both its semantics and style, while varying the non-essential details absent from the image representation. Moreover, the joint embedding space of CLIP enables language-guided image manipulations in a zero-shot fashion. We use diffusion models for the decoder and experiment with both autoregressive and diffusion models for the prior, finding that the latter are computationally more efficient and produce higher-quality samples.},
+  pubstate = {prepublished},
+  file = {/home/danesabo/Zotero/storage/Q36KWUMC/Ramesh et al. - 2022 - Hierarchical Text-Conditional Image Generation wit.pdf;/home/danesabo/Zotero/storage/MYPJ54Y8/2204.html}
+}
+
+@article{ramirezDynamicSystemIdentification2021,
+  title = {Dynamic {{System Identification}} of {{Underwater Vehicles Using Multi-Output Gaussian Processes}}},
+  author = {Ramirez, Wilmer Ariza and Kocijan, Jus and Leong, Zhi Quan and Nguyen, Hung Duc and Jayasinghe, Shantha Gamini},
+  date = {2021-10},
+  journaltitle = {International Journal of Automation and Computing},
+  shortjournal = {Int. J. Autom. Comput.},
+  volume = {18},
+  number = {5},
+  pages = {681--693},
+  publisher = {Springernature},
+  location = {London},
+  issn = {1476-8186},
+  doi = {10.1007/s11633-021-1308-x},
+  url = {https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=DynamicDOIArticle&SrcApp=UA&KeyAID=10.1007%2Fs11633-021-1308-x&DestApp=DOI&SrcAppSID=USW2EC0B9Be3QMZ9xhmtqgGcprgqa&SrcJTitle=INTERNATIONAL+JOURNAL+OF+AUTOMATION+AND+COMPUTING&DestDOIRegistrantName=Springer-Verlag},
+  urldate = {2022-04-18},
+  abstract = {Non-parametric system identification with Gaussian processes for underwater vehicles is explored in this research with the purpose of modelling autonomous underwater vehicle (AUV) dynamics with a low amount of data. Multi-output Gaussian processes and their aptitude for modelling the dynamic system of an underactuated AUV without losing the relationships between tied outputs are used. The simulation of a first-principle model of a Remus 100 AUV is employed to capture data for the training and validation of the multi-output Gaussian processes. The metric and required procedure to carry out multi-output Gaussian processes for AUV with 6 degrees of freedom (DoF) is also shown in this paper. Multi-output Gaussian processes compared with the popular technique of recurrent neural network show that multi-output Gaussian processes manage to surpass RNN for non-parametric dynamic system identification in underwater vehicles with highly coupled DoF with the added benefit of providing the measurement of confidence.},
+  langid = {english},
+  annotation = {WOS:000673001900001},
+  file = {/home/danesabo/Zotero/storage/BE43T3S6/Ramirez et al. - 2021 - Dynamic System Identification of Underwater Vehicl.pdf}
+}
+
+@online{RansomwareAttackLeads,
+  title = {Ransomware Attack Leads to Shutdown of Major {{U}}.{{S}}. Pipeline System - {{The Washington Post}}},
+  url = {https://www.washingtonpost.com/business/2021/05/08/cyber-attack-colonial-pipeline/},
+  urldate = {2022-04-02}
+}
+
+@online{RansomwareAttackShuts,
+  title = {Ransomware {{Attack Shuts Down Colonial Pipeline}} : {{NPR}}},
+  url = {https://www.npr.org/2021/05/08/995040240/cybersecurity-attack-shuts-down-a-top-u-s-gasoline-pipeline},
+  urldate = {2022-04-02}
+}
+
+@article{rasheedDigitalTwinValues2020,
+  title = {Digital {{Twin}}: {{Values}}, {{Challenges}} and {{Enablers From}} a {{Modeling Perspective}}},
+  shorttitle = {Digital {{Twin}}},
+  author = {Rasheed, Adil and San, Omer and Kvamsdal, Trond},
+  date = {2020},
+  journaltitle = {IEEE Access},
+  shortjournal = {IEEE Access},
+  volume = {8},
+  pages = {21980--22012},
+  issn = {2169-3536},
+  doi = {10.1109/ACCESS.2020.2970143},
+  url = {https://ieeexplore.ieee.org/document/8972429/},
+  urldate = {2023-10-11},
+  abstract = {Digital twin can be defined as a virtual representation of a physical asset enabled through data and simulators for real-time prediction, optimization, monitoring, controlling, and improved decision making. Recent advances in computational pipelines, multiphysics solvers, artificial intelligence, big data cybernetics, data processing and management tools bring the promise of digital twins and their impact on society closer to reality. Digital twinning is now an important and emerging trend in many applications. Also referred to as a computational megamodel, device shadow, mirrored system, avatar or a synchronized virtual prototype, there can be no doubt that a digital twin plays a transformative role not only in how we design and operate cyber-physical intelligent systems, but also in how we advance the modularity of multi-disciplinary systems to tackle fundamental barriers not addressed by the current, evolutionary modeling practices. In this work, we review the recent status of methodologies and techniques related to the construction of digital twins mostly from a modeling perspective. Our aim is to provide a detailed coverage of the current challenges and enabling technologies along with recommendations and reflections for various stakeholders.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/58BWKHYM/Rasheed et al. - 2020 - Digital Twin Values, Challenges and Enablers From.pdf}
+}
+
+@article{rashidUndergraduateCourseModelbased2020,
+  title = {An Undergraduate Course on Model-Based System Engineering for Embedded Systems},
+  author = {Rashid, Muhammad},
+  date = {2020-05},
+  journaltitle = {COMPUTER APPLICATIONS IN ENGINEERING EDUCATION},
+  shortjournal = {Comput. Appl. Eng. Educ.},
+  volume = {28},
+  number = {3},
+  pages = {645--657},
+  publisher = {Wiley},
+  location = {Hoboken},
+  issn = {1061-3773, 1099-0542},
+  doi = {10.1002/cae.22233},
+  url = {https://www.webofscience.com/wos/woscc/summary/563bee91-8c90-4554-ae8d-46c3ce0028ee-a808dfa0/relevance/1},
+  urldate = {2023-10-03},
+  abstract = {Model-based system engineering (MBSE) is becoming an industrial standard to design embedded systems. Therefore, its integration in electrical and computer engineering education is critical. This article presents an undergraduate course on MBSE for embedded systems through the formulation of course learning outcomes, identification of the course contents, and the construction of a holistic view for the contents. The holistic view of the course binds the contents by providing the modeling methodology, the transformation engine, and the simulation environment of an end-to-end framework. Furthermore, students obtain integrated design experience, through problem-based learning, using three case studies. Assessment through quantitative evaluation and students' feedback show the viability of the presented course.},
+  langid = {english},
+  pagetotal = {13},
+  annotation = {Web of Science ID: WOS:000522056200001}
+}
+
+@unpublished{rasmussenAdvancesGaussianProcesses2006,
+  title = {Advances in {{Gaussian Processes}} - {{Tutorial}} at {{NIPS}} 2006 in {{Vancouver}}},
+  author = {Rasmussen, Carl Edward},
+  date = {2006},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/ZIM675NZ/Rasmussen - 1960 - Advances in Gaussian Processes - Tutorial at NIPS .pdf}
+}
+
+@book{rasmussenGaussianProcessesMachine2006,
+  title = {Gaussian Processes for Machine Learning},
+  author = {Rasmussen, Carl Edward and Williams, Christopher K. I.},
+  date = {2006},
+  series = {Adaptive Computation and Machine Learning},
+  publisher = {MIT Press},
+  location = {Cambridge, Mass},
+  isbn = {978-0-262-18253-9},
+  langid = {english},
+  pagetotal = {248},
+  annotation = {OCLC: ocm61285753},
+  file = {/home/danesabo/Zotero/storage/5H8XNPIU/Rasmussen and Williams - 2006 - Gaussian processes for machine learning.pdf}
+}
+
+@inproceedings{rauschFormalVerificationPLC1998,
+  title = {Formal Verification of {{PLC}} Programs},
+  booktitle = {Proceedings of the 1998 {{American Control Conference}}. {{ACC}} ({{IEEE Cat}}. {{No}}.{{98CH36207}})},
+  author = {Rausch, M. and Krogh, B.H.},
+  date = {1998},
+  pages = {234-238 vol.1},
+  publisher = {IEEE},
+  location = {Philadelphia, PA, USA},
+  doi = {10.1109/ACC.1998.694666},
+  url = {http://ieeexplore.ieee.org/document/694666/},
+  urldate = {2023-10-10},
+  abstract = {This paper presents an approach to the verification of programs for programmablelogic controllers(PLCs) using SMV, a softwqe package for formal verification of state transition systems. Binary PLC programs are converted directly into SMV modules that retain the variable names and execution sequences of the original programs. The system being controlled is modeled by a C/E system block diagram which is also transformed into a set of SMV modules, retaining the structure of the block diagram model. SMV allows the engineer to verify the behavior of the control program over all possible operating conditions. Mechanisms are discussed for representing correctly the concurrent execution of the PLC programs and the plant model using SMV primitives. The SMV approach to PLC program verification is illustrated with an example.},
+  eventtitle = {Proceedings of the 1998 {{American Control Conference}} ({{ACC}})},
+  isbn = {978-0-7803-4530-0},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/7QCJ2RIG/Rausch and Krogh - 1998 - Formal verification of PLC programs.pdf}
+}
+
+@article{rauzyFoundationsModelbasedSystems2019,
+  title = {Foundations for Model-Based Systems Engineering and Model-Based Safety Assessment},
+  author = {Rauzy, Antoine B. and Haskins, Cecilia},
+  date = {2019-03},
+  journaltitle = {SYSTEMS ENGINEERING},
+  shortjournal = {Syst. Eng.},
+  volume = {22},
+  number = {2},
+  pages = {146--155},
+  publisher = {Wiley},
+  location = {Hoboken},
+  issn = {1098-1241, 1520-6858},
+  doi = {10.1002/sys.21469},
+  url = {https://www.webofscience.com/wos/woscc/summary/563bee91-8c90-4554-ae8d-46c3ce0028ee-a808dfa0/relevance/1},
+  urldate = {2023-10-03},
+  abstract = {This article is a contribution to the INCOSE initiative for model-based engineering transformation. Its material has been presented at the ALSEE tour event in Oslo in September 2016. The ideas developed here come from the practical and theoretical experience of the authors in both industrial and academic frameworks. We organize the discussion around 6 theses that aim at establishing robust conceptual foundations for the model-based engineering transformation. We focus on model-based systems engineering, model-based safety assessment, and the relationship between these 2 disciplines. We report on active research initiatives that implement these 6 theses via the S2ML+X paradigm. We conclude with suggestions about future research and teaching activities.},
+  langid = {english},
+  pagetotal = {10},
+  annotation = {Web of Science ID: WOS:000461577200005}
+}
+
+@article{rehtanzDigitalTwinBuzzword2024,
+  title = {Digital {{Twin}}: {{From Buzzword To Solutions}} [{{Guest Editorial}}]},
+  shorttitle = {Digital {{Twin}}},
+  author = {Rehtanz, Christian and Häger, Ulf and Liu, Chen-Ching},
+  date = {2024-01},
+  journaltitle = {IEEE Power and Energy Magazine},
+  volume = {22},
+  number = {1},
+  pages = {14--15},
+  issn = {1558-4216},
+  doi = {10.1109/MPE.2023.3339094},
+  url = {https://ieeexplore.ieee.org/document/10398570/},
+  urldate = {2024-03-13},
+  abstract = {When we talk about digitization and digitalization, the term digital twin is not far away; data and information are the new oil for the economy. But hasn’t electrical power always been at the forefront with computational models and computer applications for the secure operation of power systems? With the development of computer systems in the middle of the last century, power systems were one of the first civilian applications. Many standard computing methods and models in power systems have been established for more than half a century. Why are we suddenly researching and talking so much about digital twins, and which new solutions will really be established in practice? In this special issue, we want to explore these questions and examine them from different perspectives.},
+  eventtitle = {{{IEEE Power}} and {{Energy Magazine}}},
+  file = {/home/danesabo/Zotero/storage/55UAFMKU/Rehtanz et al. - 2024 - Digital Twin From Buzzword To Solutions [Guest Ed.pdf;/home/danesabo/Zotero/storage/DUTRXEHQ/10398570.html}
+}
+
+@report{ReportCybersecurityCritical2015,
+  type = {Executive Survey},
+  title = {Report on {{Cybersecurity}} and {{Critical Infrastructure}} in the {{Americas}}},
+  date = {2015},
+  institution = {Trend Micro Incorporated},
+  file = {/home/danesabo/Zotero/storage/VY5YKDV7/2015 - Report on Cybersecurity and Critical Infrastructur.pdf}
+}
+
+@online{RevModPhys,
+  title = {Rev. {{Mod}}. {{Phys}}. 83, 943 (2011) - {{Bayesian}} Inference in Physics},
+  url = {https://journals.aps.org/rmp/abstract/10.1103/RevModPhys.83.943},
+  urldate = {2024-05-21},
+  file = {/home/danesabo/Zotero/storage/P8JBYTZZ/RevModPhys.83.html}
+}
+
+@online{rezendeVariationalInferenceNormalizing2016,
+  title = {Variational {{Inference}} with {{Normalizing Flows}}},
+  author = {Rezende, Danilo Jimenez and Mohamed, Shakir},
+  date = {2016-06-14},
+  eprint = {1505.05770},
+  eprinttype = {arXiv},
+  eprintclass = {cs, stat},
+  doi = {10.48550/arXiv.1505.05770},
+  url = {http://arxiv.org/abs/1505.05770},
+  urldate = {2023-10-05},
+  abstract = {The choice of approximate posterior distribution is one of the core problems in variational inference. Most applications of variational inference employ simple families of posterior approximations in order to allow for efficient inference, focusing on mean-field or other simple structured approximations. This restriction has a significant impact on the quality of inferences made using variational methods. We introduce a new approach for specifying flexible, arbitrarily complex and scalable approximate posterior distributions. Our approximations are distributions constructed through a normalizing flow, whereby a simple initial density is transformed into a more complex one by applying a sequence of invertible transformations until a desired level of complexity is attained. We use this view of normalizing flows to develop categories of finite and infinitesimal flows and provide a unified view of approaches for constructing rich posterior approximations. We demonstrate that the theoretical advantages of having posteriors that better match the true posterior, combined with the scalability of amortized variational approaches, provides a clear improvement in performance and applicability of variational inference.},
+  pubstate = {prepublished},
+  keywords = {diffusion models},
+  note = {Comment: Proceedings of the 32nd International Conference on Machine Learning},
+  file = {/home/danesabo/Zotero/storage/AFW2WCSS/Rezende and Mohamed - 2016 - Variational Inference with Normalizing Flows.pdf;/home/danesabo/Zotero/storage/GEBQP5TR/1505.html}
+}
+
+@online{ribeiroWhyShouldTrust2016,
+  title = {"{{Why Should I Trust You}}?": {{Explaining}} the {{Predictions}} of {{Any Classifier}}},
+  shorttitle = {"{{Why Should I Trust You}}?},
+  author = {Ribeiro, Marco Tulio and Singh, Sameer and Guestrin, Carlos},
+  date = {2016-08-09},
+  eprint = {1602.04938},
+  eprinttype = {arXiv},
+  eprintclass = {cs, stat},
+  url = {http://arxiv.org/abs/1602.04938},
+  urldate = {2023-10-11},
+  abstract = {Despite widespread adoption, machine learning models remain mostly black boxes. Understanding the reasons behind predictions is, however, quite important in assessing trust, which is fundamental if one plans to take action based on a prediction, or when choosing whether to deploy a new model. Such understanding also provides insights into the model, which can be used to transform an untrustworthy model or prediction into a trustworthy one. In this work, we propose LIME, a novel explanation technique that explains the predictions of any classifier in an interpretable and faithful manner, by learning an interpretable model locally around the prediction. We also propose a method to explain models by presenting representative individual predictions and their explanations in a non-redundant way, framing the task as a submodular optimization problem. We demonstrate the flexibility of these methods by explaining different models for text (e.g. random forests) and image classification (e.g. neural networks). We show the utility of explanations via novel experiments, both simulated and with human subjects, on various scenarios that require trust: deciding if one should trust a prediction, choosing between models, improving an untrustworthy classifier, and identifying why a classifier should not be trusted.},
+  langid = {english},
+  pubstate = {prepublished},
+  file = {/home/danesabo/Zotero/storage/HQA3996Q/Ribeiro et al. - 2016 - Why Should I Trust You Explaining the Predicti.pdf}
+}
+
+@article{rifaiContractiveAutoEncodersExplicit,
+  title = {Contractive {{Auto-Encoders}}: {{Explicit Invariance During Feature Extraction}}},
+  author = {Rifai, Salah and Vincent, Pascal and Muller, Xavier and Glorot, Xavier and Bengio, Yoshua},
+  abstract = {We present in this paper a novel approach for training deterministic auto-encoders. We show that by adding a well chosen penalty term to the classical reconstruction cost function, we can achieve results that equal or surpass those attained by other regularized autoencoders as well as denoising auto-encoders on a range of datasets. This penalty term corresponds to the Frobenius norm of the Jacobian matrix of the encoder activations with respect to the input. We show that this penalty term results in a localized space contraction which in turn yields robust features on the activation layer. Furthermore, we show how this penalty term is related to both regularized auto-encoders and denoising auto-encoders and how it can be seen as a link between deterministic and non-deterministic auto-encoders. We find empirically that this penalty helps to carve a representation that better captures the local directions of variation dictated by the data, corresponding to a lower-dimensional non-linear manifold, while being more invariant to the vast majority of directions orthogonal to the manifold. Finally, we show that by using the learned features to initialize a MLP, we achieve state of the art classification error on a range of datasets, surpassing other methods of pretraining.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/5ZPNEPQQ/Rifai et al. - Contractive Auto-Encoders Explicit Invariance Dur.pdf}
+}
+
+@article{ritterDigitalTwinDetect2022,
+  title = {Digital {{Twin}} to {{Detect Nuclear Proliferation}}: {{A Case Study}}},
+  shorttitle = {Digital {{Twin}} to {{Detect Nuclear Proliferation}}},
+  author = {Ritter, Christopher and Hays, Ross and Browning, Jeren and Stewart, Ryan and Bays, Samuel and Reyes, Gustavo and Schanfein, Mark and Pluth, Adam and Sabharwall, Piyush and Kunz, Ross and Shields, Ashley and Koudelka, John and Zohner, Porter},
+  date = {2022-10-01},
+  journaltitle = {Journal of Energy Resources Technology},
+  volume = {144},
+  number = {10},
+  pages = {102108},
+  issn = {0195-0738, 1528-8994},
+  doi = {10.1115/1.4053979},
+  url = {https://asmedigitalcollection.asme.org/energyresources/article/144/10/102108/1137857/Digital-Twin-to-Detect-Nuclear-Proliferation-A},
+  urldate = {2023-10-11},
+  abstract = {Abstract             This case study describes the development of technologies that enable digital-engineering and digital-twinning efforts in proliferation detection. The project presents a state-of-the-art approach to support International Atomic Energy Agency (IAEA) safeguards by incorporating diversion-pathway analysis, facility misuse, and the detection of indicators within the reactor core, applying the safeguards-by-design concept, and demonstrates its applicability as a sensitive monitoring system for advanced reactors and power plants. There are two pathways a proliferating state might take using the reactor core. One is “diversion,” where special fissionable nuclear material—i.e., Pu-239, U-233, U enriched in U-233/235—that has been declared to the IAEA is removed surreptitiously, either by taking small amounts of nuclear material over a long time (known as protracted diversion) or large amounts in a short time (known as abrupt diversion). The second pathway is “misuse,” where undeclared source material—material that can be transmuted into special fissionable nuclear material: depleted uranium, natural uranium, and thorium—is placed in the core, where it uses the neutron flux for transmutation. Digital twinning and digital engineering have demonstrated significant performance improvement and schedule reduction in the aerospace, automotive, and construction industries. This integrated modeling approach has not been fully applied to nuclear safeguards programs in the past. Digital twinning, combined with machine learning technologies, can lead to new innovations in process-monitoring detection, specifically in event classification, real-time notification, and data tampering. It represents a technological leap in evaluation and detection capability to safeguard any nuclear facility.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/37TG3D3G/Ritter et al. - 2022 - Digital Twin to Detect Nuclear Proliferation A Ca.pdf}
+}
+
+@article{robbinsMendeleyZoteroWhich2012,
+  title = {Mendeley or {{Zotero}}: {{Which Should}} the {{Mobile Researcher Use}}?},
+  shorttitle = {Mendeley or {{Zotero}}},
+  author = {Robbins, Laura Pope},
+  date = {2012-10-01},
+  journaltitle = {The Charleston Advisor},
+  shortjournal = {charleston adv},
+  volume = {14},
+  number = {2},
+  pages = {5--11},
+  issn = {15254011, 15254003},
+  doi = {10.5260/chara.14.2.5},
+  url = {http://openurl.ingenta.com/content/xref?genre=article&issn=1525-4011&volume=14&issue=2&spage=5},
+  urldate = {2022-02-11},
+  abstract = {Today’s bibliographic managers provide cloud storage so that papers can be attached to citations and syncing services, in order for papers and citations to be available in multiple mediums. Mendeley and Zotero are two services that offer online storage of papers and citations, desktop applications, and tablet integration. Mendeley has an iPad application and an open API so that developers can create apps for Android tablets. Zotero is an open-source project that encourages developers to create both iPad and Android apps. Both suites can be integrated with word processing software for accurate in-text and bibliographic entries, provide full-text indexing of PDF documents, and can attach notes to citations. Choosing between them depends upon what features a mobile researcher would need and use.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/KXJNXWQZ/Robbins - 2012 - Mendeley or Zotero Which Should the Mobile Resear.pdf}
+}
+
+@online{RobustControlMicrovibrations,
+  title = {Robust Control of Microvibrations with Experimental Verification},
+  doi = {10.1243/095440605X16929},
+  url = {https://journals.sagepub.com/doi/epdf/10.1243/095440605X16929},
+  urldate = {2024-08-30},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/R87QX9MX/Robust control of microvibrations with experimental verification.pdf;/home/danesabo/Zotero/storage/UM5DZ2U7/095440605X16929.html}
+}
+
+@incollection{rocchettoCPDYExtendingDolevYao2016,
+  title = {{{CPDY}}: {{Extending}} the {{Dolev-Yao Attacker}} with {{Physical-Layer Interactions}}},
+  shorttitle = {{{CPDY}}},
+  booktitle = {Formal {{Methods}} and {{Software Engineering}}},
+  author = {Rocchetto, Marco and Tippenhauer, Nils Ole},
+  editor = {Ogata, Kazuhiro and Lawford, Mark and Liu, Shaoying},
+  date = {2016},
+  volume = {10009},
+  pages = {175--192},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-319-47846-3_12},
+  url = {http://link.springer.com/10.1007/978-3-319-47846-3_12},
+  urldate = {2023-10-10},
+  abstract = {We propose extensions to the Dolev-Yao attacker model to make it suitable for arguments about security of Cyber-Physical Systems. The Dolev-Yao attacker model uses a set of rules to define potential actions by an attacker with respect to messages (i.e. information) exchanged between parties during a protocol execution. As the traditional Dolev-Yao model considers only information (exchanged over a channel controlled by the attacker), the model cannot directly be used to argue about the security of cyber-physical systems where physicallayer interactions are possible. Our Dolev-Yao extension, called CyberPhysical Dolev-Yao (CPDY), allows additional orthogonal interaction channels between the parties. In particular, such orthogonal channels can be used to model physical-layer mechanical, chemical, or electrical interactions between components. In addition, we discuss the inclusion of physical properties such as location or distance in the rule set. We present an example set of additional rules for the Dolev-Yao attacker, using those we are able to formally discover physical attacks that previously could only be found by empirical methods or detailed physical process models.},
+  isbn = {978-3-319-47845-6 978-3-319-47846-3},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/REEHE6HE/Rocchetto and Tippenhauer - 2016 - CPDY Extending the Dolev-Yao Attacker with Physic.pdf}
+}
+
+@inproceedings{rocchettoFormalSecurityAnalysis2017,
+  title = {Towards {{Formal Security Analysis}} of {{Industrial Control Systems}}},
+  booktitle = {Proceedings of the 2017 {{ACM}} on {{Asia Conference}} on {{Computer}} and {{Communications Security}}},
+  author = {Rocchetto, Marco and Tippenhauer, Nils Ole},
+  date = {2017-04-02},
+  pages = {114--126},
+  publisher = {ACM},
+  location = {Abu Dhabi United Arab Emirates},
+  doi = {10.1145/3052973.3053024},
+  url = {https://dl.acm.org/doi/10.1145/3052973.3053024},
+  urldate = {2023-10-10},
+  abstract = {We discuss the use of formal modeling to discover potential attacks on Cyber-Physical systems, in particular Industrial Control Systems. We propose a general approach to achieve that goal considering physical-layer interactions, time and state discretization of the physical process and logic, and the use of suitable attacker profiles. We then apply the approach to model a real-world water treatment testbed using ASLan++ and analyze the resulting transition system using CL-AtSe, identifying four attack classes.},
+  eventtitle = {{{ASIA CCS}} '17: {{ACM Asia Conference}} on {{Computer}} and {{Communications Security}}},
+  isbn = {978-1-4503-4944-4},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/SGTDVRIL/Rocchetto and Tippenhauer - 2017 - Towards Formal Security Analysis of Industrial Con.pdf}
+}
+
+@article{rojasTutorialIntroductionLambda,
+  title = {A {{Tutorial Introduction}} to the {{Lambda Calculus}}},
+  author = {Rojas, Raul},
+  abstract = {This paper is a short and painless introduction to the λ calculus. Originally developed in order to study some mathematical properties of effectively computable functions, this formalism has provided a strong theoretical foundation for the family of functional programming languages. We show how to perform some arithmetical computations using the λ calculus and how to define recursive functions, even though functions in λ calculus are not given names and thus cannot refer explicitly to themselves.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/WPF5L78G/Rojas - A Tutorial Introduction to the Lambda Calculus.pdf}
+}
+
+@article{rokkachhetriSideChannelsCyberPhysical2017,
+  title = {Side {{Channels}} of {{Cyber-Physical Systems}}: {{Case Study}} in {{Additive Manufacturing}}},
+  shorttitle = {Side {{Channels}} of {{Cyber-Physical Systems}}},
+  author = {Rokka Chhetri, Sujit and Al Faruque, Mohammad Abdullah},
+  date = {2017-08},
+  journaltitle = {IEEE Design \& Test},
+  volume = {34},
+  number = {4},
+  pages = {18--25},
+  issn = {2168-2364},
+  doi = {10.1109/MDAT.2017.2682225},
+  url = {https://ieeexplore.ieee.org/abstract/document/7878599?casa_token=KQXDZEp-sRgAAAAA:I48bww9EmRuRNHG8q3L4XF3DW5OVSkWLjoSS59nTGAH1OXvSw_8Wg1r7nD7ziKTRGEyIo5it4A},
+  urldate = {2023-09-27},
+  abstract = {As 3-D printers are becoming increasingly relevant in various domains, including critical infrastructure, cyber-security questions naturally arise. This article investigates how to leverage analog emissions (vibration, acoustic, magnetic, and power) of 3-D printers in order to identify the printed object and compromise confidentiality.},
+  eventtitle = {{{IEEE Design}} \& {{Test}}},
+  file = {/home/danesabo/Zotero/storage/SMP9MIFC/Rokka Chhetri and Al Faruque - 2017 - Side Channels of Cyber-Physical Systems Case Stud.pdf}
+}
+
+@online{rombachHighResolutionImageSynthesis2022,
+  title = {High-{{Resolution Image Synthesis}} with {{Latent Diffusion Models}}},
+  author = {Rombach, Robin and Blattmann, Andreas and Lorenz, Dominik and Esser, Patrick and Ommer, Björn},
+  date = {2022-04-13},
+  eprint = {2112.10752},
+  eprinttype = {arXiv},
+  eprintclass = {cs},
+  doi = {10.48550/arXiv.2112.10752},
+  url = {http://arxiv.org/abs/2112.10752},
+  urldate = {2023-10-05},
+  abstract = {By decomposing the image formation process into a sequential application of denoising autoencoders, diffusion models (DMs) achieve state-of-the-art synthesis results on image data and beyond. Additionally, their formulation allows for a guiding mechanism to control the image generation process without retraining. However, since these models typically operate directly in pixel space, optimization of powerful DMs often consumes hundreds of GPU days and inference is expensive due to sequential evaluations. To enable DM training on limited computational resources while retaining their quality and flexibility, we apply them in the latent space of powerful pretrained autoencoders. In contrast to previous work, training diffusion models on such a representation allows for the first time to reach a near-optimal point between complexity reduction and detail preservation, greatly boosting visual fidelity. By introducing cross-attention layers into the model architecture, we turn diffusion models into powerful and flexible generators for general conditioning inputs such as text or bounding boxes and high-resolution synthesis becomes possible in a convolutional manner. Our latent diffusion models (LDMs) achieve a new state of the art for image inpainting and highly competitive performance on various tasks, including unconditional image generation, semantic scene synthesis, and super-resolution, while significantly reducing computational requirements compared to pixel-based DMs. Code is available at https://github.com/CompVis/latent-diffusion .},
+  pubstate = {prepublished},
+  note = {Comment: CVPR 2022},
+  file = {/home/danesabo/Zotero/storage/52SBVWJ7/Rombach et al. - 2022 - High-Resolution Image Synthesis with Latent Diffus.pdf;/home/danesabo/Zotero/storage/ID2GIIZ3/2112.html}
+}
+
+@thesis{rouhlingFormalisationToolsClassical2019,
+  type = {phdthesis},
+  title = {Formalisation Tools for Classical Analysis : A Case Study in Control Theory},
+  shorttitle = {Formalisation Tools for Classical Analysis},
+  author = {Rouhling, Damien},
+  date = {2019-09-30},
+  institution = {Université Côte d'Azur},
+  url = {https://theses.hal.science/tel-02333396},
+  urldate = {2024-01-22},
+  abstract = {In this thesis, we put a library for analysis in the Coq proof assistant to the test through a case study in control theory. We formalise a proof of stability for the inverted pendulum, a standard example in control theory. Controlling the inverted pendulum is challenging because of its non-linearity, so that this system is often used as a benchmark for new control techniques. Through this case study, we identify issues in the tools that are currently available for the formalisation of classical analysis and we develop new ones in order to achieve our formalisation goal. In particular, we try to imitate the pen-and-paper proof style thanks to new notations and inference mechanisms. This is an essential step to make formal proofs more accessible to mathematicians. We then develop a new library for classical analysis in Coq that integrates these new tools and tries to palliate the limitations of the library we tested, especially in the domain of asymptotic reasoning. We also experiment with this new library on the same formal proof and draw lessons on its strengths and weaknesses. Finally, we sketch a new methodology in order to address the limitations of our library in the particular domain of computation. We exploit a technique called refinement to refactor the methodology of proof by reflection, a technique that automates proofs through computation and also reduces the size of proof terms. We implement this methodology on the example of arithmetic reasoning in rings and discuss how this work could be used to generalise existing tools.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/T9AMRA7H/Rouhling - 2019 - Formalisation tools for classical analysis  a cas.pdf}
+}
+
+@inproceedings{rouhlingFormalProofCoq2018,
+  title = {A Formal Proof in {{Coq}} of a Control Function for the Inverted Pendulum},
+  booktitle = {Proceedings of the 7th {{ACM SIGPLAN International Conference}} on {{Certified Programs}} and {{Proofs}}},
+  author = {Rouhling, Damien},
+  date = {2018-01-08},
+  series = {{{CPP}} 2018},
+  pages = {28--41},
+  publisher = {Association for Computing Machinery},
+  location = {New York, NY, USA},
+  doi = {10.1145/3167101},
+  url = {https://doi.org/10.1145/3167101},
+  urldate = {2022-06-20},
+  abstract = {Control theory provides techniques to design controllers, or control functions, for dynamical systems with inputs, so as to grant a particular behaviour of such a system. The inverted pendulum is a classic system in control theory: it is used as a benchmark for nonlinear control techniques and is a model for several other systems with various applications. We formalized in the Coq proof assistant the proof of soundness of a control function for the inverted pendulum. This is a first step towards the formal verification of more complex systems for which safety may be critical.},
+  isbn = {978-1-4503-5586-5},
+  file = {/home/danesabo/Zotero/storage/ICH37TXP/Rouhling - 2018 - A formal proof in Coq of a control function for th.pdf}
+}
+
+@article{rouhlingFormalProofsControl,
+  title = {Formal {{Proofs}} for {{Control Theory}} and {{Robotics}}: {{A Case Study}}},
+  author = {Rouhling, Damien},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/YFPFJRX7/Rouhling - Formal Proofs for Control Theory and Robotics A C.pdf}
+}
+
+@article{roustantDiceKrigingDiceOptimTwo2012,
+  title = {{{DiceKriging}}, {{DiceOptim}}: {{Two R Packages}} for the {{Analysis}} of {{Computer Experiments}} by {{Kriging-Based Metamodeling}} and {{Optimization}}},
+  shorttitle = {{{{\textbf{DiceKriging}}}} , {{{\textbf{DiceOptim}}}}},
+  author = {Roustant, Olivier and Ginsbourger, David and Deville, Yves},
+  date = {2012},
+  journaltitle = {Journal of Statistical Software},
+  shortjournal = {J. Stat. Soft.},
+  volume = {51},
+  number = {1},
+  issn = {1548-7660},
+  doi = {10.18637/jss.v051.i01},
+  url = {http://www.jstatsoft.org/v51/i01/},
+  urldate = {2022-04-21},
+  abstract = {We present two recently released R packages, DiceKriging and DiceOptim, for the approximation and the optimization of expensive-to-evaluate deterministic functions. Following a self-contained mini tutorial on Kriging-based approximation and optimization, the functionalities of both packages are detailed and demonstrated in two distinct sections. In particular, the versatility of DiceKriging with respect to trend and noise specifications, covariance parameter estimation, as well as conditional and unconditional simulations are illustrated on the basis of several reproducible numerical experiments. We then put to the fore the implementation of sequential and parallel optimization strategies relying on the expected improvement criterion on the occasion of DiceOptim’s presentation. An appendix is dedicated to complementary mathematical and computational details.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/7KBM24LR/Roustant et al. - 2012 - DiceKriging , DiceOptim  Two R.pdf}
+}
+
+@article{routhDynamicsSystemRigid1955,
+  title = {Dynamics of a System of Rigid Bodies. {{Part II}}: {{Of}} Atreatise on the Whole Subject},
+  author = {Routh, Edward John},
+  date = {1955},
+  journaltitle = {Dover Publications Inc., New York, USA}
+}
+
+@inproceedings{ruchkinChallengesPhysicalModeling2016,
+  title = {Challenges in Physical Modeling for Adaptation of Cyber-Physical Systems},
+  booktitle = {2016 {{IEEE}} 3rd {{World Forum}} on {{Internet}} of {{Things}} ({{WF-IoT}})},
+  author = {Ruchkin, Ivan and Samuel, Selva and Schmerl, Bradley and Rico, Amanda and Garlan, David},
+  date = {2016-12},
+  pages = {210--215},
+  doi = {10.1109/WF-IoT.2016.7845513},
+  url = {https://ieeexplore.ieee.org/abstract/document/7845513?casa_token=4qDnAMcJ_VkAAAAA:BmwKCMMxC-lGcaRMmVDxkqk6df0Gd5P39iNud94-qMYWM77p-myERky0ofSw2dLXcY6k0V-6AA},
+  urldate = {2023-11-06},
+  abstract = {Cyber-physical systems (CPSs) mix software, hardware, and physical aspects with equal importance. Typically, the use of models of such systems during run time has concentrated only on managing and controlling the cyber (software) aspects. However, to fully realize the goals of a CPS, physical models too have to be treated as first-class models. This approach gives rise to three main challenges: (a) identifying and integrating physical and software models with different characteristics and semantics; (b) obtaining instances of physical models at a suitable level of abstraction for adaptation; and (c) using and adapting physical models to control CPSs. In this position paper, we elaborate on these three challenges and describe our vision of making physical models first-class entities in adaptation. We illustrate this vision in the context of power adaptation for a service robotic system.},
+  eventtitle = {2016 {{IEEE}} 3rd {{World Forum}} on {{Internet}} of {{Things}} ({{WF-IoT}})},
+  file = {/home/danesabo/Zotero/storage/PW3EVUTY/Ruchkin et al. - 2016 - Challenges in physical modeling for adaptation of .pdf;/home/danesabo/Zotero/storage/C9H5E7FQ/7845513.html}
+}
+
+@inproceedings{ruchkinChallengesPhysicalModeling2016a,
+  title = {Challenges in Physical Modeling for Adaptation of Cyber-Physical Systems},
+  booktitle = {2016 {{IEEE}} 3rd {{World Forum}} on {{Internet}} of {{Things}} ({{WF-IoT}})},
+  author = {Ruchkin, Ivan and Samuel, Selva and Schmerl, Bradley and Rico, Amanda and Garlan, David},
+  date = {2016-12},
+  pages = {210--215},
+  publisher = {IEEE},
+  location = {Reston, VA, USA},
+  doi = {10.1109/WF-IoT.2016.7845513},
+  url = {http://ieeexplore.ieee.org/document/7845513/},
+  urldate = {2023-11-08},
+  abstract = {Cyber-physical systems (CPSs) mix software, hardware, and physical aspects with equal importance. Typically, the use of models of such systems during run time has concentrated only on managing and controlling the cyber (software) aspects. However, to fully realize the goals of a CPS, physical models too have to be treated as first-class models. This approach gives rise to three main challenges: (a) identifying and integrating physical and software models with different characteristics and semantics; (b) obtaining instances of physical models at a suitable level of abstraction for adaptation; and (c) using and adapting physical models to control CPSs. In this position paper, we elaborate on these three challenges and describe our vision of making physical models first-class entities in adaptation. We illustrate this vision in the context of power adaptation for a service robotic system.},
+  eventtitle = {2016 {{IEEE}} 3rd {{World Forum}} on {{Internet}} of {{Things}} ({{WF-IoT}})},
+  isbn = {978-1-5090-4130-5},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/D7H37QIX/Ruchkin et al. - 2016 - Challenges in physical modeling for adaptation of .pdf}
+}
+
+@inproceedings{ruchkinContractbasedIntegrationCyberphysical2014,
+  title = {Contract-Based Integration of Cyber-Physical Analyses},
+  booktitle = {2014 {{International Conference}} on {{Embedded Software}} ({{EMSOFT}})},
+  author = {Ruchkin, Ivan and De Niz, Dionisio and Chaki, Sagar and Garlan, David},
+  date = {2014-10},
+  pages = {1--10},
+  doi = {10.1145/2656045.2656052},
+  url = {https://ieeexplore.ieee.org/document/6986131},
+  urldate = {2023-11-08},
+  abstract = {Developing cyber-physical systems involves multiple engineering domains, e.g., timing, logical correctness, thermal resilience, and mechanical stress. In today's industrial practice, these domains rely on multiple analyses to obtain and verify critical system properties. Domain differences make the analyses abstract away interactions among themselves, potentially invalidating the results. Specifically, one challenge is to ensure that an analysis is never applied to a model that violates the assumptions of the analysis. Since such violation can originate from the updating of the model by another analysis, analyses must be executed in the correct order. Another challenge is to apply diverse analyses soundly and scalably over models of realistic complexity. To address these challenges, we develop an analysis integration approach that uses contracts to specify dependencies between analyses, determine their correct orders of application, and specify and verify applicability conditions in multiple domains. We implement our approach and demonstrate its effectiveness, scalability, and extensibility through a verification case study for thread and battery cell scheduling.},
+  eventtitle = {2014 {{International Conference}} on {{Embedded Software}} ({{EMSOFT}})},
+  file = {/home/danesabo/Zotero/storage/JUEJI5RZ/Ruchkin et al. - 2014 - Contract-based integration of cyber-physical analy.pdf}
+}
+
+@inproceedings{ruchkinContractbasedIntegrationCyberphysical2014a,
+  title = {Contract-Based Integration of Cyber-Physical Analyses},
+  booktitle = {Proceedings of the 14th {{International Conference}} on {{Embedded Software}}},
+  author = {Ruchkin, Ivan and De Niz, Dionisio and Garlan, David and Chaki, Sagar},
+  date = {2014-10-12},
+  pages = {1--10},
+  publisher = {ACM},
+  location = {New Delhi India},
+  doi = {10.1145/2656045.2656052},
+  url = {https://dl.acm.org/doi/10.1145/2656045.2656052},
+  urldate = {2023-11-08},
+  abstract = {Developing cyber-physical systems involves multiple engineering domains, e.g., timing, logical correctness, thermal resilience, and mechanical stress. In today’s industrial practice, these domains rely on multiple analyses to obtain and verify critical system properties. Domain differences make the analyses abstract away interactions among themselves, potentially invalidating the results. Specifically, one challenge is to ensure that an analysis is never applied to a model that violates the assumptions of the analysis. Since such violation can originate from the updating of the model by another analysis, analyses must be executed in the correct order. Another challenge is to apply diverse analyses soundly and scalably over models of realistic complexity. To address these challenges, we develop an analysis integration approach that uses contracts to specify dependencies between analyses, determine their correct orders of application, and specify and verify applicability conditions in multiple domains. We implement our approach and demonstrate its effectiveness, scalability, and extensibility through a verification case study for thread and battery cell scheduling.},
+  eventtitle = {{{ESWEEK}}'14: {{TENTH EMBEDDED SYSTEM WEEK}}},
+  isbn = {978-1-4503-3052-7},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/XVQPTS4L/Ruchkin et al. - 2014 - Contract-based integration of cyber-physical analy.pdf}
+}
+
+@inproceedings{ruchkinEliminatingInterDomainVulnerabilities2015,
+  title = {Eliminating {{Inter-Domain Vulnerabilities}} in {{Cyber-Physical Systems}}: {{An Analysis Contracts Approach}}},
+  shorttitle = {Eliminating {{Inter-Domain Vulnerabilities}} in {{Cyber-Physical Systems}}},
+  booktitle = {Proceedings of the {{First ACM Workshop}} on {{Cyber-Physical Systems-Security}} and/or {{PrivaCy}}},
+  author = {Ruchkin, Ivan and Rao, Ashwini and De Niz, Dionisio and Chaki, Sagar and Garlan, David},
+  date = {2015-10-16},
+  pages = {11--22},
+  publisher = {ACM},
+  location = {Denver Colorado USA},
+  doi = {10.1145/2808705.2808714},
+  url = {https://dl.acm.org/doi/10.1145/2808705.2808714},
+  urldate = {2023-11-08},
+  abstract = {Designing secure cyber-physical systems (CPS) is a particularly difficult task since security vulnerabilities stem not only from traditional cybersecurity concerns, but also physical ones. Many of the standard methods for CPS design make strong and unverified assumptions about the trustworthiness of physical devices, such as sensors. When these assumptions are violated, subtle inter-domain vulnerabilities are introduced into the system model. In this paper we use formal specification of analysis contracts to expose security assumptions and guarantees of analyses from reliability, control, and sensor security domains. We show that this specification allows us to determine where these assumptions are violated, opening the door to malicious attacks. We demonstrate how this approach can help discover and prevent vulnerabilities using a self-driving car example.},
+  eventtitle = {{{CCS}}'15: {{The}} 22nd {{ACM Conference}} on {{Computer}} and {{Communications Security}}},
+  isbn = {978-1-4503-3827-1},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/IMNISSCZ/Ruchkin et al. - 2015 - Eliminating Inter-Domain Vulnerabilities in Cyber-.pdf}
+}
+
+@article{ruchkinIntegrationModelingMethods,
+  title = {Integration of {{Modeling Methods}} for {{Cyber-Physical Systems}}},
+  author = {Ruchkin, Ivan},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/P3M755MW/Ruchkin - Integration of Modeling Methods for Cyber-Physical.pdf}
+}
+
+@incollection{ruchkinIPLIntegrationProperty2018,
+  title = {{{IPL}}: {{An Integration Property Language}} for {{Multi-model Cyber-physical Systems}}},
+  shorttitle = {{{IPL}}},
+  booktitle = {Formal {{Methods}}},
+  author = {Ruchkin, Ivan and Sunshine, Joshua and Iraci, Grant and Schmerl, Bradley and Garlan, David},
+  editor = {Havelund, Klaus and Peleska, Jan and Roscoe, Bill and De Vink, Erik},
+  date = {2018},
+  volume = {10951},
+  pages = {165--184},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-319-95582-7_10},
+  url = {http://link.springer.com/10.1007/978-3-319-95582-7_10},
+  urldate = {2023-11-08},
+  abstract = {Design and verification of modern systems requires diverse models, which often come from a variety of disciplines, and it is challenging to manage their heterogeneity – especially in the case of cyber-physical systems. To check consistency between models, recent approaches map these models to flexible static abstractions, such as architectural views. This model integration approach, however, comes at a cost of reduced expressiveness because complex behaviors of the models are abstracted away. As a result, it may be impossible to automatically verify important behavioral properties across multiple models, leaving systems vulnerable to subtle bugs. This paper introduces the Integration Property Language (IPL) that improves integration expressiveness using modular verification of properties that depend on detailed behavioral semantics while retaining the ability for static system-wide reasoning. We prove that the verification algorithm is sound and analyze its termination conditions. Furthermore, we perform a case study on a mobile robot to demonstrate IPL is practically useful and evaluate its performance.},
+  isbn = {978-3-319-95581-0 978-3-319-95582-7},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/NR28IQPG/Ruchkin et al. - 2018 - IPL An Integration Property Language for Multi-mo.pdf}
+}
+
+@article{rufferConvergentSystemsVs2013,
+  title = {Convergent Systems vs. Incremental Stability},
+  author = {Rüffer, Björn S. and Van De Wouw, Nathan and Mueller, Markus},
+  date = {2013-03},
+  journaltitle = {Systems \& Control Letters},
+  shortjournal = {Systems \& Control Letters},
+  volume = {62},
+  number = {3},
+  pages = {277--285},
+  issn = {01676911},
+  doi = {10.1016/j.sysconle.2012.11.015},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0167691112002393},
+  urldate = {2023-10-13},
+  abstract = {Two similar stability notions are considered; one is the long established notion of convergent systems, the other is the younger notion of incremental stability. Both notions require that any two solutions of a system converge to each other. Yet these stability concepts are different, in the sense that none implies the other, as is shown in this paper using two examples. It is shown under what additional assumptions one property indeed implies the other. Furthermore, this paper contains necessary and sufficient characterizations of both properties in terms of Lyapunov functions.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/L3VUTJ9S/Rüffer et al. - 2013 - Convergent systems vs. incremental stability.pdf}
+}
+
+@article{rumpVerificationMethodsRigorous2010,
+  title = {Verification Methods:  {{Rigorous}} Results Using Floating-Point Arithemetic},
+  author = {Rump, Siegfried},
+  date = {2010},
+  journaltitle = {Acta Numerica},
+  pages = {287--449},
+  file = {/home/danesabo/Zotero/storage/ZGVNLRMQ/ActaNumerica2010.pdf}
+}
+
+@online{RussiansWhoPose,
+  title = {Russians {{Who Pose Election Threat Have Hacked Nuclear Plants}} and {{Power Grid}} - {{The New York Times}}},
+  url = {https://www.nytimes.com/2020/10/23/us/politics/energetic-bear-russian-hackers.html?action=click&module=Well&pgtype=Homepage&section=Politics},
+  urldate = {2022-04-02}
+}
+
+@inproceedings{rysavyFormalAuthorizationFramework2012,
+  title = {A {{Formal Authorization Framework}} for {{Networked SCADA Systems}}},
+  booktitle = {2012 {{IEEE}} 19th {{International Conference}} and {{Workshops}} on {{Engineering}} of {{Computer-Based Systems}}},
+  author = {Rysavy, Ondrej and Rab, Jaroslav and Halfar, Patrik and Sveda, Mirsolav},
+  date = {2012-04},
+  pages = {298--302},
+  publisher = {IEEE},
+  location = {Novi Sad, Serbia},
+  doi = {10.1109/ECBS.2012.4},
+  url = {http://ieeexplore.ieee.org/document/6195199/},
+  urldate = {2023-10-10},
+  abstract = {In this paper, we propose an application of a formal authorization framework for defining and enforcing security policies in SCADA systems. Current generation of SCADA systems are built as open networked systems often connected to public networks. Thus the security becomes an important issue, which needs to be properly addressed in these systems. The knowledge gained from securing networked computer based systems may help to develop security measures for SCADA systems too. Among such methods, a policy based security methods are the most applied. The contribution of this paper consists of an overview of security issues related to SCADA systems and a proposal to use a logic-based authorization framework in this environment for achieving scalable and efficient authentication.},
+  eventtitle = {2012 19th {{IEEE International Conference}} and {{Workshops}} on {{Engineering}} of {{Computer Based Systems}} ({{ECBS}})},
+  isbn = {978-1-4673-0912-7 978-0-7695-4664-3},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/7BT93UQZ/Rysavy et al. - 2012 - A Formal Authorization Framework for Networked SCA.pdf}
+}
+
+@article{rysavyImprovingSecuritySCADA2013,
+  title = {Improving Security in {{SCADA}} Systems through Firewall Policy Analysis},
+  author = {Rysavy, Ondrej and Rab, Jaroslav and Sveda, Miroslav},
+  date = {2013},
+  abstract = {Modern SCADA networks are connected to both the companys enterprise network and the Internet. Because these industrial systems often control critical processes the cybersecurity requirements become a priority for their design.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/AX7YFQBL/Rysavy et al. - 2013 - Improving security in SCADA systems through firewa.pdf}
+}
+
+@article{saadImplementationIoTBasedDigital2020,
+  title = {On the {{Implementation}} of {{IoT-Based Digital Twin}} for {{Networked Microgrids Resiliency Against Cyber Attacks}}},
+  author = {Saad, Ahmed and Faddel, Samy and Youssef, Tarek and Mohammed, Osama A.},
+  date = {2020-11},
+  journaltitle = {Ieee Transactions on Smart Grid},
+  shortjournal = {IEEE Trans. Smart Grid},
+  volume = {11},
+  number = {6},
+  pages = {5138--5150},
+  publisher = {Ieee-Inst Electrical Electronics Engineers Inc},
+  location = {Piscataway},
+  issn = {1949-3053},
+  doi = {10.1109/TSG.2020.3000958},
+  url = {http://www.webofscience.com/wos/woscc/summary/marked/relevance/1?markedListId=List%202},
+  urldate = {2022-03-08},
+  abstract = {The increased rate of cyber-attacks on the power system necessitates the need for innovative solutions to ensure its resiliency. This work builds on the advancement in the IoT to provide a practical framework that is able to respond to multiple attacks on a network of interconnected microgrids. This paper provides an IoT-based digital twin (DT) of the cyber-physical system that interacts with the control system to ensure its proper operation. The IoT cloud provision of the energy cyber-physical and the DT are mathematically formulated. Unlike other cybersecurity frameworks in the literature, the proposed one can mitigate an individual as well as coordinated attacks. The framework is tested on a distributed control system and the security measures are implemented using cloud computing. The physical controllers are implemented using single-board computers. The practical results show that the proposed DT is able to mitigate the coordinated false data injection and the denial of service cyber-attacks.},
+  langid = {english},
+  keywords = {DGC read},
+  annotation = {WOS:000583560800048},
+  file = {/home/danesabo/Zotero/storage/UCFBIKZW/Saad et al. - 2020 - On the Implementation of IoT-Based Digital Twin fo.pdf}
+}
+
+@inproceedings{sadraddiniFormalMethodsAdaptive2017,
+  title = {Formal Methods for Adaptive Control of Dynamical Systems},
+  booktitle = {2017 {{IEEE}} 56th {{Annual Conference}} on {{Decision}} and {{Control}} ({{CDC}})},
+  author = {Sadraddini, Sadra and Belta, Calin},
+  date = {2017-12},
+  pages = {1782--1787},
+  doi = {10.1109/CDC.2017.8263906},
+  abstract = {We develop a method to control discrete-time systems with constant but initially unknown parameters from linear temporal logic (LTL) specifications. We introduce the notions of (non-deterministic) parametric and adaptive transition systems and show how to use tools from formal methods to compute adaptive control strategies for finite systems. For infinite systems, we first compute abstractions in the form of parametric finite quotient transition systems and then apply the techniques for finite systems. Unlike traditional adaptive control techniques, our method is correct-by-design, does not require a reference model, and can handle a much wider range of systems and specifications. Illustrative examples are included.},
+  eventtitle = {2017 {{IEEE}} 56th {{Annual Conference}} on {{Decision}} and {{Control}} ({{CDC}})},
+  file = {/home/danesabo/Zotero/storage/LSETZD6D/Sadraddini and Belta - 2017 - Formal methods for adaptive control of dynamical s.pdf}
+}
+
+@article{saeedloeiLogicbasedModelingVerification2011,
+  title = {A Logic-Based Modeling and Verification of {{CPS}}},
+  author = {Saeedloei, Neda and Gupta, Gopal},
+  date = {2011-06},
+  journaltitle = {ACM SIGBED Review},
+  shortjournal = {SIGBED Rev.},
+  volume = {8},
+  number = {2},
+  pages = {31--34},
+  issn = {1551-3688},
+  doi = {10.1145/2000367.2000374},
+  url = {https://dl.acm.org/doi/10.1145/2000367.2000374},
+  urldate = {2023-10-10},
+  abstract = {Cyber-physical systems (CPS) consist of perpetually and concurrently executing physical and computational components. The presence of physical components require the computational components to deal with continuous quantities. A formalism that can model discrete and continuous quantities together with concurrent, perpetual execution is lacking. In this paper we report on the development of a formalism based on logic programming extended with co-induction, constraints over reals, and coroutining that allows CPS to be elegantly modeled. This logic programming realization can be used for verifying interesting properties as well as generating implementations of CPS. We illustrate this formalism by applying it to elegant modeling of the reactor temperature control system. Interesting properties of the system can be verified merely by posing appropriate queries to this model. Precise parametric analysis can also be performed.},
+  langid = {english},
+  keywords = {Hybrid},
+  file = {/home/danesabo/Zotero/storage/FNWFL7NL/Saeedloei and Gupta - 2011 - A logic-based modeling and verification of CPS.pdf}
+}
+
+@online{SafeReinforcementLearning,
+  title = {Safe Reinforcement Learning Integrating Physic Laws, Control Theories, and Formal Methods},
+  url = {https://carnegiebosch.cmu.edu/research/2021-projects/safe-reinforcement-learning-integration.html},
+  urldate = {2024-02-13},
+  abstract = {\$pageDescription},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/EH77EBN7/safe-reinforcement-learning-integration.html}
+}
+
+@article{saffordCommunicatingSciencePolicymakers2019,
+  title = {Communicating Science to Policymakers: Six Strategies for Success},
+  shorttitle = {Communicating Science to Policymakers},
+  author = {Safford, Hannah and Brown, Austin},
+  date = {2019-08-12},
+  journaltitle = {Nature},
+  volume = {572},
+  number = {7771},
+  pages = {681--682},
+  publisher = {Nature Publishing Group},
+  doi = {10.1038/d41586-019-02372-3},
+  url = {https://www.nature.com/articles/d41586-019-02372-3},
+  urldate = {2024-01-02},
+  abstract = {Scientists can improve how they inform politicians and other policymakers on how to make decisions, say Hannah Safford and Austin Brown.},
+  issue = {7771},
+  langid = {english},
+  annotation = {Bandiera\_abtest: a\\
+Cg\_type: Career Column\\
+Subject\_term: Careers, Politics, Policy},
+  file = {/home/danesabo/Zotero/storage/IYR5VX2U/Safford and Brown - 2019 - Communicating science to policymakers six strateg.pdf;/home/danesabo/Zotero/storage/FWIZAHW9/d41586-019-02372-3.html}
+}
+
+@article{sahaNeuralIdentificationControl2021,
+  title = {Neural {{Identification}} for {{Control}}},
+  author = {Saha, Priyabrata and Egerstedt, Magnus and Mukhopadhyay, Saibal},
+  date = {2021-07},
+  journaltitle = {IEEE Robotics and Automation Letters},
+  shortjournal = {IEEE Robot. Autom. Lett.},
+  volume = {6},
+  number = {3},
+  eprint = {2009.11782},
+  eprinttype = {arXiv},
+  eprintclass = {cs, eess},
+  pages = {4648--4655},
+  issn = {2377-3766, 2377-3774},
+  doi = {10.1109/LRA.2021.3068099},
+  url = {http://arxiv.org/abs/2009.11782},
+  urldate = {2024-01-30},
+  abstract = {We present a new method for learning control law that stabilizes an unknown nonlinear dynamical system at an equilibrium point. We formulate a system identification task in a self-supervised learning setting that jointly learns a controller and corresponding stable closed-loop dynamics hypothesis. The input-output behavior of the unknown dynamical system under random control inputs is used as the supervising signal to train the neural network-based system model and the controller. The proposed method relies on the Lyapunov stability theory to generate a stable closed-loop dynamics hypothesis and corresponding control law. We demonstrate our method on various nonlinear control problems such as n-link pendulum balancing and trajectory tracking, pendulum on cart balancing, and wheeled vehicle path following.},
+  keywords = {Computer Science - Machine Learning,Computer Science - Robotics,Electrical Engineering and Systems Science - Systems and Control},
+  note = {Comment: Copyright 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works},
+  file = {/home/danesabo/Zotero/storage/DYHN77BB/Saha et al. - 2021 - Neural Identification for Control.pdf;/home/danesabo/Zotero/storage/ERWUWG8S/2009.html}
+}
+
+@online{sahariaPhotorealisticTexttoImageDiffusion2022,
+  title = {Photorealistic {{Text-to-Image Diffusion Models}} with {{Deep Language Understanding}}},
+  author = {Saharia, Chitwan and Chan, William and Saxena, Saurabh and Li, Lala and Whang, Jay and Denton, Emily and Ghasemipour, Seyed Kamyar Seyed and Ayan, Burcu Karagol and Mahdavi, S. Sara and Lopes, Rapha Gontijo and Salimans, Tim and Ho, Jonathan and Fleet, David J. and Norouzi, Mohammad},
+  date = {2022-05-23},
+  eprint = {2205.11487},
+  eprinttype = {arXiv},
+  eprintclass = {cs},
+  doi = {10.48550/arXiv.2205.11487},
+  url = {http://arxiv.org/abs/2205.11487},
+  urldate = {2023-10-05},
+  abstract = {We present Imagen, a text-to-image diffusion model with an unprecedented degree of photorealism and a deep level of language understanding. Imagen builds on the power of large transformer language models in understanding text and hinges on the strength of diffusion models in high-fidelity image generation. Our key discovery is that generic large language models (e.g. T5), pretrained on text-only corpora, are surprisingly effective at encoding text for image synthesis: increasing the size of the language model in Imagen boosts both sample fidelity and image-text alignment much more than increasing the size of the image diffusion model. Imagen achieves a new state-of-the-art FID score of 7.27 on the COCO dataset, without ever training on COCO, and human raters find Imagen samples to be on par with the COCO data itself in image-text alignment. To assess text-to-image models in greater depth, we introduce DrawBench, a comprehensive and challenging benchmark for text-to-image models. With DrawBench, we compare Imagen with recent methods including VQ-GAN+CLIP, Latent Diffusion Models, and DALL-E 2, and find that human raters prefer Imagen over other models in side-by-side comparisons, both in terms of sample quality and image-text alignment. See https://imagen.research.google/ for an overview of the results.},
+  pubstate = {prepublished},
+  file = {/home/danesabo/Zotero/storage/Z47V6ZPD/Saharia et al. - 2022 - Photorealistic Text-to-Image Diffusion Models with.pdf;/home/danesabo/Zotero/storage/PY7P8NQV/2205.html}
+}
+
+@article{sangiovanni-vincentelliTamingDrFrankenstein2012,
+  title = {Taming {{Dr}}. {{Frankenstein}}: {{Contract-Based Design}} for {{Cyber-Physical Systems}}*},
+  shorttitle = {Taming {{Dr}}. {{Frankenstein}}},
+  author = {Sangiovanni-Vincentelli, Alberto and Damm, Werner and Passerone, Roberto},
+  date = {2012-01},
+  journaltitle = {European Journal of Control},
+  shortjournal = {European Journal of Control},
+  volume = {18},
+  number = {3},
+  pages = {217--238},
+  issn = {09473580},
+  doi = {10.3166/ejc.18.217-238},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0947358012709433},
+  urldate = {2023-11-08},
+  abstract = {Cyber-physical systems combine a cyber side (computing and networking) with a physical side (mechanical, electrical, and chemical processes). In many cases, the cyber component controls the physical side using sensors and actuators that observe the physical system and actuate the controls. Such systems present the biggest challenges as well as the biggest opportunities in several large industries, including electronics, energy, automotive, defense and aerospace, telecommunications, instrumentation, industrial automation.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/2RHC55DF/Sangiovanni-Vincentelli et al. - 2012 - Taming Dr. Frankenstein Contract-Based Design for.pdf}
+}
+
+@article{sangiovanni-vincentelliTamingDrFrankenstein2012a,
+  title = {Taming {{Dr}}. {{Frankenstein}}: {{Contract-Based Design}} for {{Cyber-Physical Systems}}*},
+  shorttitle = {Taming {{Dr}}. {{Frankenstein}}},
+  author = {Sangiovanni-Vincentelli, Alberto and Damm, Werner and Passerone, Roberto},
+  date = {2012-01},
+  journaltitle = {European Journal of Control},
+  shortjournal = {European Journal of Control},
+  volume = {18},
+  number = {3},
+  pages = {217--238},
+  issn = {09473580},
+  doi = {10.3166/ejc.18.217-238},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0947358012709433},
+  urldate = {2023-10-10},
+  abstract = {Cyber-physical systems combine a cyber side (computing and networking) with a physical side (mechanical, electrical, and chemical processes). In many cases, the cyber component controls the physical side using sensors and actuators that observe the physical system and actuate the controls. Such systems present the biggest challenges as well as the biggest opportunities in several large industries, including electronics, energy, automotive, defense and aerospace, telecommunications, instrumentation, industrial automation.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/CLZJWNEW/Sangiovanni-Vincentelli et al. - 2012 - Taming Dr. Frankenstein Contract-Based Design for.pdf}
+}
+
+@article{sarkkaGaussianProcessLatent2019,
+  title = {Gaussian {{Process Latent Force Models}} for {{Learning}} and {{Stochastic Control}} of {{Physical Systems}}},
+  author = {Sarkka, Simo and Alvarez, Mauricio A. and Lawrence, Neil D.},
+  date = {2019-07},
+  journaltitle = {Ieee Transactions on Automatic Control},
+  shortjournal = {IEEE Trans. Autom. Control},
+  volume = {64},
+  number = {7},
+  pages = {2953--2960},
+  publisher = {Ieee-Inst Electrical Electronics Engineers Inc},
+  location = {Piscataway},
+  issn = {0018-9286},
+  doi = {10.1109/TAC.2018.2874749},
+  url = {https://www.webofscience.com/wos/author/record/677259?state=%7B%22siloSearchWarning%22:false,%22collection%22:%22woscc%22%7D},
+  urldate = {2022-04-18},
+  abstract = {This paper is concerned with learning and stochastic control in physical systems that contain unknown input signals. These unknown signals are modeled as Gaussian processes (GP) with certain parameterized covariance structures. The resulting latent force models can be seen as hybrid models that contain a first-principle physical model part and a nonparametric GP model part. We briefly review the statistical inference and learning methods for this kind of models, introduce stochastic control methodology for these models, and provide new theoretical observability and controllability results for them.},
+  langid = {english},
+  annotation = {WOS:000473489700027},
+  file = {/home/danesabo/Zotero/storage/FH4EWY9C/Sarkka et al. - 2019 - Gaussian Process Latent Force Models for Learning .pdf}
+}
+
+@book{scholkopfLearningKernelsSupport2002,
+  title = {Learning with {{Kernels}}: {{Support Vector Machines}}, {{Regularization}}, {{Optimization}}, and {{Beyond}}},
+  shorttitle = {Learning with {{Kernels}}},
+  author = {Schölkopf, Bernhard and Schölkopf, Director of the Max Planck Institute for Intelligent in Tübingen Germany Professor for Machine Lea Bernhard and Smola, Alexander J. and Bach, Francis and Schölkopf, rnhard and Scholkopf, Managing Director of the Max Planck Institute for Biological Cybernetics in Tubingen Germany Profe Bernhard},
+  date = {2002},
+  eprint = {y8ORL3DWt4sC},
+  eprinttype = {googlebooks},
+  publisher = {MIT Press},
+  abstract = {A comprehensive introduction to Support Vector Machines and related kernel methods. In the 1990s, a new type of learning algorithm was developed, based on results from statistical learning theory: the Support Vector Machine (SVM). This gave rise to a new class of theoretically elegant learning machines that use a central concept of SVMs---kernels--for a number of learning tasks. Kernel machines provide a modular framework that can be adapted to different tasks and domains by the choice of the kernel function and the base algorithm. They are replacing neural networks in a variety of fields, including engineering, information retrieval, and bioinformatics. Learning with Kernels provides an introduction to SVMs and related kernel methods. Although the book begins with the basics, it also includes the latest research. It provides all of the concepts necessary to enable a reader equipped with some basic mathematical knowledge to enter the world of machine learning using theoretically well-founded yet easy-to-use kernel algorithms and to understand and apply the powerful algorithms that have been developed over the last few years.},
+  isbn = {978-0-262-19475-4},
+  langid = {english},
+  pagetotal = {658}
+}
+
+@report{schweikerOperadicAnalysisDistributed2015,
+  title = {Operadic {{Analysis}} of {{Distributed Systems}}},
+  author = {Schweiker, Kevin and Varadarajan, Srivatsan and Spivak, David and Schultz, Patrick and Wisnesky, Ryan and Perez, Marco},
+  date = {2015},
+  number = {NASA/CR-2015-xxxxx},
+  institution = {NASA},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/7BPMLJ2F/Schweiker et al. - 2015 - Operadic Analysis of Distributed Systems.pdf}
+}
+
+@online{SEBoK,
+  title = {{{SEBoK}}},
+  url = {https://sebokwiki.org/wiki/Guide_to_the_Systems_Engineering_Body_of_Knowledge_(SEBoK)},
+  urldate = {2023-10-06},
+  abstract = {The Guide to the Systems Engineering Body of Knowledge (SEBoK) is a living, authoritative guide of the Systems Engineering discipline.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/77VF96U4/Guide_to_the_Systems_Engineering_Body_of_Knowledge_(SEBoK).html}
+}
+
+@article{sedjelmaciCyberSecurityBased2020,
+  title = {Cyber {{Security Based}} on {{Artificial Intelligence}} for {{Cyber-Physical Systems}}},
+  author = {Sedjelmaci, Hichem and Guenab, Fateh and Senouci, Sidi-Mohammed and Moustafa, Hassnaa and Liu, Jiajia and Han, Shuai},
+  date = {2020-05},
+  journaltitle = {IEEE Network},
+  volume = {34},
+  number = {3},
+  pages = {6--7},
+  issn = {1558-156X},
+  doi = {10.1109/MNET.2020.9105926},
+  url = {https://ieeexplore.ieee.org/abstract/document/9105926},
+  urldate = {2023-09-27},
+  abstract = {The ten papers in this special issue focus on cybersecurity for cyber-physical systems (CPSs). The systems have become very complex, more sophisticated, intelligent and autonomous. They offer very complex interaction between heterogeneous cyber and physical components; additionally to this complexity, they are exposed to important disturbances due to unintentional and intentional events which make the prediction of their behaviors a very difficult task. Meanwhile, cyber security for CPS is attracting the attention of research scientists in both industry and academia since the number of cyber-attacks have increased and their behaviors have become more sophisticated, commonly known as zero-day threats. the papers in this issue aim to bring together researchers from academic and industry to share their vision of AI application in the cyber security context, and present challenges and recent works and advances related to AI-based cyber security applied to CPSs.},
+  eventtitle = {{{IEEE Network}}},
+  file = {/home/danesabo/Zotero/storage/83MCXNFL/Sedjelmaci et al. - 2020 - Cyber Security Based on Artificial Intelligence fo.pdf}
+}
+
+@article{selvarajuGradCAMVisualExplanations2020,
+  title = {Grad-{{CAM}}: {{Visual Explanations}} from {{Deep Networks}} via {{Gradient-based Localization}}},
+  shorttitle = {Grad-{{CAM}}},
+  author = {Selvaraju, Ramprasaath R. and Cogswell, Michael and Das, Abhishek and Vedantam, Ramakrishna and Parikh, Devi and Batra, Dhruv},
+  date = {2020-02},
+  journaltitle = {International Journal of Computer Vision},
+  shortjournal = {Int J Comput Vis},
+  volume = {128},
+  number = {2},
+  eprint = {1610.02391},
+  eprinttype = {arXiv},
+  eprintclass = {cs},
+  pages = {336--359},
+  issn = {0920-5691, 1573-1405},
+  doi = {10.1007/s11263-019-01228-7},
+  url = {http://arxiv.org/abs/1610.02391},
+  urldate = {2023-10-11},
+  abstract = {We propose a technique for producing ‘visual explanations’ for decisions from a large class of Convolutional Neural Network (CNN)-based models, making them more transparent and explainable.},
+  langid = {english},
+  note = {Comment: This version was published in International Journal of Computer Vision (IJCV) in 2019; A previous version of the paper was published at International Conference on Computer Vision (ICCV'17)},
+  file = {/home/danesabo/Zotero/storage/ZCYUH685/Selvaraju et al. - 2020 - Grad-CAM Visual Explanations from Deep Networks v.pdf)}
+}
+
+@online{sguegliaFederalOfficialsInvestigating2023,
+  title = {Federal Officials Investigating after Pro-{{Iran}} Group Allegedly Hacked Water Authority in {{Pennsylvania}}},
+  author = {Sgueglia, By Kristina, Sean Lyngaas},
+  date = {2023-11-28T12:41:01},
+  url = {https://www.cnn.com/2023/11/28/us/pennsylvania-water-cyberattack/index.html},
+  urldate = {2024-08-13},
+  abstract = {A Pennsylvania water utility is still dealing with the fallout of pro-Iran hackers breaching some of its industrial equipment four days ago, including having to operate one of its water pump stations in manual mode, the utility’s general manager told CNN on Tuesday.},
+  langid = {english},
+  organization = {CNN},
+  file = {/home/danesabo/Zotero/storage/HZVFWDPW/index.html}
+}
+
+@online{sharfAssumeGuaranteeContracts2021,
+  title = {Assume/{{Guarantee Contracts}} for {{Dynamical Systems}}: {{Theory}} and {{Computational Tools}}},
+  shorttitle = {Assume/{{Guarantee Contracts}} for {{Dynamical Systems}}},
+  author = {Sharf, Miel and Besselink, Bart and Molin, Adam and Zhao, Qiming and Johansson, Karl Henrik},
+  date = {2021-04-19},
+  eprint = {2012.12657},
+  eprinttype = {arXiv},
+  eprintclass = {cs, eess},
+  url = {http://arxiv.org/abs/2012.12657},
+  urldate = {2023-11-08},
+  abstract = {Modern engineering systems include many components of different types and functions. Verifying that these systems satisfy given specifications can be an arduous task, as most formal verification methods are limited to systems of moderate size. Recently, contract theory has been proposed as a modular framework for defining specifications. In this paper, we present a contract theory for discrete-time dynamical control systems relying on assume/guarantee contracts, which prescribe assumptions on the input of the system and guarantees on the output. We then focus on contracts defined by linear constraints, and develop efficient computational tools for verification of satisfaction and refinement based on linear programming. We exemplify these tools in a simulation example, proving a certain safety specification for a two-vehicle autonomous driving setting.},
+  langid = {english},
+  pubstate = {prepublished},
+  note = {Comment: 9 pages, 5 figures},
+  file = {/home/danesabo/Zotero/storage/KYZMWWB7/Sharf et al. - 2021 - AssumeGuarantee Contracts for Dynamical Systems .pdf}
+}
+
+@article{shevitzLyapunovStabilityTheory1994,
+  title = {Lyapunov Stability Theory of Nonsmooth Systems},
+  author = {Shevitz, D. and Paden, B.},
+  year = {Sept./1994},
+  journaltitle = {IEEE Transactions on Automatic Control},
+  shortjournal = {IEEE Trans. Automat. Contr.},
+  volume = {39},
+  number = {9},
+  pages = {1910--1914},
+  issn = {00189286},
+  doi = {10.1109/9.317122},
+  url = {http://ieeexplore.ieee.org/document/317122/},
+  urldate = {2024-03-04},
+  file = {/home/danesabo/Zotero/storage/ZTQV2QVD/Shevitz and Paden - 1994 - Lyapunov stability theory of nonsmooth systems.pdf}
+}
+
+@article{shiLSTMautoencoderBasedOnline2023,
+  title = {An {{LSTM-autoencoder}} Based Online Side Channel Monitoring Approach for Cyber-Physical Attack Detection in Additive Manufacturing},
+  author = {Shi, Zhangyue and Mamun, Abdullah Al and Kan, Chen and Tian, Wenmeng and Liu, Chenang},
+  date = {2023-04-01},
+  journaltitle = {Journal of Intelligent Manufacturing},
+  shortjournal = {J Intell Manuf},
+  volume = {34},
+  number = {4},
+  pages = {1815--1831},
+  issn = {1572-8145},
+  doi = {10.1007/s10845-021-01879-9},
+  url = {https://doi.org/10.1007/s10845-021-01879-9},
+  urldate = {2023-09-27},
+  abstract = {Additive manufacturing (AM) has gained increasing popularity in a large variety of mission-critical fields, such as aerospace, medical, and transportation. The layer-by-layer fabrication scheme of the AM significantly enhances fabrication flexibility, resulting in the expanded vulnerability space of cyber-physical AM systems. This potentially leads to altered AM parts with compromised mechanical properties and functionalities. Furthermore, those internal alterations in the AM builds are very challenging to detect using the traditional geometric dimensioning and tolerancing (GD\&T) features. Therefore, how to effectively monitor and accurately detect cyber-physical attacks becomes a critical barrier for the broader adoption of AM technology. To address this issue, this paper proposes a machine learning-driven online side channel monitoring approach for AM process authentication. A data-driven feature extraction approach based on the LSTM-autoencoder is developed to detect the unintended process/product alterations caused by cyber-physical attacks. Both supervised and unsupervised monitoring schemes are implemented based on the extracted features. To validate the effectiveness of the proposed method, real-world case studies were conducted using a fused filament fabrication (FFF) platform equipped with two accelerometers. In the case study, two different types of cyber-physical attacks are implemented to mimic the potential real-world process alterations. Experimental results demonstrate that the proposed method outperforms conventional process monitoring methods, and it can effectively detect part geometry and layer thickness alterations in a real-time manner.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/3P3NG9L8/Shi et al. - 2023 - An LSTM-autoencoder based online side channel moni.pdf}
+}
+
+@inproceedings{shresthaModelCheckingSecurity2018,
+  title = {Model {{Checking}} of {{Security Properties}} in {{Industrial Control Systems}} ({{ICS}})},
+  booktitle = {Proceedings of the {{Eighth ACM Conference}} on {{Data}} and {{Application Security}} and {{Privacy}}},
+  author = {Shrestha, Roshan and Mehrpouyan, Hoda and Xu, Dianxiang},
+  date = {2018-03-13},
+  pages = {164--166},
+  publisher = {ACM},
+  location = {Tempe AZ USA},
+  doi = {10.1145/3176258.3176949},
+  url = {https://dl.acm.org/doi/10.1145/3176258.3176949},
+  urldate = {2023-10-10},
+  abstract = {With the increasing inter-connection of operation technology to the IT network, the security threat to the Industrial Control System (ICS) is increasing daily. Therefore, it is critical to utilize formal verification technique such as model checking to mathematically prove the correctness of security and safety requirements in the controller logic before it is deployed on the field. However, model checking requires considerable effort for regular ICS users and control technician to verify properties . This paper, provides a simpler approach to the model checking of temperature process control system by first starting with the control module design without formal verification. Second, identifying possible vulnerabilities in such design. Third, verifying the safety and security properties with a formal method.},
+  eventtitle = {{{CODASPY}} '18: {{Eighth ACM Conference}} on {{Data}} and {{Application Security}} and {{Privacy}}},
+  isbn = {978-1-4503-5632-9},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/C6EIZQLE/Shrestha et al. - 2018 - Model Checking of Security Properties in Industria.pdf}
+}
+
+@article{shulmanBasicsTypeTheory,
+  title = {Basics of Type Theory and {{Coq}}},
+  author = {Shulman, Michael},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/LICNPZ7G/Shulman - Basics of type theory and Coq.pdf}
+}
+
+@article{shumanABETProfessionalSkills2005,
+  title = {The {{ABET}} “{{Professional Skills}}” — {{Can They Be Taught}}? {{Can They Be Assessed}}?},
+  shorttitle = {The {{ABET}} “{{Professional Skills}}” — {{Can They Be Taught}}?},
+  author = {Shuman, Larry J. and Besterfield-Sacre, Mary and McGourty, Jack},
+  date = {2005},
+  journaltitle = {Journal of Engineering Education},
+  volume = {94},
+  number = {1},
+  pages = {41--55},
+  issn = {2168-9830},
+  doi = {10.1002/j.2168-9830.2005.tb00828.x},
+  url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/j.2168-9830.2005.tb00828.x},
+  urldate = {2024-01-30},
+  abstract = {In developing its new engineering accreditation criteria, ABET reaffirmed a set of “hard” engineering skills while introducing a second, equally important, set of six “professional” skills. These latter skills include communication, teamwork, and understanding ethics and professionalism, which we label process skills, and engineering within a global and societal context, lifelong learning, and a knowledge of contemporary issues, which we designate as awareness skills. We review these skills with an emphasis on how they can be taught, or more correctly learned, citing a number of examples of successful and/or promising implementations. We then examine the difficult issue of assessing these skills. We are very positive about a number of creative ways that these skills are being learned, particularly at institutions that are turning to global and/or service learning in combination with engineering design projects to teach and reinforce outcome combinations. We are also encouraged by work directed at assessing these skills, but recognize that there is considerable research that remains to be done.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/HTS6699V/Shuman et al. - 2005 - The ABET “Professional Skills” — Can They Be Taugh.pdf;/home/danesabo/Zotero/storage/5FPIUCK2/j.2168-9830.2005.tb00828.html}
+}
+
+@book{sibirskijIntroductionTopologicalDynamics1975,
+  title = {Introduction to Topological Dynamics},
+  author = {Sibirskij, Konstantin Sergeevič and Sibirsky, K. S.},
+  date = {1975},
+  publisher = {Springer},
+  isbn = {90-286-0174-0}
+}
+
+@article{siddavatamTestingValidationModbus2017,
+  title = {Testing and {{Validation}} of {{Modbus}}/{{TCP Protocol}} for {{Secure SCADA Communication}} in {{CPS}} Using {{Formal Methods}}},
+  author = {Siddavatam, Irfan A. and Parekh, Sachin and Shah, Tanay and Kazi, Faruk},
+  date = {2017-11-24},
+  journaltitle = {Scalable Computing: Practice and Experience},
+  shortjournal = {SCPE},
+  volume = {18},
+  number = {4},
+  pages = {313--330},
+  issn = {1895-1767},
+  doi = {10.12694/scpe.v18i4.1331},
+  url = {http://www.scpe.org/index.php/scpe/article/view/1331},
+  urldate = {2023-10-10},
+  abstract = {Cyber-Physical Systems (CPS’s) evident representation is Supervisory Control, and Data Acquisition(SCADA). As SCADA is being refurbished with advanced computing and communication technologies, the risk involved in adopting/updating to new technology needs to be validated and verified thoroughly. One of the greatest challenges is security testing of protocols. All CPS systems being live and attached to physical process can not be scheduled for penetration testing and verification. This paper presents design and implementation of industrial compliant SCADA test bed, the formal analysis of semantics and security of Modbus/TCP protocol using Coloured Petri Nets(CPN) tool. A novel method is proposed to differentiate attack vector by identifying influential nodes using formal concept analysis. Modbus/TCP conceptualized attack from analysis is tested and verified on the test bed.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/F4N2I8WK/Siddavatam et al. - 2017 - Testing and Validation of ModbusTCP Protocol for .pdf}
+}
+
+@incollection{simkoSpecificationCyberPhysicalComponents2013,
+  title = {Specification of {{Cyber-Physical Components}} with {{Formal Semantics}} – {{Integration}} and {{Composition}}},
+  booktitle = {Model-{{Driven Engineering Languages}} and {{Systems}}},
+  author = {Simko, Gabor and Lindecker, David and Levendovszky, Tihamer and Neema, Sandeep and Sztipanovits, Janos},
+  editor = {Moreira, Ana and Schätz, Bernhard and Gray, Jeff and Vallecillo, Antonio and Clarke, Peter},
+  editora = {Hutchison, David and Kanade, Takeo and Kittler, Josef and Kleinberg, Jon M. and Mattern, Friedemann and Mitchell, John C. and Naor, Moni and Nierstrasz, Oscar and Pandu Rangan, C. and Steffen, Bernhard and Sudan, Madhu and Terzopoulos, Demetri and Tygar, Doug and Vardi, Moshe Y. and Weikum, Gerhard},
+  editoratype = {redactor},
+  date = {2013},
+  volume = {8107},
+  pages = {471--487},
+  publisher = {Springer Berlin Heidelberg},
+  location = {Berlin, Heidelberg},
+  doi = {10.1007/978-3-642-41533-3_29},
+  url = {http://link.springer.com/10.1007/978-3-642-41533-3_29},
+  urldate = {2023-11-08},
+  abstract = {Model-Based Engineering of Cyber-Physical Systems (CPS) needs correct-by-construction design methodologies, hence CPS modeling languages require mathematically rigorous, unambiguous, and sound specifications of their semantics. The main challenge is the formalization of the heterogeneous composition and interactions of CPS systems. Creating modeling languages that support both the acausal and causal modeling approaches, and which has well-defined and sound behavior across the heterogeneous time domains is a challenging task. In this paper, we discuss the difficulties and as an example develop the formal semantics of a CPS-specific modeling language called CyPhyML. We formalize the structural semantics of CyPhyML by means of constraint rules and its behavioral semantics by defining a semantic mapping to a language for differential algebraic equations. The specification language is based on an executable subset of first-order logic, which facilitates model conformance checking, model checking and model synthesis.},
+  isbn = {978-3-642-41532-6 978-3-642-41533-3},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/LQLFS8BV/Simko et al. - 2013 - Specification of Cyber-Physical Components with Fo.pdf}
+}
+
+@inproceedings{simkoTheoryCyberphysicalSystems2014,
+  title = {Towards a Theory for Cyber-Physical Systems Modeling},
+  booktitle = {Proceedings of the 4th {{ACM SIGBED International Workshop}} on {{Design}}, {{Modeling}}, and {{Evaluation}} of {{Cyber-Physical Systems}}},
+  author = {Simko, Gabor and Levendovszky, Tihamer and Maroti, Miklos and Sztipanovits, Janos},
+  date = {2014-04-14},
+  pages = {56--61},
+  publisher = {ACM},
+  location = {Berlin Germany},
+  doi = {10.1145/2593458.2593463},
+  url = {https://dl.acm.org/doi/10.1145/2593458.2593463},
+  urldate = {2023-11-08},
+  abstract = {Modeling the heterogeneous composition of physical, computational and communication systems is an important challenge in engineering Cyber-Physical Systems (CPS), where the major sources of heterogeneity are causality, time semantics, and different physical domains. Classical physical laws capture acausal continuous-time dynamics, thus the behavior of physical systems are inherently characterized by acausal continuous-time equations. On the other hand, computational and communication systems are based on the notion of causality and discrete-time semantics. Connecting the two worlds is challenging, and calls for proper formalization of the composition. In this paper, we discuss a formalism that captures both acausal physical laws, unidirectional analog signals, and is capable of describing causal computational systems, as well as the composition of CPS models.},
+  eventtitle = {{{CPS Week}} '14: {{Cyber Physical Systems Week}} 2014},
+  isbn = {978-1-4503-2871-5},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/JF45NQMG/Simko et al. - 2014 - Towards a theory for cyber-physical systems modeli.pdf}
+}
+
+@article{singhDigitalTwinOrigin2021,
+  title = {Digital {{Twin}}: {{Origin}} to {{Future}}},
+  shorttitle = {Digital {{Twin}}},
+  author = {Singh, Maulshree and Fuenmayor, Evert and Hinchy, Eoin P. and Qiao, Yuansong and Murray, Niall and Devine, Declan},
+  date = {2021-06},
+  journaltitle = {Applied System Innovation},
+  shortjournal = {Appl. Syst. Innov.},
+  volume = {4},
+  number = {2},
+  pages = {36},
+  publisher = {Mdpi},
+  location = {Basel},
+  doi = {10.3390/asi4020036},
+  url = {http://www.webofscience.com/wos/woscc/summary/marked/relevance/1},
+  urldate = {2022-03-08},
+  abstract = {Digital Twin (DT) refers to the virtual copy or model of any physical entity (physical twin) both of which are interconnected via exchange of data in real time. Conceptually, a DT mimics the state of its physical twin in real time and vice versa. Application of DT includes real-time monitoring, designing/planning, optimization, maintenance, remote access, etc. Its implementation is expected to grow exponentially in the coming decades. The advent of Industry 4.0 has brought complex industrial systems that are more autonomous, smart, and highly interconnected. These systems generate considerable amounts of data useful for several applications such as improving performance, predictive maintenance, training, etc. A sudden influx in the number of publications related to 'Digital Twin' has led to confusion between different terminologies related to the digitalization of industries. Another problem that has arisen due to the growing popularity of DT is a lack of consensus on the description of DT as well as so many different types of DT, which adds to the confusion. This paper intends to consolidate the different types of DT and different definitions of DT throughout the literature for easy identification of DT from the rest of the complimentary terms such as 'product avatar', 'digital thread', 'digital model', and 'digital shadow'. The paper looks at the concept of DT since its inception to its predicted future to realize the value it can bring to certain sectors. Understanding the characteristics and types of DT while weighing its pros and cons is essential for any researcher, business, or sector before investing in the technology.},
+  langid = {english},
+  keywords = {DGC read},
+  annotation = {WOS:000667262200001},
+  file = {/home/danesabo/Zotero/storage/7LJF6EJ3/Singh et al. - 2021 - Digital Twin Origin to Future.pdf}
+}
+
+@article{sisinniIndustrialInternetThings2018,
+  title = {Industrial {{Internet}} of {{Things}}: {{Challenges}}, {{Opportunities}}, and {{Directions}}},
+  shorttitle = {Industrial {{Internet}} of {{Things}}},
+  author = {Sisinni, Emiliano and Saifullah, Abusayeed and Han, Song and Jennehag, Ulf and Gidlund, Mikael},
+  date = {2018-11},
+  journaltitle = {IEEE Transactions on Industrial Informatics},
+  shortjournal = {IEEE Trans. Ind. Inf.},
+  volume = {14},
+  number = {11},
+  pages = {4724--4734},
+  issn = {1551-3203, 1941-0050},
+  doi = {10.1109/TII.2018.2852491},
+  url = {https://ieeexplore.ieee.org/document/8401919/},
+  urldate = {2022-09-30},
+  abstract = {Internet of Things (IoT) is an emerging domain that promises ubiquitous connection to the Internet, turning common objects into connected devices. The IoT paradigm is changing the way people interact with things around them. It paves the way for creating pervasively connected infrastructures to support innovative services and promises better flexibility and efficiency. Such advantages are attractive not only for consumer applications, but also for the industrial domain. Over the last few years, we have been witnessing the IoT paradigm making its way into the industry marketplace with purposely designed solutions. In this paper, we clarify the concepts of IoT, Industrial IoT, and Industry 4.0. We highlight the opportunities brought in by this paradigm shift as well as the challenges for its realization. In particular, we focus on the challenges associated with the need of energy efficiency, real-time performance, coexistence, interoperability, and security and privacy. We also provide a systematic overview of the state-of-the-art research efforts and potential research directions to solve Industrial IoT challenges.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/FEE7KHKK/Sisinni et al. - 2018 - Industrial Internet of Things Challenges, Opportu.pdf}
+}
+
+@article{siunitx,
+  title = {Siunitx — {{A}} Comprehensive ({{SI}}) Units Package},
+  author = {Wright, Joseph},
+  pages = {98},
+  abstract = {Physical quantities have both numbers and units, and each physical quantity should be expressed as the product of a number and a unit. Typesetting physical quantities requires care to ensure that the combined mathematical meaning of the number–unit combination is clear. In particular, the SI units system lays down a consistent set of units with rules on how these are to be used. However, different countries and publishers have differing conventions on the exact appearance of numbers (and units).},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/PFF89QY2/Wright - siunitx — A comprehensive (SI) units package.pdf}
+}
+
+@article{sivajiAdaptiveCruiseControl2013,
+  title = {Adaptive {{Cruise}} Control Systems for Vehicle Modeling Using Stop and Go Manoeuvres},
+  author = {Sivaji, V V and Sailaja, Dr M},
+  date = {2013},
+  journaltitle = {International Journal of Engineering Research and Applications},
+  volume = {3},
+  number = {4},
+  abstract = {This research paper deals with the design of adaptive cruise control (ACC) which was implemented on a passenger car using PID controller. An important feature of the newly based adaptive cruise control system is that, its ability to manage a competent inter-vehicle gap based on the speed of host vehicle and headway. There are three major inputs to the ACC system, that is, speed of host vehicle read from Memory unit, headway time set by driver, and actual gap measured by the Radar scanner. The system is been adapted with the velocity control at urban environments avoids mitigate possible accidents. This paper deals with the design, modulating, and estimation of the controllers performing actions on the longitudinal control of a car to accomplish stop-and-go manoeuvres.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/FTITBI9U/Sivaji and Sailaja - 2013 - Adaptive Cruise control systems for vehicle modeli.pdf}
+}
+
+@book{skjerveSimulatorbasedHumanFactors2011,
+  title = {Simulator-Based {{Human Factors Studies Across}} 25 {{Years}}: {{The History}} of the {{Halden Man-Machine Laboratory}}},
+  shorttitle = {Simulator-Based {{Human Factors Studies Across}} 25 {{Years}}},
+  editor = {Skjerve, Ann Britt and Bye, Andreas},
+  date = {2011},
+  publisher = {Springer London},
+  location = {London},
+  doi = {10.1007/978-0-85729-003-8},
+  url = {https://link.springer.com/10.1007/978-0-85729-003-8},
+  urldate = {2023-10-11},
+  isbn = {978-0-85729-002-1 978-0-85729-003-8},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/6B29IU34/Skjerve and Bye - 2011 - Simulator-based Human Factors Studies Across 25 Ye.pdf}
+}
+
+@inproceedings{slackFoolingLIMESHAP2020,
+  title = {Fooling {{LIME}} and {{SHAP}}: {{Adversarial Attacks}} on {{Post}} Hoc {{Explanation Methods}}},
+  shorttitle = {Fooling {{LIME}} and {{SHAP}}},
+  booktitle = {Proceedings of the {{AAAI}}/{{ACM Conference}} on {{AI}}, {{Ethics}}, and {{Society}}},
+  author = {Slack, Dylan and Hilgard, Sophie and Jia, Emily and Singh, Sameer and Lakkaraju, Himabindu},
+  date = {2020-02-07},
+  pages = {180--186},
+  publisher = {ACM},
+  location = {New York NY USA},
+  doi = {10.1145/3375627.3375830},
+  url = {https://dl.acm.org/doi/10.1145/3375627.3375830},
+  urldate = {2023-10-11},
+  abstract = {As machine learning black boxes are increasingly being deployed in domains such as healthcare and criminal justice, there is growing emphasis on building tools and techniques for explaining these black boxes in an interpretable manner. Such explanations are being leveraged by domain experts to diagnose systematic errors and underlying biases of black boxes. In this paper, we demonstrate that post hoc explanations techniques that rely on input perturbations, such as LIME and SHAP, are not reliable. Specifically, we propose a novel scaffolding technique that effectively hides the biases of any given classifier by allowing an adversarial entity to craft an arbitrary desired explanation. Our approach can be used to scaffold any biased classifier in such a way that its predictions on the input data distribution still remain biased, but the post hoc explanations of the scaffolded classifier look innocuous. Using extensive evaluation with multiple real world datasets (including COMPAS), we demonstrate how extremely biased (racist) classifiers crafted by our framework can easily fool popular explanation techniques such as LIME and SHAP into generating innocuous explanations which do not reflect the underlying biases.},
+  eventtitle = {{{AIES}} '20: {{AAAI}}/{{ACM Conference}} on {{AI}}, {{Ethics}}, and {{Society}}},
+  isbn = {978-1-4503-7110-0},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/WGGEGEC3/Slack et al. - 2020 - Fooling LIME and SHAP Adversarial Attacks on Post.pdf}
+}
+
+@article{sleitiDigitalTwinEnergy2022,
+  title = {Digital Twin in Energy Industry: {{Proposed}} Robust Digital Twin for Power Plant and Other Complex Capital-Intensive Large Engineering Systems},
+  shorttitle = {Digital Twin in Energy Industry},
+  author = {Sleiti, Ahmad K. and Kapat, Jayanta S. and Vesely, Ladislav},
+  date = {2022-11},
+  journaltitle = {Energy Reports},
+  shortjournal = {Energy Reports},
+  volume = {8},
+  pages = {3704--3726},
+  issn = {23524847},
+  doi = {10.1016/j.egyr.2022.02.305},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S2352484722005522},
+  urldate = {2023-10-11},
+  abstract = {The complex future power plants require digital twin (DT) architecture to achieve high reliability, availability and maintainability at lower cost. The available research on DT for power plants is limited and lacks details on DT comprehensiveness and robustness. The main focus of the present study is to propose a comprehensive and robust DT architecture for power plants that can also be used for other similar complex capital-intensive large engineering systems. First, overviews are conducted for DT key research and development for power plants and related energy savings applications to provide current status, guidelines and research gaps. Then, the requirements and rules for the power plant DT are established and the major DT components are determined. These components include the physics-based formulations; the statistical analysis of data from the sensor network; the realtime data; the pre-performed localized in-depth simulations to predict activities of the corresponding physical twin; and the system Genome with a digital thread that connects all these components together. Recommendations and future directions are made for the power plant DT development including the need for real data and physical description of the overall system focusing on each component individually and on the overall connections. Data-driven algorithms with capabilities to predict the system’s dynamic behavior still need to be developed. The data-driven approach alone is not sufficient and a low-order physics based model should operate in tandem with the updated latest system parameters to allow interpretation and enhancing the results from the data-driven process. Discrepancies between the dynamic system models (DSM) and anomaly detection and deep learning (ADL) require in-depth localized off-line simulations. Furthermore, this paper demonstrates the advantages of the developed ADL algorithm approach and DSM prediction of the DT using vector autoregressive model for anomaly detection in utility gas turbines with data from an operational power plant.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/JRW2LEDB/Sleiti et al. - 2022 - Digital twin in energy industry Proposed robust d.pdf}
+}
+
+@article{slothVerificationContinuousDynamical2011,
+  title = {Verification of Continuous Dynamical Systems by Timed Automata},
+  author = {Sloth, Christoffer and Wisniewski, Rafael},
+  date = {2011-08},
+  journaltitle = {Formal Methods in System Design},
+  shortjournal = {Form Methods Syst Des},
+  volume = {39},
+  number = {1},
+  pages = {47--82},
+  issn = {0925-9856, 1572-8102},
+  doi = {10.1007/s10703-011-0118-0},
+  url = {http://link.springer.com/10.1007/s10703-011-0118-0},
+  urldate = {2023-11-22},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/Q8GCI4MY/Sloth and Wisniewski - 2011 - Verification of continuous dynamical systems by ti.pdf}
+}
+
+@online{smilkovSmoothGradRemovingNoise2017,
+  title = {{{SmoothGrad}}: Removing Noise by Adding Noise},
+  shorttitle = {{{SmoothGrad}}},
+  author = {Smilkov, Daniel and Thorat, Nikhil and Kim, Been and Viégas, Fernanda and Wattenberg, Martin},
+  date = {2017-06-12},
+  eprint = {1706.03825},
+  eprinttype = {arXiv},
+  eprintclass = {cs, stat},
+  url = {http://arxiv.org/abs/1706.03825},
+  urldate = {2023-10-11},
+  abstract = {Explaining the output of a deep network remains a challenge. In the case of an image classifier, one type of explanation is to identify pixels that strongly influence the final decision. A starting point for this strategy is the gradient of the class score function with respect to the input image. This gradient can be interpreted as a sensitivity map, and there are several techniques that elaborate on this basic idea. This paper makes two contributions: it introduces SMOOTHGRAD, a simple method that can help visually sharpen gradient-based sensitivity maps, and it discusses lessons in the visualization of these maps. We publish the code for our experiments and a website with our results.},
+  langid = {english},
+  pubstate = {prepublished},
+  note = {Comment: 10 pages},
+  file = {/home/danesabo/Zotero/storage/32ADXEX3/Smilkov et al. - 2017 - SmoothGrad removing noise by adding noise.pdf}
+}
+
+@misc{smolaLearningKernels1998,
+  title = {Learning with {{Kernels}}},
+  author = {Smola, Alexander Johannes},
+  date = {1998},
+  abstract = {The present thesis can take its place among the numerous doctoral theses and other publications that are currently revolutionizing the area of machine learning. The author's basic concern is with kernel-based methods and in particular Support Vector algorithms for regression estimation for the solution of inverse, often ill- posed problems. However, Alexander Smola's thesis stands out from many of the other publications in this field. This is due in part to the author's profound theoretical penetration of his subject-matter, but also and in particular to the wealth of detailed results he has included. Especially neat and of particular relevance are the algorithmic extensions of Support Vector Machines, which can be combined as building blocks, thus markedly improving the Support Vectors. Of substantial interest is also the very elegant unsupervised method for nonlinear feature extraction, which applies the kernel-based method to classical Principal Component Analysis (kernel PCA). And although only designed to illustrate the theoretical results, the practical applications the author gives us from the area of high-energy physics and time-series analysis are highly convincing. In many respects the thesis is groundbreaking, but it is likely to soon become a frequently cited work for numerous innovative applications from the field of statistical machine learning and for improving our theoretical understanding of Support Vector Machines.},
+  file = {/home/danesabo/Zotero/storage/GUH9JCVR/Smola - 1998 - Learning with Kernels.pdf;/home/danesabo/Zotero/storage/W3FPW6HL/summary.html}
+}
+
+@online{SNARKZKJargon,
+  title = {{{SNARK}} - {{ZK Jargon Decoder}}},
+  url = {https://nmohnblatt.github.io/zk-jargon-decoder/definitions/snark.html},
+  urldate = {2024-04-01},
+  file = {/home/danesabo/Zotero/storage/5IQHWKIU/snark.html}
+}
+
+@article{soderstrandHighspeedLowcostRecursive1977,
+  title = {A High-Speed Low-Cost Recursive Digital Filter Using Residue Number Arithmetic},
+  author = {Soderstrand, M.A.},
+  date = {1977-07},
+  journaltitle = {Proceedings of the IEEE},
+  volume = {65},
+  number = {7},
+  pages = {1065--1067},
+  issn = {1558-2256},
+  doi = {10.1109/PROC.1977.10616},
+  url = {https://ieeexplore.ieee.org/abstract/document/1454885?casa_token=0nHHqOecy5oAAAAA:9oASTHv6Hh9oRe4Biqf7Yv3_QzHSY2Mn8h98SpRmAq9iWceMPcKtzQWq7ausax3IXfGs0BaQKg},
+  urldate = {2024-02-08},
+  abstract = {Use of table look-up multiplication by fractional coefficients allows implementation of high-speed, low-cost recursive digital filters using residue number arithmetic. An 8-bit equivalent filter based on the lossless discrete integrator (LDI) technique described by Bruton can be easily implemented using inexpensive commercially available PROM's for the table look-up. Computer Simulations of first- and second-order LDI-RNS filters indicate substantial cost savings and speed advantages. Experiments on a first-order section verify the basic operation, speed calculations, and cost analysis. Furthermore, extensions to more bits and higher order filters are possible.},
+  eventtitle = {Proceedings of the {{IEEE}}},
+  file = {/home/danesabo/Zotero/storage/GNHJXDBQ/Soderstrand - 1977 - A high-speed low-cost recursive digital filter usi.pdf}
+}
+
+@article{soderstrandMultipliersResiduenumberarithmeticDigital1977,
+  title = {Multipliers for Residue-Number-Arithmetic Digital Filters},
+  author = {Soderstrand, M. A. and Fields, E. L.},
+  date = {1977-03-17},
+  journaltitle = {Electronics Letters},
+  volume = {13},
+  number = {6},
+  pages = {164--166},
+  publisher = {IET Digital Library},
+  issn = {1350-911X},
+  doi = {10.1049/el:19770117},
+  url = {https://digital-library.theiet.org/content/journals/10.1049/el_19770117},
+  urldate = {2024-02-08},
+  abstract = {A recently proposed residue-number-arithmetic digital filter offers major cost and speed advantages over binary-arithmetic digital filters, but suffers one major drawback. The filter coefficients must be constant, since the lack of a fast method of multiplication by a fraction in residue arithmetic requires the coefficients to be realised by a fixed table look-up read-only memory. Two multipliers are proposed which realise a completely general fractional multiply and are suitable for digital-filtering applications.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/V5GDT5SK/el_19770117.html}
+}
+
+@online{sohl-dicksteinDeepUnsupervisedLearning2015,
+  title = {Deep {{Unsupervised Learning}} Using {{Nonequilibrium Thermodynamics}}},
+  author = {Sohl-Dickstein, Jascha and Weiss, Eric A. and Maheswaranathan, Niru and Ganguli, Surya},
+  date = {2015-11-18},
+  eprint = {1503.03585},
+  eprinttype = {arXiv},
+  eprintclass = {cond-mat, q-bio, stat},
+  doi = {10.48550/arXiv.1503.03585},
+  url = {http://arxiv.org/abs/1503.03585},
+  urldate = {2024-07-16},
+  abstract = {A central problem in machine learning involves modeling complex data-sets using highly flexible families of probability distributions in which learning, sampling, inference, and evaluation are still analytically or computationally tractable. Here, we develop an approach that simultaneously achieves both flexibility and tractability. The essential idea, inspired by non-equilibrium statistical physics, is to systematically and slowly destroy structure in a data distribution through an iterative forward diffusion process. We then learn a reverse diffusion process that restores structure in data, yielding a highly flexible and tractable generative model of the data. This approach allows us to rapidly learn, sample from, and evaluate probabilities in deep generative models with thousands of layers or time steps, as well as to compute conditional and posterior probabilities under the learned model. We additionally release an open source reference implementation of the algorithm.},
+  pubstate = {prepublished},
+  keywords = {Computer Science - Machine Learning,Condensed Matter - Disordered Systems and Neural Networks,Quantitative Biology - Neurons and Cognition,Statistics - Machine Learning},
+  file = {/home/danesabo/Zotero/storage/M24N888A/Sohl-Dickstein et al. - 2015 - Deep Unsupervised Learning using Nonequilibrium Th.pdf;/home/danesabo/Zotero/storage/APVVMP7V/1503.html}
+}
+
+@online{sohl-dicksteinDeepUnsupervisedLearning2015a,
+  title = {Deep {{Unsupervised Learning}} Using {{Nonequilibrium Thermodynamics}}},
+  author = {Sohl-Dickstein, Jascha and Weiss, Eric A. and Maheswaranathan, Niru and Ganguli, Surya},
+  date = {2015-11-18},
+  eprint = {1503.03585},
+  eprinttype = {arXiv},
+  eprintclass = {cond-mat, q-bio, stat},
+  doi = {10.48550/arXiv.1503.03585},
+  url = {http://arxiv.org/abs/1503.03585},
+  urldate = {2023-10-05},
+  abstract = {A central problem in machine learning involves modeling complex data-sets using highly flexible families of probability distributions in which learning, sampling, inference, and evaluation are still analytically or computationally tractable. Here, we develop an approach that simultaneously achieves both flexibility and tractability. The essential idea, inspired by non-equilibrium statistical physics, is to systematically and slowly destroy structure in a data distribution through an iterative forward diffusion process. We then learn a reverse diffusion process that restores structure in data, yielding a highly flexible and tractable generative model of the data. This approach allows us to rapidly learn, sample from, and evaluate probabilities in deep generative models with thousands of layers or time steps, as well as to compute conditional and posterior probabilities under the learned model. We additionally release an open source reference implementation of the algorithm.},
+  pubstate = {prepublished},
+  file = {/home/danesabo/Zotero/storage/2A8PNKEU/Sohl-Dickstein et al. - 2015 - Deep Unsupervised Learning using Nonequilibrium Th.pdf;/home/danesabo/Zotero/storage/7DYWKBP7/1503.html}
+}
+
+@online{SoKUsedCryptography,
+  title = {{{SoK}} of {{Used Cryptography}} in {{Blockchain}} | {{IEEE Journals}} \& {{Magazine}} | {{IEEE Xplore}}},
+  url = {https://ieeexplore.ieee.org/document/8865045},
+  urldate = {2023-10-04},
+  file = {/home/danesabo/Zotero/storage/X9DRX9MM/SoK of Used Cryptography in Blockchain  IEEE Jour.pdf;/home/danesabo/Zotero/storage/FLI9NNJF/8865045.html}
+}
+
+@inproceedings{sommerOutsideClosedWorld2010,
+  title = {Outside the {{Closed World}}: {{On Using Machine Learning}} for {{Network Intrusion Detection}}},
+  shorttitle = {Outside the {{Closed World}}},
+  booktitle = {2010 {{IEEE Symposium}} on {{Security}} and {{Privacy}}},
+  author = {Sommer, Robin and Paxson, Vern},
+  date = {2010},
+  pages = {305--316},
+  publisher = {IEEE},
+  location = {Oakland, CA, USA},
+  doi = {10.1109/SP.2010.25},
+  url = {http://ieeexplore.ieee.org/document/5504793/},
+  urldate = {2023-10-03},
+  abstract = {In network intrusion detection research, one popular strategy for finding attacks is monitoring a network’s activity for anomalies: deviations from profiles of normality previously learned from benign traffic, typically identified using tools borrowed from the machine learning community. However, despite extensive academic research one finds a striking gap in terms of actual deployments of such systems: compared with other intrusion detection approaches, machine learning is rarely employed in operational “real world” settings. We examine the differences between the network intrusion detection problem and other areas where machine learning regularly finds much more success. Our main claim is that the task of finding attacks is fundamentally different from these other applications, making it significantly harder for the intrusion detection community to employ machine learning effectively. We support this claim by identifying challenges particular to network intrusion detection, and provide a set of guidelines meant to strengthen future research on anomaly detection.},
+  eventtitle = {2010 {{IEEE Symposium}} on {{Security}} and {{Privacy}}},
+  isbn = {978-1-4244-6894-2},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/Z3ZE8W5Q/Sommer and Paxson - 2010 - Outside the Closed World On Using Machine Learnin.pdf}
+}
+
+@unpublished{sommerville-videosMaroochyWaterBreach05:35:03UTC,
+  title = {Maroochy Water Breach},
+  author = {family=videos, prefix=sommerville-, useprefix=true},
+  year = {05:35:03 UTC},
+  url = {https://www.slideshare.net/sommerville-videos/maroochy-water-breach},
+  urldate = {2022-04-02}
+}
+
+@online{songDenoisingDiffusionImplicit2022,
+  title = {Denoising {{Diffusion Implicit Models}}},
+  author = {Song, Jiaming and Meng, Chenlin and Ermon, Stefano},
+  date = {2022-10-05},
+  eprint = {2010.02502},
+  eprinttype = {arXiv},
+  eprintclass = {cs},
+  doi = {10.48550/arXiv.2010.02502},
+  url = {http://arxiv.org/abs/2010.02502},
+  urldate = {2023-10-05},
+  abstract = {Denoising diffusion probabilistic models (DDPMs) have achieved high quality image generation without adversarial training, yet they require simulating a Markov chain for many steps to produce a sample. To accelerate sampling, we present denoising diffusion implicit models (DDIMs), a more efficient class of iterative implicit probabilistic models with the same training procedure as DDPMs. In DDPMs, the generative process is defined as the reverse of a Markovian diffusion process. We construct a class of non-Markovian diffusion processes that lead to the same training objective, but whose reverse process can be much faster to sample from. We empirically demonstrate that DDIMs can produce high quality samples \$10 \textbackslash times\$ to \$50 \textbackslash times\$ faster in terms of wall-clock time compared to DDPMs, allow us to trade off computation for sample quality, and can perform semantically meaningful image interpolation directly in the latent space.},
+  pubstate = {prepublished},
+  note = {Comment: ICLR 2021; updated connections with ODEs at page 6, fixed some typos in the proof},
+  file = {/home/danesabo/Zotero/storage/7AYYEX82/Song et al. - 2022 - Denoising Diffusion Implicit Models.pdf;/home/danesabo/Zotero/storage/3YEV2MR3/2010.html}
+}
+
+@online{songGenerativeModelingEstimating2020,
+  title = {Generative {{Modeling}} by {{Estimating Gradients}} of the {{Data Distribution}}},
+  author = {Song, Yang and Ermon, Stefano},
+  date = {2020-10-10},
+  eprint = {1907.05600},
+  eprinttype = {arXiv},
+  eprintclass = {cs, stat},
+  doi = {10.48550/arXiv.1907.05600},
+  url = {http://arxiv.org/abs/1907.05600},
+  urldate = {2023-10-05},
+  abstract = {We introduce a new generative model where samples are produced via Langevin dynamics using gradients of the data distribution estimated with score matching. Because gradients can be ill-defined and hard to estimate when the data resides on low-dimensional manifolds, we perturb the data with different levels of Gaussian noise, and jointly estimate the corresponding scores, i.e., the vector fields of gradients of the perturbed data distribution for all noise levels. For sampling, we propose an annealed Langevin dynamics where we use gradients corresponding to gradually decreasing noise levels as the sampling process gets closer to the data manifold. Our framework allows flexible model architectures, requires no sampling during training or the use of adversarial methods, and provides a learning objective that can be used for principled model comparisons. Our models produce samples comparable to GANs on MNIST, CelebA and CIFAR-10 datasets, achieving a new state-of-the-art inception score of 8.87 on CIFAR-10. Additionally, we demonstrate that our models learn effective representations via image inpainting experiments.},
+  pubstate = {prepublished},
+  note = {Comment: NeurIPS 2019 (Oral)},
+  file = {/home/danesabo/Zotero/storage/92EXAJWP/Song and Ermon - 2020 - Generative Modeling by Estimating Gradients of the.pdf;/home/danesabo/Zotero/storage/EPN682ZV/1907.html}
+}
+
+@online{songImprovedTechniquesTraining2020,
+  title = {Improved {{Techniques}} for {{Training Score-Based Generative Models}}},
+  author = {Song, Yang and Ermon, Stefano},
+  date = {2020-10-23},
+  eprint = {2006.09011},
+  eprinttype = {arXiv},
+  eprintclass = {cs, stat},
+  doi = {10.48550/arXiv.2006.09011},
+  url = {http://arxiv.org/abs/2006.09011},
+  urldate = {2023-10-05},
+  abstract = {Score-based generative models can produce high quality image samples comparable to GANs, without requiring adversarial optimization. However, existing training procedures are limited to images of low resolution (typically below 32x32), and can be unstable under some settings. We provide a new theoretical analysis of learning and sampling from score models in high dimensional spaces, explaining existing failure modes and motivating new solutions that generalize across datasets. To enhance stability, we also propose to maintain an exponential moving average of model weights. With these improvements, we can effortlessly scale score-based generative models to images with unprecedented resolutions ranging from 64x64 to 256x256. Our score-based models can generate high-fidelity samples that rival best-in-class GANs on various image datasets, including CelebA, FFHQ, and multiple LSUN categories.},
+  pubstate = {prepublished},
+  note = {Comment: NeurIPS 2020},
+  file = {/home/danesabo/Zotero/storage/6YZT8E6Q/Song and Ermon - 2020 - Improved Techniques for Training Score-Based Gener.pdf;/home/danesabo/Zotero/storage/585R6E4V/2006.html}
+}
+
+@inproceedings{songMySmartphoneKnows2016,
+  title = {My {{Smartphone Knows What You Print}}: {{Exploring Smartphone-based Side-channel Attacks Against 3D Printers}}},
+  shorttitle = {My {{Smartphone Knows What You Print}}},
+  booktitle = {Proceedings of the 2016 {{ACM SIGSAC Conference}} on {{Computer}} and {{Communications Security}}},
+  author = {Song, Chen and Lin, Feng and Ba, Zhongjie and Ren, Kui and Zhou, Chi and Xu, Wenyao},
+  date = {2016-10-24},
+  pages = {895--907},
+  publisher = {ACM},
+  location = {Vienna Austria},
+  doi = {10.1145/2976749.2978300},
+  url = {https://dl.acm.org/doi/10.1145/2976749.2978300},
+  urldate = {2024-01-02},
+  abstract = {Additive manufacturing, also known as 3D printing, has been increasingly applied to fabricate highly intellectual property (IP) sensitive products. However, the related IP protection issues in 3D printers are still largely underexplored. On the other hand, smartphones are equipped with rich onboard sensors and have been applied to pervasive mobile surveillance in many applications. These facts raise one critical question: is it possible that smartphones access the sidechannel signals of 3D printer and then hack the IP information? To answer this, we perform an end-to-end study on exploring smartphone-based side-channel attacks against 3D printers. Specifically, we formulate the problem of the IP side-channel attack in 3D printing. Then, we investigate the possible acoustic and magnetic side-channel attacks using the smartphone built-in sensors. Moreover, we explore a magnetic-enhanced side-channel attack model to accurately deduce the vital directional operations of 3D printer. Experimental results show that by exploiting the side-channel signals collected by smartphones, we can successfully reconstruct the physical prints and their G-code with Mean Tendency Error of 5.87\% on regular designs and 9.67\% on complex designs, respectively. Our study demonstrates this new and practical smartphone-based side channel attack on compromising IP information during 3D printing.},
+  eventtitle = {{{CCS}}'16: 2016 {{ACM SIGSAC Conference}} on {{Computer}} and {{Communications Security}}},
+  isbn = {978-1-4503-4139-4},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/LTR8HF5F/Song et al. - 2016 - My Smartphone Knows What You Print Exploring Smar.pdf}
+}
+
+@inproceedings{songScoreBasedGenerativeModeling2020,
+  title = {Score-{{Based Generative Modeling}} through {{Stochastic Differential Equations}}},
+  author = {Song, Yang and Sohl-Dickstein, Jascha and Kingma, Diederik P. and Kumar, Abhishek and Ermon, Stefano and Poole, Ben},
+  date = {2020-10-02},
+  url = {https://openreview.net/forum?id=PxTIG12RRHS},
+  urldate = {2023-10-05},
+  abstract = {Creating noise from data is easy; creating data from noise is generative modeling. We present a stochastic differential equation (SDE) that smoothly transforms a complex data distribution to a known prior distribution by slowly injecting noise, and a corresponding reverse-time SDE that transforms the prior distribution back into the data distribution by slowly removing the noise. Crucially, the reverse-time SDE depends only on the time-dependent gradient field (a.k.a., score) of the perturbed data distribution. By leveraging advances in score-based generative modeling, we can accurately estimate these scores with neural networks, and use numerical SDE solvers to generate samples. We show that this framework encapsulates previous approaches in score-based generative modeling and diffusion probabilistic modeling, allowing for new sampling procedures and new modeling capabilities. In particular, we introduce a predictor-corrector framework to correct errors in the evolution of the discretized reverse-time SDE. We also derive an equivalent neural ODE that samples from the same distribution as the SDE, but additionally enables exact likelihood computation, and improved sampling efficiency. In addition, we provide a new way to solve inverse problems with score-based models, as demonstrated with experiments on class-conditional generation, image inpainting, and colorization. Combined with multiple architectural improvements, we achieve record-breaking performance for unconditional image generation on CIFAR-10 with an Inception score of 9.89 and FID of 2.20, a competitive likelihood of 2.99 bits/dim, and demonstrate high fidelity generation of \$1024\textbackslash times 1024\$ images for the first time from a score-based generative model.},
+  eventtitle = {International {{Conference}} on {{Learning Representations}}},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/FBHMISQR/Song et al. - 2020 - Score-Based Generative Modeling through Stochastic.pdf}
+}
+
+@incollection{sontagControlLyapunovFunctions1999,
+  title = {Control-{{Lyapunov}} Functions},
+  booktitle = {Open {{Problems}} in {{Mathematical Systems}} and {{Control Theory}}},
+  author = {Sontag, Eduardo D.},
+  editor = {Blondel, Vincent and Sontag, Eduardo D. and Vidyasagar, Mathukumalli and Willems, Jan C.},
+  editora = {Dickinson, B. W. and Fettweis, A. and Massey, J. L. and Modestino, J. W. and Sontag, E. D. and Thoma, M.},
+  editoratype = {redactor},
+  date = {1999},
+  pages = {211--216},
+  publisher = {Springer London},
+  location = {London},
+  doi = {10.1007/978-1-4471-0807-8_40},
+  url = {http://link.springer.com/10.1007/978-1-4471-0807-8_40},
+  urldate = {2023-11-22},
+  isbn = {978-1-4471-1207-5 978-1-4471-0807-8}
+}
+
+@book{sontagMathematicalControlTheory2013,
+  title = {Mathematical Control Theory: Deterministic Finite Dimensional Systems},
+  author = {Sontag, Eduardo D.},
+  date = {2013},
+  volume = {6},
+  publisher = {Springer Science \& Business Media},
+  isbn = {1-4612-0577-8}
+}
+
+@misc{sorensenLecturesCurryHowardIsomorphism,
+  title = {Lectures on the {{Curry-Howard Isomorphism}}},
+  author = {Sorensen, Morten Heine B. and Urzyczyn, Pawel},
+  file = {/home/danesabo/Zotero/storage/R5BD74P2/curry-howard.pdf}
+}
+
+@online{SpaceExStateSpace,
+  title = {{{SpaceEx}} | {{State Space Explorer}}},
+  url = {http://spaceex.imag.fr/},
+  urldate = {2023-10-12},
+  file = {/home/danesabo/Zotero/storage/277ZC3YA/spaceex.imag.fr.html}
+}
+
+@online{SpeedgoatRealTimeSimulation,
+  title = {Speedgoat - {{Real-Time Simulation}} and {{Testing}}},
+  url = {https://www.speedgoat.com/},
+  urldate = {2024-08-14}
+}
+
+@book{spivakCategoryTheorySciences2014,
+  title = {Category {{Theory}} for the {{Sciences}}},
+  author = {Spivak, David I.},
+  date = {2014},
+  publisher = {MIT Press},
+  location = {Cambridge, UNITED STATES},
+  url = {http://ebookcentral.proquest.com/lib/pitt-ebooks/detail.action?docID=3339883},
+  urldate = {2023-12-07},
+  isbn = {978-0-262-32052-8},
+  file = {/home/danesabo/Zotero/storage/5US8QC8N/reader.html}
+}
+
+@online{spivakOperadWiringDiagrams2013,
+  title = {The Operad of Wiring Diagrams: Formalizing a Graphical Language for Databases, Recursion, and Plug-and-Play Circuits},
+  shorttitle = {The Operad of Wiring Diagrams},
+  author = {Spivak, David I.},
+  date = {2013-05-01},
+  eprint = {1305.0297},
+  eprinttype = {arXiv},
+  eprintclass = {cs, math},
+  doi = {10.48550/arXiv.1305.0297},
+  url = {http://arxiv.org/abs/1305.0297},
+  urldate = {2023-12-07},
+  abstract = {Wiring diagrams, as seen in digital circuits, can be nested hierarchically and thus have an aspect of self-similarity. We show that wiring diagrams form the morphisms of an operad \$\textbackslash mcT\$, capturing this self-similarity. We discuss the algebra \$\textbackslash Rel\$ of mathematical relations on \$\textbackslash mcT\$, and in so doing use wiring diagrams as a graphical language with which to structure queries on relational databases. We give the example of circuit diagrams as a special case. We move on to show how plug-and-play devices and also recursion can be formulated in the operadic framework as well. Throughout we include many examples and figures.},
+  pubstate = {prepublished},
+  note = {Comment: 28 pages},
+  file = {/home/danesabo/Zotero/storage/T5BKJJFT/Spivak - 2013 - The operad of wiring diagrams formalizing a graph.pdf;/home/danesabo/Zotero/storage/LWDRTFCD/1305.html}
+}
+
+@article{sridharCyberPhysicalSystemSecurity2012,
+  title = {Cyber-{{Physical System Security}} for the {{Electric Power Grid}}},
+  author = {Sridhar, Siddharth and Hahn, Adam and Govindarasu, Manimaran},
+  date = {2012},
+  journaltitle = {Proceedings of the Ieee},
+  shortjournal = {Proc. IEEE},
+  volume = {100},
+  number = {1},
+  pages = {210--224},
+  publisher = {Ieee-Inst Electrical Electronics Engineers Inc},
+  location = {Piscataway},
+  issn = {0018-9219},
+  doi = {10.1109/JPROC.2011.2165269},
+  url = {http://www.webofscience.com/wos/woscc/summary/marked/relevance/1?markedListId=CPS%20Security},
+  urldate = {2022-03-08},
+  abstract = {The development of a trustworthy smart grid requires a deeper understanding of potential impacts resulting from successful cyber attacks. Estimating feasible attack impact requires an evaluation of the grid's dependency on its cyber infrastructure and its ability to tolerate potential failures. A further exploration of the cyber-physical relationships within the smart grid and a specific review of possible attack vectors is necessary to determine the adequacy of cybersecurity efforts. This paper highlights the significance of cyber infrastructure security in conjunction with power application security to prevent, mitigate, and tolerate cyber attacks. A layered approach is introduced to evaluating risk based on the security of both the physical power applications and the supporting cyber infrastructure. A classification is presented to highlight dependencies between the cyber-physical controls required to support the smart grid and the communication and computations that must be protected from cyber attack. The paper then presents current research efforts aimed at enhancing the smart grid's application and infrastructure security. Finally, current challenges are identified to facilitate future research efforts.},
+  langid = {english},
+  keywords = {DGC read,key},
+  annotation = {WOS:000298326400016},
+  file = {/home/danesabo/Zotero/storage/DG8KHKZH/Sridhar12.pdf}
+}
+
+@article{srivastavaDigitalTwinsServing2024,
+  title = {Digital {{Twins Serving Cybersecurity}}: {{More Than}} a {{Model}}: {{Cybersecurity}} as a {{Future Benefit}} of {{Digital Twins}} 2},
+  shorttitle = {Digital {{Twins Serving Cybersecurity}}},
+  author = {Srivastava, Anurag and Liu, Chen-Ching and Stefanov, Alexandru and Basumallik, Sagnik and Hussain, Mohammed M. and Somda, Baza and Rajkumar, Vetrivel S.},
+  date = {2024-01},
+  journaltitle = {IEEE Power and Energy Magazine},
+  shortjournal = {IEEE Power and Energy Mag.},
+  volume = {22},
+  number = {1},
+  pages = {61--71},
+  issn = {1540-7977, 1558-4216},
+  doi = {10.1109/MPE.2023.3325196},
+  url = {https://ieeexplore.ieee.org/document/10398550/},
+  urldate = {2024-03-13},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/XDQSIFHF/Srivastava et al. - 2024 - Digital Twins Serving Cybersecurity More Than a M.pdf}
+}
+
+@article{srivastavaDigitalTwinsServing2024a,
+  title = {Digital {{Twins Serving Cybersecurity}}: {{More Than}} a {{Model}}: {{Cybersecurity}} as a {{Future Benefit}} of {{Digital Twins}} 2},
+  shorttitle = {Digital {{Twins Serving Cybersecurity}}},
+  author = {Srivastava, Anurag and Liu, Chen-Ching and Stefanov, Alexandru and Basumallik, Sagnik and Hussain, Mohammed M. and Somda, Baza and Rajkumar, Vetrivel S.},
+  date = {2024-01},
+  journaltitle = {IEEE Power and Energy Magazine},
+  volume = {22},
+  number = {1},
+  pages = {61--71},
+  issn = {1558-4216},
+  doi = {10.1109/MPE.2023.3325196},
+  url = {https://ieeexplore.ieee.org/document/10398550/},
+  urldate = {2024-03-13},
+  abstract = {Today’s critical infrastructure systems are more interconnected and dependent on the electric power grid. This interdependence means that disruptions in one system can have far-reaching consequences across many others. This is particularly evident when a cyberattack in the power grid leads to widespread outages and disrupts essential societal services. To prevent such disasters, it is crucial that proactive actions are taken to secure our power grid control centers and digital substations. This is where digital twins (DTs) play an important role: By creating virtual replicas of cyberphysical assets and processes, DTs allow system operators to anticipate and address potential vulnerabilities in our cybersecurity defenses before they can be exploited. As such, a DT can be considered as a key contributor to safeguard the power system against cyberattacks. This article examines the potential future benefits of DTs in enabling a cybersecure and resilient power grid, explores multiple use cases, and proposes a path forward.},
+  eventtitle = {{{IEEE Power}} and {{Energy Magazine}}},
+  file = {/home/danesabo/Zotero/storage/2JCWZKFM/Srivastava et al. - 2024 - Digital Twins Serving Cybersecurity More Than a M.pdf;/home/danesabo/Zotero/storage/M2E85SGM/10398550.html}
+}
+
+@online{STALIROTALIROTOOLS,
+  title = {S-{{TALIRO}} - {{TALIRO-TOOLS}}},
+  url = {https://sites.google.com/a/asu.edu/s-taliro/s-taliro},
+  urldate = {2023-10-13},
+  abstract = {TALIRO (TemporAl LogIC RObustness) tools is a suit of tools for the analysis of continuous and hybrid dynamical systems using linear time temporal logics.},
+  file = {/home/danesabo/Zotero/storage/PHFV7QMF/s-taliro.html}
+}
+
+@article{standalone,
+  title = {Standalone {{Package}}},
+  author = {Scharrer, Martin},
+  pages = {29},
+  abstract = {The standalone bundle allows users to easily place picture environments or other material in own source files and compile these on their own or as part of a main document. A special standalone class is provided for use with such files, which by default crops the resulting output file to the content. The standalone package enables the user to simply load the standalone files using \textbackslash input inside a main document.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/ZXNEEHZ2/Scharrer - The standalone Package.pdf}
+}
+
+@article{stiasnyPhysicsInformedNeuralNetworks2023,
+  title = {Physics-{{Informed Neural Networks}} for {{Time-Domain Simulations}}: {{Accuracy}}, {{Computational Cost}}, and {{Flexibility}}},
+  shorttitle = {Physics-{{Informed Neural Networks}} for {{Time-Domain Simulations}}},
+  author = {Stiasny, Jochen and Chatzivasileiadis, Spyros},
+  date = {2023-11},
+  journaltitle = {Electric Power Systems Research},
+  shortjournal = {Electric Power Systems Research},
+  volume = {224},
+  eprint = {2303.08994},
+  eprinttype = {arXiv},
+  eprintclass = {cs, eess},
+  pages = {109748},
+  issn = {03787796},
+  doi = {10.1016/j.epsr.2023.109748},
+  url = {http://arxiv.org/abs/2303.08994},
+  urldate = {2024-01-30},
+  abstract = {The simulation of power system dynamics poses a computationally expensive task. Considering the growing uncertainty of generation and demand patterns, thousands of scenarios need to be continuously assessed to ensure the safety of power systems. Physics-Informed Neural Networks (PINNs) have recently emerged as a promising solution for drastically accelerating computations of non-linear dynamical systems. This work investigates the applicability of these methods for power system dynamics, focusing on the dynamic response to load disturbances. Comparing the prediction of PINNs to the solution of conventional solvers, we find that PINNs can be 10 to 1000 times faster than conventional solvers. At the same time, we find them to be sufficiently accurate and numerically stable even for large time steps. To facilitate a deeper understanding, this paper also present a new regularisation of Neural Network (NN) training by introducing a gradient-based term in the loss function. The resulting NNs, which we call dtNNs, help us deliver a comprehensive analysis about the strengths and weaknesses of the NN based approaches, how incorporating knowledge of the underlying physics affects NN performance, and how this compares with conventional solvers for power system dynamics.},
+  keywords = {Computer Science - Machine Learning,Electrical Engineering and Systems Science - Systems and Control},
+  note = {Comment: Published in Electric Power Systems Research},
+  file = {/home/danesabo/Zotero/storage/B5YWLZSE/Stiasny and Chatzivasileiadis - 2023 - Physics-Informed Neural Networks for Time-Domain S.pdf;/home/danesabo/Zotero/storage/6GUKX8Z6/2303.html}
+}
+
+@online{stiasnyTransientStabilityAnalysis2023,
+  title = {Transient {{Stability Analysis}} with {{Physics-Informed Neural Networks}}},
+  author = {Stiasny, Jochen and Misyris, Georgios S. and Chatzivasileiadis, Spyros},
+  date = {2023-03-15},
+  eprint = {2106.13638},
+  eprinttype = {arXiv},
+  eprintclass = {cs, eess},
+  url = {http://arxiv.org/abs/2106.13638},
+  urldate = {2024-01-30},
+  abstract = {We explore the possibility to use physics-informed neural networks to drastically accelerate the solution of ordinary differential-algebraic equations that govern the power system dynamics. When it comes to transient stability assessment, the traditionally applied methods either carry a significant computational burden, require model simplifications, or use overly conservative surrogate models. Conventional neural networks can circumvent these limitations but are faced with high demand of high-quality training datasets, while they ignore the underlying governing equations. Physics-informed neural networks are different: they incorporate the power system differential algebraic equations directly into the neural network training and drastically reduce the need for training data. This paper takes a deep dive into the performance of physics-informed neural networks for power system transient stability assessment. Introducing a new neural network training procedure to facilitate a thorough comparison, we explore how physics-informed neural networks compare with conventional differential-algebraic solvers and classical neural networks in terms of computation time, requirements in data, and prediction accuracy. We illustrate the findings on the Kundur two-area system, and assess the opportunities and challenges of physics-informed neural networks to serve as a transient stability analysis tool, highlighting possible pathways to further develop this method.},
+  pubstate = {prepublished},
+  keywords = {Computer Science - Machine Learning,Electrical Engineering and Systems Science - Systems and Control},
+  note = {Comment: 9 pages, 8 figures},
+  file = {/home/danesabo/Zotero/storage/J8WQK82B/Stiasny et al. - 2023 - Transient Stability Analysis with Physics-Informed.pdf;/home/danesabo/Zotero/storage/BFZKZ9EM/2106.html}
+}
+
+@report{stoufferGuideIndustrialControl2015,
+  title = {Guide to {{Industrial Control Systems}} ({{ICS}}) {{Security}}},
+  author = {Stouffer, Keith and Lightman, Suzanne and Pillitteri, Victoria and Abrams, Marshall and Hahn, Adam},
+  date = {2015-06-03},
+  number = {NIST Special Publication (SP) 800-82 Rev. 2},
+  institution = {{National Institute of Standards and Technology}},
+  doi = {10.6028/NIST.SP.800-82r2},
+  url = {https://csrc.nist.gov/pubs/sp/800/82/r2/final},
+  urldate = {2023-09-27},
+  abstract = {This document provides guidance on how to secure Industrial Control Systems (ICS), including Supervisory Control and Data Acquisition (SCADA) systems, Distributed Control Systems (DCS), and other control system configurations such as Programmable Logic Controllers (PLC), while addressing their unique performance, reliability, and safety requirements. The document provides an overview of ICS and typical system topologies, identifies typical threats and vulnerabilities to these systems, and provides recommended security countermeasures to mitigate the associated risks.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/E9PTQMA4/Stouffer et al. - 2015 - Guide to Industrial Control Systems (ICS) Security.pdf}
+}
+
+@report{StrategyCyberPhysicalResilience,
+  title = {Strategy for {{Cyber-Physical Resilience}}:  {{Fortifying}} Our {{Critical Infrastructure}} for a {{Digital World}}},
+  file = {/home/danesabo/Zotero/storage/J5F24YH2/PCAST_Cyber-Physical-Resilience-Report_Feb2024.pdf}
+}
+
+@article{StructureInterpretationComputer1997,
+  title = {Structure and Interpretation of Computer Programs, (Second Edition)},
+  date = {1997-02},
+  journaltitle = {Computers \& Mathematics with Applications},
+  shortjournal = {Computers \& Mathematics with Applications},
+  volume = {33},
+  number = {4},
+  pages = {133},
+  issn = {08981221},
+  doi = {10.1016/S0898-1221(97)90051-1},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0898122197900511},
+  urldate = {2024-02-01},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/KATDRK86/1997 - Structure and interpretation of computer programs,.pdf}
+}
+
+@online{StuxnetOriginsSCADA2020,
+  title = {Stuxnet and {{Beyond}}: {{The Origins}} of {{SCADA}} and {{Vulnerabilities}} to {{Critical Infrastructure}} - {{HS Today}}},
+  shorttitle = {Stuxnet and {{Beyond}}},
+  date = {2020-12-08T16:38:15+00:00},
+  url = {https://www.hstoday.us/federal-pages/dhs/stuxnet-and-beyond-the-origins-of-scada-and-vulnerabilities-to-critical-infrastructure/},
+  urldate = {2022-04-02},
+  abstract = {Many understand this growing threat to industrial control systems but don’t know the origins of a key attack vector.},
+  langid = {american}
+}
+
+@article{sulamanComparisonFMEASTPA2019,
+  title = {Comparison of the {{FMEA}} and {{STPA}} Safety Analysis Methods–a Case Study},
+  author = {Sulaman, Sardar Muhammad and Beer, Armin and Felderer, Michael and Höst, Martin},
+  date = {2019-03},
+  journaltitle = {Software Quality Journal},
+  shortjournal = {Software Qual J},
+  volume = {27},
+  number = {1},
+  pages = {349--387},
+  issn = {0963-9314, 1573-1367},
+  doi = {10.1007/s11219-017-9396-0},
+  url = {http://link.springer.com/10.1007/s11219-017-9396-0},
+  urldate = {2023-11-03},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/ULVDPRDS/Sulaman et al. - 2019 - Comparison of the FMEA and STPA safety analysis me.pdf}
+}
+
+@article{sullereyDesignGuidelinesFormal,
+  title = {Design {{Guidelines}} for {{Formal Verification}}},
+  author = {Sullerey, Anamaya},
+  abstract = {Improvement in capacity and usability of EDA tools has helped in pushing the formal verification envelope. Capacity still remains the major limiting factor in the scope of formal verification deployment. Formal verification experts employ a variety of techniques to overcome this challenge. Design and implementation choices made by the designers greatly influences the effectiveness of these techniques as well as ease with which they can be applied. Most designers are not exposed to the formal verification process. This paper proposes design guidelines that facilitate application of formal verification on large blocks.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/4BY2LV8B/Sullerey - Design Guidelines for Formal Verification.pdf}
+}
+
+@article{sultanMomentsGeneralizedComplex1994,
+  title = {Moments of the {{Generalized Complex Matrix-Variate Normal Distribution}}},
+  author = {Sultan, Shagufta A and Tracy, Derrick S},
+  date = {1994},
+  journaltitle = {Int. J. Math. Statist. Sci.},
+  volume = {3},
+  number = {2},
+  pages = {217--239},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/8RQGTQT9/Sultan and Tracy - MOMENTS OF THE GENERALIZED COMPLEX MATRIX-VARIATE .pdf}
+}
+
+@article{sunCyberSecurityPower2018,
+  title = {Cyber Security of a Power Grid: {{State-of-the-art}}},
+  shorttitle = {Cyber Security of a Power Grid},
+  author = {Sun, Chih-Che and Hahn, Adam and Liu, Chen-Ching},
+  date = {2018},
+  journaltitle = {International Journal of Electrical Power \textbackslash\& Energy Systems},
+  shortjournal = {Int. J. Electr. Power Energy Syst.},
+  volume = {99},
+  pages = {45--56},
+  publisher = {Elsevier Sci Ltd},
+  location = {Oxford},
+  issn = {0142-0615},
+  doi = {10.1016/j.ijepes.2017.12.020},
+  url = {http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&amp;SrcAuth=DOISource&amp;SrcApp=WOS&amp;KeyAID=10.1016%2Fj.ijepes.2017.12.020&amp;DestApp=DOI&amp;SrcAppSID=8COHllwH67CX3cigLe5&amp;SrcJTitle=INTERNATIONAL+JOURNAL+OF+ELECTRICAL+POWER+%26+ENERGY+SYSTEMS&amp;DestDOIRegistrantName=Elsevier},
+  urldate = {2022-03-08},
+  abstract = {The integration of computing and communication capabilities with the power grid has led to numerous vulnerabilities in the cyber-physical system (CPS). This cyber security threat can significantly impact the physical infrastructure, economy, and society. In traditional IT environments, there are already abundant attack cases demonstrating that unauthorized users have the capability to access and manipulate sensitive data from a protected network domain. Electric power grids have also heavily adopted information technology (IT) to perform real-time control, monitoring, and maintenance tasks. In 2015, a sophisticated cyber attack targeted Ukrainian's power grid causing wide area power outages. It highlights the importance of investment on cyber security against intruders. This paper provides a state-of-the-art survey of the most relevant cyber security studies in power systems. It reviews research that demonstrates cyber security risks and constructs solutions to enhance the security of a power grid. To achieve this goal, this paper covers: (1) a survey of the state-of-the-art smart grid technologies, (2) power industry practices and standards, (3) solutions that address cyber security issues, (4) a review of existing CPS testbeds for cyber security research, and (5) unsolved cyber security problems. Power grid cyber security research has been conducted at Washington State University (WSU) with a hardware-in-a-loop CPS testbed. A demonstration is provided to show how the proposed defense systems can be deployed to protect a power grid against cyber intruders.},
+  langid = {english},
+  keywords = {DGC read,key},
+  annotation = {WOS:000430770600004},
+  file = {/home/danesabo/Zotero/storage/T2I2DIYT/Sun et al. - 2018 - Cyber security of a power grid State-of-the-art.pdf}
+}
+
+@article{sundeCalculationNeutronNoise2017,
+  title = {Calculation of the {{Neutron Noise Induced}} by {{Shell-Mode Core-Barrel Vibrations}} in a 1-{{D}}, {{Two-Group}}, {{Two-Region Slab Reactor Model}}},
+  author = {Sunde, Carl and Demazière, Christophe and Pázsit, Imre},
+  date = {2017},
+  journaltitle = {Nuclear Technology},
+  volume = {154},
+  number = {2},
+  pages = {129--141},
+  issn = {0029-5450 1943-7471},
+  doi = {10.13182/nt06-1},
+  url = {https://www.tandfonline.com/doi/abs/10.13182/NT06-1},
+  abstract = {The subject of this paper is the calculation of the in-core neutron noise induced by the shell-mode vibrations of the core barrel. The original motivation was to investigate whether an out-of-phase behavior can exist between the in-core and ex-core (ex-vessel) detectors lying at the same azimuthal position. To this end, a two-region two-group diffusion model was used in one dimension. The noise was calculated by representing the vibrations of the core barrel by a model developed earlier to describe control rod vibrations. It was found that such an out-of-phase behavior indeed exists, although only for in-core detector positions close to the core boundary. This behavior is due to the local component of the noise, which is accounted for in a two-group treatment. The finding is in accordance with the experiment whose result prompted the present work. In addition to its effect on the phase, the local component also manifests itself by a large amplitude of the noise around the vibrating core boundary, i.e., in both the core and the reflector. The appearance and the properties of the local component of the neutron noise for core-barrel vibrations is the main finding of this paper. The results suggest that the efficiency of core-barrel vibrations can be enhanced if in addition to the ex-core detectors, the in-core detectors in the outermost fuel assemblies are used.}
+}
+
+@online{sunSoKAttacksIndustrial2021,
+  title = {{{SoK}}: {{Attacks}} on {{Industrial Control Logic}} and {{Formal Verification-Based Defenses}}},
+  shorttitle = {{{SoK}}},
+  author = {Sun, Ruimin and Mera, Alejandro and Lu, Long and Choffnes, David},
+  date = {2021-03-23},
+  eprint = {2006.04806},
+  eprinttype = {arXiv},
+  eprintclass = {cs},
+  url = {http://arxiv.org/abs/2006.04806},
+  urldate = {2022-05-16},
+  abstract = {Programmable Logic Controllers (PLCs) play a critical role in the industrial control systems. Vulnerabilities in PLC programs might lead to attacks causing devastating consequences to the critical infrastructure, as shown in Stuxnet and similar attacks. In recent years, we have seen an exponential increase in vulnerabilities reported for PLC control logic. Looking back on past research, we found extensive studies explored control logic modification attacks, as well as formal verification-based security solutions.},
+  langid = {english},
+  pubstate = {prepublished},
+  note = {Comment: 18 pages w/ ref, Sok, PLC, ICS, CPS, attack, formal verification
+\par
+Comment: 18 pages w/ ref, Sok, PLC, ICS, CPS, attack, formal verification
+\par
+Comment: 18 pages w/ ref, Sok, PLC, ICS, CPS, attack, formal verification},
+  file = {/home/danesabo/Zotero/storage/T9L6LJMI/Sun et al. - 2021 - SoK Attacks on Industrial Control Logic and Forma.pdf;/home/danesabo/Zotero/storage/VSLPZVKJ/Sun et al. - 2021 - SoK Attacks on Industrial Control Logic and Forma.pdf;/home/danesabo/Zotero/storage/4KZGCWIW/2006.html}
+}
+
+@article{symb,
+  title = {The {{Comprehensive LaTeX Symbol List}}},
+  author = {Pakin, Scott},
+  pages = {164},
+  abstract = {This document lists 5913 symbols and the corresponding LATEX commands that produce them. Some of these symbols are guaranteed to be available in every LATEX 2ε system; others require fonts and packages that may not accompany a given distribution and that therefore need to be installed. All of the fonts and packages used to prepare this document—as well as this document itself—are freely available from the Comprehensive TEX Archive Network (http://www.ctan.org/).},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/29UT8IGL/Pakin - The Comprehensive LaTeX Symbol List.pdf}
+}
+
+@online{SystematizingSoK,
+  title = {Systematizing {{SoK}}},
+  url = {https://oaklandsok.github.io/},
+  urldate = {2023-10-03},
+  file = {/home/danesabo/Zotero/storage/JBY8Y4W4/oaklandsok.github.io.html}
+}
+
+@online{SystemizationKnowledgeGuidelines,
+  title = {Systemization of {{Knowledge}} Guidelines},
+  shorttitle = {Http},
+  url = {http://jsys.org/type_SoK/},
+  urldate = {2023-10-04},
+  abstract = {Journal of Systems Research},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/76UMW92F/type_SoK.html}
+}
+
+@inproceedings{szegedyGoingDeeperConvolutions2015,
+  title = {Going Deeper with Convolutions},
+  booktitle = {2015 {{IEEE Conference}} on {{Computer Vision}} and {{Pattern Recognition}} ({{CVPR}})},
+  author = {Szegedy, Christian and {Wei Liu} and {Yangqing Jia} and Sermanet, Pierre and Reed, Scott and Anguelov, Dragomir and Erhan, Dumitru and Vanhoucke, Vincent and Rabinovich, Andrew},
+  date = {2015-06},
+  pages = {1--9},
+  publisher = {IEEE},
+  location = {Boston, MA, USA},
+  doi = {10.1109/CVPR.2015.7298594},
+  url = {http://ieeexplore.ieee.org/document/7298594/},
+  urldate = {2023-10-11},
+  abstract = {We propose a deep convolutional neural network architecture codenamed Inception that achieves the new state of the art for classification and detection in the ImageNet Large-Scale Visual Recognition Challenge 2014 (ILSVRC14). The main hallmark of this architecture is the improved utilization of the computing resources inside the network. By a carefully crafted design, we increased the depth and width of the network while keeping the computational budget constant. To optimize quality, the architectural decisions were based on the Hebbian principle and the intuition of multi-scale processing. One particular incarnation used in our submission for ILSVRC14 is called GoogLeNet, a 22 layers deep network, the quality of which is assessed in the context of classification and detection.},
+  eventtitle = {2015 {{IEEE Conference}} on {{Computer Vision}} and {{Pattern Recognition}} ({{CVPR}})},
+  isbn = {978-1-4673-6964-0},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/NKF8H67U/Szegedy et al. - 2015 - Going deeper with convolutions.pdf}
+}
+
+@inproceedings{szekeresSoKEternalWar2013,
+  title = {{{SoK}}: {{Eternal War}} in {{Memory}}},
+  shorttitle = {{{SoK}}},
+  booktitle = {2013 {{IEEE Symposium}} on {{Security}} and {{Privacy}}},
+  author = {Szekeres, László and Payer, Mathias and Wei, Tao and Song, Dawn},
+  date = {2013-05},
+  pages = {48--62},
+  issn = {1081-6011},
+  doi = {10.1109/SP.2013.13},
+  url = {https://ieeexplore.ieee.org/abstract/document/6547101?casa_token=BS-5MJ0vLmIAAAAA:zbQEgMfdsqfRXpxxi0C6R7go0gaaCAcHsF9WLHt91MdiFDWvo4NS8Xbh7fDNJh44ZI-IarctggU},
+  urldate = {2023-10-03},
+  abstract = {Memory corruption bugs in software written in low-level languages like C or C++ are one of the oldest problems in computer security. The lack of safety in these languages allows attackers to alter the program's behavior or take full control over it by hijacking its control flow. This problem has existed for more than 30 years and a vast number of potential solutions have been proposed, yet memory corruption attacks continue to pose a serious threat. Real world exploits show that all currently deployed protections can be defeated. This paper sheds light on the primary reasons for this by describing attacks that succeed on today's systems. We systematize the current knowledge about various protection techniques by setting up a general model for memory corruption attacks. Using this model we show what policies can stop which attacks. The model identifies weaknesses of currently deployed techniques, as well as other proposed protections enforcing stricter policies. We analyze the reasons why protection mechanisms implementing stricter polices are not deployed. To achieve wide adoption, protection mechanisms must support a multitude of features and must satisfy a host of requirements. Especially important is performance, as experience shows that only solutions whose overhead is in reasonable bounds get deployed. A comparison of different enforceable policies helps designers of new protection mechanisms in finding the balance between effectiveness (security) and efficiency. We identify some open research problems, and provide suggestions on improving the adoption of newer techniques.},
+  eventtitle = {2013 {{IEEE Symposium}} on {{Security}} and {{Privacy}}},
+  file = {/home/danesabo/Zotero/storage/IZY5CZDT/Szekeres et al. - 2013 - SoK Eternal War in Memory.pdf;/home/danesabo/Zotero/storage/3IMIIH6S/6547101.html}
+}
+
+@inproceedings{sztipanovitsDesignToolChain2015,
+  title = {Design Tool Chain for Cyber-Physical Systems: Lessons Learned},
+  shorttitle = {Design Tool Chain for Cyber-Physical Systems},
+  booktitle = {Proceedings of the 52nd {{Annual Design Automation Conference}}},
+  author = {Sztipanovits, Janos and Bapty, Ted and Neema, Sandeep and Koutsoukos, Xenofon and Jackson, Ethan},
+  date = {2015-06-07},
+  pages = {1--6},
+  publisher = {ACM},
+  location = {San Francisco California},
+  doi = {10.1145/2744769.2747922},
+  url = {https://dl.acm.org/doi/10.1145/2744769.2747922},
+  urldate = {2023-11-08},
+  abstract = {Design automation tools evolved to support the principle of "separation of concerns" to manage engineering complexity. Accordingly, we find tool suites that are vertically integrated with limited support (even intention) for horizontal integratability (i.e. integration across disciplinary boundaries). CPS challenges these established boundaries and with this - market conditions. The question is how to facilitate reorganization and create the foundation and technologies for composable CPS design tool chains that enables reuse of existing commercial and open source tools? In this paper we describe some of the lessons learned in the design and implementation of a design automation tool suite for complex cyber-physical systems (CPS) in the vehicle domain. The tool suite followed a model- and component-based design approach to match the significant increase in design productivity experienced in several narrowly focused homogeneous domains, such as signal processing, control and aspects of electronic design. The primary challenge in the undertaking was the tremendous heterogeneity of complex cyber-physical systems (CPS), where such as vehicles has not yet been achieved. This paper describes some of the challenges addressed and solution approaches to building a comprehensive design tool suite for complex CPS.},
+  eventtitle = {{{DAC}} '15: {{The}} 52nd {{Annual Design Automation Conference}} 2015},
+  isbn = {978-1-4503-3520-1},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/PZWKS6V3/Sztipanovits et al. - 2015 - Design tool chain for cyber-physical systems less.pdf}
+}
+
+@article{tables-tips,
+  title = {{{LaTeX Table Hints}} and {{Tips}}},
+  author = {Robson, Adrian P},
+  pages = {16},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/EIZ7H64M/Robson - LaTeX Table Hints and Tips.pdf}
+}
+
+@online{TALIROTOOLS,
+  title = {{{TALIRO-TOOLS}}},
+  url = {https://sites.google.com/a/asu.edu/s-taliro/},
+  urldate = {2023-10-13},
+  abstract = {TALIRO (TemporAl LogIC RObustness) tools is a suit of tools for the analysis of continuous and hybrid dynamical systems using linear time temporal logics.}
+}
+
+@article{tangeSystematicSurveyIndustrial2020,
+  title = {A {{Systematic Survey}} of {{Industrial Internet}} of {{Things Security}}: {{Requirements}} and {{Fog Computing Opportunities}}},
+  shorttitle = {A {{Systematic Survey}} of {{Industrial Internet}} of {{Things Security}}},
+  author = {Tange, Koen and De Donno, Michele and Fafoutis, Xenofon and Dragoni, Nicola},
+  date = {2020-24},
+  journaltitle = {IEEE Communications Surveys \& Tutorials},
+  shortjournal = {IEEE Commun. Surv. Tutorials},
+  volume = {22},
+  number = {4},
+  pages = {2489--2520},
+  issn = {1553-877X, 2373-745X},
+  doi = {10.1109/COMST.2020.3011208},
+  url = {https://ieeexplore.ieee.org/document/9146364/},
+  urldate = {2022-09-30},
+  abstract = {A key application of the Internet of Things (IoT) paradigm lies within industrial contexts. Indeed, the emerging Industrial Internet of Things (IIoT), commonly referred to as Industry 4.0, promises to revolutionize production and manufacturing through the use of large numbers of networked embedded sensing devices, and the combination of emerging computing technologies, such as Fog/Cloud Computing and Artificial Intelligence. The IIoT is characterized by an increased degree of inter-connectivity, which not only creates opportunities for the industries that adopt it, but also for cyber-criminals. Indeed, IoT security currently represents one of the major obstacles that prevent the widespread adoption of IIoT technology. Unsurprisingly, such concerns led to an exponential growth of published research over the last few years. To get an overview of the field, we deem it important to systematically survey the academic literature so far, and distill from it various security requirements as well as their popularity. This paper consists of two contributions: our primary contribution is a systematic review of the literature over the period 2011-2019 on IIoT Security, focusing in particular on the security requirements of the IIoT. Our secondary contribution is a reflection on how the relatively new paradigm of Fog computing can be leveraged to address these requirements, and thus improve the security of the IIoT.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/TPCXRCVV/Tange et al. - 2020 - A Systematic Survey of Industrial Internet of Thin.pdf}
+}
+
+@article{taoDigitalTwinIndustry2019,
+  title = {Digital {{Twin}} in {{Industry}}: {{State-of-the-Art}}},
+  shorttitle = {Digital {{Twin}} in {{Industry}}},
+  author = {Tao, Fei and Zhan, He and Liu, Ang and Nee, A. Y. C.},
+  date = {2019-04},
+  journaltitle = {Ieee Transactions on Industrial Informatics},
+  shortjournal = {IEEE Trans. Ind. Inform.},
+  volume = {15},
+  number = {4},
+  pages = {2405--2415},
+  publisher = {Ieee-Inst Electrical Electronics Engineers Inc},
+  location = {Piscataway},
+  issn = {1551-3203},
+  doi = {10.1109/TII.2018.2873186},
+  url = {http://www.webofscience.com/wos/woscc/summary/marked/relevance/1},
+  urldate = {2022-03-08},
+  abstract = {Digital twin (DT) is one of the most promising enabling technologies for realizing smart manufacturing and Industry 4.0. DTs are characterized by the seamless integration between the cyber and physical spaces. The importance of DTs is increasingly recognized by both academia and industry. It has been almost 15 years since the concept of the DT was initially proposed. To date, many DT applications have been successfully implemented in different industries, including product design, production, prognostics and health management, and some other fields. However, at present, no paper has focused on the review of DT applications in industry. In an effort to understand the development and application of DTs in industry, this paper thoroughly reviews the state-of-the-art of the DT research concerning the key components of DTs, the current development of DTs, and the major DT applications in industry. This paper also outlines the current challenges and some possible directions for future work.},
+  langid = {english},
+  keywords = {key},
+  annotation = {WOS:000467095500054},
+  file = {/home/danesabo/Zotero/storage/XXJFN5SS/Tao et al. - 2019 - Digital Twin in Industry State-of-the-Art.pdf}
+}
+
+@article{taoRobustFuzzyControl2005,
+  title = {Robust Fuzzy Control for a Plant with Fuzzy Linear Model},
+  author = {Tao, C.W. and Taur, J.S.},
+  date = {2005-02},
+  journaltitle = {IEEE Transactions on Fuzzy Systems},
+  volume = {13},
+  number = {1},
+  pages = {30--41},
+  issn = {1941-0034},
+  doi = {10.1109/TFUZZ.2004.839653},
+  url = {https://ieeexplore.ieee.org/abstract/document/1392998},
+  urldate = {2024-07-10},
+  abstract = {A robust complexity reduced proportional-integral-derivative (PID)-like fuzzy controllers is designed for a plant with fuzzy linear model. The plant model is described with the expert's linguistic information involved. The linguistic information for the plant model is represented as fuzzy sets. In order to design a robust fuzzy controller for a plant model with fuzzy sets, an approach is developed to implement the best crisp approximation of fuzzy sets into intervals. Then, Kharitonov's Theorem is applied to construct a robust fuzzy controller for the fuzzy uncertain plant with interval model. With the linear combination of input variables as a new input variable, the complexity of the fuzzy mechanism of PID-like fuzzy controller is significantly reduced. The parameters in the robust fuzzy controller are determined to satisfy the stability conditions. The robustness of the designed fuzzy controller is discussed. Also, with the provided definition of relative robustness, the robustness of the complexity reduced fuzzy controller is compared to the classical PID controller for a second-order plant with fuzzy linear model. The simulation results are included to show the effectiveness of the designed PID-like robust fuzzy controller with the complexity reduced fuzzy mechanism.},
+  eventtitle = {{{IEEE Transactions}} on {{Fuzzy Systems}}},
+  keywords = {Aerodynamics,Fuzzy control,Fuzzy linear model,Fuzzy sets,Input variables,Mathematical model,Proportional control,Robust control,robust fuzzy controller,Robust stability,Sliding mode control,Uncertainty},
+  file = {/home/danesabo/Zotero/storage/3YPS56DA/Tao and Taur - 2005 - Robust fuzzy control for a plant with fuzzy linear.pdf}
+}
+
+@article{taoRobustFuzzyControl2005a,
+  title = {Robust Fuzzy Control for a Plant with Fuzzy Linear Model},
+  author = {Tao, C.W. and Taur, J.S.},
+  date = {2005-02},
+  journaltitle = {IEEE Transactions on Fuzzy Systems},
+  shortjournal = {IEEE Trans. Fuzzy Syst.},
+  volume = {13},
+  number = {1},
+  pages = {30--41},
+  issn = {1063-6706},
+  doi = {10.1109/TFUZZ.2004.839653},
+  url = {http://ieeexplore.ieee.org/document/1392998/},
+  urldate = {2024-08-30}
+}
+
+@article{taoRobustFuzzyControl2005b,
+  title = {Robust Fuzzy Control for a Plant with Fuzzy Linear Model},
+  author = {Tao, C.W. and Taur, J.S.},
+  date = {2005-02},
+  journaltitle = {IEEE Transactions on Fuzzy Systems},
+  volume = {13},
+  number = {1},
+  pages = {30--41},
+  issn = {1941-0034},
+  doi = {10.1109/TFUZZ.2004.839653},
+  url = {https://ieeexplore.ieee.org/document/1392998/?arnumber=1392998},
+  urldate = {2024-08-30},
+  abstract = {A robust complexity reduced proportional-integral-derivative (PID)-like fuzzy controllers is designed for a plant with fuzzy linear model. The plant model is described with the expert's linguistic information involved. The linguistic information for the plant model is represented as fuzzy sets. In order to design a robust fuzzy controller for a plant model with fuzzy sets, an approach is developed to implement the best crisp approximation of fuzzy sets into intervals. Then, Kharitonov's Theorem is applied to construct a robust fuzzy controller for the fuzzy uncertain plant with interval model. With the linear combination of input variables as a new input variable, the complexity of the fuzzy mechanism of PID-like fuzzy controller is significantly reduced. The parameters in the robust fuzzy controller are determined to satisfy the stability conditions. The robustness of the designed fuzzy controller is discussed. Also, with the provided definition of relative robustness, the robustness of the complexity reduced fuzzy controller is compared to the classical PID controller for a second-order plant with fuzzy linear model. The simulation results are included to show the effectiveness of the designed PID-like robust fuzzy controller with the complexity reduced fuzzy mechanism.},
+  eventtitle = {{{IEEE Transactions}} on {{Fuzzy Systems}}},
+  keywords = {Aerodynamics,Fuzzy control,Fuzzy linear model,Fuzzy sets,Input variables,Mathematical model,Proportional control,Robust control,robust fuzzy controller,Robust stability,Sliding mode control,Uncertainty},
+  file = {/home/danesabo/Zotero/storage/N5C6ILB6/Tao and Taur - 2005 - Robust fuzzy control for a plant with fuzzy linear.pdf;/home/danesabo/Zotero/storage/W2MJ8X2B/1392998.html}
+}
+
+@misc{tcolorbox,
+  title = {Tcolorbox {{Package}}},
+  file = {/home/danesabo/Zotero/storage/6PN2AWJK/tcolorbox.pdf}
+}
+
+@inproceedings{teigeTwoDecadesFormal2021,
+  title = {Two {{Decades}} of {{Formal Methods}} in {{Industrial Products}} at {{BTC Embedded Systems}}},
+  booktitle = {Formal {{Methods}}},
+  author = {Teige, Tino and Eggers, Andreas and Scheibler, Karsten and Stasch, Matthias and Brockmeyer, Udo and Holberg, Hans J. and Bienmüller, Tom},
+  editor = {Huisman, Marieke and Păsăreanu, Corina and Zhan, Naijun},
+  date = {2021},
+  series = {Lecture {{Notes}} in {{Computer Science}}},
+  pages = {725--729},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-030-90870-6_40},
+  abstract = {Over the last two decades, we at BTC Embedded Systems have collected experience with various applications of formal methods in our products together with our industrial partners and customers. In this paper, we give an overview of these fields of applications.},
+  isbn = {978-3-030-90870-6},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/WQNPQIWI/Teige et al. - 2021 - Two Decades of Formal Methods in Industrial Produc.pdf}
+}
+
+@article{terbeekFormalMethodsTools2022,
+  title = {Formal Methods and Tools for Industrial Critical Systems},
+  author = {Ter Beek, Maurice H. and Larsen, Kim G. and Ničković, Dejan and Willemse, Tim A. C.},
+  date = {2022-06},
+  journaltitle = {International Journal on Software Tools for Technology Transfer},
+  shortjournal = {Int J Softw Tools Technol Transfer},
+  volume = {24},
+  number = {3},
+  pages = {325--330},
+  issn = {1433-2779, 1433-2787},
+  doi = {10.1007/s10009-022-00660-4},
+  url = {https://link.springer.com/10.1007/s10009-022-00660-4},
+  urldate = {2023-10-10},
+  abstract = {Formal methods and tools have become well established and widely applied to ensure the correctness of fundamental components of industrial critical systems in domains like railways, avionics and automotive. In this Introduction to the special issue, we outline a number of recent achievements concerning the use of formal methods and tools for the specification and verification of critical systems from a variety of industrial domains. These achievements are represented by eight properly revised and extended versions of papers that were selected from the 24th and 25th International Conference on Formal Methods for Industrial Critical Systems (FMICS 2019 and FMICS 2020).},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/CI4DN5JM/Ter Beek et al. - 2022 - Formal methods and tools for industrial critical s.pdf}
+}
+
+@article{thalerProofsArgumentsZeroKnowledge,
+  title = {Proofs, {{Arguments}}, and {{Zero-Knowledge}}},
+  author = {Thaler, Justin},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/2W727EK4/Thaler - Proofs, Arguments, and Zero-Knowledge.pdf}
+}
+
+@article{thieCoreMotionMonitoring1979,
+  title = {Core {{Motion Monitoring}}},
+  author = {Thie, Joseph A},
+  date = {1979},
+  journaltitle = {Nuclear technology},
+  volume = {45},
+  number = {1},
+  pages = {5--45},
+  publisher = {Taylor \& Francis},
+  issn = {0029-5450},
+  doi = {10.13182/NT79-A32283},
+  abstract = {Experimental methods for detecting types of motion within and surrounding reactor cores were employed, including the dominating influence of noise analysis techniques and the associated theoretical bases underlying these methods. Out of extensive tabulations of demonstrated applications, particular attention was given to specific methods for measuring core barrel motions, in-core instrument vibrations, steam void velocity, fuel motions, and control rod vibrations. Selected features of types of in-vessel motion monitoring programs found in commercial power reactors were noted along with their motivations. Advantages and disadvantages can be cited for specific techniques.}
+}
+
+@misc{tikz,
+  title = {{{TikZ Manual}}},
+  file = {/home/danesabo/Zotero/storage/CGT7IB7B/tikzpgfmanual.pdf}
+}
+
+@article{titlesec,
+  title = {Titlesec, Titleps and Titletoc {{Packages}}},
+  author = {Bezos, Javier},
+  pages = {24},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/MLUHA9EQ/Bezos - The titlesec, titleps and titletoc Packages.pdf}
+}
+
+@inreference{TLA2023,
+  title = {{{TLA}}{\textsuperscript{+}}},
+  booktitle = {Wikipedia},
+  date = {2023-12-24T12:43:03Z},
+  url = {https://en.wikipedia.org/w/index.php?title=TLA%2B&oldid=1191589904},
+  urldate = {2024-01-28},
+  abstract = {TLA+ is a formal specification language developed by Leslie Lamport. It is used for designing, modelling, documentation, and verification of programs, especially concurrent systems and distributed systems. TLA+ is considered to be exhaustively-testable pseudocode, and its use likened to drawing blueprints for software systems; TLA is an acronym for Temporal Logic of Actions. For design and documentation, TLA+ fulfills the same purpose as informal technical specifications. However, TLA+ specifications are written in a formal language of logic and mathematics, and the precision of specifications written in this language is intended to uncover design flaws before system implementation is underway.Since TLA+ specifications are written in a formal language, they are amenable to finite model checking. The model checker finds all possible system behaviours up to some number of execution steps, and examines them for violations of desired invariance properties such as safety and liveness. TLA+ specifications use basic set theory to define safety (bad things won't happen) and temporal logic to define liveness (good things eventually happen). TLA+ is also used to write machine-checked proofs of correctness both for algorithms and mathematical theorems. The proofs are written in a declarative, hierarchical style independent of any single theorem prover backend. Both formal and informal structured mathematical proofs can be written in TLA+; the language is similar to LaTeX, and tools exist to translate TLA+ specifications to LaTeX documents.TLA+ was introduced in 1999, following several decades of research into a verification method for concurrent systems. Ever since, a toolchain has been developed, including an IDE and a distributed model checker. The pseudocode-like language PlusCal was created in 2009; it transpiles to TLA+ and is useful for specifying sequential algorithms. TLA+2 was announced in 2014, expanding language support for proof constructs. The current TLA+ reference is The TLA+ Hyperbook by Leslie Lamport.},
+  annotation = {Page Version ID: 1191589904}
+}
+
+@article{tomlinComputationalTechniquesVerification2003,
+  title = {Computational Techniques for the Verification of Hybrid Systems},
+  author = {Tomlin, C.J. and Mitchell, I. and Bayen, A.M. and Oishi, M.},
+  date = {2003-07},
+  journaltitle = {Proceedings of the IEEE},
+  shortjournal = {Proc. IEEE},
+  volume = {91},
+  number = {7},
+  pages = {986--1001},
+  issn = {0018-9219},
+  doi = {10.1109/JPROC.2003.814621},
+  url = {http://ieeexplore.ieee.org/document/1215682/},
+  urldate = {2023-10-23},
+  abstract = {Hybrid system theory lies at the intersection of the fields of engineering control theory and computer science verification. It is defined as the modeling, analysis, and control of systems which involve the interaction of both discrete state systems, represented by finite automata, and continuous state dynamics, represented by differential equations. The embedded autopilot of a modern commercial jet is a prime example of a hybrid system: the autopilot modes correspond to the application of different control laws, and the logic of mode switching is determined by the continuous state dynamics of the aircraft, as well as through interaction with the pilot. To understand the behavior of hybrid systems, to simulate, and to control these systems, theoretical advances, analyses, and numerical tools are needed. In this paper, we first present a general model for a hybrid system along with an overview of methods for verifying continuous and hybrid systems. We describe a particular verification technique for hybrid systems, based on two-person zero-sum game theory for automata and continuous dynamical systems. We then outline a numerical implementation of this technique using level set methods, and we demonstrate its use in the design and analysis of aircraft collision avoidance protocols, and in verification of autopilot logic.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/SLWJMVUN/Tomlin et al. - 2003 - Computational techniques for the verification of h.pdf;/home/danesabo/Zotero/storage/U27XE389/Tomlin et al. - 2003 - Computational techniques for the verification of h.pdf}
+}
+
+@article{tomlinSafetyVerificationConflict2001,
+  title = {Safety Verification of Conflict Resolution Manoeuvres},
+  author = {Tomlin, C. and Mitchell, I. and Ghosh, R.},
+  date = {2001-06},
+  journaltitle = {IEEE Transactions on Intelligent Transportation Systems},
+  shortjournal = {IEEE Trans. Intell. Transport. Syst.},
+  volume = {2},
+  number = {2},
+  pages = {110--120},
+  issn = {15249050},
+  doi = {10.1109/6979.928722},
+  url = {http://ieeexplore.ieee.org/document/928722/},
+  urldate = {2023-10-27},
+  abstract = {We address the problem of generating provably-safe conflict resolution maneuvers for aircraft in uncertain environments. We assume that a maneuver is composed of a sequence of flight modes, which are segments of constant heading, of constant bank angle, or of constant airspeed. Each of these flight modes has associated to it the kinematics of the aircraft, and hence the maneuver is a hybrid system. While the flight modes are defined ahead of time, their sequencing and parameter values do not necessarily have to be. We present an algorithm for generating provably safe maneuvers, which is based on a general procedure for designing controllers for hybrid systems. The result is a maneuver, proven to be safe within the limits of the models used, which is a familiar sequence of commands easily executable by the flight management systems. The maneuvers may be viewed as protocols, or “rules of the road”, and are well-defined for each conflict scenario. We present results for two example maneuvers.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/9KKJKVRS/Tomlin et al. - 2001 - Safety verification of conflict resolution manoeuv.pdf}
+}
+
+@online{ToolboxLevelSet,
+  title = {A {{Toolbox}} of {{Level Set Methods}}},
+  url = {https://pdfs.semanticscholar.org/f7f4/aa142f6beff42a95d6254289400a6038774e.pdf}
+}
+
+@article{topperModelBasedSystemsEngineering2013,
+  title = {Model-{{Based Systems Engineering}} in {{Support}} of {{Complex Systems Development}}},
+  author = {Topper, J. Stephen and Horner, Nathaniel C.},
+  date = {2013},
+  journaltitle = {JOHNS HOPKINS APL TECHNICAL DIGEST},
+  shortjournal = {Johns Hopkins APL Tech. Dig.},
+  volume = {32},
+  number = {1},
+  pages = {419--432},
+  publisher = {Johns Hopkins Univ Applied Physics Laboratory Llc},
+  location = {Laurel},
+  issn = {0270-5214, 1930-0530},
+  url = {https://www.webofscience.com/wos/woscc/summary/563bee91-8c90-4554-ae8d-46c3ce0028ee-a808dfa0/relevance/1},
+  urldate = {2023-10-03},
+  abstract = {Model-based systems engineering techniques facilitate complex system design and documentation processes. A rigorous, iterative conceptual development process based on the Unified Modeling Language (UML) or the Systems Modeling Language (SysML) and consisting of domain modeling, use case development, and behavioral and structural modeling supports design, architecting, analysis, modeling and simulation, test and evaluation, and program management activities. The resulting model is more useful than traditional documentation because it represents structure, data, and functions, along with associated documentation, in a multidimensional, navigable format. Beyond benefits to project documentation and stakeholder communication, UML- and SysML-based models also support direct analysis methods, such as functional thread extraction. The APL team is continuing to develop analysis techniques using conceptual models to reduce the risk of design and test errors, reduce costs, and improve the quality of analysis and supporting modeling and simulation activities in the development of complex systems.},
+  langid = {english},
+  pagetotal = {14},
+  keywords = {Important},
+  annotation = {Web of Science ID: WOS:000321063200005},
+  file = {/home/danesabo/Zotero/storage/F5BMARBR/Topper and Horner - 2013 - Model-Based Systems Engineering in Support of Comp.pdf}
+}
+
+@article{torbenAutomaticSimulationbasedTesting2023,
+  title = {Automatic Simulation-Based Testing of Autonomous Ships Using {{Gaussian}} Processes and Temporal Logic},
+  author = {Torben, Tobias Rye and Glomsrud, Jon Arne and Pedersen, Tom Arne and Utne, Ingrid B and Sørensen, Asgeir J},
+  date = {2023-04-01},
+  journaltitle = {Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability},
+  shortjournal = {Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability},
+  volume = {237},
+  number = {2},
+  pages = {293--313},
+  publisher = {SAGE Publications},
+  issn = {1748-006X},
+  doi = {10.1177/1748006X211069277},
+  url = {https://doi.org/10.1177/1748006X211069277},
+  urldate = {2024-07-10},
+  abstract = {A methodology for automatic simulation-based testing of control systems for autonomous vessels is proposed. The work is motivated by the need for increased test coverage and formalism in the verification efforts. It aims to achieve this by formulating requirements in the formal logic Signal Temporal Logic (STL). This enables automatic evaluation of simulations against requirements using the STL robustness metric, resulting in a robustness score for requirements satisfaction. Furthermore, the proposed method uses a Gaussian Process (GP) model for estimating robustness scores including levels of uncertainty for untested cases. The GP model is updated by running simulations and observing the resulting robustness, and its estimates are used to automatically guide the test case selection toward cases with low robustness or high uncertainty. The main scientific contribution is the development of an automatic testing method which incrementally runs new simulations until the entire parameter space of the case is covered to the desired confidence level, or until a case which falsifies the requirement is identified. The methodology is demonstrated through a case study, where the test object is a Collision Avoidance (CA) system for a small high-speed vessel. STL requirements for safety distance, mission compliance, and COLREG compliance are developed. The proposed method shows promise, by both achieving verification in feasible time and identifying falsifying behaviors which would be difficult to detect manually or using brute-force methods. An additional contribution of this work is a formalization of COLREG using temporal logic, which appears to be an interesting direction for future work.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/EQEE26WM/Torben et al. - 2023 - Automatic simulation-based testing of autonomous s.pdf}
+}
+
+@inproceedings{tothBayesianLearningSequential2020,
+  title = {Bayesian {{Learning}} from {{Sequential Data}} Using {{Gaussian Processes}} with {{Signature Covariances}}},
+  booktitle = {Proceedings of the 37th {{International Conference}} on {{Machine Learning}}},
+  author = {Toth, Csaba and Oberhauser, Harald},
+  date = {2020-11-21},
+  pages = {9548--9560},
+  publisher = {PMLR},
+  issn = {2640-3498},
+  url = {https://proceedings.mlr.press/v119/toth20a.html},
+  urldate = {2022-04-21},
+  abstract = {We develop a Bayesian approach to learning from sequential data by using Gaussian processes (GPs) with so-called signature kernels as covariance functions. This allows to make sequences of different length comparable and to rely on strong theoretical results from stochastic analysis. Signatures capture sequential structure with tensors that can scale unfavourably in sequence length and state space dimension. To deal with this, we introduce a sparse variational approach with inducing tensors. We then combine the resulting GP with LSTMs and GRUs to build larger models that leverage the strengths of each of these approaches and benchmark the resulting GPs on multivariate time series (TS) classification datasets.},
+  eventtitle = {International {{Conference}} on {{Machine Learning}}},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/QYT92IJU/Toth and Oberhauser - 2020 - Bayesian Learning from Sequential Data using Gauss.pdf;/home/danesabo/Zotero/storage/Z54Z38KT/Toth and Oberhauser - 2020 - Bayesian Learning from Sequential Data using Gauss.pdf}
+}
+
+@article{trentyOperationalFeedbackInternal1995,
+  title = {Operational Feedback on Internal Structure Vibration in 54 {{French PWRs}} during 300 Fuel Cycles},
+  author = {Trenty, A.},
+  date = {1995},
+  journaltitle = {Progress in Nuclear Energy},
+  volume = {29},
+  number = {3-4},
+  pages = {347--356},
+  issn = {01491970},
+  doi = {10.1016/0149-1970(95)00017-e},
+  url = {https://www.sciencedirect.com/science/article/abs/pii/014919709500017E?via%3Dihub},
+  abstract = {EDF has acquired extensive feedback on vibration of reactor vessel internals by analysing ex-core neutron noise on its 54 pressurized water reactors during the course of over 300 fuel cycles. This feedback has been built up by processing more than 3,000 vibratory signatures acquired since the startup of its reactors. These signatures are now centralized for the whole of France in the “SINBAD” data base. Signature processing has enabled: 1. • distinguishing between mechanical phenomena and signature variation linked to unit operation: in particular, the impact on signature level of unit operating parameters such as initial fuel enrichment and burn-up rate was assessed; 2. • among the purely mechanical phenomena, pointing up slight changes in position of vessel internals and the first signs of structural wear: relaxation (in the hold-down spring and fuel rod assemblies) and wear on surfaces of contact between internals and reactor vessel were detected; 3. • lastly and most importantly, automatic recognition of the various types of vibratory behavior of internals. It was consequently possible to draw up user requirement specifications for automated monitoring of internals, which should soon be integrated in PSAD, a system which groups several reactor monitoring functions.}
+}
+
+@inreference{TrustedComputerSystem2024,
+  title = {Trusted {{Computer System Evaluation Criteria}}},
+  booktitle = {Wikipedia},
+  date = {2024-02-25T21:38:00Z},
+  url = {https://en.wikipedia.org/w/index.php?title=Trusted_Computer_System_Evaluation_Criteria&oldid=1210281816},
+  urldate = {2024-02-29},
+  abstract = {Trusted Computer System Evaluation Criteria (TCSEC) is a United States Government Department of Defense (DoD) standard that sets basic requirements for assessing the effectiveness of computer security controls built into a computer system. The TCSEC was used to evaluate, classify, and select computer systems being considered for the processing, storage, and retrieval of sensitive or classified information.The TCSEC, frequently referred to as the Orange Book, is the centerpiece of the DoD Rainbow Series publications. Initially issued in 1983 by the National Computer Security Center (NCSC), an arm of the National Security Agency, and then updated in 1985, TCSEC was eventually replaced by the Common Criteria international standard, originally published in 2005.},
+  langid = {english},
+  annotation = {Page Version ID: 1210281816}
+}
+
+@article{tsialiamanisGenerativeModelsBasis2021,
+  title = {On Generative Models as the Basis for Digital Twins},
+  author = {Tsialiamanis, George and Wagg, David J. and Dervilis, Nikolaos and Worden, Keith},
+  date = {2021},
+  journaltitle = {Data-Centric Engineering},
+  shortjournal = {DCE},
+  volume = {2},
+  pages = {e11},
+  issn = {2632-6736},
+  doi = {10.1017/dce.2021.13},
+  url = {https://www.cambridge.org/core/product/identifier/S2632673621000137/type/journal_article},
+  urldate = {2022-03-02},
+  abstract = {A framework is proposed for generative models as a basis for digital twins or mirrors of structures. The proposal is based on the premise that deterministic models cannot account for the uncertainty present in most structural modeling applications. Two different types of generative models are considered here. The first is a physics-based model based on the stochastic finite element (SFE) method, which is widely used when modeling structures that have material and loading uncertainties imposed. Such models can be calibrated according to data from the structure and would be expected to outperform any other model if the modeling accurately captures the true underlying physics of the structure. The potential use of SFE models as digital mirrors is illustrated via application to a linear structure with stochastic material properties. For situations where the physical formulation of such models does not suffice, a datadriven framework is proposed, using machine learning and conditional generative adversarial networks (cGANs). The latter algorithm is used to learn the distribution of the quantity of interest in a structure with material nonlinearities and uncertainties. For the examples considered in this work, the data-driven cGANs model outperforms the physicsbased approach. Finally, an example is shown where the two methods are coupled such that a hybrid model approach is demonstrated.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/9FDATPBL/On generative models as the basis for digital twins.pdf}
+}
+
+@inproceedings{tsukadaToolchainModelChecking2016,
+  title = {A Toolchain on Model Checking {{SPIN}} via {{Kalman Decomposition}} for Control System Software},
+  booktitle = {2016 {{IEEE International Conference}} on {{Automation Science}} and {{Engineering}} ({{CASE}})},
+  author = {Tsukada, Kento and Sawada, Kenji and Shin, Seiichi},
+  date = {2016-08},
+  pages = {300--305},
+  publisher = {IEEE},
+  location = {Fort Worth, TX, USA},
+  doi = {10.1109/COASE.2016.7743421},
+  url = {http://ieeexplore.ieee.org/document/7743421/},
+  urldate = {2023-10-10},
+  abstract = {This paper proposes a new model checking method to detect falsification on control system software. In the previous study, we have examined a method which detects illegal rewriting for control system software via Petri Net and Kalman Decomposition (KD). In this paper, in order to divert this method to model checking, we consider a new toolchain with the existing model checker SPIN. Specifically, we develop a tool that translates Petri Net into Promela (modeling language of SPIN) and clarify that KD allows us to generate Linear Temporal Logic (LTL) formulas for SPIN automatically. In addition, we give a simple example of applying SPIN to Petri Net models before and after falsification.},
+  eventtitle = {2016 {{IEEE International Conference}} on {{Automation Science}} and {{Engineering}} ({{CASE}})},
+  isbn = {978-1-5090-2409-4},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/ZF7RMHVJ/Tsukada et al. - 2016 - A toolchain on model checking SPIN via Kalman Deco.pdf}
+}
+
+@article{tuegelReengineeringAircraftStructural2011,
+  title = {Reengineering {{Aircraft Structural Life Prediction Using}} a {{Digital Twin}}},
+  author = {Tuegel, Eric J. and Ingraffea, Anthony R. and Eason, Thomas G. and Spottswood, S. Michael},
+  date = {2011},
+  journaltitle = {International Journal of Aerospace Engineering},
+  shortjournal = {International Journal of Aerospace Engineering},
+  volume = {2011},
+  pages = {1--14},
+  issn = {1687-5966, 1687-5974},
+  doi = {10.1155/2011/154798},
+  url = {http://www.hindawi.com/journals/ijae/2011/154798/},
+  urldate = {2023-10-11},
+  abstract = {Reengineering of the aircraft structural life prediction process to fully exploit advances in very high performance digital computing is proposed. The proposed process utilizes an ultrahigh fidelity model of individual aircraft by tail number, a Digital Twin, to integrate computation of structural deflections and temperatures in response to flight conditions, with resulting local damage and material state evolution. A conceptual model of how the Digital Twin can be used for predicting the life of aircraft structure and assuring its structural integrity is presented. The technical challenges to developing and deploying a Digital Twin are discussed in detail.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/MB2M7PU8/Tuegel et al. - 2011 - Reengineering Aircraft Structural Life Prediction .pdf}
+}
+
+@report{turkCyberIncidentsInvolving2005,
+  title = {Cyber {{Incidents Involving Control Systems}}},
+  author = {Turk, Robert J.},
+  date = {2005-10-01},
+  number = {INL/EXT-05-00671},
+  institution = {Idaho National Lab. (INL), Idaho Falls, ID (United States)},
+  doi = {10.2172/911775},
+  url = {https://www.osti.gov/biblio/911775},
+  urldate = {2022-03-22},
+  abstract = {The Analysis Function of the US-CERT Control Systems Security Center (CSSC) at the Idaho National Laboratory (INL) has prepared this report to document cyber security incidents for use by the CSSC. The description and analysis of incidents reported herein support three CSSC tasks: establishing a business case; increasing security awareness and private and corporate participation related to enhanced cyber security of control systems; and providing informational material to support model development and prioritize activities for CSSC. The stated mission of CSSC is to reduce vulnerability of critical infrastructure to cyber attack on control systems. As stated in the Incident Management Tool Requirements (August 2005) ''Vulnerability reduction is promoted by risk analysis that tracks actual risk, emphasizes high risk, determines risk reduction as a function of countermeasures, tracks increase of risk due to external influence, and measures success of the vulnerability reduction program''. Process control and Supervisory Control and Data Acquisition (SCADA) systems, with their reliance on proprietary networks and hardware, have long been considered immune to the network attacks that have wreaked so much havoc on corporate information systems. New research indicates this confidence is misplaced--the move to open standards such as Ethernet, Transmission Control Protocol/Internet Protocol, and Web technologies is allowing hackers to take advantage of the control industry's unawareness. Much of the available information about cyber incidents represents a characterization as opposed to an analysis of events. The lack of good analyses reflects an overall weakness in reporting requirements as well as the fact that to date there have been very few serious cyber attacks on control systems. Most companies prefer not to share cyber attack incident data because of potential financial repercussions. Uniform reporting requirements will do much to make this information available to Department of Homeland Security (DHS) and others who require it. This report summarizes the rise in frequency of cyber attacks, describes the perpetrators, and identifies the means of attack. This type of analysis, when used in conjunction with vulnerability analyses, can be used to support a proactive approach to prevent cyber attacks. CSSC will use this document to evolve a standardized approach to incident reporting and analysis. This document will be updated as needed to record additional event analyses and insights regarding incident reporting. This report represents 120 cyber security incidents documented in a number of sources, including: the British Columbia Institute of Technology (BCIT) Industrial Security Incident Database, the 2003 CSI/FBI Computer Crime and Security Survey, the KEMA, Inc., Database, Lawrence Livermore National Laboratory, the Energy Incident Database, the INL Cyber Incident Database, and other open-source data. The National Memorial Institute for the Prevention of Terrorism (MIPT) database was also interrogated but, interestingly, failed to yield any cyber attack incidents. The results of this evaluation indicate that historical evidence provides insight into control system related incidents or failures; however, that the limited available information provides little support to future risk estimates. The documented case history shows that activity has increased significantly since 1988. The majority of incidents come from the Internet by way of opportunistic viruses, Trojans, and worms, but a surprisingly large number are directed acts of sabotage. A substantial number of confirmed, unconfirmed, and potential events that directly or potentially impact control systems worldwide are also identified. Twelve selected cyber incidents are presented at the end of this report as examples of the documented case studies (see Appendix B).},
+  langid = {english},
+  keywords = {DGC read},
+  file = {/home/danesabo/Zotero/storage/JHL3A738/Turk - 2005 - Cyber Incidents Involving Control Systems.pdf;/home/danesabo/Zotero/storage/WBH4WQ7E/911775.html}
+}
+
+@online{TypesProgrammingLanguages,
+  title = {Types and {{Programming Languages}}},
+  url = {https://web-p-ebscohost-com.pitt.idm.oclc.org/ehost/ebookviewer/ebook?sid=9aae5940-b8e1-4213-9bc3-47cea530173c%40redis&vid=0&format=EB},
+  urldate = {2024-01-22},
+  file = {/home/danesabo/Zotero/storage/TPVAQDGL/ebook.html}
+}
+
+@online{TyphoonHILExpert,
+  title = {Typhoon {{HIL}} - {{Expert Hardware-in-the-Loop Solutions}}},
+  url = {https://www.typhoon-hil.com/},
+  urldate = {2024-08-14},
+  abstract = {Typhoon HIL is the technology leader in controller hardware in the loop (C-HIL) solutions for e-mobility, e-drives, renewables, microgrids, and other applications.},
+  langid = {american},
+  organization = {Typhoon HIL},
+  file = {/home/danesabo/Zotero/storage/R4C4KBVR/www.typhoon-hil.com.html}
+}
+
+@inproceedings{uckunModelBasedSystemsEngineering2011,
+  title = {Model-{{Based Systems Engineering}} for the {{Design}} and {{Development}} of {{Complex Aerospace Systems}}},
+  author = {Uckun, Serdar and Kurtoglu, Tolga and Bunus, Peter and Tumer, Irem and Hoyle, Christopher and Musliner, David},
+  date = {2011-10-18},
+  pages = {2011-01-2664},
+  doi = {10.4271/2011-01-2664},
+  url = {https://www.sae.org/content/2011-01-2664/},
+  urldate = {2023-10-03},
+  eventtitle = {Aerospace {{Technology Conference}} and {{Exposition}}}
+}
+
+@inproceedings{uluagacSensoryChannelThreats2014,
+  title = {Sensory Channel Threats to {{Cyber Physical Systems}}: {{A}} Wake-up Call},
+  shorttitle = {Sensory Channel Threats to {{Cyber Physical Systems}}},
+  booktitle = {2014 {{IEEE Conference}} on {{Communications}} and {{Network Security}}},
+  author = {Uluagac, A. Selcuk and Subramanian, Venkatachalam and Beyah, Raheem},
+  date = {2014-10},
+  pages = {301--309},
+  doi = {10.1109/CNS.2014.6997498},
+  url = {https://ieeexplore.ieee.org/abstract/document/6997498?casa_token=eDetTaSM9l8AAAAA:XBYe2w66DUfoi3YO8RYukrB0ZlkaI_z5-WW17tczR2njEgix6AyGvZSqsX0cnaes2IMgFIgxmQ},
+  urldate = {2023-09-27},
+  abstract = {Cyber-Physical Systems (CPS) is a relatively novel computing paradigm where there is a tight integration of communications, computation, and the physical environment. An important component of the CPS devices is the sensors they use to interact with each other and the physical world around them. With CPS applications, engineers monitor the structural health of highways and bridges, farmers check the health of their crops, and ecologists observe wildlife in their natural habitat. Nonetheless, current security models consider protecting only networking components of the CPS devices utilizing traditional security mechanisms (e.g., an intrusion detection system for the data that traverse the network protocol stacks). The protection mechanisms are not sufficient to protect CPS devices from threats emanating from sensory channels. Using sensory channels (e.g., light, temperature, infrared), an adversary can successfully attack systems. Specifically, the adversary can (1) trigger existing malware, (2) transfer malware, or (3) combine malicious use of different sensory channels to increase the impact of the attack on CPS devices. In this work, we focus on these novel sensory channel threats to CPS devices and applications. We first note how sensory channel threats are an emerging area for the CPS world. Then, we analyze the performance various sensory channel threats. Moreover, using an iRobot Create as our CPS platform, we exploit simple vulnerable programs on iRobot through its infrared channel. Finally, we introduce the design of a novel sensory channel aware intrusion detection system as a protection mechanism against the sensory channel threats for CPS devices.},
+  eventtitle = {2014 {{IEEE Conference}} on {{Communications}} and {{Network Security}}},
+  file = {/home/danesabo/Zotero/storage/GTTH2G95/Uluagac et al. - 2014 - Sensory channel threats to Cyber Physical Systems.pdf}
+}
+
+@online{UnivalentFoundationsMathematics2010,
+  title = {Univalent {{Foundations}} of {{Mathematics}}},
+  date = {2010-12-16T14:05:59-0500},
+  url = {https://www.ias.edu/video/univalent/voevodsky},
+  urldate = {2024-01-27},
+  abstract = {The correspondence between homotopy types and higher categorical analogs of groupoids which was first conjectured by Alexander Grothendieck naturally leads to a view of mathematics where sets are used to parametrize collections of objects without "internal structure" while collections of objects with "internal structure" are parametrized by more general homotopy types. Univalent Foundations are based on the combination of this view with the discovery that it is possible to directly formalize reasoning about homotopy types using Martin-Lof type theories.}
+}
+
+@inproceedings{urazayevDistributedEnergyManagement2019,
+  title = {Distributed {{Energy Management System}} with the {{Use}} of {{Digital Twin}}},
+  booktitle = {2019 {{International Multi-Conference}} on {{Engineering}}, {{Computer}} and {{Information Sciences}} ({{SIBIRCON}})},
+  author = {Urazayev, Damir and Bragin, Dmitriy and Zykov, Dmitriy and Hafizov, Rashit and Pospelova, Irina and Shelupanov, Alexander},
+  date = {2019-10},
+  pages = {0685--0689},
+  doi = {10.1109/SIBIRCON48586.2019.8958118},
+  abstract = {At present, the transition from the traditional scheme of energy supply organization to new technologies and practices, implying decentralization, digitalization and intellectualization systems of energy-saving with the active involvement of consumers in the generation and management of all types of energy resources, is becoming increasingly relevant. According to forecasts of experts given in the study “Distributed energy in Russia: potential for development”, the architecture of a distributed energy (DE) system being created will include the following elements: manageable interfaces, “routers of energy”, and platforms of management and services. Most of the platform solutions being created include only a part of the elements from the list above. Existing solutions in the field of DE are based on algorithms that do not provide the flexibility of decision-making and the proper level of security. The purpose of our work is to develop the concept of the intelligent management system of DE facilities. The principle of modular programming using the kernel expansion method was taken as a basis for the development of the concept. The proposed intelligent management system operates in real-time and allows implementing new algorithms and methods of control of the power system, including the management of its active elements. The subsequent development of the project includes the development of the architecture of the software platform and the implementation of the management system of DE facilities. Using the results of the work will increase the efficiency of management of DE facilities.},
+  eventtitle = {2019 {{International Multi-Conference}} on {{Engineering}}, {{Computer}} and {{Information Sciences}} ({{SIBIRCON}})},
+  file = {/home/danesabo/Zotero/storage/E55PTBBZ/Urazayev et al. - 2019 - Distributed Energy Management System with the Use .pdf;/home/danesabo/Zotero/storage/LDMRPCTR/8958118.html}
+}
+
+@article{urbanDevelopingEmbeddedSoftware,
+  title = {Developing {{Embedded Software}} with {{Model-Based Design}} to {{Meet Certification Standards}}},
+  author = {Urban, Paul and Harper, Jeff},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/J2F2D4RT/Urban and Harper - Developing Embedded Software with Model-Based Desi.pdf}
+}
+
+@incollection{usdepartmentofdefenseDepartmentDefenseTrusted1985,
+  title = {Department of {{Defense Trusted Computer System Evaluation Criteria}}},
+  booktitle = {The ‘{{Orange Book}}’ {{Series}}},
+  author = {{US Department of Defense}},
+  editor = {{US Department of Defense}},
+  date = {1985},
+  pages = {1--129},
+  publisher = {Palgrave Macmillan UK},
+  location = {London},
+  doi = {10.1007/978-1-349-12020-8_1},
+  url = {http://link.springer.com/10.1007/978-1-349-12020-8_1},
+  urldate = {2024-02-29},
+  isbn = {978-0-333-53947-7 978-1-349-12020-8},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/IMD3HDTU/US Department of Defense - 1985 - Department of Defense Trusted Computer System Eval.pdf}
+}
+
+@online{vagnerAlgebrasOpenDynamical2015,
+  title = {Algebras of {{Open Dynamical Systems}} on the {{Operad}} of {{Wiring Diagrams}}},
+  author = {Vagner, Dmitry and Spivak, David I. and Lerman, Eugene},
+  date = {2015-10-02},
+  eprint = {1408.1598},
+  eprinttype = {arXiv},
+  eprintclass = {math},
+  doi = {10.48550/arXiv.1408.1598},
+  url = {http://arxiv.org/abs/1408.1598},
+  urldate = {2023-12-07},
+  abstract = {In this paper, we use the language of operads to study open dynamical systems. More specifically, we study the algebraic nature of assembling complex dynamical systems from an interconnection of simpler ones. The syntactic architecture of such interconnections is encoded using the visual language of wiring diagrams. We define the symmetric monoidal category W, from which we may construct an operad O(W), whose objects are black boxes with input and output ports, and whose morphisms are wiring diagrams, thus prescribing the algebraic rules for interconnection. We then define two W-algebras, G and L, which associate semantic content to the structures in W. Respectively, they correspond to general and to linear systems of differential equations, in which an internal state is controlled by inputs and produces outputs. As an example, we use these algebras to formalize the classical problem of systems of tanks interconnected by pipes, and hence make explicit the algebraic relationships among systems at different levels of granularity.},
+  pubstate = {prepublished},
+  note = {Comment: 26 pages},
+  file = {/home/danesabo/Zotero/storage/T2V4TXP6/Vagner et al. - 2015 - Algebras of Open Dynamical Systems on the Operad o.pdf;/home/danesabo/Zotero/storage/R4GV5EVF/1408.html}
+}
+
+@online{vagnerAlgebrasOpenDynamical2015a,
+  title = {Algebras of {{Open Dynamical Systems}} on the {{Operad}} of {{Wiring Diagrams}}},
+  author = {Vagner, Dmitry and Spivak, David I. and Lerman, Eugene},
+  date = {2015-10-02},
+  eprint = {1408.1598},
+  eprinttype = {arXiv},
+  eprintclass = {math},
+  doi = {10.48550/arXiv.1408.1598},
+  url = {http://arxiv.org/abs/1408.1598},
+  urldate = {2023-12-08},
+  abstract = {In this paper, we use the language of operads to study open dynamical systems. More specifically, we study the algebraic nature of assembling complex dynamical systems from an interconnection of simpler ones. The syntactic architecture of such interconnections is encoded using the visual language of wiring diagrams. We define the symmetric monoidal category W, from which we may construct an operad O(W), whose objects are black boxes with input and output ports, and whose morphisms are wiring diagrams, thus prescribing the algebraic rules for interconnection. We then define two W-algebras, G and L, which associate semantic content to the structures in W. Respectively, they correspond to general and to linear systems of differential equations, in which an internal state is controlled by inputs and produces outputs. As an example, we use these algebras to formalize the classical problem of systems of tanks interconnected by pipes, and hence make explicit the algebraic relationships among systems at different levels of granularity.},
+  pubstate = {prepublished},
+  note = {Comment: 26 pages},
+  file = {/home/danesabo/Zotero/storage/HQBVBU8A/Vagner et al. - 2015 - Algebras of Open Dynamical Systems on the Operad o.pdf;/home/danesabo/Zotero/storage/HJFNVTGE/1408.html}
+}
+
+@article{vanderveenSelfOrganizationCyberphysicalEnergy2024,
+  title = {Self-{{Organization}} in {{Cyberphysical Energy Systems}}: {{Seven Practical Steps}} to {{Agent-Based}} and {{Digital Twin-Supported Voltage Control}}},
+  shorttitle = {Self-{{Organization}} in {{Cyberphysical Energy Systems}}},
+  author = {family=Veen, given=Aliene, prefix=van der, useprefix=true and family=Leeuwen, given=Coen, prefix=van, useprefix=true and Helmholt, Kristian A.},
+  date = {2024-01},
+  journaltitle = {IEEE Power and Energy Magazine},
+  volume = {22},
+  number = {1},
+  pages = {43--51},
+  issn = {1558-4216},
+  doi = {10.1109/MPE.2023.3327065},
+  url = {https://ieeexplore.ieee.org/document/10398556/},
+  urldate = {2024-03-13},
+  abstract = {Due to the energy transition, energy systems need to become more agile, effective, and efficient. More situational awareness and direct responses to changes in the flow of energy are required, especially for electrical energy systems, where demand and supply must be balanced continuously and the power quality must be preserved. This change can be achieved by adding extra sensors, actuators, and information and communication technology (ICT) to collect and analyze data and to make decisions. The addition of ICT results in evolution toward a cyberphysical energy system (CPES), where physical and computational components are integrated to monitor and control physical energy processes.},
+  eventtitle = {{{IEEE Power}} and {{Energy Magazine}}},
+  file = {/home/danesabo/Zotero/storage/BLM7F3EF/van der Veen et al. - 2024 - Self-Organization in Cyberphysical Energy Systems.pdf;/home/danesabo/Zotero/storage/3UST3BK7/10398556.html}
+}
+
+@article{vazquezMultiOutputSuppportVector2003,
+  title = {Multi-{{Output Suppport Vector Regression}}},
+  author = {Vazquez, Emmanuel and Walter, Eric},
+  date = {2003-09-01},
+  journaltitle = {IFAC Proceedings Volumes},
+  shortjournal = {IFAC Proceedings Volumes},
+  series = {13th {{IFAC Symposium}} on {{System Identification}} ({{SYSID}} 2003), {{Rotterdam}}, {{The Netherlands}}, 27-29 {{August}}, 2003},
+  volume = {36},
+  number = {16},
+  pages = {1783--1788},
+  issn = {1474-6670},
+  doi = {10.1016/S1474-6670(17)35018-8},
+  url = {https://www.sciencedirect.com/science/article/pii/S1474667017350188},
+  urldate = {2022-04-21},
+  abstract = {Support vector regression builds a model of a process that depends on a set of factors. It traditionally considers one output at a time, which means that advantage cannot be taken ofthe correlations that may exist between outputs. The purpose of this paper is to show how the body of knowledge accumulated by geostatisticians on Kriging and its extensions over the last 40 years can help extend support vector regression to the multi-output case and provides guidance for the choice of a suitable kernel for a given application, a recurrent, fundamental and largely open question.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/VEWCYHZN/Vazquez and Walter - 2003 - Multi-Output Suppport Vector Regression.pdf;/home/danesabo/Zotero/storage/944WPN9U/S1474667017350188.html}
+}
+
+@book{veneriHandsonIndustrialInternet2018,
+  title = {Hands-on Industrial {{Internet}} of {{Things}}: Create a Powerful Industrial {{IoT}} Infrastructure Using Industry 4.0},
+  author = {Veneri, Giacomo and Capasso, Antonio},
+  date = {2018},
+  publisher = {Packt Publishing Ltd},
+  isbn = {1-78953-830-0},
+  file = {/home/danesabo/Zotero/storage/UB928X4R/HandsOn Industrial Internet of Things Create a powerful Industrial IoT infrastructure using Industry 4.pdf}
+}
+
+@article{vicentiniSafetyAssessmentCollaborative2020,
+  title = {Safety {{Assessment}} of {{Collaborative Robotics Through Automated Formal Verification}}},
+  author = {Vicentini, Federico and Askarpour, Mehrnoosh and Rossi, Matteo G. and Mandrioli, Dino},
+  date = {2020-02},
+  journaltitle = {IEEE Transactions on Robotics},
+  shortjournal = {IEEE Trans. Robot.},
+  volume = {36},
+  number = {1},
+  pages = {42--61},
+  issn = {1552-3098, 1941-0468},
+  doi = {10.1109/TRO.2019.2937471},
+  url = {https://ieeexplore.ieee.org/document/8844289/},
+  urldate = {2023-10-13},
+  abstract = {A crucial aspect of physical human–robot collaboration (HRC) is to maintain a safe common workspace for human operator. However, close proximity between human–robot and unpredictability of human behavior raises serious challenges in terms of safety. This article proposes a risk analysis methodology for collaborative robotic applications, which is compatible with well-known standards in the area and relies on formal verification techniques to automate the traditional risk analysis methods. In particular, the methodology relies on temporal logic-based models to describe the different possible ways in which tasks can be carried out, and on fully automated formal verification techniques to explore the corresponding state space to detect and modify the hazardous situations at early stages of system design.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/APQ5622C/Vicentini et al. - 2020 - Safety Assessment of Collaborative Robotics Throug.pdf}
+}
+
+@online{VideoConferencingWeb,
+  title = {Video {{Conferencing}}, {{Web Conferencing}}, {{Webinars}}, {{Screen Sharing}}},
+  url = {https://georgetown.zoom.us/rec/play/d46bqL1PaidLX23hjxCYCGO_xrFquiewA1TEhUpinGY4MW7ZjB1A_W1zZ7fdGuCMvPXmbo_-jog37dk.ELIjMzJjJmWhidCo},
+  urldate = {2024-04-01},
+  abstract = {Zoom is the leader in modern enterprise video communications, with an easy, reliable cloud platform for video and audio conferencing, chat, and webinars across mobile, desktop, and room systems. Zoom Rooms is the original software-based conference room solution used around the world in board, conference, huddle, and training rooms, as well as executive offices and classrooms. Founded in 2011, Zoom helps businesses and organizations bring their teams together in a frictionless environment to get more done. Zoom is a publicly traded company headquartered in San Jose, CA.},
+  langid = {american},
+  organization = {Zoom},
+  file = {/home/danesabo/Zotero/storage/DYKMLYTI/d46bqL1PaidLX23hjxCYCGO_xrFquiewA1TEhUpinGY4MW7ZjB1A_W1zZ7fdGuCMvPXmbo_-jog37dk.html}
+}
+
+@article{vijayakumaranReliableNextGeneration2020,
+  title = {A Reliable next Generation Cyber Security Architecture for Industrial Internet of Things Environment},
+  author = {Vijayakumaran, C. and Muthusenthil, B. and Manickavasagam, B.},
+  date = {2020-02-01},
+  journaltitle = {International Journal of Electrical and Computer Engineering (IJECE)},
+  shortjournal = {IJECE},
+  volume = {10},
+  number = {1},
+  pages = {387},
+  issn = {2088-8708, 2088-8708},
+  doi = {10.11591/ijece.v10i1.pp387-395},
+  url = {http://ijece.iaescore.com/index.php/IJECE/article/view/18300},
+  urldate = {2022-09-30},
+  abstract = {Architectural changes are happening in the modern industries due to the adaption and the deployment of „Internet of Things (IoT)‟ for monitoring and controlling various devices remotely from the external world. The most predominant place where the IoT technology makes the most sense is the industrial automation processes in smart industries (Industry 4.0). In this paper, a reliable „Next Generation Cyber Security Architecture (NCSA)‟ is presented for Industrial IoT (IIoT) environment that detects and thwarts cybersecurity threats and vulnerabilities. It helps to automate the processes of exchanging real-time critical information between devices without any human intervention. It proposes an analytical framework that can be used to protect entities and network traffics involved in the IIoT wireless communication. It incorporates an automated cyber-defense authentication mechanism that detects and prevents security attacks when a network session has been established. The defense mechanism accomplishes the required level of security protection in the network by generating an identity token which is cryptographically encrypted and verified by a virtual gateway system. The proposed NCSA improves security in the IIoT environment and reduces operational management cost.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/UF4Z58J3/Vijayakumaran et al. - 2020 - A reliable next generation cyber security architec.pdf}
+}
+
+@article{villalongaCloudBasedIndustrialCyber2020,
+  title = {Cloud-{{Based Industrial Cyber}}–{{Physical System}} for {{Data-Driven Reasoning}}: {{A Review}} and {{Use Case}} on an {{Industry}} 4.0 {{Pilot Line}}},
+  shorttitle = {Cloud-{{Based Industrial Cyber}}–{{Physical System}} for {{Data-Driven Reasoning}}},
+  author = {Villalonga, Alberto and Beruvides, Gerardo and Castano, Fernando and Haber, Rodolfo E.},
+  date = {2020-09},
+  journaltitle = {IEEE Transactions on Industrial Informatics},
+  shortjournal = {IEEE Trans. Ind. Inf.},
+  volume = {16},
+  number = {9},
+  pages = {5975--5984},
+  issn = {1551-3203, 1941-0050},
+  doi = {10.1109/TII.2020.2971057},
+  url = {https://ieeexplore.ieee.org/document/8978483/},
+  urldate = {2022-09-30},
+  abstract = {Nowadays, reconfiguration and adaptation by means of optimal re-parameterization in Industrial Cyber–Physical Systems (ICPSs) is one of the bottlenecks for the digital transformation of the manufacturing industry. This article proposes a cloud-to-edge-based ICPS equipped with machine learning techniques. The proposed reasoning module includes a learning procedure based on two reinforcement learning techniques, running in parallel, for updating both the data-conditioning and processing strategy and the prediction model. The presented solution distributes computational resources and analytic engines in multiple layers and independent modules, increasing the smartness and the autonomy for monitoring and control the behavior at the shop floor level. The suitability of the proposed solution, evaluated in a pilot line, is endorsed by fast time response (i.e., 0.01 s at the edge level) and the appropriate setting of optimal operational parameters for guaranteeing the desired quality surface roughness during macro- and micro-milling operations.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/H9TLYUU6/Villalonga et al. - 2020 - Cloud-Based Industrial Cyber–Physical System for D.pdf}
+}
+
+@article{viteriExplosiveProofsMathematical2022,
+  title = {Explosive {{Proofs}} of {{Mathematical Truths}}},
+  author = {Viteri, Scott and DeDeo, Simon},
+  date = {2022-08},
+  journaltitle = {Cognition},
+  shortjournal = {Cognition},
+  volume = {225},
+  eprint = {2004.00055},
+  eprinttype = {arXiv},
+  eprintclass = {physics, q-bio},
+  pages = {105120},
+  issn = {00100277},
+  doi = {10.1016/j.cognition.2022.105120},
+  url = {http://arxiv.org/abs/2004.00055},
+  urldate = {2024-01-29},
+  abstract = {Mathematical proofs are both paradigms of certainty and some of the most explicitly-justified arguments that we have in the cultural record. Their very explicitness, however, leads to a paradox, because their probability of error grows exponentially as the argument expands. Here we show that under a cognitively-plausible belief formation mechanism that combines deductive and abductive reasoning, mathematical arguments can undergo what we call an epistemic phase transition: a dramatic and rapidly-propagating jump from uncertainty to near-complete confidence at reasonable levels of claim-to-claim error rates. To show this, we analyze an unusual dataset of forty-eight machine-aided proofs from the formalized reasoning system Coq, including major theorems ranging from ancient to 21st Century mathematics, along with four hand-constructed cases from Euclid, Apollonius, Spinoza, and Andrew Wiles. Our results bear both on recent work in the history and philosophy of mathematics, and on a question, basic to cognitive science, of how we form beliefs, and justify them to others.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/VVC8XMR4/Viteri and DeDeo - 2022 - Epistemic Phase Transitions in Mathematical Proofs.pdf}
+}
+
+@article{voevodskyOriginsMotivationsUnivalent,
+  title = {The {{Origins}} and {{Motivations}} of {{Univalent Foundations}}},
+  author = {Voevodsky, Vladimir},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/43YCVSMW/Sörlin - Environmental Turn in the Human Sciences.pdf}
+}
+
+@article{volodinConceptInstrumentationDigital2019,
+  title = {Concept of Instrumentation of Digital Twins of Nuclear Power Plants Units as Observers for Digital {{NPP I}}\&{{C}} System},
+  author = {Volodin, V.S. and Tolokonskii, A.O.},
+  date = {2019-11-01},
+  journaltitle = {Journal of Physics: Conference Series},
+  shortjournal = {J. Phys.: Conf. Ser.},
+  volume = {1391},
+  number = {1},
+  pages = {012083},
+  issn = {1742-6588, 1742-6596},
+  doi = {10.1088/1742-6596/1391/1/012083},
+  url = {https://iopscience.iop.org/article/10.1088/1742-6596/1391/1/012083},
+  urldate = {2023-10-11},
+  abstract = {The relevance of the idea under consideration lies in the development of the use of digital twins of power units in the nuclear industry. With their help, we can not only predict the state of technological equipment, etc., but also solve the problem of parameter tuning of automatic regulators in different operating modes of NPP unit. Authors consider approaches to this problem based on optimal control theory, fuzzy logic and machine learning. Advantages and disadvantages of each approach are considered.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/SH7T5TZ5/Volodin and Tolokonskii - 2019 - Concept of instrumentation of digital twins of nuc.pdf}
+}
+
+@incollection{vorosIntroductionFormalMethods2004,
+  title = {An {{Introduction}} to {{Formal Methods}}},
+  booktitle = {{{UML-B Specification}} for {{Proven Embedded Systems Design}}},
+  author = {Voros, Nikolaos S. and Mueller, Wolfgang and Snook, Colin},
+  editor = {Bernin, Fredrik and Butler, Michael and Cansell, Dominique and Hallerstede, Stefan and Kronlöf, Klaus and Krupp, Alexander and Lecomte, Thierry and Lundell, Michael and Lundkvist, Ola and Marchetti, Michele and Mueller, Wolfgang and Oliver, Ian and Sabatier, Denis and Schattkowsky, Tim and Snook, Colin and Voros, Nikolaos S. and Zimmermann, Yann and Mermet, Jean},
+  date = {2004},
+  pages = {1--20},
+  publisher = {Springer US},
+  location = {Boston, MA},
+  doi = {10.1007/978-1-4020-2867-0_1},
+  url = {https://doi.org/10.1007/978-1-4020-2867-0_1},
+  urldate = {2024-07-09},
+  abstract = {This chapter begins with an introduction to the main concepts of formal methods. Languages and tools for developing formal System modeis are also described, while the use of semi formal notations and their integration with formal methods is covered as well. At the end of the chapter, an overview of the current Status of formal methods in embedded System design is presented.},
+  isbn = {978-1-4020-2867-0},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/XENN9EAI/Voros et al. - 2004 - An Introduction to Formal Methods.pdf}
+}
+
+@report{W32StuxnetDossier,
+  title = {W32.{{Stuxnet Dossier}}},
+  url = {https://pax0r.com/hh/stuxnet/Symantec-Stuxnet-Update-Feb-2011.pdf},
+  urldate = {2022-03-22},
+  file = {/home/danesabo/Zotero/storage/ZDJ2MYSX/Symantec-Stuxnet-Update-Feb-2011.pdf}
+}
+
+@article{wadlerPropositionsTypes2015,
+  title = {Propositions as Types},
+  author = {Wadler, Philip},
+  date = {2015-11-23},
+  journaltitle = {Communications of the ACM},
+  shortjournal = {Commun. ACM},
+  volume = {58},
+  number = {12},
+  pages = {75--84},
+  issn = {0001-0782, 1557-7317},
+  doi = {10.1145/2699407},
+  url = {https://dl.acm.org/doi/10.1145/2699407},
+  urldate = {2024-02-22},
+  abstract = {Connecting mathematical logic and computation, it ensures that some aspects of programming are absolute.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/L56337XT/Wadler - 2015 - Propositions as types.pdf}
+}
+
+@misc{wadlerPropositionTypes,
+  title = {Proposition as {{Types}}},
+  author = {Wadler, Philip},
+  file = {/home/danesabo/Zotero/storage/AZ6HK6QN/propositions-as-types.pdf}
+}
+
+@article{wagnerDigitalTwinsPower2024,
+  title = {Digital {{Twins}} in {{Power Systems}}: {{A Proposal}} for a {{Definition}}},
+  shorttitle = {Digital {{Twins}} in {{Power Systems}}},
+  author = {Wagner, Timo and Kittl, Chris and Jakob, Joshua and Hiry, Johannes and Häger, Ulf},
+  date = {2024-01},
+  journaltitle = {IEEE Power and Energy Magazine},
+  volume = {22},
+  number = {1},
+  pages = {16--23},
+  issn = {1558-4216},
+  doi = {10.1109/MPE.2023.3328581},
+  url = {https://ieeexplore.ieee.org/document/10398557/},
+  urldate = {2024-03-13},
+  abstract = {The term “digital twin” was already introduced by Michael Grieves in 2002 (see Grieves, 2016), and after about 20 years the concept has found its way into the energy sector on a broader base. The first applications of digital twins were for product lifecycle management within the aerospace industry at NASA. After this initial implementation of digital twinning, the digital twin technique for lifecycle management was supplemented by networkability. Since then digital twins have been widely embraced by many industrial stakeholders, allowing machines and processes to optimize their production. Today this development is considered as the fourth industrial revolution (Industry 4.0).},
+  eventtitle = {{{IEEE Power}} and {{Energy Magazine}}},
+  file = {/home/danesabo/Zotero/storage/C9DMSYH8/Wagner et al. - 2024 - Digital Twins in Power Systems A Proposal for a D.pdf;/home/danesabo/Zotero/storage/V8XDSUNR/10398557.html}
+}
+
+@article{wallPolynomialsWhoseZeros1945,
+  title = {Polynomials {{Whose Zeros Have Negative Real Parts}}},
+  author = {Wall, H. S.},
+  date = {1945-06-01},
+  journaltitle = {The American Mathematical Monthly},
+  publisher = {Taylor \& Francis},
+  issn = {0002-9890},
+  doi = {10.2307/2305291},
+  url = {https://www.tandfonline.com/doi/abs/10.1080/00029890.1945.11991574},
+  urldate = {2024-03-04},
+  abstract = {(1945). Polynomials Whose Zeros Have Negative Real Parts. The American Mathematical Monthly: Vol. 52, No. 6, pp. 308-322.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/HJLNFYUV/00029890.1945.html}
+}
+
+@article{wangAdaptiveCriticNonlinear2017,
+  title = {Adaptive {{Critic Nonlinear Robust Control}}: {{A Survey}}},
+  shorttitle = {Adaptive {{Critic Nonlinear Robust Control}}},
+  author = {Wang, Ding and He, Haibo and Liu, Derong},
+  date = {2017-10},
+  journaltitle = {IEEE Transactions on Cybernetics},
+  shortjournal = {IEEE Trans. Cybern.},
+  volume = {47},
+  number = {10},
+  pages = {3429--3451},
+  issn = {2168-2267, 2168-2275},
+  doi = {10.1109/TCYB.2017.2712188},
+  url = {http://ieeexplore.ieee.org/document/7967695/},
+  urldate = {2024-05-20},
+  file = {/home/danesabo/Zotero/storage/FD3USCZJ/Wang et al. - 2017 - Adaptive Critic Nonlinear Robust Control A Survey.pdf}
+}
+
+@inproceedings{wangDiffuseBotBreedingSoft2023,
+  title = {{{DiffuseBot}}: {{Breeding Soft Robots With Physics-Augmented Generative Diffusion Models}}},
+  booktitle = {Advances in {{Neural Information Processing Systems}}},
+  author = {Wang, Tsun-Hsuan Johnson and Zheng, Juntian and Ma, Pingchuan and Du, Yilun and Kim, Byungchul and Spielberg, Andrew and Tenenbaum, Josh and Gan, Chuang and Rus, Daniela},
+  editor = {Oh, A. and Naumann, T. and Globerson, A. and Saenko, K. and Hardt, M. and Levine, S.},
+  date = {2023},
+  volume = {36},
+  pages = {44398--44423},
+  publisher = {Curran Associates, Inc.},
+  url = {https://proceedings.neurips.cc/paper_files/paper/2023/file/8b1008098947ad59144c18a78337f937-Paper-Conference.pdf}
+}
+
+@inproceedings{wangFormalAnalysisSecurity2017,
+  title = {Formal {{Analysis}} of {{Security Properties}} of {{Cyber-Physical System Based}} on {{Timed Automata}}},
+  booktitle = {2017 {{IEEE Second International Conference}} on {{Data Science}} in {{Cyberspace}} ({{DSC}})},
+  author = {Wang, Ting and Su, Qi and Chen, Tieming},
+  date = {2017-06},
+  pages = {534--540},
+  publisher = {IEEE},
+  location = {Shenzhen, China},
+  doi = {10.1109/DSC.2017.44},
+  url = {http://ieeexplore.ieee.org/document/8005528/},
+  urldate = {2023-10-10},
+  abstract = {For the research and development of CyberPhysical System (CPS), the security problems have gradually emerged. This paper explores the design of security for CPS. We focus on a kind of common attacks that destroys the critical system parameters to paralyze the system. Timed Automata are used for formalizing the behaviors of CPS, since the requirements on time are necessary for CPS. The modeling of CPS includes three aspects: the interactions between the various components of the CPS, the attacker, and the recovery mechanism. A modeling framework is given to illustrate our method. We also take the network water level control system as an example to illustrate our modeling processes. By using the model checking tool PAT, the security properties are verified and the results are analyzed.},
+  eventtitle = {2017 {{IEEE Second International Conference}} on {{Data Science}} in {{Cyberspace}} ({{DSC}})},
+  isbn = {978-1-5386-1600-0},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/4FL6TSHL/Wang et al. - 2017 - Formal Analysis of Security Properties of Cyber-Ph.pdf}
+}
+
+@article{wangFormalModelBasedDesign2019,
+  title = {A {{Formal Model-Based Design Method}} for {{Robotic Systems}}},
+  author = {Wang, Rui and Guan, Yong and Song, Houbing and Li, Xinxin and Li, Xiaojuan and Shi, Zhiping and Song, Xiaoyu},
+  date = {2019-03},
+  journaltitle = {IEEE Systems Journal},
+  shortjournal = {IEEE Systems Journal},
+  volume = {13},
+  number = {1},
+  pages = {1096--1107},
+  issn = {1932-8184, 1937-9234, 2373-7816},
+  doi = {10.1109/JSYST.2018.2867285},
+  url = {https://ieeexplore.ieee.org/document/8464674/},
+  urldate = {2023-10-10},
+  abstract = {The model-based approach has been widely applied to the design of software. However, most of these approaches depend on simulation and manual code implementation, which reduces the efficiency and quality of software. In this paper, we present a new model-based approach, which automatically generates the executable C++ code running on the popular Robot Operation System (ROS). Our approach consists of three phases: modeling, verification, and automatic code generation. In the modeling phase, the internal interaction behaviors of robot systems are modeled as a network of timed automata. In the verification phase, the safety requirements are formalized and verified. In the code generation phase, a code generation tool can generate executable C++ code from the verified timed automata model. It bridges the gap between the formal model and the error-prone system implementation. Compared with existing method, the code generator provides the abstractions and mapping of ROS instructions, which realize the seamless connection between the generated code and ROS. The tool also supports most of the complex structures and advanced features of timed automata such as timer, committed location, and synchronous action. For evaluation, a real-industrial robot application of grasping a cup is conducted using our modelbased design method, and the generated code can be directly deployed and successfully accomplishes the grasping task.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/GJ8Q4YD8/Wang et al. - 2019 - A Formal Model-Based Design Method for Robotic Sys.pdf}
+}
+
+@online{wangPINNsBasedUncertaintyQuantification2023,
+  title = {{{PINNs-Based Uncertainty Quantification}} for {{Transient Stability Analysis}}},
+  author = {Wang, Ren and Zhong, Ming and Xu, Kaidi and Sánchez-Cortés, Lola Giráldez and Guerra, Ignacio de Cominges},
+  date = {2023-11-21},
+  eprint = {2311.12947},
+  eprinttype = {arXiv},
+  eprintclass = {cs, eess},
+  url = {http://arxiv.org/abs/2311.12947},
+  urldate = {2024-01-30},
+  abstract = {This paper addresses the challenge of transient stability in power systems with missing parameters and uncertainty propagation in swing equations. We introduce a novel application of Physics-Informed Neural Networks (PINNs), specifically an Ensemble of PINNs (E-PINNs), to estimate critical parameters like rotor angle and inertia coefficient with enhanced accuracy and reduced computational load. E-PINNs capitalize on the underlying physical principles of swing equations to provide a robust solution. Our approach not only facilitates efficient parameter estimation but also quantifies uncertainties, delivering probabilistic insights into the system behavior. The efficacy of E-PINNs is demonstrated through the analysis of \$1\$-bus and \$2\$-bus systems, highlighting the model's ability to handle parameter variability and data scarcity. The study advances the application of machine learning in power system stability, paving the way for reliable and computationally efficient transient stability analysis.},
+  pubstate = {prepublished},
+  keywords = {Computer Science - Artificial Intelligence,Electrical Engineering and Systems Science - Systems and Control},
+  file = {/home/danesabo/Zotero/storage/NA3Q8IV8/Wang et al. - 2023 - PINNs-Based Uncertainty Quantification for Transie.pdf;/home/danesabo/Zotero/storage/KVHS32C8/2311.html}
+}
+
+@inproceedings{wankhadeCyberPhysicalSystem2020,
+  title = {Cyber {{Physical System Framework}}: {{An Apropos Study}}},
+  shorttitle = {Cyber {{Physical System Framework}}},
+  booktitle = {2020 {{Fourth International Conference}} on {{Inventive Systems}} and {{Control}} ({{ICISC}})},
+  author = {Wankhade, Megha and Kottur, Suhasini Vijaykumar},
+  date = {2020-01},
+  pages = {716--719},
+  doi = {10.1109/ICISC47916.2020.9171074},
+  url = {https://ieeexplore.ieee.org/abstract/document/9171074?casa_token=ThzOr3xT16gAAAAA:NktWFIimmo9FAbCfwaYlLywtCc_wYOE0B2TuTlV-stWns1HSOxoQWqD5IlOFQ2FwK4jQ-MJbig},
+  urldate = {2023-09-27},
+  abstract = {The next generation of engineered systems is specified as the cyber-physical systems (CPS) with the incorporation of communiqué, computation, and controller to achieve the targets of constancy, routine, sturdiness, and competence in physical systems. Cyber-Physical systems are a feedback system that requires cybersecurity and improved design tools that enables design methodology. Cyber-Physical system becomes a significant track intended for the advance of the smart engineering business. The control trial of wide-ranging and organically disseminated cyber-physical systems is intended to be sturdy and consistent with very multifaceted disseminated in addition to the vital controller. The safety difficulties in addition protective measures the aforementioned aspects are progressively advancing the concentration of exploration in the arena. This paper presents a study of different application framework that is helpful to industry and academia in the direction of design a strong security framework to improve these systems.},
+  eventtitle = {2020 {{Fourth International Conference}} on {{Inventive Systems}} and {{Control}} ({{ICISC}})},
+  keywords = {survey},
+  file = {/home/danesabo/Zotero/storage/QJ7J54V8/Wankhade and Kottur - 2020 - Cyber Physical System Framework An Apropos Study.pdf}
+}
+
+@article{WaPo-water,
+  title = {The Cybersecurity Risk to Our Water Supply Is Real. {{We}} Need to Prepare},
+  author = {Montgomery, Mark and Ravich, Samantha F.},
+  year = {date accesssed 02/13/2022},
+  journaltitle = {The Washington Post},
+  url = {https://www.washingtonpost.com/opinions/2022/01/03/cybersecurity-risk-water-supply/}
+}
+
+@article{wardellMethodRevealingAddressing2016,
+  title = {A {{Method}} for {{Revealing}} and {{Addressing Security Vulnerabilities}} in {{Cyber-physical Systems}} by {{Modeling Malicious Agent Interactions}} with {{Formal Verification}}},
+  author = {Wardell, Dean C. and Mills, Robert F. and Peterson, Gilbert L. and Oxley, Mark E.},
+  date = {2016},
+  journaltitle = {Procedia Computer Science},
+  shortjournal = {Procedia Computer Science},
+  volume = {95},
+  pages = {24--31},
+  issn = {18770509},
+  doi = {10.1016/j.procs.2016.09.289},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S1877050916324619},
+  urldate = {2023-10-10},
+  abstract = {Several cyber-attacks on the cyber-physical systems (CPS) that monitor and control critical infrastructure were publically announced over the last few years. Almost without exception, the proposed security solutions focus on preventing unauthorized access to the industrial control systems (ICS) at various levels – the defense in depth approach. While useful, it does not address the problem of making the systems more capable of responding to the malicious actions of an attacker once they have gained access to the system. The first step in making an ICS more resilient to an attacker is identifying the cyber security vulnerabilities the attacker can use during system design. This paper presents a method that reveals cyber security vulnerabilities in ICS through the formal modeling of the system and malicious agents. The inclusion of the malicious agent in the analysis of an existing systems identifies security vulnerabilities that are missed in traditional functional model checking.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/XPXSX3AP/Wardell et al. - 2016 - A Method for Revealing and Addressing Security Vul.pdf}
+}
+
+@report{weinsteinQUANTIZATIONEFFECTSDIGITAL1969,
+  title = {{{QUANTIZATION EFFECTS IN DIGITAL FILTERS}}:},
+  shorttitle = {{{QUANTIZATION EFFECTS IN DIGITAL FILTERS}}},
+  author = {Weinstein, Clifford J.},
+  date = {1969-11-21},
+  institution = {Defense Technical Information Center},
+  location = {Fort Belvoir, VA},
+  doi = {10.21236/AD0706862},
+  url = {http://www.dtic.mil/docs/citations/AD0706862},
+  urldate = {2024-02-08},
+  abstract = {When a digital filter is implemented on a computer or with special-purpose hardware, errors and constraints due to finite word length are unavoidable. These quantization effects must be considered, both in deciding what register length is needed for a given filter implementation and in choosing between several possible implementations of the same filter design, which will be affected differently by quantization.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/VJ9FAH7X/Weinstein - 1969 - QUANTIZATION EFFECTS IN DIGITAL FILTERS.pdf}
+}
+
+@article{weiSystemTheoreticApproach2018,
+  title = {A {{System Theoretic Approach}} to {{Cybersecurity Risk Analysis}} and {{Mitigation}} for {{Autonomous Passenger Vehicles}}},
+  author = {Wei, Lee Chee and Madnick, Stuart E.},
+  date = {2018},
+  journaltitle = {SSRN Electronic Journal},
+  shortjournal = {SSRN Journal},
+  issn = {1556-5068},
+  doi = {10.2139/ssrn.3370555},
+  url = {https://www.ssrn.com/abstract=3370555},
+  urldate = {2023-11-03},
+  langid = {english}
+}
+
+@article{weizenbaumELIZAComputerProgram1966,
+  title = {{{ELIZA}}—a Computer Program for the Study of Natural Language Communication between Man and Machine},
+  author = {Weizenbaum, Joseph},
+  date = {1966-01-01},
+  journaltitle = {Commun. ACM},
+  volume = {9},
+  number = {1},
+  pages = {36--45},
+  issn = {0001-0782},
+  doi = {10.1145/365153.365168},
+  url = {https://doi.org/10.1145/365153.365168},
+  urldate = {2024-07-02},
+  keywords = {gen_ai},
+  file = {/home/danesabo/Zotero/storage/Y78493V7/Weizenbaum - 1966 - ELIZA—a computer program for the study of natural .pdf}
+}
+
+@inproceedings{wellingBayesianLearningStochastic2011,
+  title = {Bayesian Learning via Stochastic Gradient {{Langevin}} Dynamics},
+  booktitle = {Proceedings of the 28th International Conference on Machine Learning ({{ICML-11}})},
+  author = {Welling, Max and Teh, Yee W.},
+  date = {2011},
+  pages = {681--688}
+}
+
+@online{wengAutoencoderBetaVAE2018,
+  title = {From {{Autoencoder}} to {{Beta-VAE}}},
+  author = {Weng, Lilian},
+  date = {2018-08-12T00:00:00+00:00},
+  url = {https://lilianweng.github.io/posts/2018-08-12-vae/},
+  urldate = {2023-10-11},
+  abstract = {[Updated on 2019-07-18: add a section on VQ-VAE \& VQ-VAE-2.]  [Updated on 2019-07-26: add a section on TD-VAE.]  Autocoder is invented to reconstruct high-dimensional data using a neural network model with a narrow bottleneck layer in the middle (oops, this is probably not true for Variational Autoencoder, and we will investigate it in details in later sections). A nice byproduct is dimension reduction: the bottleneck layer captures a compressed latent encoding.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/JNA8P8DJ/2018-08-12-vae.html}
+}
+
+@online{wengWhatAreDiffusion2021,
+  title = {What Are {{Diffusion Models}}?},
+  author = {Weng, Lilian},
+  date = {2021-07-11T00:00:00+00:00},
+  url = {https://lilianweng.github.io/posts/2021-07-11-diffusion-models/},
+  urldate = {2023-10-05},
+  abstract = {[Updated on 2021-09-19: Highly recommend this blog post on score-based generative modeling by Yang Song (author of several key papers in the references)]. [Updated on 2022-08-27: Added classifier-free guidance, GLIDE, unCLIP and Imagen. [Updated on 2022-08-31: Added latent diffusion model. So far, I’ve written about three types of generative models, GAN, VAE, and Flow-based models. They have shown great success in generating high-quality samples, but each has some limitations of its own.},
+  langid = {english},
+  keywords = {diffusion models},
+  file = {/home/danesabo/Zotero/storage/BWU7KMFA/2021-07-11-diffusion-models.html}
+}
+
+@online{WhatModelBasedSystems,
+  title = {What Is {{Model-Based Systems Engineering}} ({{MBSE}})?},
+  url = {https://www.ansys.com/blog/model-based-systems-engineering-explained},
+  urldate = {2023-10-06},
+  abstract = {See how organizations are using model-based solutions that enable them to manage complexity, collaborate and communicate, reduce costs, and get products to market more quickly.},
+  langid = {american}
+}
+
+@article{wilsonBestPracticesScientific2014,
+  title = {Best {{Practices}} for {{Scientific Computing}}},
+  author = {Wilson, Greg and Aruliah, D. A. and Brown, C. Titus and Hong, Neil P. Chue and Davis, Matt and Guy, Richard T. and Haddock, Steven H. D. and Huff, Kathryn D. and Mitchell, Ian M. and Plumbley, Mark D. and Waugh, Ben and White, Ethan P. and Wilson, Paul},
+  date = {2014-01-07},
+  journaltitle = {PLOS Biology},
+  shortjournal = {PLOS Biology},
+  volume = {12},
+  number = {1},
+  pages = {e1001745},
+  publisher = {Public Library of Science},
+  issn = {1545-7885},
+  doi = {10.1371/journal.pbio.1001745},
+  url = {https://journals.plos.org/plosbiology/article?id=10.1371/journal.pbio.1001745},
+  urldate = {2023-10-27},
+  abstract = {We describe a set of best practices for scientific software development, based on research and experience, that will improve scientists' productivity and the reliability of their software.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/ASKUBTZP/Wilson et al. - 2014 - Best Practices for Scientific Computing.pdf}
+}
+
+@article{wolfSafetySecurityCyberPhysical2018,
+  title = {Safety and {{Security}} in {{Cyber-Physical Systems}} and {{Internet-of-Things Systems}}},
+  author = {Wolf, Marilyn and Serpanos, Dimitrios},
+  date = {2018-01},
+  journaltitle = {Proceedings of the IEEE},
+  volume = {106},
+  number = {1},
+  pages = {9--20},
+  issn = {1558-2256},
+  doi = {10.1109/JPROC.2017.2781198},
+  url = {https://ieeexplore.ieee.org/abstract/document/8232537?casa_token=twgboow2ylwAAAAA:f3ATPxSmH1AMq9hxerfDl0j3khT6t-mgIuG9acsuTRPpMwDlVfB-49fTxtTHMLA4xdE0D9o_Dw},
+  urldate = {2023-09-27},
+  abstract = {Safety and security have traditionally been distinct problems in engineering and computer science. The introduction of computing elements to create cyber-physical systems (CPSs) has opened up a vast new range of potential problems that do not always show up on the radar of traditional engineers. Security, in contrast, is traditionally viewed as a data or communications security problem to be handled by computer scientists and/or computer engineers. Advances in CPSs and the Internet-of-Things (IoT) requires us to take a unified view of safety and security. This paper defines a safety/security threat model for CPSs and IoT systems and surveys emerging techniques which improve the safety and security of CPSs and IoT systems.},
+  eventtitle = {Proceedings of the {{IEEE}}},
+  file = {/home/danesabo/Zotero/storage/J3P35MSE/8232537.html}
+}
+
+@inproceedings{woodModelingAnalysisNeutron1991,
+  title = {Modeling and Analysis of Neutron Noise from an Ex-Core Detector at a Pressurized Water Reactor},
+  author = {Wood, R. T. and Perez, R. B.},
+  date = {1991},
+  location = {United States},
+  abstract = {Two applications of a noise diagnostic methodology were performed using ex-core neutron detector data from a pressurized water reactor (PWR). A feedback dynamics model of the neutron power spectral density (PSD) was derived from a low-order whole-plant physical model made stochastic using the Langevin technique. From a functional fit to plant data, the response of the dynamic system to changes in important physical parameters was evaluated by a direct sensitivity analysis. In addition, changes in monitored spectra were related to changes in physical parameters and detection thresholds using common surveillance discriminants were determined. A resonance model was developed from perturbation theory to give the ex-core neutron detector response for small in-core mechanical motions in terms of a pole-strength factor, a resonance asymmetry (or skewness) factor, a vibration damping factor, and a frequency of vibration. The mechanical motion parameters for several resonances were determined by a functional fit of the model to plant data taken at various times during a fuel cycle and were tracked to determine trends that indicated vibrational changes of reactor internals. In addition, the resonance model gave the ability to separate the resonant components of the PSD after the parameters had been identified. As a result, the behavior of several vibration peaks were monitored over a fuel cycle. 9 refs., 6 figs., 1 tab.},
+  note = {AC05-84OR21400}
+}
+
+@article{wooldridgeLECTUREINTRODUCTIONFORMAL,
+  title = {{{LECTURE}} 6: {{INTRODUCTION TO FORMAL METHODS}}},
+  author = {Wooldridge, Mike},
+  journaltitle = {Software Engineering},
+  langid = {english}
+}
+
+@article{wrightUsingCyberInformedEngineering,
+  title = {Using {{Cyber-Informed Engineering}} for {{Cyber Defense Workbook}}},
+  author = {Wright, Virginia and Chanoski, Sam and Turner, Tony and Freeman, Sarah},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/7PUG5TB8/Wright et al. - Using Cyber-Informed Engineering for Cyber Defense.pdf}
+}
+
+@article{wuBatteryDigitalTwins2020,
+  title = {Battery Digital Twins: {{Perspectives}} on the Fusion of Models, Data and Artificial Intelligence for Smart Battery Management Systems},
+  shorttitle = {Battery Digital Twins},
+  author = {Wu, Billy and Widanage, W. Dhammika and Yang, Shichun and Liu, Xinhua},
+  date = {2020-08},
+  journaltitle = {Energy and AI},
+  shortjournal = {Energy and AI},
+  volume = {1},
+  pages = {100016},
+  issn = {26665468},
+  doi = {10.1016/j.egyai.2020.100016},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S2666546820300161},
+  urldate = {2022-03-02},
+  langid = {english},
+  keywords = {DGC read},
+  file = {/home/danesabo/Zotero/storage/IW5WNMK7/Wu20.pdf}
+}
+
+@article{wuDigitalTwinsMicrogrids2024,
+  title = {Digital {{Twins}} for {{Microgrids}}: {{Opening}} a {{New Dimension}} in the {{Power System}}},
+  shorttitle = {Digital {{Twins}} for {{Microgrids}}},
+  author = {Wu, Ying and Guerrero, Josep M. and Wu, Yanpeng and Bazmohammadi, Najmeh and Vasquez, Juan C. and Cabrera, Andrea Justo and Lu, Ning},
+  date = {2024-01},
+  journaltitle = {IEEE Power and Energy Magazine},
+  volume = {22},
+  number = {1},
+  pages = {35--42},
+  issn = {1558-4216},
+  doi = {10.1109/MPE.2023.3324296},
+  url = {https://ieeexplore.ieee.org/document/10398548/},
+  urldate = {2024-03-13},
+  abstract = {The need for affordable, reliable, sustainable, and modern energy is now more important than ever because of the climate crisis. Climate change will push up to 130 million people into poverty over the next 10 years and continue to cause more unpredictable natural disasters, such as cyclones, flooding, earthquakes, landslides, tsunamis, and volcanic eruptions. Power outages do not occur only in remote rural areas but also in developed countries, lasting for several hours and even a couple of days, due to the extreme weather in recent years. Microgrids, as a flexible architecture capable of integrating local distributed energy resources (DERs), can satisfy wide-ranging demands via their variable solutions, from off-grid to on-grid applications.},
+  eventtitle = {{{IEEE Power}} and {{Energy Magazine}}},
+  file = {/home/danesabo/Zotero/storage/WX3U8WEL/Wu et al. - 2024 - Digital Twins for Microgrids Opening a New Dimens.pdf;/home/danesabo/Zotero/storage/MXY9KRLA/10398548.html}
+}
+
+@article{xiaoHyperparameterSelectionGaussian2015,
+  title = {Hyperparameter {{Selection}} for {{Gaussian Process One-Class Classification}}},
+  author = {Xiao, Yingchao and Wang, Huangang and Xu, Wenli},
+  date = {2015-09},
+  journaltitle = {IEEE Transactions on Neural Networks and Learning Systems},
+  shortjournal = {IEEE Trans. Neural Netw. Learning Syst.},
+  volume = {26},
+  number = {9},
+  pages = {2182--2187},
+  issn = {2162-237X, 2162-2388},
+  doi = {10.1109/TNNLS.2014.2363457},
+  url = {https://ieeexplore.ieee.org/document/6940303},
+  urldate = {2022-04-21},
+  abstract = {Gaussian processes (GPs) provide predicted outputs with a full conditional statistical description, which can be used to establish confidence intervals and to set hyperparameters. This characteristic provides GPs with competitive or better performance in various applications. However, the specificity of one-class classification (OCC) makes GPs unable to select suitable hyperparameters in their traditional way. This brief proposes to select hyperparameters for GP OCC using the prediction difference between edge and interior positive training samples. Experiments on 2-D artificial and University of California benchmark data sets verify the effectiveness of this method.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/LSPTYCAG/Xiao et al. - 2015 - Hyperparameter Selection for Gaussian Process One-.pdf}
+}
+
+@book{xuNuclearPowerPlants2017,
+  title = {Nuclear {{Power Plants}}: {{Innovative Technologies}} for {{Instrumentation}} and {{Control Systems}}: {{International Symposium}} on {{Software Reliability}}, {{Industrial Safety}}, {{Cyber Security}} and {{Physical Protection}} of {{Nuclear Power Plant}}},
+  shorttitle = {Nuclear {{Power Plants}}},
+  editor = {Xu, Yang},
+  date = {2017},
+  series = {Lecture {{Notes}} in {{Electrical Engineering}}},
+  volume = {400},
+  publisher = {Springer Singapore},
+  location = {Singapore},
+  doi = {10.1007/978-981-10-3361-2},
+  url = {http://link.springer.com/10.1007/978-981-10-3361-2},
+  urldate = {2022-09-30},
+  isbn = {978-981-10-3360-5 978-981-10-3361-2},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/W5BZQUID/Xu - 2017 - Nuclear Power Plants Innovative Technologies for .pdf}
+}
+
+@article{xuSurveyIndustrialInternet2018,
+  title = {A {{Survey}} on {{Industrial Internet}} of {{Things}}: {{A Cyber-Physical Systems Perspective}}},
+  shorttitle = {A {{Survey}} on {{Industrial Internet}} of {{Things}}},
+  author = {Xu, Hansong and Yu, Wei and Griffith, David and Golmie, Nada},
+  date = {2018},
+  journaltitle = {IEEE Access},
+  shortjournal = {IEEE Access},
+  volume = {6},
+  pages = {78238--78259},
+  issn = {2169-3536},
+  doi = {10.1109/ACCESS.2018.2884906},
+  url = {https://ieeexplore.ieee.org/document/8558534/},
+  urldate = {2022-09-30},
+  abstract = {The vision of Industry 4.0, otherwise known as the fourth industrial revolution, is the integration of massively deployed smart computing and network technologies in industrial production and manufacturing settings for the purposes of automation, reliability, and control, implicating the development of an Industrial Internet of Things (I-IoT). Specifically, I-IoT is devoted to adopting the IoT to enable the interconnection of anything, anywhere, and at any time in the manufacturing system context to improve the productivity, efficiency, safety, and intelligence. As an emerging technology, I-IoT has distinct properties and requirements that distinguish it from consumer IoT, including the unique types of smart devices incorporated, network technologies and quality-of-service requirements, and strict needs of command and control. To more clearly understand the complexities of I-IoT and its distinct needs and to present a unified assessment of the technology from a systems’ perspective, in this paper, we comprehensively survey the body of existing research on I-IoT. Particularly, we first present the I-IoT architecture, I-IoT applications (i.e., factory automation and process automation), and their characteristics. We then consider existing research efforts from the three key system aspects of control, networking, and computing. Regarding control, we first categorize industrial control systems and then present recent and relevant research efforts. Next, considering networking, we propose a three-dimensional framework to explore the existing research space and investigate the adoption of some representative networking technologies, including 5G, machine-tomachine communication, and software-defined networking. Similarly, concerning computing, we again propose a second three-dimensional framework that explores the problem space of computing in I-IoT and investigate the cloud, edge, and hybrid cloud and edge computing platforms. Finally, we outline particular challenges and future research needs in control, networking, and computing systems, as well as for the adoption of machine learning in an I-IoT context.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/NRWS9353/Xu et al. - 2018 - A Survey on Industrial Internet of Things A Cyber.pdf}
+}
+
+@article{yaacoubCyberphysicalSystemsSecurity2020,
+  title = {Cyber-Physical Systems Security: {{Limitations}}, Issues and Future Trends},
+  shorttitle = {Cyber-Physical Systems Security},
+  author = {Yaacoub, Jean-Paul A. and Salman, Ola and Noura, Hassan N. and Kaaniche, Nesrine and Chehab, Ali and Malli, Mohamad},
+  date = {2020-09},
+  journaltitle = {Microprocessors and Microsystems},
+  shortjournal = {Microprocessors and Microsystems},
+  volume = {77},
+  pages = {103201},
+  issn = {01419331},
+  doi = {10.1016/j.micpro.2020.103201},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0141933120303689},
+  urldate = {2023-10-11},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/78PSLB9E/Yaacoub et al. - 2020 - Cyber-physical systems security Limitations, issu.pdf}
+}
+
+@unpublished{yangDiffusionModelsComprehensive2022,
+  title = {Diffusion Models: {{A}} Comprehensive Survey of Methods and Applications},
+  author = {Yang, Ling and Zhang, Zhilong and Song, Yang and Hong, Shenda and Xu, Runsheng and Zhao, Yue and Shao, Yingxia and Zhang, Wentao and Cui, Bin and Yang, Ming-Hsuan},
+  date = {2022},
+  eprint = {2209.00796},
+  eprinttype = {arXiv}
+}
+
+@article{yangDiffusionModelsComprehensive2024,
+  title = {Diffusion {{Models}}: {{A Comprehensive Survey}} of {{Methods}} and {{Applications}}},
+  shorttitle = {Diffusion {{Models}}},
+  author = {Yang, Ling and Zhang, Zhilong and Song, Yang and Hong, Shenda and Xu, Runsheng and Zhao, Yue and Zhang, Wentao and Cui, Bin and Yang, Ming-Hsuan},
+  date = {2024-04-30},
+  journaltitle = {ACM Computing Surveys},
+  shortjournal = {ACM Comput. Surv.},
+  volume = {56},
+  number = {4},
+  pages = {1--39},
+  issn = {0360-0300, 1557-7341},
+  doi = {10.1145/3626235},
+  url = {https://dl.acm.org/doi/10.1145/3626235},
+  urldate = {2024-05-20},
+  abstract = {Diffusion models have emerged as a powerful new family of deep generative models with record-breaking performance in many applications, including image synthesis, video generation, and molecule design. In this survey, we provide an overview of the rapidly expanding body of work on diffusion models, categorizing the research into three key areas: efficient sampling, improved likelihood estimation, and handling data with special structures. We also discuss the potential for combining diffusion models with other generative models for enhanced results. We further review the wide-ranging applications of diffusion models in fields spanning from computer vision, natural language processing, temporal data modeling, to interdisciplinary applications in other scientific disciplines. This survey aims to provide a contextualized, in-depth look at the state of diffusion models, identifying the key areas of focus and pointing to potential areas for further exploration. Github:               https://github.com/YangLing0818/Diffusion-Models-Papers-Survey-Taxonomy},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/4QVSPKRW/Yang et al. - 2024 - Diffusion Models A Comprehensive Survey of Method.pdf}
+}
+
+@article{yangMeasureRiskDecisionmaking2005,
+  title = {A Measure of Risk and a Decision-Making Model Based on Expected Utility and Entropy},
+  author = {Yang, Jiping and Qiu, Wanhua},
+  date = {2005-08},
+  journaltitle = {European Journal of Operational Research},
+  shortjournal = {European Journal of Operational Research},
+  volume = {164},
+  number = {3},
+  pages = {792--799},
+  issn = {03772217},
+  doi = {10.1016/j.ejor.2004.01.031},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0377221704000773},
+  urldate = {2024-01-26},
+  abstract = {In this paper we extend the classical decision model under risk to a more general case, in which the state of nature corresponding to each risky action may have its own distribution. More specifically, we propose an expected utilityentropy (EU-E) measure of risk and a decision-making model based on expected utility and entropy. The EU-E measure of risk reflects an individual’s intuitive attitude toward risk. The decision model incorporates the expected utility decision criterion as a special case. Using this decision model, a class of decision problems, which cannot be dealt with the expected utility or mean–variance criterion reasonably, can be solved. Besides, some famous decision paradoxes can be interpreted. This decision model can either serve as a descriptive or a normative decision model involving risk.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/I9TCGTGB/Yang and Qiu - 2005 - A measure of risk and a decision-making model base.pdf}
+}
+
+@inproceedings{yangRuntimeIntegrityVerification2019,
+  title = {Runtime {{Integrity Verification}} in {{Cyber-physical Systems}} Using {{Side-Channel Fingerprint}}},
+  booktitle = {2019 {{IEEE International Conference}} on {{Consumer Electronics}} ({{ICCE}})},
+  author = {Yang, Shuo and Alaql, Abdulrahman and Hoque, Tamzidul and Bhunia, Swarup},
+  date = {2019-01},
+  pages = {1--6},
+  issn = {2158-4001},
+  doi = {10.1109/ICCE.2019.8662071},
+  url = {https://ieeexplore.ieee.org/abstract/document/8662071?casa_token=fcNFHkRNawcAAAAA:vcY_JpTHsFPPEVXy60IB0ScqkGXHkAPpk6IAlr1u6MsgPEtBDgrUpuJv3LeLGYdgpw7Nd3qwsw},
+  urldate = {2023-09-27},
+  abstract = {The world is moving towards a connected ecosystem of cyber-physical components, which are increasingly deployed in diverse fields, from automobiles, to power grids, city infrastructure, manufacturing, and biomedical systems. Majority of these applications call for physical proximity of users to the system due to the nature of the service (e.g., health care). Both remote (through a network) and physical access to these systems have significantly broadened the attack surface of Cyber-Physical Systems (CPS) by providing increased flexibility to observe and alter the system maliciously. Many such systems are deployed in critical applications requiring a high level of operational integrity. Existing solutions for attack detection and prevention are often not adequate, specifically with respect to emerging vulnerabilities. In this paper, we focus on run-time monitoring of CPS with respect to attacks on hardware and software. In particular, we present the motivation for run-time monitoring and then propose methods for detection of physical attacks on hardware and activation of malicious programs in system software, both of which are severe threats to traditional and emerging applications of CPS. We propose a power-up and runtime hardware-software integrity monitoring of sensing and computing equipment in CPS through continuous observation of various side-channel parameters using a plug-and-play hardware module. We present a systematic framework that includes signature generation and comparison technique through device calibration, noise reduction, and workload analysis. Finally, we present a framework for monitoring two side-channel parameters (namely, power and electromagnetic radiation) to detect component replacement and malicious code execution.},
+  eventtitle = {2019 {{IEEE International Conference}} on {{Consumer Electronics}} ({{ICCE}})},
+  file = {/home/danesabo/Zotero/storage/EW34JFVV/Yang et al. - 2019 - Runtime Integrity Verification in Cyber-physical S.pdf}
+}
+
+@article{yaoModelBasedDeepTransfer2022,
+  title = {Model-{{Based Deep Transfer Learning Method}} to {{Fault Detection}} and {{Diagnosis}} in {{Nuclear Power Plants}}},
+  author = {Yao, Yuantao and Ge, Daochuan and Yu, Jie and Xie, Min},
+  date = {2022-03-02},
+  journaltitle = {Frontiers in Energy Research},
+  shortjournal = {Front. Energy Res.},
+  volume = {10},
+  pages = {823395},
+  issn = {2296-598X},
+  doi = {10.3389/fenrg.2022.823395},
+  url = {https://www.frontiersin.org/articles/10.3389/fenrg.2022.823395/full},
+  urldate = {2023-10-11},
+  abstract = {Deep learning–based nuclear intelligent fault detection and diagnosis (FDD) methods have been widely developed and have achieved very competitive results with the progress of artificial intelligence technology. However, the pretrained model for diagnosis tasks is hard in achieving good performance when the reactor operation conditions are updated. On the other hand, retraining the model for a new data set will waste computing resources. This article proposes an FDD method for cross-condition and cross-facility tasks based on the optimized transferable convolutional neural network (CNN) model. First, by using the pretrained model’s prior knowledge, the model’s diagnosis performance to be transferred for source domain data sets is improved. Second, a model-based transfer learning strategy is adopted to freeze the feature extraction layer in a part of the training model. Third, the training data in target domain data sets are used to optimize the model layer by layer to find the optimization model with the transferred layer. Finally, the proposed comprehensive simulation platform provides source and target cross-condition and cross-facility data sets to support case studies. The designed model utilizes the strong nonlinear feature extraction performance of a deep network and applies the prior knowledge of pretrained models to improve the accuracy and timeliness of training. The results show that the proposed method is superior to achieving good generalization performance at less training epoch than the retraining benchmark deep CNN model.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/92IWNIQD/Yao et al. - 2022 - Model-Based Deep Transfer Learning Method to Fault.pdf}
+}
+
+@unpublished{yaoQualityUncertaintyQuantification2019,
+  title = {Quality of {{Uncertainty Quantification}} for {{Bayesian Neural Network Inference}}},
+  author = {Yao, Jiayu and Pan, Weiwei and Ghosh, Soumya and Doshi-Velez, Finale},
+  date = {2019-06-23},
+  eprint = {1906.09686},
+  eprinttype = {arXiv},
+  eprintclass = {cs, stat},
+  url = {http://arxiv.org/abs/1906.09686},
+  urldate = {2022-05-05},
+  abstract = {Bayesian Neural Networks (BNNs) place priors over the parameters in a neural network. Inference in BNNs, however, is difficult; all inference methods for BNNs are approximate. In this work, we empirically compare the quality of predictive uncertainty estimates for 10 common inference methods on both regression and classification tasks. Our experiments demonstrate that commonly used metrics (e.g. test log-likelihood) can be misleading. Our experiments also indicate that inference innovations designed to capture structure in the posterior do not necessarily produce high quality posterior approximations.},
+  note = {Comment: Accepted to ICML UDL 2019},
+  file = {/home/danesabo/Zotero/storage/3STLFSLA/Yao et al. - 2019 - Quality of Uncertainty Quantification for Bayesian.pdf;/home/danesabo/Zotero/storage/KKA3FIX8/1906.html}
+}
+
+@article{yildizEfficiencyHydrogenProduction2006,
+  title = {Efficiency of Hydrogen Production Systems Using Alternative Nuclear Energy Technologies},
+  author = {Yildiz, B and Kazimi, M},
+  date = {2006-01},
+  journaltitle = {International Journal of Hydrogen Energy},
+  shortjournal = {International Journal of Hydrogen Energy},
+  volume = {31},
+  number = {1},
+  pages = {77--92},
+  issn = {03603199},
+  doi = {10.1016/j.ijhydene.2005.02.009},
+  url = {https://linkinghub.elsevier.com/retrieve/pii/S0360319905000583},
+  urldate = {2022-03-30},
+  abstract = {Nuclear energy can be used as the primary energy source in centralized hydrogen production through high-temperature thermochemical processes, water electrolysis, or high-temperature steam electrolysis. Energy efficiency is important in providing hydrogen economically and in a climate friendly manner. High operating temperatures are needed for more efficient thermochemical and electrochemical hydrogen production using nuclear energy. Therefore, high-temperature reactors, such as the gas-cooled, molten-salt-cooled and liquid-metal-cooled reactor technologies, are the candidates for use in hydrogen production. Several candidate technologies that span the range from well developed to conceptual are compared in our analysis. Among these alternatives, high-temperature steam electrolysis (HTSE) coupled to an advanced gas reactor cooled by supercritical CO2 (S-CO2) and equipped with a supercritical CO2 power conversion cycle has the potential to provide higher energy efficiency at a lower temperature range than the other alternatives.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/DX6BWXJG/Yildiz and Kazimi - 2006 - Efficiency of hydrogen production systems using al.pdf}
+}
+
+@online{yimSEDiffusionModel2023,
+  title = {{{SE}}(3) Diffusion Model with Application to Protein Backbone Generation},
+  author = {Yim, Jason and Trippe, Brian L. and De Bortoli, Valentin and Mathieu, Emile and Doucet, Arnaud and Barzilay, Regina and Jaakkola, Tommi},
+  date = {2023-05-22},
+  eprint = {2302.02277},
+  eprinttype = {arXiv},
+  eprintclass = {cs, q-bio, stat},
+  url = {http://arxiv.org/abs/2302.02277},
+  urldate = {2023-10-05},
+  abstract = {The design of novel protein structures remains a challenge in protein engineering for applications across biomedicine and chemistry. In this line of work, a diffusion model over rigid bodies in 3D (referred to as frames) has shown success in generating novel, functional protein backbones that have not been observed in nature. However, there exists no principled methodological framework for diffusion on SE(3), the space of orientation preserving rigid motions in R3, that operates on frames and confers the group invariance. We address these shortcomings by developing theoretical foundations of SE(3) invariant diffusion models on multiple frames followed by a novel framework, FrameDiff, for learning the SE(3) equivariant score over multiple frames. We apply FrameDiff on monomer backbone generation and find it can generate designable monomers up to 500 amino acids without relying on a pretrained protein structure prediction network that has been integral to previous methods. We find our samples are capable of generalizing beyond any known protein structure.},
+  langid = {english},
+  pubstate = {prepublished},
+  file = {/home/danesabo/Zotero/storage/6AHQKEGA/Yim et al. - 2023 - SE(3) diffusion model with application to protein .pdf}
+}
+
+@article{yinRecentAdvancesFormal2020,
+  title = {Recent Advances on Formal Methods for Safety and Security of Cyber-Physical Systems},
+  author = {Yin, Xiang and Li, Shaoyuan},
+  date = {2020-12-01},
+  journaltitle = {Control Theory and Technology},
+  shortjournal = {Control Theory Technol.},
+  volume = {18},
+  number = {4},
+  pages = {459--461},
+  issn = {2198-0942},
+  doi = {10.1007/s11768-020-00008-w},
+  url = {https://doi.org/10.1007/s11768-020-00008-w},
+  urldate = {2022-06-20},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/6BVGTXCF/Yin and Li - 2020 - Recent advances on formal methods for safety and s.pdf}
+}
+
+@incollection{yuSTLmcRobustSTL2022,
+  title = {{{STLmc}}: {{Robust STL Model Checking}} of {{Hybrid Systems Using SMT}}},
+  shorttitle = {{{STLmc}}},
+  booktitle = {Computer {{Aided Verification}}},
+  author = {Yu, Geunyeol and Lee, Jia and Bae, Kyungmin},
+  editor = {Shoham, Sharon and Vizel, Yakir},
+  date = {2022},
+  volume = {13371},
+  pages = {524--537},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-031-13185-1_26},
+  url = {https://link.springer.com/10.1007/978-3-031-13185-1_26},
+  urldate = {2023-11-02},
+  abstract = {We present the STLmc model checker for signal temporal logic (STL) properties of hybrid systems. The STLmc tool can perform STL model checking up to a robustness threshold for a wide range of hybrid systems. Our tool utilizes the refutation-complete SMT-based bounded model checking algorithm by reducing the robust STL model checking problem into Boolean STL model checking. If STLmc does not find a counterexample, the system is guaranteed to be correct up to the given bounds and robustness threshold. We demonstrate the effectiveness of STLmc on a number of hybrid system benchmarks.},
+  isbn = {978-3-031-13184-4 978-3-031-13185-1},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/3YTF9M9I/Yu et al. - 2022 - STLmc Robust STL Model Checking of Hybrid Systems.pdf}
+}
+
+@article{zahidSystematicMappingSemiformal2022,
+  title = {A Systematic Mapping of Semi-Formal and Formal Methods in Requirements Engineering of Industrial {{Cyber-Physical}} Systems},
+  author = {Zahid, Farzana and Tanveer, Awais and Kuo, Matthew M. Y. and Sinha, Roopak},
+  date = {2022-08},
+  journaltitle = {Journal of Intelligent Manufacturing},
+  shortjournal = {J Intell Manuf},
+  volume = {33},
+  number = {6},
+  pages = {1603--1638},
+  issn = {0956-5515, 1572-8145},
+  doi = {10.1007/s10845-021-01753-8},
+  url = {https://link.springer.com/10.1007/s10845-021-01753-8},
+  urldate = {2023-10-10},
+  abstract = {The requirements engineering of Industrial Cyber-Physical Systems is extremely challenging due to large system sizes, component heterogeneity, involvement of multi-discipline stakeholders and machines, and continuous evolution. Formal and semi-formal languages, techniques, tools and frameworks can assist by providing repeatable and rigorous structures for eliciting, specifying, analysing, verifying and maintaining requirements. Various approaches have been proposed, but a contemporary and comprehensive study providing a landscape of the state-of-the-art is currently missing. This article reports a systematic mapping study covering 93 primary studies published between 2009 and October 2020. We categorise surveyed studies by current research directions in the use of semi-formal and formal methods for Requirements Engineering phases for Industrial Cyber-Physical Systems. We also identify gaps in current research and develop a novel conceptual model capturing the relationship between available formalisms and Requirements Engineering activities. We find that extensive work has been carried out on the formal analysis and verification of safety and timings requirements. However, the use of semi-formal notations, works on key phases like requirements elicitation and management, and the adoption of industrial standards are largely missing. Moreover, we find no literature providing methods to handle privacy and trust requirements, which have become critical concerns in this area.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/QSAFGNUU/Zahid et al. - 2022 - A systematic mapping of semi-formal and formal met.pdf}
+}
+
+@online{zhangExplainableHumanintheloopDynamic2022,
+  title = {Explainable {{Human-in-the-loop Dynamic Data-Driven Digital Twins}}},
+  author = {Zhang, Nan and Bahsoon, Rami and Tziritas, Nikos and Theodoropoulos, Georgios},
+  date = {2022-11-22},
+  eprint = {2207.09106},
+  eprinttype = {arXiv},
+  eprintclass = {cs, eess},
+  url = {http://arxiv.org/abs/2207.09106},
+  urldate = {2023-10-11},
+  abstract = {Digital Twins (DT) are essentially Dynamic Data-driven models that serve as real-time symbiotic “virtual replicas” of real-world systems. DT can leverage fundamentals of Dynamic Data-Driven Applications Systems (DDDAS) bidirectional symbiotic sensing feedback loops for its continuous updates. Sensing loops can consequently steer measurement, analysis and reconfiguration aimed at more accurate modelling and analysis in DT. The reconfiguration decisions can be autonomous or interactive, keeping human-in-the-loop. The trustworthiness of these decisions can be hindered by inadequate explainability of the rationale, and utility gained in implementing the decision for the given situation among alternatives. Additionally, different decision-making algorithms and models have varying complexity, quality and can result in different utility gained for the model. The inadequacy of explainability can limit the extent to which humans can evaluate the decisions, often leading to updates which are unfit for the given situation, erroneous, compromising the overall accuracy of the model. The novel contribution of this paper is an approach to harnessing explainability in human-in-the-loop DDDAS and DT systems, leveraging bidirectional symbiotic sensing feedback. The approach utilises interpretable machine learning and goal modelling to explainability, and considers trade-off analysis of utility gained. We use examples from smart warehousing to demonstrate the approach.},
+  langid = {english},
+  pubstate = {prepublished},
+  note = {Comment: 11 pages, 1 figure, accepted by the 4th International Conference on InfoSymbiotics/Dynamic Data Driven Applications Systems (DDDAS2022)},
+  file = {/home/danesabo/Zotero/storage/6EZU83L3/Zhang et al. - 2022 - Explainable Human-in-the-loop Dynamic Data-Driven .pdf}
+}
+
+@article{zhangSurveyAttackDetection2021,
+  title = {A Survey on Attack Detection, Estimation and Control of Industrial Cyber–Physical Systems},
+  author = {Zhang, Dan and Wang, Qing-Guo and Feng, Gang and Shi, Yang and Vasilakos, Athanasios V.},
+  date = {2021-10-01},
+  journaltitle = {ISA Transactions},
+  shortjournal = {ISA Transactions},
+  volume = {116},
+  pages = {1--16},
+  issn = {0019-0578},
+  doi = {10.1016/j.isatra.2021.01.036},
+  url = {https://www.sciencedirect.com/science/article/pii/S001905782100046X},
+  urldate = {2023-09-27},
+  abstract = {Cyber–physical systems (CPSs) are complex systems that involve technologies such as control, communication, and computing. Nowadays, CPSs have a wide range of applications in smart cities, smart grids, smart manufacturing and intelligent transportation. However, with integration of industrial control systems with modern communication technologies, CPSs would be inevitably exposed to increasing security threats, which could lead to severe degradation of the system performance and even destruction of CPSs. This paper presents a survey on recent advances on security issues of industrial cyber–physical systems (ICPSs). We specifically discuss two typical kinds of attacks, i.e., Denial-of-Service (DoS) attack and Deception attack, and present recent results in terms of attack detection, estimation, and control of ICPSs. Classifications of current studies are analyzed and summarized based on different system modeling and analysis methods. In addition, advantages and disadvantage of various methodologies are also discussed. Finally, the paper concludes with some potential future research directions on secure ICPSs.},
+  keywords = {survey},
+  file = {/home/danesabo/Zotero/storage/PWC8KKBH/Zhang et al. - 2021 - A survey on attack detection, estimation and contr.pdf}
+}
+
+@inproceedings{zhangUnderstandingUncertaintyCyberPhysical2016,
+  title = {Understanding {{Uncertainty}} in {{Cyber-Physical Systems}}: {{A Conceptual Model}}},
+  shorttitle = {Understanding {{Uncertainty}} in {{Cyber-Physical Systems}}},
+  booktitle = {Modelling {{Foundations}} and {{Applications}}},
+  author = {Zhang, Man and Selic, Bran and Ali, Shaukat and Yue, Tao and Okariz, Oscar and Norgren, Roland},
+  editor = {Wąsowski, Andrzej and Lönn, Henrik},
+  date = {2016},
+  pages = {247--264},
+  publisher = {Springer International Publishing},
+  location = {Cham},
+  doi = {10.1007/978-3-319-42061-5_16},
+  abstract = {Uncertainty is intrinsic in most technical systems, including Cyber-Physical Systems (CPS). Therefore, handling uncertainty in a graceful manner during the real operation of CPS is critical. Since designing, developing, and testing modern and highly sophisticated CPS is an expanding field, a step towards dealing with uncertainty is to identify, define, and classify uncertainties at various levels of CPS. This will help develop a systematic and comprehensive understanding of uncertainty. To that end, we propose a conceptual model for uncertainty specifically designed for CPS. Since the study of uncertainty in CPS development and testing is still irrelatively unexplored, this conceptual model was derived in a large part by reviewing existing work on uncertainty in other fields, including philosophy, physics, statistics, and healthcare. The conceptual model is mapped to the three logical levels of CPS: Application, Infrastructure, and Integration. It is captured using UML class diagrams, including relevant OCL constraints. To validate the conceptual model, we identified, classified, and specified uncertainties in two distinct industrial case studies.},
+  isbn = {978-3-319-42061-5},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/J3FYJD5D/Zhang et al. - 2016 - Understanding Uncertainty in Cyber-Physical System.pdf}
+}
+
+@inproceedings{zhaoByzantineFaultTolerance2008,
+  title = {Byzantine {{Fault Tolerance}} for {{Electric Power Grid Monitoring}} and {{Control}}},
+  booktitle = {2008 {{International Conference}} on {{Embedded Software}} and {{Systems}}},
+  author = {Zhao, Wenbing and Villaseca, F. Eugenio},
+  date = {2008-07},
+  pages = {129--135},
+  doi = {10.1109/ICESS.2008.13},
+  abstract = {The stability of the electric power grid is crucial to every nation's security and well-being. As revealed by a number of large-scale blackout incidents in North America, the data communication infrastructure for power grid is in urgent need of transformation to modern technology. It has been shown by extensive research work that such blackout could have been avoided if there were more prompt information sharing and coordination among the power grid monitoring and control systems. In this paper, we point out the need for Byzantine fault tolerance and investigate the feasibility of applying Byzantine fault tolerance technology to ensure high degree of reliability and security of power grid monitoring and control. Our empirical study demonstrated that Byzantine fault tolerant monitoring and control can easily sustain the 60 Hz sampling rate needed for supervisory control and data acquisition (SCADA) operations with sub-millisecond response time under the local-area network environment. Byzantine fault tolerant monitoring and control is also feasible under the wide-area network environment for power grid applications that demand sub-second reaction time.},
+  eventtitle = {2008 {{International Conference}} on {{Embedded Software}} and {{Systems}}},
+  file = {/home/danesabo/Zotero/storage/P8VBL56H/Zhao and Villaseca - 2008 - Byzantine Fault Tolerance for Electric Power Grid .pdf;/home/danesabo/Zotero/storage/MU9XALCI/4595548.html}
+}
+
+@article{zhaoDataDrivenAttackDetection2023,
+  title = {Data-{{Driven Attack Detection}} and {{Identification}} for {{Cyber-Physical Systems Under Sparse Sensor Attacks}}},
+  author = {Zhao, Zhengen and Xu, Yunsong and Li, Yuzhe and Zhen, Ziyang and Yang, Ying and Shi, Yang},
+  date = {2023-10},
+  journaltitle = {IEEE Transactions on Automatic Control},
+  volume = {68},
+  number = {10},
+  pages = {6330--6337},
+  issn = {1558-2523},
+  doi = {10.1109/TAC.2022.3230360},
+  url = {https://ieeexplore.ieee.org/abstract/document/9992077?casa_token=QLOzqroOodIAAAAA:yAha4LvQYD_84AqAdVCAcT1QBP3lqtACiaTZMfu2oxg_mn21MrclVfnbGVFeD8cmd6NRWXQprA},
+  urldate = {2023-09-27},
+  abstract = {This article studies the issues of data-driven attack detection and identification for cyber-physical systems under sparse sensor attacks. First, based on the available input and output datasets, a data-driven monitor is formulated with the following two objectives: attack detection and attack identification. Then, with the subspace approach, a data-driven attack detection policy is presented, wherein the attack detector is designed directly by the process data. A subspace projection-based attack identification scheme is proposed via designing a bank of projection filters to determine the locations of attacked sensors. Moreover, the sparse recovery technique is adopted to decrease the combinatorial complexity of the subspace projection-based identification method. The attack identification is recast into a block-sparse recovery problem. Finally, the proposed methods are verified by the simulations on a flight vehicle system.},
+  eventtitle = {{{IEEE Transactions}} on {{Automatic Control}}},
+  keywords = {detection},
+  file = {/home/danesabo/Zotero/storage/5MH4FDV2/Zhao et al. - 2023 - Data-Driven Attack Detection and Identification fo.pdf;/home/danesabo/Zotero/storage/7HWD9NET/9992077.html}
+}
+
+@article{zhaoNeuralLyapunovControl2021,
+  title = {Neural {{Lyapunov Control}} for {{Power System Transient Stability}}: {{A Deep Learning-Based Approach}}},
+  shorttitle = {Neural {{Lyapunov Control}} for {{Power System Transient Stability}}},
+  author = {Zhao, Tianqiao and Wang, Jianhui and Lu, Xiaonan and Du, Yuhua},
+  date = {2021-08-05},
+  journaltitle = {IEEE Transactions on Power Systems},
+  volume = {37},
+  number = {BNL-222935-2022-JAAM},
+  publisher = {IEEE},
+  issn = {0885-8950},
+  doi = {10.1109/tpwrs.2021.3102857},
+  url = {https://www.osti.gov/biblio/1868519},
+  urldate = {2024-01-17},
+  abstract = {We report that power system control and transient stability analysis play essential roles in secure system operation. Control of power systems typically involves highly nonlinear and complex dynamics. Most of the existing works address such problems with additional assumptions in system dynamics, leading to a requirement for a complete and general solution. This paper, therefore, proposes a novel control framework for various power system control and stability problems leveraging a learning-based approach. The proposed framework includes a two-module structure that iteratively and jointly learns the candidate Lyapunov function and control law via deep neural networks in a learning module. Meanwhile, it guides the learning procedure towards valid results satisfying Lyapunov conditions in a falsification module. The introduced termination criteria ensure provable system stability. This control framework is verified through several studies handling different types of power system control problems. The results show that the proposed framework is generalizable and can simplify the control design for complex power systems with the stability guarantee and enlarged region of attraction.},
+  issue = {2},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/7RV26D7X/Zhao et al. - 2021 - Neural Lyapunov Control for Power System Transient.pdf}
+}
+
+@article{zhaoStabilityL2gainControl2008,
+  title = {On Stability, {{L2-gain}} and {{H}}∞ Control for Switched Systems},
+  author = {Zhao, Jun and Hill, David J.},
+  date = {2008-05-01},
+  journaltitle = {Automatica},
+  shortjournal = {Automatica},
+  volume = {44},
+  number = {5},
+  pages = {1220--1232},
+  issn = {0005-1098},
+  doi = {10.1016/j.automatica.2007.10.011},
+  url = {https://www.sciencedirect.com/science/article/pii/S0005109807004505},
+  urldate = {2024-01-16},
+  abstract = {This paper addresses the issues of stability, L2-gain analysis and H∞ control for switched systems via multiple Lyapunov function methods. A concept of general Lyapunov-like functions is presented. A necessary and sufficient condition for stability of switched systems is given in terms of multiple generalized Lyapunov-like functions, which enables derivation of improved stability tests, an L2-gain characterization and a design method for stabilizing switching laws. A solution to the H∞ control problem for switched systems is also provided.},
+  file = {/home/danesabo/Zotero/storage/TKKQIFS3/Zhao and Hill - 2008 - On stability, L2-gain and H∞ control for switched .pdf;/home/danesabo/Zotero/storage/NYPRM7Y7/S0005109807004505.html}
+}
+
+@article{zhenhaiMultiargumentControlMode2016,
+  title = {Multi-Argument {{Control Mode Switching Strategy}} for {{Adaptive Cruise Control System}}},
+  author = {Zhenhai, Gao and Jun, Wang and Hongyu, Hu and Wei, Yan and Dazhi, Wang and Lin, Wang},
+  date = {2016-01-01},
+  journaltitle = {Procedia Engineering},
+  shortjournal = {Procedia Engineering},
+  series = {Green {{Intelligent Transportation System}} and {{Safety}}},
+  volume = {137},
+  pages = {581--589},
+  issn = {1877-7058},
+  doi = {10.1016/j.proeng.2016.01.295},
+  url = {https://www.sciencedirect.com/science/article/pii/S1877705816003222},
+  urldate = {2023-11-20},
+  abstract = {Adaptive Cruise Control system contains the distance control function which is an extension of the conventional Cruise Control system. ACC system has to switch to appropriate control modes according to different traffic scenes. The existing switching strategies are generally designed based on two arguments including relative distance and relative velocity between the host vehicle and the preceding vehicle. Because switching thresholds of the existing methods are mostly determined based on steady states of control mode, the switching process cannot be continuous and smooth in many cases. In order to overcome the shortage of existing switching strategy, a new switch strategy is put forward in this paper which considers three arguments: distance, relative velocity and acceleration. This new strategy can make vehicle acceleration continuous and smooth during control mode switching, which improves the comfort performance of ACC system. Moreover, the decision algorithms of cruise mode, follow mode and approach mode in ACC system are built. The new switching strategy with three arguments is established in this paper. At last, the road tests show that the proposed switching strategy is able to switch to correct control mode according to actual traffic scenes. In addition, the switching progress is smoother than the existing two arguments switching strategy.},
+  file = {/home/danesabo/Zotero/storage/V42HQ6C5/Zhenhai et al. - 2016 - Multi-argument Control Mode Switching Strategy for.pdf;/home/danesabo/Zotero/storage/VFRJU8BV/S1877705816003222.html}
+}
+
+@article{zhongAnalysisEnergyLaboratory2023,
+  title = {Analysis of {{Energy Laboratory Safety Management}} in {{China Based}} on the {{System-Theoretic Accident Model}} and {{Processes}}/{{System Theoretic Process Analysis STAMP}}/{{STPA Model}}},
+  author = {Zhong, Shuheng and Du, Jinping and Jiang, Xidi},
+  date = {2023-07-25},
+  journaltitle = {Sustainability},
+  shortjournal = {Sustainability},
+  volume = {15},
+  number = {15},
+  pages = {11505},
+  issn = {2071-1050},
+  doi = {10.3390/su151511505},
+  url = {https://www.mdpi.com/2071-1050/15/15/11505},
+  urldate = {2023-11-03},
+  abstract = {Laboratory safety in colleges and universities has received wider attention as a critical annual inspection by the Ministry of Education. The laboratory environment is complex and diverse, with many hazard factors. To effectively prevent the occurrence of laboratory emergencies in universities, the STAMP/STPA model is used to analyze the safety of energy laboratory safety management in a resource-based university. Between 2021 and 2022, we carried out laboratory safety inspection and field observation for a mining resource university in China, and identified 16 unsafe control actions in the field of energy laboratory safety management in the university, and identified ten critical causal factors leading to unsafe control actions. Combining the actual situation of the mining resource university, the short-term countermeasures and long-term countermeasures to improve laboratory safety management are proposed to guarantee the university’s laboratory safety management. Moreover, the research results have suggestions for the construction and development of laboratory safety management at similar universities.},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/RNUKHQWX/Zhong et al. - 2023 - Analysis of Energy Laboratory Safety Management in.pdf}
+}
+
+@article{zhouDigitalTwinFramework2019,
+  title = {Digital {{Twin Framework}} and {{Its Application}} to {{Power Grid Online Analysis}}},
+  author = {Zhou, Mike and Yan, Jianfeng and Feng, Donghao},
+  date = {2019-09},
+  journaltitle = {Csee Journal of Power and Energy Systems},
+  shortjournal = {CSEE J. Power Energy Syst.},
+  volume = {5},
+  number = {3},
+  pages = {391--398},
+  publisher = {China Electric Power Research Inst},
+  location = {Beijing},
+  issn = {2096-0042},
+  doi = {10.17775/CSEEJPES.2018.01460},
+  url = {http://www.webofscience.com/wos/woscc/summary/marked/relevance/1?markedListId=List%202},
+  urldate = {2022-03-08},
+  abstract = {Digital twin (DT) framework is introduced in the context of application for power grid online analysis. In the development process of a new power grid real-time online analysis system, an online analysis digital twin (OADT) has been implemented to realize the new online analysis architecture. The OADT approach is presented and its prominent features are discussed. The presentation, discussion, and performance testing are based on a large-scale grid network model (40K+ buses), exported directly from the EMS system of an actual power grid. A plan to apply the OADT approach to digitize power grid dispatching rules is also outlined.},
+  langid = {english},
+  keywords = {DGC read},
+  annotation = {WOS:000511344100012},
+  file = {/home/danesabo/Zotero/storage/JNYP42KB/Zhou et al. - 2019 - Digital Twin Framework and Its Application to Powe.pdf}
+}
+
+@inproceedings{zhouNeuralLyapunovControl2022,
+  title = {Neural {{Lyapunov Control}} of {{Unknown Nonlinear Systems}} with {{Stability Guarantees}}},
+  author = {Zhou, Ruikun and Quartz, Thanin and Sterck, Hans De and Liu, Jun},
+  date = {2022-05-16},
+  url = {https://openreview.net/forum?id=QvlcRh8hd8X},
+  urldate = {2024-01-17},
+  abstract = {Learning for control of dynamical systems with formal guarantees remains a challenging task. This paper proposes a learning framework to simultaneously stabilize an unknown nonlinear system with a neural controller and learn a neural Lyapunov function to certify a region of attraction (ROA) for the closed-loop system with provable guarantees. The algorithmic structure consists of two neural networks and a satisfiability modulo theories (SMT) solver. The first neural network is responsible for learning the unknown dynamics. The second neural network aims to identify a valid Lyapunov function and a provably stabilizing nonlinear controller. The SMT solver verifies the candidate Lyapunov function satisfies the Lyapunov conditions. We further provide theoretical guarantees of the proposed learning framework and show that the obtained Lyapunov function indeed verifies for the unknown nonlinear system under mild assumptions. We illustrate the effectiveness of the results with a few numerical experiments.},
+  eventtitle = {Advances in {{Neural Information Processing Systems}}},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/2U4E5YQH/Zhou et al. - 2022 - Neural Lyapunov Control of Unknown Nonlinear Syste.pdf}
+}
+
+@inproceedings{zimmermanMakingFormalMethods2000,
+  title = {Making Formal Methods Practical},
+  booktitle = {19th {{DASC}}. 19th {{Digital Avionics Systems Conference}}. {{Proceedings}} ({{Cat}}. {{No}}.{{00CH37126}})},
+  author = {Zimmerman, M. and Rodriguez, M. and Ingram, B. and Katahira, M. and family=Villepin, given=M., prefix=de, useprefix=true and Leveson, N.},
+  date = {2000-10},
+  volume = {1},
+  pages = {1B2/1-1B2/8 vol.1},
+  doi = {10.1109/DASC.2000.886879},
+  abstract = {Despite their potential, formal methods have had difficulty gaining acceptance in the industrial sector. Some complaints are based on supposed impracticality: many consider formal methods to be an approach to system specification and analysis that requires a large learning time. Contributing to this scepticism is the fact that some types of formal methods have not yet been proven to handle systems of realistic complexity. To learn more about how to design formal specification languages that can be used for complex systems and require minimal training, we developed a formal specification of an English language specification of the vertical flight control system similar to that found in the MD-11. This paper describes the lessons learned from this experience.},
+  eventtitle = {19th {{DASC}}. 19th {{Digital Avionics Systems Conference}}. {{Proceedings}} ({{Cat}}. {{No}}.{{00CH37126}})},
+  file = {/home/danesabo/Zotero/storage/5T7HGMAV/Zimmerman et al. - 2000 - Making formal methods practical.pdf;/home/danesabo/Zotero/storage/GGM7YZT2/886879.html}
+}
+
+@article{zonouzDetectingIndustrialControl2014,
+  title = {Detecting {{Industrial Control Malware Using Automated PLC Code Analytics}}},
+  author = {Zonouz, Saman and Rrushi, Julian and McLaughlin, Stephen},
+  date = {2014-11},
+  journaltitle = {IEEE Security \& Privacy},
+  shortjournal = {IEEE Secur. Privacy},
+  volume = {12},
+  number = {6},
+  pages = {40--47},
+  issn = {1540-7993, 1558-4046},
+  doi = {10.1109/MSP.2014.113},
+  url = {https://ieeexplore.ieee.org/document/7006408/},
+  urldate = {2023-10-10},
+  langid = {english},
+  file = {/home/danesabo/Zotero/storage/P2TJC2AF/Zonouz et al. - 2014 - Detecting Industrial Control Malware Using Automat.pdf}
+}
+
+@online{ZoteroConnectors,
+  title = {Zotero | {{Connectors}}},
+  url = {https://www.zotero.org/download/connectors},
+  urldate = {2024-07-02},
+  file = {/home/danesabo/Zotero/storage/362GHEWB/connectors.html}
+}
+
+@online{ZoteroConnectorsa,
+  title = {Zotero | {{Connectors}}},
+  url = {https://www.zotero.org/download/connectors},
+  urldate = {2024-07-02}
+}
+
+@online{ZoteroConnectorsb,
+  title = {Zotero | {{Connectors}}},
+  url = {https://www.zotero.org/download/connectors},
+  urldate = {2024-07-02}
+}
+
+@online{ZoteroConnectorsc,
+  title = {Zotero | {{Connectors}}},
+  url = {https://www.zotero.org/download/connectors},
+  urldate = {2024-07-02},
+  file = {/home/danesabo/Zotero/storage/3V37THQF/connectors.html}
+}