;
rdfs:subClassOf qudt:CoordinateSystem .
qudt:AlgebraicDatatype a rdfs:Class,
sh:NodeShape ;
rdfs:label "Algebraic Datatype"^^xsd:string ;
dcterms:description """An Algebraic Datatype is a datatype each of whose values are data from other data types wrapped in one of the constructors of the data type.
Any wrapped datum is an argument to the constructor.
In contrast to other data types, the constructor is not executed and the only way to operate on the data is to unwrap the constructor using pattern matching.
The most common algebraic data type is a list with two constructors: Nil or [] for an empty list, and Cons (an abbreviation of constructor),
::, or : for the combination of a new element with a shorter list (for example (Cons 1 '(2 3 4)) or 1:[2,3,4]).
Special cases of algebraic types are product types i.e. records (only one constructor) and enumerated types (many constructors with no arguments).
Algebraic types are one kind of composite type (i.e. a type formed by combining other types).
An algebraic data type may also be an abstract data type (ADT) if it is exported from a module without its constructors.
Values of such a type can only be manipulated using functions defined in the same module as the type itself.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:seeAlso qudt:AbstractDatatype ;
rdfs:subClassOf qudt:StructuredDatatype ;
prov:wasInfluencedBy .
qudt:AlignmentType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Alignment type"^^xsd:string ;
dcterms:description """
Specifies how a physical data field is aligned.
The alignment could be at a bit, byte or word boundary.
"""^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:EnumeratedValue ;
sh:in ( qudt:BitAligned qudt:ByteAligned qudt:WordAligned ) .
qudt:AngleUnit a rdfs:Class,
sh:NodeShape ;
rdfs:label "Angle unit"^^xsd:string ;
dcterms:description "All units relating to specificaiton of angles. "^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:DimensionlessUnit ;
skos:exactMatch .
qudt:Array a rdfs:Class,
sh:NodeShape ;
rdfs:label "Array"^^xsd:string ;
dcterms:description """
An Array> is a data structure that stores a collection of elements, typically of the same type, in a contiguous block of memory.
Each element in an array is identified by an index or key, which is typically a numerical identifier, either starting at '0' or '1'.
The key considerations for an Array are:
- Fixed Size: The size of an array may be pre-determined when it is created and cannot be changed;
- Index-Based Access: Elements can be accessed, updated, or modified using their index;
- Contiguous Memory Allocation: The elements are stored in consecutive memory locations, which allows efficient access using the index.
An Array is represented as ordered entries of values arranged according to its dimensionality.
The number of dimensions is specified in the attribute 'dimensionality'.
An array can be multi-dimensional.
Multiple indices are used but they are treated as extensions of the same structure.
For Example: for a 2D array arr[2][3], indices refer to the row and column positions.
A 2D array is still represented as a list, where each member of the list is a list.
Higher dimensional arrays can be represented as nested lists.
For each dimension a new nested list is defined.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:StructuredDatatype ;
sh:node qudt:DimensionalityShape ;
sh:property qudt:Array-isHeterogeneous,
qudt:Array-value,
qudt:DatatypePropertyShape,
qudt:DimensionalityPropertyShape,
qudt:DimensionsPropertyShape .
qudt:ArrayDataOrder a rdfs:Class,
sh:NodeShape ;
rdfs:label "Array data order"^^xsd:string ;
dcterms:description "A sub-type of 'Enumerated Value'. Detailed description to be provided in a future version."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:EnumeratedValue ;
sh:oneOf ( qudt:ByColumn qudt:ByRow qudt:ByLeftMostIndex ) .
qudt:ArrayType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Array Type"^^xsd:string ;
dcterms:description """
An Array Type is a type specification for ordered entries of values arranged according to the dimensions given.
The dimensions are given as a list of integers where each integer is the cardinality of each dimension.
The number of dimensions is specified in the attribute 'dimensionality'.
Optionally a reference can be made to a variable, whose values are the array entries.
The data type of the array entries is an optional field, 'elementType', which points to a data type definition.
If the data type is given, then it applies to all elements.
If it is not given then the elements can be of different types for each position in the array.
The property qudt:typeMatrix must refer to a matrix of types.
If a default value is given this can be used to place the appropriate value in a cell when an entry value is not known.
If no dimensionality or dimension vector is specified the array is under-specified but still legitimate as a place-holder for a data type.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:CompositeDatatype .
qudt:AspectClass a rdfs:Class,
sh:NodeShape ;
rdfs:label "Aspect Class"^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf rdfs:Class .
qudt:AssociativeArray a rdfs:Class,
sh:NodeShape ;
rdfs:label "Associative Array"^^xsd:string ;
dcterms:description """
An Associative Array (or Map) is an abstract data type composed of a collection of keys and a collection of values,
where each key is associated with one value.
The operation of finding the value associated with a key is called a lookup or indexing,
and this is the most important operation supported by an associative array.
The relationship between a key and its value is sometimes called a mapping or binding.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:seeAlso qudt:Map ;
rdfs:subClassOf qudt:Array .
qudt:AuralCue a rdfs:Class,
sh:NodeShape ;
rdfs:label "Aural Cue"^^xsd:string ;
rdfs:comment """
An aural cue is a sound produced by a device or a system that is used to alert personnel of of an advisory, cautionary, warning, or emergency state.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:ModalCue ;
sh:property qudt:AuralCue-sound .
qudt:AxialOrientationType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Axial Orientation Type"^^xsd:string ;
dcterms:description "The axial orientation of a coordinate system frame axis."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:EnumeratedValue ;
sh:in ( qudt:PositiveZ qudt:PositiveY qudt:NegativeY qudt:NegativeZ qudt:PositiveX qudt:NegativeX ) .
qudt:BalancedTree a rdfs:Class,
sh:NodeShape ;
rdfs:label "Balanced Tree Type"^^xsd:string ;
dcterms:description """
A Balanced Tree is a data type that defines the properties of data structures that represent balanced trees.
A balanced tree is a tree where no leaf is much farther away from the root than any other leaf.
Different balancing schemes allow different definitions of "much farther" and different amounts of work to keep them balanced.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Tree ;
sh:property qudt:BalancedTree-maxDepth .
qudt:BaseDimensionMagnitude a rdfs:Class,
sh:NodeShape ;
rdfs:label "Base Dimension Magnitude"^^xsd:string ;
dcterms:description """
A Dimension expresses a magnitude for a base quantity kind such as mass, length and time.
DEPRECATED - each exponent is expressed as a property.
Keep until a validation of this has been done.
"""^^rdf:HTML ;
qudt:informativeReference "http://en.wikipedia.org/wiki/Dimensional_analysis"^^xsd:anyURI,
"http://web.mit.edu/2.25/www/pdf/DA_unified.pdf"^^xsd:anyURI ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Concept ;
sh:property qudt:BaseDimensionMagnitude-hasBaseQuantityKind,
qudt:BaseDimensionMagnitude-vectorMagnitude .
qudt:BigIntegerType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Big Integer Type"^^xsd:string ;
dcterms:description """
A Big Integer is an integer that can be represented in eight octets (64 bits) of machine memory.
Big integers may be signed or unsigned.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:IntegerDatatype .
qudt:BinaryPrefix a rdfs:Class,
sh:NodeShape ;
rdfs:label "Binary Prefix"^^xsd:string ;
dcterms:description """
A Binary Prefix is a prefix for multiples of units in data processing, data transmission, and digital information,
notably the bit and the byte, to indicate multiplication by a power of 2.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Prefix .
qudt:BinaryTree a rdfs:Class,
sh:NodeShape ;
rdfs:label "Binary Tree Type"^^xsd:string ;
dcterms:description """
A Binary Tree is a data type that defines the properties of data structures that represent binary trees.
A binary tree is a tree in which each node has at most 2 children.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Tree .
qudt:BitEncodingType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Bit Encoding"^^xsd:string ;
dcterms:description """
A Bit Encoding Type is an encoding type for the correspondence between the two possible values of a bit, 0 or 1, and some interpretation.
For example, in a boolean encoding, a bit denotes a truth value, where 0 corresponds to False and 1 corresponds to True.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Encoding ;
sh:property [ a sh:PropertyShape ;
rdfs:isDefinedBy ;
sh:in ( qudt:BitEncoding ) ;
sh:path [ sh:inversePath rdf:type ] ] .
qudt:BooleanEncodingType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Boolean Encoding Type"^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Encoding ;
sh:property [ a sh:PropertyShape ;
rdfs:isDefinedBy ;
sh:in ( qudt:BooleanEncoding qudt:BitEncoding qudt:OctetEncoding ) ;
sh:path [ sh:inversePath rdf:type ] ] .
qudt:BooleanType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Boolean Type"^^xsd:string ;
dcterms:description "A boolean data type can take on only two values."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:OrdinalType ;
sh:property qudt:BooleanType-encoding .
qudt:BooleanTypeEnumeratedValue a rdfs:Class,
sh:NodeShape ;
rdfs:label "boolean value"^^xsd:string ;
dcterms:description "Specifies how a boolean value is expressed"^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:EnumeratedValue .
qudt:ByteEncodingType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Byte Encoding"^^xsd:string ;
dcterms:description "This class contains the various ways that information may be encoded into bytes."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Encoding .
qudt:CardinalityType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Cardinality Type"^^xsd:string ;
dcterms:description """
In mathematics, the cardinality of a set is a measure of the number of elements of the set.
For example, the set $A = {2, 4, 6}$ contains 3 elements, and therefore $A$ has a cardinality of 3.
There are two approaches to cardinality: one which compares sets directly using bijections and injections,
and another which uses cardinal numbers.
"""^^qudt:LatexString ;
qudt:informativeReference "http://en.wikipedia.org/wiki/Cardinal_number"^^xsd:anyURI,
"http://en.wikipedia.org/wiki/Cardinality"^^xsd:anyURI ;
qudt:plainTextDescription "In mathematics, the cardinality of a set is a measure of the number of elements of the set. For example, the set 'A = {2, 4, 6}' contains 3 elements, and therefore 'A' has a cardinality of 3. There are two approaches to cardinality – one which compares sets directly using bijections and injections, and another which uses cardinal numbers."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:EnumeratedValue ;
prov:wasInfluencedBy ,
;
sh:in ( qudt:CT_COUNTABLY-INFINITE qudt:CT_UNCOUNTABLE qudt:CT_FINITE ) ;
sh:property [ a sh:PropertyShape ;
rdfs:isDefinedBy ;
sh:in ( qudt:CT_COUNTABLY-INFINITE qudt:CT_FINITE qudt:CT_UNCOUNTABLE ) ;
sh:path [ sh:inversePath rdf:type ] ],
qudt:CardinalityType-literal .
qudt:CartesianCoordinates a rdfs:Class,
sh:NodeShape ;
rdfs:label "Cartesian Coordinate Type"^^xsd:string ;
dcterms:description """
A set of variables which fix a geometric object.
If the coordinates are distances measured along perpendicular axes, they are known as Cartesian coordinates.
"""^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Coordinates .
qudt:CharEncodingType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Char Encoding Type"^^xsd:string ;
dcterms:description """
The class of all character encoding schemes.
Each defines a rule or algorithm for encoding character data as a sequence of bits or bytes.
"""^^rdf:HTML,
"The class of all character encoding schemes, each of which defines a rule or algorithm for encoding character data as a sequence of bits or bytes."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Encoding ;
sh:property [ a sh:PropertyShape ;
rdfs:isDefinedBy ;
sh:in ( qudt:CharEncoding ) ;
sh:path [ sh:inversePath rdf:type ] ] .
qudt:CharacterType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Character Type"^^xsd:string ;
dcterms:description """
A Character Type is a data type that defines the type and encoding of single characters.
"""^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:OrdinalType .
qudt:Citation a rdfs:Class,
sh:NodeShape ;
rdfs:label "Citation"^^xsd:string ;
dcterms:description "Provides a simple way of making citations."^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Concept ;
sh:property qudt:Citation-description,
qudt:Citation-url .
qudt:Collection a rdfs:Class,
sh:NodeShape ;
rdfs:label "Collection Type"^^xsd:string ;
dcterms:description """
A collection is a grouping of some variable number of zero or more data items that need to be operated upon together in some controlled fashion.
Generally, the data items will all share the same data type or are derived from some common ancestor data type.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:StructuredDatatype .
qudt:ColorCue a rdfs:Class,
sh:NodeShape ;
rdfs:label "Color Cue"^^xsd:string ;
rdfs:comment """
A visual cue that uses color to distinguish it from other cues.
Each color cue has exactly one corresponding coordinate point in the RGB space.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:VisualCue ;
sh:property qudt:ColorCue-rgbCode .
qudt:Comment a rdfs:Class,
sh:NodeShape ;
rdfs:label "Comment"^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Verifiable ;
sh:property qudt:Comment-description,
qudt:Comment-rationale .
qudt:CompositeDataStructure a rdfs:Class,
sh:NodeShape ;
rdfs:label "Composite Data Structure"^^xsd:string ;
rdfs:comment """
A Composite Data Structure, also referred to as Data Record is a datatype that aggregates element of possibly different types.
The aggregated items are called fields or members and are usually identified or indexed by field labels.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:CompositeDatatype ;
prov:wasInfluencedBy ,
;
sh:property qudt:CompositeDataStructure-dataElement .
qudt:CompositeDatatype a rdfs:Class,
sh:NodeShape ;
rdfs:label "Composite Data Type"^^xsd:string ;
dcterms:description """
A Composite Datatype is a datatype that is constructed from basic primitive types and other composite types.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:StructuredDatatype ;
prov:wasInfluencedBy ;
sh:property qudt:CompositeDatatype-alignment,
qudt:CompositeDatatype-padding .
qudt:CompositeTable a rdfs:Class,
sh:NodeShape ;
rdfs:label "Composite Table Type"^^xsd:string ;
dcterms:description "A sub-type of 'Table Type'."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Table .
qudt:CompositionFunction a rdfs:Class,
sh:NodeShape ;
rdfs:label "Composition function"^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Function .
qudt:CompositionTree a rdfs:Class,
sh:NodeShape ;
rdfs:label "Composition Tree"^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Tree ;
sh:property qudt:CompositionTree-compositionFunction .
qudt:Concept a rdfs:Class,
sh:NodeShape ;
rdfs:label "QUDT Concept"^^xsd:string ;
dcterms:description "The root class for all QUDT concepts."^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf rdfs:Resource ;
sh:property qudt:Concept-abbreviation,
qudt:Concept-code,
qudt:Concept-deprecated,
qudt:Concept-description,
qudt:Concept-exactMatch,
qudt:Concept-guidance,
qudt:Concept-hasRule,
qudt:Concept-id,
qudt:Concept-isReplacedBy,
qudt:Concept-plainTextDescription,
qudt:Concept-type .
qudt:ConstantValue a rdfs:Class,
sh:NodeShape ;
rdfs:label "Constant value"^^xsd:string ;
dcterms:description "Used to specify the values of a constant."^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:QuantityValue ;
sh:property qudt:ConstantValue-exactConstant .
qudt:ContextualUnit a rdfs:Class,
sh:NodeShape ;
rdfs:label "Contextual Unit"^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Unit ;
sh:property qudt:ContextualUnit-broader .
qudt:CoordinateCenterKind a rdfs:Class,
sh:NodeShape ;
rdfs:label "Coordinate Center Kind"^^xsd:string ;
dcterms:description """
An enumeration of coordinate centers for coordinate systems, such as:
"Earth centered", "Mars centered", "Moon centered", "Sun centered", and "Vehicle centered".
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:EnumeratedValue,
qudt:NominalScale ;
sh:in ( qudt:CCT_MarsCentered qudt:CCT_EarthCentered qudt:CCT_MoonCentered qudt:CCT_VehicleCentered qudt:CCT_SunCentered ) .
qudt:CoordinateMember a rdfs:Class,
sh:NodeShape ;
rdfs:label "Coordinate Member"^^xsd:string ;
dcterms:description """
A Coordinate Member is a data type that defines the properties of a coordinate in a coordinate system.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:TupleMember .
qudt:CoordinateSystem a rdfs:Class,
sh:NodeShape ;
rdfs:label "Coordinate system"^^xsd:string ;
dcterms:description """
A Coordinate System is a mathematical structure for assigning a unique n-tuple of numbers or scalars to each point in an n-dimensional space.
A Coordinate System Type is a data type that defines the properties of data structures that represent coordinate systems.
In geometry, a coordinate system is a system which uses one or more numbers, or coordinates,
to uniquely determine the position of a point or other geometric element on a manifold such as Euclidean space.
The order of the coordinates is significant.
They are sometimes identified by their position in an ordered tuple and sometimes by a letter, as in 'the x-coordinate'.
In elementary mathematics the coordinates are taken to be real numbers, but may be complex numbers or elements of a more abstract system such as a commutative ring.
The use of a coordinate system allows problems in geometry to be translated into problems about numbers and vice versa; this is the basis of analytic geometry.
In astronomy, a celestial coordinate system is a system for specifying positions of celestial objects: satellites, planets, stars, galaxies, and so on.
Coordinate systems can specify a position in 3-dimensional space, or merely the direction of the object on the celestial sphere, if its distance is not known or not important.
The coordinate systems are implemented in either spherical coordinates or rectangular coordinates.
Spherical coordinates, projected on the celestial sphere, are analogous to the geographic coordinate system used on the surface of the Earth.
These differ in their choice of fundamental plane, which divides the celestial sphere into two equal hemispheres along a great circle.
Rectangular coordinates, in appropriate units, are simply the cartesian equivalent of the spherical coordinates, with the same fundamental (x,y) plane and primary (x-axis) direction.
Each coordinate system is named for its choice of fundamental plane.
"""^^rdf:HTML ;
qudt:dbpediaMatch ;
rdfs:isDefinedBy ;
rdfs:seeAlso ,
,
,
;
rdfs:subClassOf qudt:Concept,
skos:Concept ;
sh:property qudt:CoordinateSystem-abbreviation,
qudt:CoordinateSystem-acronym,
qudt:CoordinateSystem-coordinateCenter,
qudt:CoordinateSystem-originDefinition,
qudt:CoordinateSystem-referenceFrame .
qudt:Coordinates a rdfs:Class,
sh:NodeShape ;
rdfs:label "Coordinates"^^xsd:string ;
dcterms:description """
A coordinate system is a mathematical structure for assigning a unique n-tuple of numbers or scalars to each point in an n-dimensional space.
A Coordinate System Type is a data type that defines the properties of data structures that represent coordinate systems.
The primary attributes of any coordinate system are the coordinate frame or orientation of the axes of the coordinate system and the coordinate center or origin of the coordinate system.
The coordinate center is the easier of the two attributes to define and in trajectory-related coordinate systems is often taken to be the center of mass of natural solar system bodies such as the Earth, the Moon, or Mars.
Precise definition of the coordinate frame, however, usually takes much more effort.
As a result, the primary purpose is to provide a detailed description of a number of different coordinate frames commonly used in mission analysis.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Tuple ;
sh:property qudt:Coordinates-elementType .
qudt:Coordinates-2D a rdfs:Class,
sh:NodeShape ;
rdfs:label "2D Coordinate Type"^^xsd:string ;
dcterms:description """
A 2D coordinate system is a system for assigning a two-tuple of numbers or scalars to each point in an 2-dimensional space.
A corresponding 2D Coordinate Type is a data type that defines the data type for each coordinate (tuple member) in a 2D coordinate system.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:CartesianCoordinates,
qudt:TwoTuple .
qudt:Coordinates-2D-DoublePrecision a rdfs:Class,
sh:NodeShape ;
rdfs:label "Coordinates-2D-Double precision"^^xsd:string ;
dcterms:description """
A 2D coordinates in double floating point precision for locating a point in physical space.
"""^^rdf:HTML ;
qudt:elementTypeCount 2 ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Coordinates-2D ;
sh:property qudt:Coordinates-2D-DoublePrecision-double_X,
qudt:Coordinates-2D-DoublePrecision-double_Y .
qudt:Coordinates-2D-SinglePrecision a rdfs:Class,
sh:NodeShape ;
rdfs:label "Cartesian Coordinates 2D Single Precision"^^xsd:string ;
dcterms:description """
A 2D coordinates in single floating point precision for locating a point in physical space.
"""^^rdf:HTML ;
qudt:elementTypeCount 2 ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Coordinates-2D ;
sh:property qudt:Coordinates-2D-DoublePrecision-double_X,
qudt:Coordinates-2D-DoublePrecision-double_Y .
qudt:Coordinates-3D a rdfs:Class,
sh:NodeShape ;
rdfs:label "3D Coordinate Type"^^xsd:string ;
dcterms:description """
A 3D coordinate system is a system for assigning a three-tuple of numbers or scalars to each point in an 3-dimensional space.
A corresponding 3D Coordinate Type is a data type that defines the data type for each coordinate (tuple member) in a 3D coordinate system.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:CartesianCoordinates,
qudt:ThreeTuple .
qudt:Coordinates-3D-DoublePrecision a rdfs:Class,
sh:NodeShape ;
rdfs:label "3D Coordinates (Double Precision)"^^xsd:string ;
dcterms:description """
A 3D coordinates in double floating point precision for locating a point in physical space.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Coordinates-3D ;
sh:property qudt:Coordinates-3D-DoublePrecision-double_X,
qudt:Coordinates-3D-DoublePrecision-double_Y,
qudt:Coordinates-3D-DoublePrecision-double_Z .
qudt:Coordinates-3D-SinglePrecision a rdfs:Class,
sh:NodeShape ;
rdfs:label "3D Coordinates (Single Precision)"^^xsd:string ;
dcterms:description """
A 3D coordinates in single floating point precision for locating a point in physical space.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Coordinates-3D ;
sh:property qudt:Coordinates-3D-SinglePrecision-float_X,
qudt:Coordinates-3D-SinglePrecision-float_Y,
qudt:Coordinates-3D-SinglePrecision-float_Z .
qudt:Coordinates-3D-Type a rdfs:Class,
sh:NodeShape ;
rdfs:label "3D Coordinate Type"^^xsd:string ;
dcterms:description """
A 3D coordinate system is a system for assigning a three-tuple of numbers or scalars to each point in an 3-dimensional space.
A corresponding 3D Coordinate Type is a data type that defines the data type for each coordinate (tuple member) in a 3D coordinate system.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:CartesianCoordinatesType,
qudt:ThreeTuple .
qudt:CountingUnit a rdfs:Class,
sh:NodeShape ;
rdfs:label "Counting Unit"^^xsd:string ;
dcterms:description """
A Counting Unit is used for all units that express counts.
Examples are Atomic Number, Number, Number per Year, Percent and Sample per Second.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:DimensionlessUnit .
qudt:CurrencyUnit a rdfs:Class,
sh:NodeShape ;
rdfs:label "Currency Unit"^^xsd:string ;
dcterms:description """
Currency Units have their own subclass of unit because:
(a) they have additional properties such as 'country' and
(b) their URIs do not conform to the same rules as other units.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:DimensionlessUnit ;
sh:property qudt:CurrencyUnit-currencyCode,
qudt:CurrencyUnit-currencyExponent,
qudt:CurrencyUnit-currencyNumber .
qudt:DataEncoding a rdfs:Class,
sh:NodeShape ;
rdfs:label "Data Encoding"^^xsd:string ;
dcterms:description """
Data Encoding expresses the properties that specify how data is represented at the bit and byte level.
These properties are applicable to describing raw data.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Aspect ;
sh:property qudt:DataEncoding-bitOrder,
qudt:DataEncoding-byteOrder,
qudt:DataEncoding-encoding .
qudt:DataItem a rdfs:Class,
sh:NodeShape ;
rdfs:label "Data Item"^^xsd:string ;
dcterms:description """
A Data Item holds a value that maybe a scalar or structured datatype.
Quantity Value specifies which case applies.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Concept ;
sh:property qudt:DataItem-value .
qudt:DataSetElement a rdfs:Class,
sh:NodeShape ;
rdfs:label "QUDT DataSet Element"^^xsd:string ;
dcterms:description """
A field is a tuple that carries a name, a type and optionally other properties that characterize a member element of a composite data structure.
"""^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:DataItem,
qudt:Tuple ;
sh:property qudt:DataSetElement-elementLabel,
qudt:DataSetElement-optional,
qudt:DataSetElement-quantityKind .
qudt:Datatype a rdfs:Class,
sh:NodeShape ;
rdfs:label "Datatype"^^xsd:string ;
dcterms:description """
A Datatype is a definition of the type of the "value" of a data item (for example, "all integers between 0 and 10"),
and the allowable operations on those values; the meaning of the data; and the way values of that type can be stored.
Some types are primitive - built-in to the language, with no visible internal structure.
For example "Boolean"; others are composite - constructed from one or more other types (of either kind).
For example lists, arrays, structures, unions.
Some languages provide strong typing, others allow implicit type conversion and/or explicit type conversion.
"""^^rdf:HTML ;
qudt:informativeReference "http://en.wikipedia.org/wiki/Data_type"^^xsd:anyURI,
"http://foldoc.org/data+type"^^xsd:anyURI,
"http://www.princeton.edu/~achaney/tmve/wiki100k/docs/Data_type.html"^^xsd:anyURI ;
rdfs:isDefinedBy ,
;
rdfs:subClassOf qudt:Concept ;
sh:property qudt:Datatype-ansiSQLName,
qudt:Datatype-basis,
qudt:Datatype-bounded,
qudt:Datatype-cName,
qudt:Datatype-cardinality,
qudt:Datatype-id,
qudt:Datatype-javaName,
qudt:Datatype-jsName,
qudt:Datatype-matlabName,
qudt:Datatype-microsoftSQLServerName,
qudt:Datatype-mySQLName,
qudt:Datatype-odbcName,
qudt:Datatype-oleDBName,
qudt:Datatype-oracleSQLName,
qudt:Datatype-orderedType,
qudt:Datatype-protocolBuffersName,
qudt:Datatype-pythonName,
qudt:Datatype-vbName .
qudt:DateStringType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Date String Type"^^xsd:string ;
dcterms:description "Date String Types are scalar data types that define the properties of strings that represent calendar dates."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:DateTimeStringType .
qudt:DateTimeStringEncodingType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Date Time String Encoding Type"^^xsd:string ;
dcterms:description "Date Time encodings are logical encodings for expressing date/time quantities as strings by applying unambiguous formatting and parsing rules."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:StringEncodingType ;
sh:property [ sh:path qudt:allowedPattern ;
sh:qualifiedMinCount 1 ;
sh:qualifiedValueShape [ sh:datatype xsd:string ] ],
qudt:DateTimeStringEncodingType-allowedPattern .
qudt:DateTimeStringType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Temporal Type"^^xsd:string ;
dcterms:description """
A class of data types for structures that represent temporal quantities.
For example, calendar dates, times, duration of time since a given epoch, etc.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:StringType ;
sh:property qudt:DateTimeStringType-encoding .
qudt:DecimalPrefix a rdfs:Class,
sh:NodeShape ;
rdfs:label "Decimal Prefix"^^xsd:string ;
dcterms:description """
A Decimal Prefix is a prefix for multiples of units that are powers of 10.
"""^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Prefix .
qudt:DerivedUnit a rdfs:Class,
sh:NodeShape ;
rdfs:label "Derived Unit"^^xsd:string ;
dcterms:description """
A Derived Unit is a type specification for units that are derived from other units.
"""^^rdf:HTML ;
qudt:dbpediaMatch "http://dbpedia.org/resource/Category:SI_derived_units"^^xsd:anyURI ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Unit .
qudt:Dictionary a rdfs:Class,
sh:NodeShape ;
rdfs:label "Dictionary Type"^^xsd:string ;
dcterms:description "A \"Map\"."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Map .
qudt:DigitalCurrencyUnit a rdfs:Class,
sh:NodeShape ;
rdfs:label "Digital Currency Unit"@en ;
dcterms:description "A currency-like unit for cryptographic or tokenized assets. Instances should reference an ISO 24165 Digital Token Identifier (DTI) when available."@en ;
qudt:informativeReference ,
;
rdfs:comment "A currency-like unit for cryptographic or tokenized assets. Instances should reference an ISO 24165 Digital Token Identifier (DTI) when available."@en ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:CurrencyUnit ;
sh:property [ sh:datatype xsd:string ;
sh:maxCount 1 ;
sh:message "hasDTICode, if provided, must be a 12-character ISO 24165 DTI (A–Z, 0–9)."@en ;
sh:path qudt:hasDTICode ;
sh:pattern "^[A-Z0-9]{12}$"^^xsd:string ],
[ sh:datatype xsd:string ;
sh:maxCount 1 ;
sh:message "blockchainNetwork, if provided, must be a single string (e.g., 'Bitcoin Mainnet')."@en ;
sh:path qudt:blockchainNetwork ],
[ sh:datatype xsd:string ;
sh:maxCount 1 ;
sh:message "currencyCode must be a single 2–10 character uppercase alphanumeric mnemonic (e.g., 'BTC', 'USDT')."@en ;
sh:path qudt:currencyCode ;
sh:pattern "^[A-Z0-9]{2,10}$"^^xsd:string ],
[ sh:datatype xsd:integer ;
sh:maxCount 1 ;
sh:maxInclusive 30 ;
sh:message "currencyExponent must be a single integer between 0 and 30 (e.g., BTC = 8, ETH = 18)."@en ;
sh:minInclusive 0 ;
sh:path qudt:currencyExponent ] .
qudt:DimensionalDatatype a rdfs:Class,
sh:NodeShape ;
rdfs:label "Dimensional Data Type"^^xsd:string ;
dcterms:description """
A Dimensional Data Type is a data type that specifies a physical quantity or unit of measure.
Information about the physical dimensions of the quantities and units is embedded in their types.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:StructuredDatatype .
qudt:DimensionlessUnit a rdfs:Class,
sh:NodeShape ;
rdfs:label "Dimensionless Unit"^^xsd:string ;
dcterms:description """
A Dimensionless Unit is a quantity for which all the exponents of the factors corresponding to the base quantities in its quantity dimension are zero.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Unit .
qudt:Discipline a rdfs:Class,
sh:NodeShape ;
rdfs:label "Discipline"^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Concept .
qudt:DiscreteState a rdfs:Class,
sh:NodeShape ;
rdfs:label "Discrete State"^^xsd:string ;
dcterms:description """
A Discrete State is the parent class for enumerated values that express a 'State' or 'Condition'.
Examples are 'on' and 'off for a switch, 'open' and 'closed' for a valve, and 'wet' and 'dry'.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:EnumeratedValue ;
sh:property qudt:DiscreteState-inverted .
qudt:DoublePrecisionType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Double Precision Type"^^xsd:string ;
dcterms:description """
A double precision data type specifies how a numeric value, such as an integer or real number, is stored in memory.
Typically this occupies two words in computer memory, where the byte length of a word depends on machine address size of the computer processor.
For example, on 32-bit machine architectures, a word is four bytes, and so double precision data value on a 32-bit machine architecture occupies eight bytes of memory.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:NumericType ;
sh:disjoint qudt:SinglePrecisionType .
qudt:EarthCoordinateSystem a rdfs:Class,
sh:NodeShape ;
rdfs:label "Earth Coordinate System Type"^^xsd:string ;
dcterms:description """
A "Trajectory Coordinate System" for all earth-centered coordinates, such as:
- Earth mean equator and prime meridian coordinate system;;
- Earth true equator and prime meridian of epoch coordinate system;
- International celestial reference system;
- International terrestrial reference system;
- Sun centered international celestial reference system;
- Vehicle centered international celestial reference system.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:TrajectoryCoordinateSystem ;
sh:property qudt:EarthCoordinateSystem-coordinateCenter .
qudt:Encoding a rdfs:Class,
sh:NodeShape ;
rdfs:label "Encoding"^^xsd:string ;
dcterms:description """
An encoding is a rule or algorithm that is used to convert data from a native, or unspecified form into a specific form that satisfies the encoding rules.
Examples of encodings include character encodings, such as UTF-8.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf skos:Concept ;
sh:property qudt:Encoding-bits,
qudt:Encoding-bytes .
qudt:EndianType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Endian Type"^^xsd:string ;
qudt:informativeReference "http://en.wikipedia.org/wiki/Endianness"^^xsd:anyURI ;
qudt:plainTextDescription "In computing, endianness is the ordering used to represent some kind of data as a sequence of smaller units. Typical cases are the order in which integer values are stored as bytes in computer memory (relative to a given memory addressing scheme) and the transmission order over a network or other medium. When specifically talking about bytes, endianness is also referred to simply as byte order. Most computer processors simply store integers as sequences of bytes, so that, conceptually, the encoded value can be obtained by simple concatenation. For an 'n-byte' integer value this allows 'n!' (n factorial) possible representations (one for each byte permutation). The two most common of them are: increasing numeric significance with increasing memory addresses, known as little-endian, and its opposite, called big-endian."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:EnumeratedValue ;
sh:property [ a sh:PropertyShape ;
rdfs:isDefinedBy ;
sh:in ( qudt:LittleEndian qudt:BigEndian ) ;
sh:path [ sh:inversePath rdf:type ] ] .
qudt:EngineeringValueTupleMember a rdfs:Class,
sh:NodeShape ;
rdfs:label "Engineering Value Tuple Member"^^xsd:string ;
dcterms:description """
A sub-type of 'Tuple Member Type'.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:TupleMember ;
sh:disjoint qudt:RawValueTupleMember,
qudt:RawValueTupleMemberType ;
sh:property qudt:EngineeringValueTupleMember-elementType .
qudt:EnumeratedQuantity a rdfs:Class,
sh:NodeShape ;
rdfs:label "Enumerated Quantity"^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Concept ;
sh:property qudt:EnumeratedQuantity-enumeratedValue,
qudt:EnumeratedQuantity-enumeration .
qudt:EnumeratedValue a rdfs:Class,
sh:NodeShape ;
rdfs:label "Enumerated Value"^^xsd:string ;
dcterms:description """
An Enumerated Value class defines the members of an enumeration.
An enumeration is a set of literals from which a single value is selected.
Each literal can have a tag as an integer within a standard encoding appropriate to the range of integer values.
Consistency of enumeration types will allow them, and the enumerated values, to be referred to unambiguously either through symbolic name or encoding.
Enumerated values are also controlled vocabularies and as such need to be standardized.
Without this consistency enumeration literals can be stated differently and result in data conflicts and misinterpretations.
The tags are a set of positive whole numbers, not necessarily contiguous and having no numerical significance, each corresponding to the associated literal identifier.
An order attribute can also be given on the enumeration elements.
An enumeration can itself be a member of an enumeration.
This allows enumerations to be enumerated in a selection.
Enumerations are also subclasses of Scalar Datatype.
This allows them to be used as the reference of a datatype specification.
"""^^rdf:HTML ;
qudt:informativeReference "http://en.wikipedia.org/wiki/Enumeration"^^xsd:anyURI ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Verifiable,
ns1:EnumeratedValue ;
sh:property qudt:EnumeratedValue-abbreviation,
qudt:EnumeratedValue-altSymbol,
qudt:EnumeratedValue-description,
qudt:EnumeratedValue-symbol .
qudt:Enumeration a rdfs:Class,
sh:NodeShape ;
rdfs:label "Enumeration"^^xsd:string,
"QUDT Enumeration"^^xsd:string ;
dcterms:description """
An Enumeration is a set of literals from which a single value is selected.
Each literal can have a tag as an integer within a standard encoding appropriate to the range of integer values.
Consistency of enumeration types will allow them, and the enumerated values, to be referred to unambiguously either through symbolic name or encoding.
Enumerated values are also controlled vocabularies and as such need to be standardized.
Without this consistency enumeration literals can be stated differently and result in data conflicts and misinterpretations.
The tags are a set of positive whole numbers, not necessarily contiguous and having no numerical significance, each corresponding to the associated literal identifier.
An order attribute can also be given on the enumeration elements. An enumeration can itself be a member of an enumeration. This allows enumerations to be enumerated in a selection.
Enumerations are also subclasses of Scalar Datatype.
This allows them to be used as the reference of a datatype specification.
"""^^rdf:HTML ;
qudt:dbpediaMatch "http://dbpedia.org/resource/Enumeration"^^xsd:anyURI ;
qudt:informativeReference "http://en.wikipedia.org/wiki/Enumerated_type"^^xsd:anyURI,
"http://en.wikipedia.org/wiki/Enumeration"^^xsd:anyURI ;
ns2:isElaboratedIn ;
rdfs:isDefinedBy ,
;
rdfs:subClassOf qudt:Concept,
qudt:StructuredDatatype,
ns1:Enumeration ;
sh:property qudt:Enumeration-abbreviation,
qudt:Enumeration-bits,
qudt:Enumeration-default,
qudt:Enumeration-defaultValue,
qudt:Enumeration-element,
qudt:Enumeration-encoding,
qudt:Enumeration-value .
qudt:EnumerationScale a rdfs:Class,
sh:NodeShape ;
rdfs:label "Enumeration scale"^^xsd:string ;
dcterms:description """
A sub-type of 'DTYPE Enumeration'.
"""^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Scale,
ns1:Enumeration ;
sh:class ns1:Enumeration .
qudt:FactorUnit a rdfs:Class,
sh:NodeShape ;
rdfs:label "Factor Unit"^^xsd:string,
"Reified Factor"^^xsd:string ;
dcterms:description """
A Factor Unit is a type specification for a unit, exponent pair that is a component of a derived unit.
"""^^rdf:HTML ;
qudt:dbpediaMatch "http://dbpedia.org/resource/Category:SI_derived_units"^^xsd:anyURI ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Concept ;
sh:property qudt:FactorUnit-exponent,
qudt:FactorUnit-hasUnit .
qudt:FieldType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Field Type"^^xsd:string ;
dcterms:description """
A sub-type of 'Composite Data Type'.
"""^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:CompositeDatatype ;
sh:property qudt:FieldType-elementName,
qudt:FieldType-elementType,
qudt:FieldType-fieldLabel,
qudt:FieldType-fieldType .
qudt:Figure a rdfs:Class,
sh:NodeShape ;
rdfs:label "Figure"^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Concept ;
sh:property qudt:Figure-figureCaption,
qudt:Figure-figureLabel,
qudt:Figure-height,
qudt:Figure-image,
qudt:Figure-imageLocation,
qudt:Figure-landscape,
qudt:Figure-width .
qudt:FileFormat a rdfs:Class,
sh:NodeShape ;
rdfs:label "File format"^^xsd:string ;
dcterms:description """
A sub-type of 'Enumerated Value'.
"""^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:EnumeratedValue .
qudt:FixedIntervalTimeSeriesArray a rdfs:Class,
sh:NodeShape ;
rdfs:label "Fixed Interval Time Series Array Type"^^xsd:string ;
dcterms:description """
A Fixed Interval Time Series Array Type is a data type that specifies the properties of arrays that hold time series data.
For example, data that has been sampled over uniformly spaced time intervals.
A time series is a sequence of data points, measured typically at successive times, spaced at uniform or non-uniform time intervals.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:TimeSeriesArray .
qudt:FixedIntervalTimeSeriesArrayType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Fixed Interval Time Series Array Type"^^xsd:string ;
dcterms:description """A Fixed Interval Time Series Array Type is a data type that specifies the properties of arrays that hold time series data.
For example, data that has been sampled over uniformly spaced time intervals.
A time series is a sequence of data points, measured typically at successive times, spaced at uniform or non-uniform time intervals.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:TimeSeriesArrayType .
qudt:FloatingPointEncodingType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Floating Point Encoding"^^xsd:string ;
dcterms:description """
A type for specifying an "Encoding" with the following instance(s):
"Double Precision Encoding", and "Single Precision Real Encoding".
"""^^rdf:HTML,
"""
A "Encoding" with the following instance(s): "Double Precision Encoding", "Single Precision Real Encoding".
"""^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Encoding .
qudt:FrameType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Frame Type"^^xsd:string ;
dcterms:description """
A Frame Type specifies the intertial type of a coordinate frame as either inertial, rotating, or non-rotating.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:EnumeratedValue ;
sh:in ( qudt:FT_ROTATING qudt:FT_NON-ROTATING qudt:FT_INERTIAL ) .
qudt:Function a rdfs:Class,
sh:NodeShape ;
rdfs:label "Function"^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Concept .
qudt:FunctionDatatype a rdfs:Class,
sh:NodeShape ;
rdfs:label "Function Data Type"^^xsd:string ;
dcterms:description """
A function data type defines the input and output data type for a function or method.
The data type includes at least the function name and the number of its parameters.
In some programming languages, it may also specify the function's return type or the types of its arguments.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:StructuredDatatype ;
sh:property qudt:FunctionDatatype-argType,
qudt:FunctionDatatype-functionArity,
qudt:FunctionDatatype-returnType .
qudt:Graph a rdfs:Class,
sh:NodeShape ;
rdfs:label "Graph Type"^^xsd:string ;
dcterms:description """
A Graph is an instance of a kind of abstract data type, that consists of a set of nodes (also called vertices) and a set of edges that establish relationships (connections) between the nodes.
A Graph Type is a data type that defines the properties of data structures that represent graphs and their members (nodes and edges).
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:DataItem .
qudt:GroundCoordinateSystem a rdfs:Class,
sh:NodeShape ;
rdfs:label "Ground coordinate system"^^xsd:string ;
dcterms:description "A sub-type of 'Aerospace coordinate system'."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:AerospaceCoordinateSystem .
qudt:Heap a rdfs:Class,
sh:NodeShape ;
rdfs:label "Heap"^^xsd:string ;
dcterms:description """
A heap is a specialized tree-based data structure that satisfies the condition: if B is a child node of A, then $key(A) \\ge key(B)$.
This implies that an element with the greatest key is always in the root node, and so such a heap is sometimes called a max heap.
Alternatively, if the comparison is reversed, the smallest element is always in the root node, which results in a min heap.
The function or method that implements the key() operator is specified by the heap type.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:OrderedTree ;
prov:wasInfluencedBy .
qudt:HeterogenousArray a rdfs:Class,
sh:NodeShape ;
rdfs:label "Heterogenous Array"^^xsd:string ;
dcterms:description """
An Array> is a data structure that stores a collection of elements, typically of the same type, in a contiguous block of memory.
Each element in an array is identified by an index or key, which is typically a numerical identifier, either starting at '0' or '1'.
The key considerations for an Array are:
- Fixed Size: The size of an array may be pre-determined when it is created and cannot be changed;
- Index-Based Access: Elements can be accessed, updated, or modified using their index;
- Heterogenous Elements: all elements in the array may be of different data types;
- Contiguous Memory Allocation:
the elements are stored in consecutive memory locations, which allows efficient access using the index.
An Array is represented as ordered entries of values arranged according to its dimensionality.
The number of dimensions is specified in the attribute 'dimensionality'.
The property 'qudt:datatype' refers to a list if the datatypes of the elements.
An heterogenous array can be multi-dimensional.
Multiple indices are used but they are treated as extensions of the same structure.
For example: for a 2D array arr[2][3], indices refer to the row and column positions.
A 2D array is still represented as a list, where each member of the list is a list.
Higher dimensional arrays can be represented as nested lists.
For each dimension a new nested list is defined.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Array ;
sh:property qudt:HeterogenousArray-datatype .
qudt:HexBinaryType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Hexidecimal Binary Type"^^xsd:string ;
dcterms:description "A string composed of hex characters."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:TextStringType ;
sh:property qudt:HexBinaryType-length,
qudt:HexBinaryType-maxLength,
qudt:HexBinaryType-minLength,
qudt:HexBinaryType-pattern .
qudt:HomogeneousArray a rdfs:Class,
sh:NodeShape ;
rdfs:label "Homogeneous Array"^^xsd:string ;
dcterms:description """
An Array> is a data structure that stores a collection of elements, typically of the same type, in a contiguous block of memory.
Each element in an array is identified by an index or key, which is typically a numerical identifier, either starting at '0' or '1'.
The key considerations for an Array are:
- Fixed Size: The size of an array may be pre-determined when it is created and cannot be changed;
- Index-Based Access: Elements can be accessed, updated, or modified using their index;
- Homogeneous Elements: all elements in an array must be of the same datatype;
- Contiguous Memory Allocation: The elements are stored in consecutive memory locations, which allows efficient access using the index.
An Array is represented as ordered entries of values arranged according to its dimensionality.
The number of dimensions is specified in the attribute 'dimensionality'.
The property 'qudt:datatype' refers to the datatype of the elements.
An array can be multi-dimensional.
Multiple indices are used but they are treated as extensions of the same structure.
For Example: for a 2D array arr[2][3], indices refer to the row and column positions.
A 2D array is still represented as a list, where each member of the list is a list.
Higher dimensional arrays can be represented as nested lists.
For each dimension a new nested list is defined.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Array .
qudt:IconicCue a rdfs:Class,
sh:NodeShape ;
rdfs:label "Iconic enumeration literal"^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:ModalCue ;
sh:disjoint qudt:AuralCue,
qudt:KinestheticCue,
qudt:VisualCue ;
sh:property qudt:IconicCue-image .
qudt:InertialCoordinateFrame a rdfs:Class,
sh:NodeShape ;
rdfs:label "Inertial Coordinate Frame"^^xsd:string ;
dcterms:description "A \"Coordinate Frame\"."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:seeAlso qudt:NonRotatingInertialFrame ;
rdfs:subClassOf qudt:InertialReferenceFrame ;
sh:property qudt:InertialCoordinateFrame-frameType .
qudt:InertialReferenceFrame a rdfs:Class,
sh:NodeShape ;
rdfs:label "Inertial reference frame"^^xsd:string ;
dcterms:description """
A sub-type of 'Reference Frame'.
"""^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:ReferenceFrame .
qudt:IntegerDatatype a rdfs:Class,
sh:NodeShape ;
rdfs:label "Integer Datatype"^^xsd:string ;
dcterms:description "An Integer Type is a data type that specifies how integer numbers are represented and stored in machine memory."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:NumericType,
qudt:OrdinalType .
qudt:IntegerEncodingType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Integer Encoding"^^xsd:string ;
dcterms:description "The encoding scheme for integer types"^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Encoding ;
sh:property [ a sh:PropertyShape ;
rdfs:isDefinedBy ;
sh:in ( qudt:LongUnsignedIntegerEncoding qudt:ShortUnsignedIntegerEncoding qudt:ShortUnsignedIntegerEncoding qudt:SignedIntegerEncoding qudt:UnsignedIntegerEncoding ) ;
sh:path [ sh:inversePath rdf:type ] ] .
qudt:IntegerListShape a rdfs:Class,
sh:NodeShape ;
rdfs:isDefinedBy ;
rdfs:subClassOf rdf:List ;
sh:property [ sh:datatype xsd:integer ;
sh:path rdf:first ],
[ sh:or ( [ sh:node () ] [ sh:node qudt:IntegerListShape ] ) ;
sh:path rdf:rest ] .
qudt:InterpolatedTable a rdfs:Class,
sh:NodeShape ;
rdfs:label "Interpolated Table Type"^^xsd:string ;
dcterms:description "A sub-type of 'Table Type'."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Table,
qudt:TableType .
qudt:IntervalScale a rdfs:Class,
sh:NodeShape ;
rdfs:label "Interval scale"^^xsd:string ;
dcterms:description """
The interval type allows for the degree of difference between items, but not the ratio between them.
Examples include temperature with the Celsius scale, which has two defined points
(the freezing and boiling point of water at specific conditions) and then separated into 100 intervals,
date when measured from an arbitrary epoch (such as AD), percentage such as a percentage return on a stock,
location in Cartesian coordinates, and direction measured in degrees from true or magnetic north.
Ratios are not meaningful since 20 °C cannot be said to be "twice as hot" as 10 °C, nor can multiplication/division be carried out between any two dates directly.
However, ratios of differences can be expressed; for example, one difference can be twice another.
Interval type variables are sometimes also called "scaled variables", but the formal mathematical term is an affine space (in this case an affine line).
Characteristics: median, percentile & Monotonic increasing (order (<) & totally ordered set.
"""^^rdf:HTML ;
qudt:informativeReference "https://en.wikipedia.org/wiki/Level_of_measurement"^^xsd:anyURI ;
rdfs:isDefinedBy ;
rdfs:seeAlso qudt:NominalScale,
qudt:OrdinalScale,
qudt:RatioScale ;
rdfs:subClassOf qudt:Scale .
qudt:KinestheticCue a rdfs:Class,
sh:NodeShape ;
rdfs:label "Kinesthetic Cue"^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:ModalCue ;
sh:property qudt:KinestheticCue-code .
qudt:LargeObject a rdfs:Class,
sh:NodeShape ;
rdfs:label "Large object"^^xsd:string ;
dcterms:description """
A 'LargeObject' datatype is used to store blocks of unstructured data (such as text, graphic images, video clips, and sound waveforms).
They often are used to allow efficient, random, piece-wise access to the data.
"""^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:CompositeDatatype .
qudt:LargeObjectType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Large object"^^xsd:string ;
dcterms:description "A 'LargeObject' datatype is used to store blocks of unstructured data (such as text, graphic images, video clips, and sound waveforms). They often are used to allow efficient, random, piece-wise access to the data."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:CompositeDatatype .
qudt:LimitType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Limit type"^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:EnumeratedValue .
qudt:List a rdfs:Class,
sh:NodeShape ;
rdfs:label "List"^^xsd:string ;
dcterms:description "A sub-type of 'AbstractDataItem'."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:DataItem ;
sh:property qudt:DatatypePropertyShape,
qudt:MaybeQuantityPropertyShape,
qudt:MaybeUnitPropertyShape .
qudt:LocalCoordinateSystem a rdfs:Class,
sh:NodeShape ;
rdfs:label "Local Coordinate System"^^xsd:string ;
dcterms:description """
A "Trajectory Coordinate System" with the following instance(s):
"Local vertical curvilinear coordinate system",
"Local vertical local horizontal coordinate system",
"Vehicle centered local vertical curvilinear coordinate system".
"""^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:TrajectoryCoordinateSystem .
qudt:LogarithmicUnit a rdfs:Class,
sh:NodeShape ;
rdfs:label "Logarithmic Unit"^^xsd:string ;
dcterms:description """
Logarithmic units are abstract mathematical units that can be used to express any quantities
(physical or mathematical) that are defined on a logarithmic scale, that is, as being proportional
to the value of a logarithm function.
Examples of logarithmic units include common units of information and entropy, such as the bit,
and the byte, as well as units of relative signal strength magnitude such as the decibel.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:DimensionlessUnit .
qudt:LongIntegerType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Long Integer Type"^^xsd:string ;
dcterms:description """
A "Long Integer" is an integer that can be represented in four octets (32 bits) of machine memory.
Long integers may be signed or unsigned.
"""^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:IntegerDatatype .
qudt:LunarCoordinateSystem a rdfs:Class,
sh:NodeShape ;
rdfs:label "Lunar Coordinate System"^^xsd:string ;
dcterms:description """
Two slightly different coordinate frames are commonly used to define the orientation of the axes of a lunar body-fixed coordinate system:
a mean Earth/rotation frame and a principal axis coordinate frame.
The mean Earth/rotation frame (sometimes called the "Mean Earth/polar axis" frame) is a lunar body-fixed coordinate frame.
This has the X-axis aligned with the mean direction from the Moon to the Earth and the Z-axis aligned with the mean axis of rotation of the Moon.
The principal axis frame is a lunar body-fixed coordinate frame aligned with the principal axes of the Moon.
Due to the fact that the Moon is synchronously rotating but is not exactly symmetric, the principal axes and the mean Earth/rotation axes of the Moon do not coincide.
"""^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:TrajectoryCoordinateSystem ;
sh:property qudt:LunarCoordinateSystem-coordinateCenter,
qudt:LunarCoordinateSystem-realization,
qudt:LunarCoordinateSystem-xAxisDefinition,
qudt:LunarCoordinateSystem-yAxisDefinition,
qudt:LunarCoordinateSystem-zAxisDefinition .
qudt:MajorMinorType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Major minor type"^^xsd:string ;
dcterms:description "A sub-type of 'Enumerated Value'."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:EnumeratedValue ;
sh:in ( qudt:Minor qudt:Major ) .
qudt:Map a rdfs:Class,
sh:NodeShape ;
rdfs:label "Map Type"^^xsd:string ;
dcterms:description "A Map Type is an abstract data type that defines the properties of map data structures. A Map (or Associative Array) is an abstract data structure composed of a collection of keys and a collection of values, where each key is associated with one value. The operation of finding the value associated with a key is called a lookup or indexing, and this is the most important operation supported by an associative array. The relationship between a key and its value is sometimes called a mapping or binding."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:seeAlso qudt:AssociativeArray ;
rdfs:subClassOf qudt:Collection .
qudt:MarsCoordinateSystem a rdfs:Class,
sh:NodeShape ;
rdfs:label "Mars Coordinate System Type"^^xsd:string ;
dcterms:description """
A "Trajectory Coordinate System" with the following instance(s): "Mars mean equator and IAU-Node of epoch", "Mars mean equator and prime meridian body-fixed".
"""^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:TrajectoryCoordinateSystem ;
sh:property qudt:MarsCoordinateSystem-coordinateCenter .
qudt:MathsFunctionType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Maths Function Type"^^xsd:string ;
dcterms:description "A sub-type of 'QUDT Concept'."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Concept .
qudt:Matrix a rdfs:Class,
sh:NodeShape ;
rdfs:label "Matrix"^^xsd:string ;
dcterms:description """
A Matrix is a data type that specifies the properties of an N-dimensional data structure.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Array .
qudt:MemoryOrderType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Memory order type"^^xsd:string ;
dcterms:description "A sub-type of 'Enumerated Value'."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:EnumeratedValue .
qudt:ModalCue a rdfs:Class,
sh:NodeShape ;
rdfs:label "Modal Cue"^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:EnumeratedValue ;
sh:property qudt:ModalCue-duration .
qudt:ModalEnumeration a rdfs:Class,
sh:NodeShape ;
rdfs:label "Modal Enumeration"^^xsd:string ;
dcterms:description "A sub-type of 'QUDT Enumeration'."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Enumeration ;
sh:property qudt:ModalEnumeration-defaultValue .
qudt:MultiDimensionalArray a rdfs:Class,
sh:NodeShape ;
rdfs:label "Multi-Dimensional Array Type"^^xsd:string ;
dcterms:description """
A Multi-Dimensional Array is an extension of a standard one-dimensional array,
where elements are organized in a grid-like structure across two or more dimensions.
It is a collection of elements arranged in a tabular or multi-dimensional structure for representing complex datasets,
such as matrices, tensors, or higher-dimensional data.
The elements of a multi-dimensional array are N-tuples, where 'N' corresponds to the dimensionality of the array.
Each element is specified using the property 'qudt:element'.
Ordinary or one-dimensional arrays are indexed by a single integer.
For a multi-dimensional array, the index into the array uses an ordered list of integers, such as in 'a[3,1,5]'.
The length of the list of integers used to index into the multi-dimensional array is always the same.
This is referred to as the array's dimensionality.
The bounds on each of these are called the array's dimensions.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Array .
qudt:MultiDimensionalDataFormat a rdfs:Class,
sh:NodeShape ;
rdfs:label "Multi dimensional data format"^^xsd:string ;
dcterms:description """
Data formats for storing and manipulating scalar and multidimensional data in a platform and discipline independent manner,
for example HDF, CDF and netCDF.
"""^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:CompositeDatatype ;
sh:property qudt:MultiDimensionalDataFormat-descriptor .
qudt:MultiModalEnumeration a rdfs:Class,
sh:NodeShape ;
rdfs:label "Multi modal enumeration"^^xsd:string ;
dcterms:description "A sub-type of 'QUDT Enumeration'."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Enumeration ;
sh:property qudt:MultiModalEnumeration-auralCueEnumeration,
qudt:MultiModalEnumeration-iconicCueEnumeration,
qudt:MultiModalEnumeration-kinestheticCueEnumeration,
qudt:MultiModalEnumeration-modalCueEnumeration,
qudt:MultiModalEnumeration-visualCueEnumeration .
qudt:MultiModalType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Multi Modal Type"^^xsd:string ;
dcterms:description "A sub-type of 'Enumerated Value'."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:EnumeratedValue ;
sh:property qudt:MultiModalType-auralCue,
qudt:MultiModalType-iconicCue,
qudt:MultiModalType-kinestheticCue,
qudt:MultiModalType-modalCue,
qudt:MultiModalType-visualCue .
qudt:MultiSet a rdfs:Class,
sh:NodeShape ;
rdfs:label "Bag"^^xsd:string ;
dcterms:description "A bag is a set in which elements may be repeated."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Collection .
qudt:N-Tuple a rdfs:Class,
sh:NodeShape ;
rdfs:label "N-Tuple Type"^^xsd:string ;
dcterms:description """
A tuple containing n objects is known as an "n-tuple".
For example the 4-tuple (or "quadruple"), with components of respective types PERSON, DAY, MONTH and YEAR.
This could be used to record that a certain person was born on a certain day of a certain month of a certain year.
"""^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Tuple ;
sh:property qudt:N-Tuple-elementType .
qudt:N-TupleType a rdfs:Class,
sh:NodeShape ;
rdfs:label "N-Tuple Type"^^xsd:string ;
dcterms:description """
A tuple containing n objects is known as an "n-tuple".
For example the 4-tuple (or "quadruple"), with components of respective types PERSON, DAY, MONTH and YEAR.
This could be used to record that a certain person was born on a certain day of a certain month of a certain year.
"""^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Tuple ;
sh:property qudt:N-Tuple-elementType .
qudt:NIST_SP811_Comment a rdfs:Class,
sh:NodeShape ;
rdfs:label "NIST SP~811 Comment"^^xsd:string ;
dcterms:description "National Institute of Standards and Technology (NIST) Special Publication 811 Comments on some quantities and their units"^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Comment .
qudt:NominalScale a rdfs:Class,
sh:NodeShape ;
rdfs:label "Nominal scale"^^xsd:string ;
dcterms:description """
A nominal scale differentiates between items or subjects based only on their names or (meta-)categories and other qualitative classifications they belong to;
thus dichotomous data involves the construction of classifications as well as the classification of items.
Discovery of an exception to a classification can be viewed as progress.
Numbers may be used to represent the variables but the numbers do not have numerical value or relationship:
for example, a Globally unique identifier.
Examples of these classifications include gender, nationality, ethnicity, language, genre, style, biological species, and form.
In a university one could also use hall of affiliation as an example.
"""^^rdf:HTML ;
qudt:informativeReference "https://en.wikipedia.org/wiki/Level_of_measurement"^^xsd:anyURI ;
rdfs:isDefinedBy ;
rdfs:seeAlso qudt:IntervalScale,
qudt:OrdinalScale,
qudt:RatioScale ;
rdfs:subClassOf qudt:Scale .
qudt:NonRotatingInertialFrame a rdfs:Class,
sh:NodeShape ;
rdfs:label "Non Rotating Coordinate Frame"^^xsd:string ;
dcterms:description """
The non-rotating (or "inertial") coordinate frames are defined by taking a "snapshot" of the orientation of a particular set of right-handed, orthogonal axes at a specific epoch or time.
In other words, the non-rotating coordinate frame, however it is defined, is frozen or fixed at a specific time - for all time.
These non-rotating coordinate frames are referred to as "of Epoch" coordinate frames.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:seeAlso qudt:InertialCoordinateFrame ;
rdfs:subClassOf qudt:InertialReferenceFrame ;
sh:property qudt:NonRotatingInertialFrame-frameType .
qudt:NumericListShape a rdfs:Class,
sh:NodeShape ;
rdfs:isDefinedBy ;
rdfs:subClassOf rdf:List ;
sh:property [ sh:or ( [ sh:node () ] [ sh:node qudt:NumericListShape ] ) ;
sh:path rdf:rest ],
[ sh:or qudt:NumericTypeUnion ;
sh:path rdf:first ] .
qudt:NumericType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Numeric Type"^^xsd:string ;
dcterms:description "Numeric data types are data types whose values denote quantities as defined by a mathematical number system."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:ScalarDatatype ;
sh:property qudt:NumericType-accuracy,
qudt:NumericType-signedness .
qudt:OctetType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Octet Type"^^xsd:string ;
dcterms:description "An 8 bit unsigned integer"^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:UnsignedIntegerType .
qudt:OffOnStateTypeEnumeration a rdfs:Class,
sh:NodeShape ;
dcterms:description """
A discrete state enumeration whose values are 'off' and 'on'.
The 'off' value is encoded as a zero (0) and the 'on' value as a one (1).
"""^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Enumeration .
qudt:OnOffStateType a rdfs:Class,
sh:NodeShape ;
rdfs:label "On off state type"^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:DiscreteState .
qudt:OnOffStateTypeEnumeration a rdfs:Class,
sh:NodeShape ;
qudt:inverted true ;
rdfs:comment """
A discrete state enumeration whose values are 'off' and 'on'.
The 'on' value is encoded as a zero (0) and the 'off' value as a one (1).
"""^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Enumeration .
qudt:OrderedCollection a rdfs:Class,
sh:NodeShape ;
rdfs:label "Ordered Collection Kind"^^xsd:string ;
dcterms:description """
An Ordered Collection Kind is an abstract data type that defines the properties of collection data structures whose members can be linearly ordered.
An ordered collection is a collection together with an ordering relation (such as greater than) that linearly orders the collection elements.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Collection ;
sh:property qudt:OrderedCollection-orderingRelation .
qudt:OrderedTree a rdfs:Class,
sh:NodeShape ;
rdfs:label "Ordered Tree Type"^^xsd:string ;
dcterms:description """
An "Ordered Tree Type" is a data type that defines the properties of data structures that represent ordered trees.
An ordered tree is a tree where the children of every node are ordered, that is, there is a first child, second child, third child, etc.
Typically a type specification for an ordered tree will include the comparison operator (such as lt or gt) that is used to order the nodes.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:OrderedCollection,
qudt:Tree .
qudt:OrderedType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Ordered type"^^xsd:string ;
dcterms:description "Describes how a data or information structure is ordered."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:EnumeratedValue ;
sh:property [ a sh:PropertyShape ;
rdfs:isDefinedBy ;
sh:in ( qudt:Unordered qudt:PartiallyOrdered qudt:TotallyOrdered ) ;
sh:path [ sh:inversePath rdf:type ] ],
qudt:OrderedType-literal .
qudt:OrdinalScale a rdfs:Class,
sh:NodeShape ;
rdfs:label "Ordinal scale"^^xsd:string ;
dcterms:description """
The ordinal type allows for rank order (1st, 2nd, 3rd, etc.) by which data can be sorted,
but still does not allow for relative degree of difference between them.
Examples include, on one hand, dichotomous data with dichotomous (or dichotomized) values such as:
'sick' vs. 'healthy' when measuring health, 'guilty' vs. 'innocent' when making judgments in courts,
'wrong/false' vs. 'right/true' when measuring truth value, and, on the other hand, non-dichotomous data consisting of a spectrum of values, such as:
'completely agree', 'mostly agree', 'mostly disagree', 'completely disagree' when measuring opinion.
"""^^rdf:HTML ;
qudt:informativeReference "https://en.wikipedia.org/wiki/Level_of_measurement"^^xsd:anyURI ;
rdfs:isDefinedBy ;
rdfs:seeAlso qudt:IntervalScale,
qudt:NominalScale,
qudt:RatioScale ;
rdfs:subClassOf qudt:Scale ;
sh:property qudt:OrdinalScale-order .
qudt:OrdinalType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Ordinal Data Type"^^xsd:string ;
dcterms:description """
An ordinal data type is a data type that specifies the properties of values that can easily be put in a one to one correspondence with a subset of the natural numbers.
Examples include boolean, character, and integer data types.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:ScalarDatatype .
qudt:Organization a rdfs:Class,
sh:NodeShape ;
rdfs:label "Organization"^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Concept ;
sh:property qudt:Organization-url .
qudt:PaddingType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Padding type"^^xsd:string ;
dcterms:description """
This describes how unused bits of a field are filled.
Unused bits could be set to one or zero.
A third option is "don't care".
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:EnumeratedValue ;
sh:in ( qudt:PadWithOnes qudt:PadWithZeros qudt:PadWithAny ) .
qudt:ParameterModifiabilityType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Parameter modifiability type"^^xsd:string ;
rdfs:comment "An enumeration of literals that signify whether a parameter is modifiable and if so, by whom."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:EnumeratedValue .
qudt:PartialArray a rdfs:Class,
sh:NodeShape ;
rdfs:label "Partial Array"^^xsd:string ;
dcterms:description """
A partial array is an Array with two attributes that define the starting and ending indices of the elements that are provided.
"""^^rdf:HTML ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Array .
qudt:PhysicalAddress a rdfs:Class,
sh:NodeShape ;
rdfs:label "Physical Address Type"^^xsd:string ;
dcterms:description "A physical address is a pointer to a memory location."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:CompositeDatatype .
qudt:PhysicalConstant a rdfs:Class,
sh:NodeShape ;
rdfs:label "Physical Constant"^^xsd:string ;
dcterms:description """
A Physical constant is a physical quantity that is generally believed to be both universal in nature and constant in time.
It can be contrasted with a mathematical constant, which is a fixed numerical value but does not directly involve any physical measurement.
There are many physical constants in science, some of the most widely recognized being:
the speed of light in vacuum c, Newton's gravitational constant G, Planck's constant h,
the electric permittivity of free space ε0, and the elementary charge e.
Physical constants can take many dimensional forms, or may be dimensionless depending on the system of quantities and units used.
"""^^rdf:HTML ;
qudt:dbpediaMatch "http://dbpedia.org/resource/Physical_constant"^^xsd:anyURI ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:Quantity ;
sh:property qudt:PhysicalConstant-altSymbol,
qudt:PhysicalConstant-applicableSystem,
qudt:PhysicalConstant-applicableUnit,
qudt:PhysicalConstant-dbpediaMatch,
qudt:PhysicalConstant-exactConstant,
qudt:PhysicalConstant-hasDimensionVector,
qudt:PhysicalConstant-iec61360Code,
qudt:PhysicalConstant-isoNormativeReference,
qudt:PhysicalConstant-latexDefinition,
qudt:PhysicalConstant-latexSymbol,
qudt:PhysicalConstant-mathMLdefinition,
qudt:PhysicalConstant-normativeReference,
qudt:PhysicalConstant-siExactMatch,
qudt:PhysicalConstant-symbol,
qudt:PhysicalConstant-ucumCode .
qudt:PlaneAngleUnit a rdfs:Class,
sh:NodeShape ;
rdfs:label "Plane Angle Unit"^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:AngleUnit .
qudt:Polarity a rdfs:Class,
sh:NodeShape ;
rdfs:label "Polarity"^^xsd:string ;
dcterms:description """
A "Tagged Enumeration" with the following instance(s): "negative", "positive".
"""^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:EnumeratedValue .
qudt:PositiveBigIntegerType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Positive Big Integer Type"^^xsd:string ;
dcterms:description "Positive Integers are integers that are either non-zero and non-negative."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:IntegerDatatype,
qudt:UnsignedType ;
sh:disjoint qudt:SignedIntegerType .
qudt:PositiveIntegerType a rdfs:Class,
sh:NodeShape ;
rdfs:label "Positive Integer Type"^^xsd:string ;
dcterms:description "Positive Integers are integers that are either non-zero and non-negative."^^xsd:string ;
rdfs:isDefinedBy ;
rdfs:subClassOf qudt:IntegerDatatype,
qudt:UnsignedType ;
sh:disjoint qudt:SignedIntegerType .
qudt:Prefix a rdfs:Class,
sh:NodeShape ;
rdfs:label "Prefix"^^xsd:string ;
rdfs:isDefinedBy