Simple Browser : Welcome guest : log in
Home |  Graph |  ]  KB:  Language:   

Formal Language: 



KB Term: 

  frequency

Sigma KEE - frequency
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
frequency
(frequency ?PROC ?TIME) means that the Process type of ?PROC recurs after every interval of ?TIME.
Relationships      
Children collect rate(collectRate ?System ?Period) holds if ?Period is the period at which ComputationalSystem ?System collects data.
 request rate(requestRate ?Request ?Period) means that ?Period is the period at which the user sends its ?Request.
 response rate(responseRate ?Response ?Period) means that ?Period is the period at which the computer sends its ?Response.
 send rate(sendRate ?Program ?Period) holds if ?Period is the period at which the ComputationalSystem ?System sends data reports.
 heart beat rate(softwareHeartBeatRate ?Program ?Period) holds if ?Period is the period at which the ComputerProgram ?Program sends its heartbeat to a monitoring process.
InstancesabstractProperties or qualities as distinguished from any particular embodiment of the properties/qualities in a physical medium. Instances of Abstract can be said to exist in the same sense as mathematical objects such as sets and relations, but they cannot exist at a particular place and time without some physical encoding or embodiment.
 antisymmetric relationBinaryRelation ?REL is an AntisymmetricRelation if for distinct ?INST1 and ?INST2, (?REL ?INST1 ?INST2) implies not (?REL ?INST2 ?INST1). In other words, for all ?INST1 and ?INST2, (?REL ?INST1 ?INST2) and (?REL ?INST2 ?INST1) imply that ?INST1 and ?INST2 are identical. Note that it is possible for an AntisymmetricRelation to be a ReflexiveRelation.
 asymmetric relationA BinaryRelation is asymmetric if and only if it is both an AntisymmetricRelation and an IrreflexiveRelation.
 binary predicateA Predicate relating two items - its valence is two.
 binary relationBinaryRelations are relations that are true only of pairs of things. BinaryRelations are represented as slots in frame systems.
 entityThe universal class of individuals. This is the root node of the ontology.
 inheritable relationThe class of Relations whose properties can be inherited downward in the class hierarchy via the subrelation Predicate.
 irreflexive relationRelation ?REL is irreflexive iff (?REL ?INST ?INST) holds for no value of ?INST.
 predicateA Predicate is a sentence-forming Relation. Each tuple in the Relation is a finite, ordered sequence of objects. The fact that a particular tuple is an element of a Predicate is denoted by '(*predicate* arg_1 arg_2 .. arg_n)', where the arg_i are the objects so related. In the case of BinaryPredicates, the fact can be read as `arg_1 is *predicate* arg_2' or `a *predicate* of arg_1 is arg_2'.
 relationThe Class of relations. There are two kinds of Relation: Predicate and Function. Predicates and Functions both denote sets of ordered n-tuples. The difference between these two Classes is that Predicates cover formula-forming operators, while Functions cover term-forming operators.
Belongs to Class entity


Show full definition (without tree view)
Show full definition (with tree view)

Show without tree


Sigma web home      Suggested Upper Merged Ontology (SUMO) web home
Sigma version 3.0 is open source software produced by Articulate Software and its partners