text stringlengths 12 14.7k |
|---|
Simple Knowledge Organization System : There are publicly available SKOS data sources. SKOS Datasets wiki The W3C recommends using this list of publicly available SKOS data sources. Most data found in this wiki can be used for commercial and research applications. |
Simple Knowledge Organization System : Glossary Knowledge representation Metadata registry |
Simple Knowledge Organization System : SKOS Simple Knowledge Organization System Reference W3C SKOS Home Page W3C Simple Knowledge Organization System Primer Presentation of SKOS at XTech 2005 Conference W3C Invites Implementations of SKOS (Simple Knowledge Organization System) Reference; Primer Also Published SKOS Val... |
Simulation decomposition : SimDec, or Simulation decomposition, is a hybrid uncertainty and sensitivity analysis method, for visually examining the relationships between the output and input variables of a computational model. SimDec maps multivariable scenarios onto the distribution of the model output. This visual an... |
Simulation decomposition : SimDec operates on Monte Carlo simulation (or measured) data where both output and input values are recorded. At least one thousand observations (or simulated iterations) are typically recommended to preserve the readability of the resulting histograms. An outline of the decomposition algorit... |
Simulation decomposition : The SimDec method has several limitations: It is based on Monte Carlo simulation and thus requires running a computational model a thousand of times or more. To models that take hours to evaluate once, it would be impossible to use SimDec (unless a supercomputer and/or large of time are avail... |
Simulation decomposition : Sensitivity analysis Data and information visualization Histogram Interaction (statistics) Uncertainty Decision making |
Social History and Industrial Classification : Social History and Industrial Classification (SHIC) is a classification system used by many British museums for social history and industrial collections. It was first published in 1983. |
Social History and Industrial Classification : SHIC classifies materials (books, objects, recordings etc.) by their interaction with the people who used them. For example, a carpenter's hammer is classified with other tools of the carpenter, and not with a blacksmith's hammer. In contrast other classification systems, ... |
Social History and Industrial Classification : Materials are classified under four major category numbers: Community life Domestic and family life Personal life Working life Further classification within a category is by the use of further numbers after the decimal point. It is permissible to assign more than one class... |
Social History and Industrial Classification : Social history and industrial classification (SHIC), a subject classification for museum collections, University of Sheffield, 1983 |
John F. Sowa : John Florian Sowa (born 1940) is an American computer scientist, an expert in artificial intelligence and computer design, and the inventor of conceptual graphs. |
John F. Sowa : Sowa received a BS in mathematics from Massachusetts Institute of Technology in 1962, an MA in applied mathematics from Harvard University in 1966, and a PhD in computer science from the Vrije Universiteit Brussel in 1999 with a dissertation titled "Knowledge Representation: Logical, Philosophical, and C... |
John F. Sowa : Sowa's research interests since the 1970s were in the field of artificial intelligence, expert systems and database query linked to natural languages. In his work he combines ideas from numerous disciplines and eras modern and ancient, for example, applying ideas from Aristotle, the medieval scholastics ... |
John F. Sowa : 1984. Conceptual Structures - Information Processing in Mind and Machine. The Systems Programming Series, Addison-Wesley 1991. Principles of Semantic Networks. Morgan Kaufmann. Mineau, Guy W; Moulin, Bernard; Sowa, John F, eds. (1993). Conceptual Graphs for Knowledge Representation. LNCS. Vol. 699. doi:1... |
John F. Sowa : John F. Sowa homepage |
Spatial–temporal reasoning : Spatial–temporal reasoning is an area of artificial intelligence that draws from the fields of computer science, cognitive science, and cognitive psychology. The theoretic goal—on the cognitive side—involves representing and reasoning spatial-temporal knowledge in mind. The applied goal—on ... |
Spatial–temporal reasoning : A convergent result in cognitive psychology is that the connection relation is the first spatial relation that human babies acquire, followed by understanding orientation relations and distance relations. Internal relations among the three kinds of spatial relations can be computationally a... |
Spatial–temporal reasoning : Without addressing internal relations among spatial relations, AI researchers contributed many fragmentary representations. Examples of temporal calculi include Allen's interval algebra, and Vilain's & Kautz's point algebra. The most prominent spatial calculi are mereotopological calculi, F... |
Spatial–temporal reasoning : An emphasis in the literature has been on qualitative spatial-temporal reasoning which is based on qualitative abstractions of temporal and spatial aspects of the common-sense background knowledge on which our human perspective of physical reality is based. Methodologically, qualitative con... |
Spatial–temporal reasoning : Most of these calculi can be formalized as abstract relation algebras, such that reasoning can be carried out at a symbolic level. For computing solutions of a constraint network, the path-consistency algorithm is an important tool. |
Spatial–temporal reasoning : GQR, constraint network solver for calculi like RCC-5, RCC-8, Allen's interval algebra, point algebra, cardinal direction calculus, etc. qualreas is a Python framework for qualitative reasoning over networks of relation algebras, such as RCC-8, Allen's interval algebra, and Allen's algebra ... |
Spatial–temporal reasoning : Cerebral cortex Commonsense reasoning Diagrammatic reasoning Spatial ability Temporal logic Visual thinking |
Spatial–temporal reasoning : Renz, J.; Nebel, B. (2007). "Qualitative Spatial Reasoning using Constraint Calculi" (PDF). In Aiello, M.; Pratt-Hartmann, I.; van Benthem, J. (eds.). Handbook of Spatial Logics. Springer. ISBN 9781402055867. Archived from the original (PDF) on 2007-06-27. Retrieved 2007-03-01. Dong, T. (20... |
Spatial–temporal reasoning : Media related to Spatial–temporal reasoning at Wikimedia Commons |
Tag (metadata) : In information systems, a tag is a keyword or term assigned to a piece of information (such as an Internet bookmark, multimedia, database record, or computer file). This kind of metadata helps describe an item and allows it to be found again by browsing or searching. Tags are generally chosen informall... |
Tag (metadata) : People use tags to aid classification, mark ownership, note boundaries, and indicate online identity. Tags may take the form of words, images, or other identifying marks. An analogous example of tags in the physical world is museum object tagging. People were using textual keywords to classify informat... |
Tag (metadata) : The use of keywords as part of an identification and classification system long predates computers. Paper data storage devices, notably edge-notched cards, that permitted classification and sorting by multiple criteria were already in use prior to the twentieth century, and faceted classification has b... |
Tag (metadata) : In a typical tagging system, there is no explicit information about the meaning or semantics of each tag, and a user can apply new tags to an item as easily as applying older tags. Hierarchical classification systems can be slow to change, and are rooted in the culture and era that created them; in con... |
Tag (metadata) : Some tagging systems provide a single text box to enter tags, so to be able to tokenize the string, a separator must be used. Two popular separators are the space character and the comma. To enable the use of separators in the tags, a system may allow for higher-level separators (such as quotation mark... |
Tag (metadata) : == References == |
Transaction logic : Transaction Logic is an extension of predicate logic that accounts in a clean and declarative way for the phenomenon of state changes in logic programs and databases. This extension adds connectives specifically designed for combining simple actions into complex transactions and for providing contro... |
Transaction logic : A number of implementations of Transaction Logic exist: The original implementation. An implementation of Concurrent Transaction Logic. Transaction Logic enhanced with tabling. An implementation of Transaction Logic has also been incorporated as part of the Flora-2 knowledge representation and reaso... |
Transaction logic : Flora-2 Web site, containing additional papers on Transaction Logic |
Tree (abstract data type) : In computer science, a tree is a widely used abstract data type that represents a hierarchical tree structure with a set of connected nodes. Each node in the tree can be connected to many children (depending on the type of tree), but must be connected to exactly one parent, except for the ro... |
Tree (abstract data type) : A node is a structure which may contain data and connections to other nodes, sometimes called edges or links. Each node in a tree has zero or more child nodes, which are below it in the tree (by convention, trees are drawn with descendants going downwards). A node that has a child is called ... |
Tree (abstract data type) : Enumerating all the items Enumerating a section of a tree Searching for an item Adding a new item at a certain position on the tree Deleting an item Pruning: Removing a whole section of a tree Grafting: Adding a whole section to a tree Finding the root for any node Finding the lowest common ... |
Tree (abstract data type) : There are many different ways to represent trees. In working memory, nodes are typically dynamically allocated records with pointers to their children, their parents, or both, as well as any associated data. If of a fixed size, the nodes might be stored in a list. Nodes and relationships bet... |
Tree (abstract data type) : As an abstract data type, the abstract tree type T with values of some type E is defined, using the abstract forest type F (list of trees), by the functions: value: T → E children: T → F nil: () → F node: E × F → T with the axioms: value(node(e, f)) = e children(node(e, f)) = f In terms of t... |
Tree (abstract data type) : Viewed as a whole, a tree data structure is an ordered tree, generally with values attached to each node. Concretely, it is (if required to be non-empty): A rooted tree with the "away from root" direction (a more narrow term is an "arborescence"), meaning: A directed graph, whose underlying ... |
Tree (abstract data type) : Trees are commonly used to represent or manipulate hierarchical data in applications such as: File systems for: Directory structure used to organize subdirectories and files (symbolic links create non-tree graphs, as do multiple hard links to the same file or directory) The mechanism used to... |
Tree (abstract data type) : Distributed tree search Category:Trees (data structures) (catalogs types of computational trees) |
Tree (abstract data type) : Donald Knuth. The Art of Computer Programming: Fundamental Algorithms, Third Edition. Addison-Wesley, 1997. ISBN 0-201-89683-4 . Section 2.3: Trees, pp. 308–423. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Second Edition. MIT Pres... |
Tree (abstract data type) : Description from the Dictionary of Algorithms and Data Structures |
Type–token distinction : The type–token distinction is the difference between a class (type) of objects and the individual instances (tokens) of that class. Since each type may be instantiated by multiple tokens, there are generally more tokens than types of an object. For example, the sentence "A Green is à green" con... |
Type–token distinction : The type–token distinction separates types (abstract descriptive concepts) from tokens (objects that instantiate concepts). For example, in the sentence "the bicycle is becoming more popular" the word bicycle represents the abstract concept of bicycles and this abstract concept is a type, where... |
Type–token distinction : In typography, the type–token distinction is used to determine the presence of a text printed by movable type: The defining criteria which a typographic print has to fulfill is that of the type identity of the various letter forms which make up the printed text. In other words: each letter form... |
Type–token distinction : The distinctions between using words as types or tokens were first made by American logician and philosopher Charles Sanders Peirce in 1906 using terminology that he established. Peirce's type–token distinction applies to words, sentences, paragraphs and so on: to anything in a universe of disc... |
Type–token distinction : Linda Wetzel. "Types and Tokens". In Zalta, Edward N. (ed.). Stanford Encyclopedia of Philosophy. |
UMBEL : UMBEL (Upper Mapping and Binding Exchange Layer) is a logically organized knowledge graph of 34,000 concepts and entity types that can be used in information science for relating information from disparate sources to one another. It was retired at the end of 2019. UMBEL was first released in July 2008. Version ... |
UMBEL : Cyc DBpedia |
UMBEL : Main page for UMBEL UMBEL specification, and its accompanying Annexes A – L, Z |
Unified Modeling Language : The unified modeling language (UML) is a general-purpose visual modeling language that is intended to provide a standard way to visualize the design of a system. UML provides a standard notation for many types of diagrams which can be roughly divided into three main groups: behavior diagrams... |
Unified Modeling Language : UML offers a way to visualize a system's architectural blueprints in a diagram, including elements such as: any activities (jobs); individual components of the system; and how they can interact with other software components; how the system will run; how entities interact with others (compon... |
Unified Modeling Language : UML 2 has many types of diagrams, which are divided into two categories. Some types represent structural information, and the rest represent general types of behavior, including a few that represent different aspects of interactions. These diagrams can be categorized hierarchically as shown ... |
Unified Modeling Language : In UML, an artifact is the "specification of a physical piece of information that is used or produced by a software development process, or by deployment and operation of a system." "Examples of artifacts include model files, source files, scripts, and binary executable files, a table in a d... |
Unified Modeling Language : The Object Management Group (OMG) has developed a metamodeling architecture to define the UML, called the Meta-Object Facility. MOF is designed as a four-layered architecture, as shown in the image at right. It provides a meta-meta model at the top, called the M3 layer. This M3-model is the ... |
Unified Modeling Language : In 2013, UML had been marketed by OMG for many contexts, but aimed primarily at software development with limited success. It has been treated, at times, as a design silver bullet, which leads to problems. UML misuse includes overuse (designing every part of the system with it, which is unne... |
Unified Modeling Language : Applications of UML BPMN (Business Process Model and Notation) C4 model Department of Defense Architecture Framework DOT (graph description language) List of Unified Modeling Language tools MODAF Model-based testing Model-driven engineering Object-oriented role analysis and modeling Process ... |
Unified Modeling Language : Ambler, Scott William (2004). The Object Primer: Agile Model Driven Development with UML 2. Cambridge University Press. ISBN 0-521-54018-6. Archived from the original on 31 January 2010. Retrieved 29 April 2006. Chonoles, Michael Jesse; James A. Schardt (2003). UML 2 for Dummies. Wiley Publi... |
Unified Modeling Language : Official website Current UML specification: Unified Modeling Language 2.5.1. OMG Document Number formal/2017-12-05. Object Management Group Standards Development Organization (OMG SDO). December 2017. |
Unique name assumption : The unique name assumption is a simplifying assumption made in some ontology languages and description logics. In logics with the unique name assumption, different names always refer to different entities in the world. It was included in Ray Reiter's discussion of the closed-world assumption of... |
Unique name assumption : Closed-world assumption Coreference == References == |
Universal Data Element Framework : The Universal Data Element Framework (UDEF) was a controlled vocabulary developed by The Open Group. It provided a framework for categorizing, naming, and indexing data. It assigned to every item of data a structured alphanumeric tag plus a controlled vocabulary name that describes th... |
Universal Data Element Framework : In an application used by a hospital, the last name and first name of several people could include the following example concepts: Patient Person Family Name – find the word “Patient” under the UDEF object “Person” and find the word “Family” under the UDEF property “Name” Patient Pers... |
Universal Data Element Framework : Data integration ISO/IEC 11179 National Information Exchange Model Metadata Semantic web Data element Representation term Controlled vocabulary |
Universal Data Element Framework : UDEF Project of The Open Group UDEF Frequently Asked Questions O-DEF™, the Open Data Element Framework, Version 2.0 O-DEF™, the Open Data Element Framework, Version 3.0 |
Upper ontology : In information science, an upper ontology (also known as a top-level ontology, upper model, or foundation ontology) is an ontology (in the sense used in information science) that consists of very general terms (such as "object", "property", "relation") that are common across all domains. An important f... |
Upper ontology : Any standard foundational ontology is likely to be contested among different groups, each with its own idea of "what exists". One factor exacerbating the failure to arrive at a common approach has been the lack of open-source applications that would permit the testing of different ontologies in the sam... |
Upper ontology : The following table contains data mainly from "A Comparison of Upper Ontologies" article by V Mascardi, V Cordi and P Rosso (2007). |
Upper ontology : Authority control Commonsense knowledge Core ontology Formal ontology Foundations of mathematics Knowledge Organization Systems Library classification Ontology (information science) Physical ontology Process ontology Semantic interoperability |
Upper ontology : COSMO General Formal Ontology (GFO) homepage Laboratory of Applied Ontology (LOA) homepage PROTON Ontology Upper Ontology Summit (March 2006) What is an upper level ontology? Knowledge Blog article, 2010. The MarineTLO ontology What, Why, Who, Current applications, How to exploit it, Documents and Publ... |
User modeling : User modeling is the subdivision of human–computer interaction which describes the process of building up and modifying a conceptual understanding of the user. The main goal of user modeling is customization and adaptation of systems to the user's specific needs. The system needs to "say the 'right' thi... |
User modeling : A user model is the collection and categorization of personal data associated with a specific user. A user model is a (data) structure that is used to capture certain characteristics about an individual user, and a user profile is the actual representation in a given user model. The process of obtaining... |
User modeling : Information about users can be gathered in several ways. There are three main methods: Asking for specific facts while (first) interacting with the system Mostly this kind of data gathering is linked with the registration process. While registering users are asked for specific facts, their likes and dis... |
User modeling : Once a system has gathered information about a user it can evaluate that data by preset analytical algorithm and then start to adapt to the user's needs. These adaptations may concern every aspect of the system's behavior and depend on the system's purpose. Information and functions can be presented acc... |
User modeling : Adaptive hypermedia: In an adaptive hypermedia system the displayed content and the offered hyperlinks are chosen on basis of users' specific characteristics, taking their goals, interests, knowledge and abilities into account. Thus, an adaptive hypermedia system aims to reduce the "lost in hyperspace" ... |
User modeling : A certain number of representation formats and standards are available for representing the users in computer systems, such as: IMS-LIP (IMS – Learner Information Packaging, used in e-learning) HR-XML (used in human resource management) JXDM (Justice with the Global Justice Extensible Markup) Europass (... |
User modeling : Personalization Cognitive model User profile Identity management |
User modeling : User Modeling and User-Adapted Interaction (UMUAI) The Journal of Personalization Research CogTool Project at CMU User Modeling Conference 2007 User Modeling Conference 2018 Hypertext 2018 |
User profile : A user profile is a collection of settings and information associated with a user. It contains critical information that is used to identify an individual, such as their name, age, portrait photograph and individual characteristics such as knowledge or expertise. User profiles are most commonly present o... |
User profile : The origin of user profiles can be traced to the origin of the passport, an identity document (ID) made mandatory in 1920, after World War I following negotiations at the League of Nations. The passport served as an official government record of an individual. Consequently, Immigration Act of 1924 was es... |
User profile : A user profile can be of any format if it contains information, settings and/or characteristics specific to an individual. Most popular user profiles include those on photo and video sharing websites such as Facebook and Instagram, accounts on operating systems, such as those on Windows and MacOS and phy... |
User profile : Modern software and applications account for user profiles as a foundation on which a usable application is built. The structure and layout of an application such as its menus, features and controls are often derived from user's selected settings and preferences. The origin of digital user profiles in co... |
User profile : Physical user profiles or legal documents such as passport and driving license are widely accepted as an official government record of an individual's details. Much like digital user profiles, these documents outline primary characteristics of an individual such as their full legal name, birthdate, addre... |
User profile : Internet privacy Identity document Online identity Online identity management Personal data Data mining Social media == References == |
Visual hierarchy : Visual hierarchy, according to Gestalt psychology, is a pattern in the visual field wherein some elements tend to "stand out," or attract attention, more strongly than other elements, suggesting a hierarchy of importance. While it may occur naturally in any visual field, the term is most commonly use... |
Visual hierarchy : There is some scientific evidence for visual hierarchy using eye tracking. For example, one study found that when people agree that a graphic design is good, they exhibit more similar eye movements; measured by the Fréchet distance. |
Visual hierarchy : The concept of visual hierarchy is based in Gestalt psychological theory, an early 20th-century German theory that proposes that the human brain has innate organizing tendencies that “structure individual elements, shapes or forms into a coherent, organized whole,” especially when processing visual i... |
Visual hierarchy : Visual hierarchy is an important concept in the field of graphic design, a field that specializes in visual organization. Designers attempt to control visual hierarchy to guide the eye to information in a specific order for a specific purpose. One could compare visual hierarchy in graphic design to g... |
Visual hierarchy : Bauhaus Cognitive psychology Pattern recognition Figure-ground contrast (cartography) == References == |
Vivid knowledge : Vivid knowledge refers to a specific kind of knowledge representation. The idea of a vivid knowledge base is to get an interpretation mostly straightforward out of it – it implies the interpretation. Thus, any query to such a knowledge base can be reduced to a database-like query. |
Vivid knowledge : A propositional knowledge base KB is vivid iff KB is a complete and consistent set of literals (over some vocabulary). Such a knowledge base has the property that it as exactly one interpretation, i.e. the interpretation is unique. A check for entailment of a sentence can simply be broken down into it... |
Vivid knowledge : A first-order knowledge base KB is vivid iff for some finite set of positive function-free ground literals KB+, KB = KB+ ∪ Negations ∪ DomainClosure ∪ UniqueNames, whereby Negations ≔ , DomainClosure ≔ , UniqueNames ≔ . All interpretations of a vivid first-order knowledge base are isomorphic. |
Vivid knowledge : Closed world assumption == References == |
Vivification : Vivification is an operation on a description logic knowledge base to improve performance of a semantic reasoner. Vivification replaces a disjunction of concepts C 1 ⊔ C 2 … ⊔ C n \sqcup C_\ldots \sqcup C_ by the least common subsumer of the concepts C 1 , C 2 , … C n ,C_,\ldots C_ . The goal of this ope... |
Vivification : Knowledge base vivification is not necessarily exact. If the reasoner is operating under the open world assumption we may get surprising results. In the previous example, if we replace the disjunction with the vivified concept, we will arrive at a surprising results. First, we find that the reasoner will... |
Vivification : Cohen, W.W., Borgida, A., Hirsh, H., Computing Least Common Subsumers in Description Logics, In: Proc. AAAI-92, AAAI Press/The MIT Press, 1992, pages 754—760. "citeseer". Archived from the original on 19 February 2008. Retrieved 26 January 2008. Baader, F., Kusters, R., Wolter F., Extensions to Descripti... |
VoID : The Vocabulary of Interlinked Datasets (VoID) is an RDF vocabulary, and a set of instructions, that enables the discovery and usage of linked data sets. A linked dataset is a collection of data, published and maintained by a single provider, available as RDF on the Web, where at least some of the resources in th... |
VoID : Describing Linked Datasets with the VoID Vocabulary |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.