Abstract: The invention includes an algorithmic method for dynamically computing complex relationships among objects of an underlying functional system. The invention includes a method to algorithmically determine a set of functional locations in n-dimensional functional space of a set of elements of a functional system by electronically representing a set of data entities in a database system, the database system comprising a logical data model for structuring data sets from which functional information can be derived, using the logical data model to associate a set of characteristics with a reference point in the functional information system, selecting a functional positioning algorithm, and wherein the functional positioning algorithm executes a set of steps that takes as input a set of characteristics and returns as output a set of locations in n-dimensional functional space.

Abstract: The invention includes an algorithmic method for dynamically computing complex relationships among objects of an underlying functional system. The invention includes a method to algorithmically determine a set of functional locations in n-dimensional functional space of a set of elements of a functional system by electronically representing a set of data entities in a database system, the database system comprising a logical data model for structuring data sets from which functional information can be derived, using the logical data model to associate a set of characteristics with a reference point in the functional information system, selecting a functional positioning algorithm, and wherein the functional positioning algorithm executes a set of steps that takes as input a set of characteristics and returns as output a set of locations in n-dimensional functional space.

Abstract: A stratified or segmented composite data structure can be formed by selecting a group of data entities, stratifying or segmenting them according to attributes, and assigning relative weights to the components based on their stratified or segmented positions. The attributes are selected from a universe of possible values. Further positive and negative biases can be applied at any arbitrary point or position, including to individual data entities, groups of arbitrarily selected data entities, or arbitrary positions.

Abstract: A stratified or segmented composite data structure can be formed by selecting a group of data entities, stratifying or segmenting them according to attributes, and assigning relative weights to the components based on their stratified or segmented positions. The attributes are selected from a universe of possible values. Further positive and negative biases can be applied at any arbitrary point or position, including to individual data entities, groups of arbitrarily selected data entities, or arbitrary positions.

Abstract: The invention includes methods for algorithmically modifying a representation of a functional system based on functional trajectory signals by electronically representing a systems syntax, wherein the systems syntax comprises a logical data model, electronically constructing a representation of the functional system comprising a graph, based on an input signal algorithmically computing a functional trajectory that assesses magnitude, distance, or paths among at least two nodes, and updating the functional trajectory representing a set of paths through functional locations over time.

Abstract: The invention includes methods for algorithmically modifying a representation of a functional system based on functional trajectory signals by electronically representing a systems syntax, wherein the systems syntax comprises a logical data model, electronically constructing a representation of the functional system comprising a graph, based on an input signal algorithmically computing a functional trajectory that assesses magnitude, distance, or paths among at least two nodes, and updating the functional trajectory representing a set of paths through functional locations over time.

Abstract: The invention includes an algorithmic method for dynamically computing complex relationships among objects of an underlying functional system. The invention includes a method to algorithmically determine a set of functional locations in n-dimensional functional space of a set of elements of a functional system by electronically representing a set of data entities in a database system, the database system comprising a logical data model for structuring data sets from which functional information can be derived, using the logical data model to associate a set of characteristics with a reference point in the functional information system, selecting a functional positioning algorithm, and wherein the functional positioning algorithm executes a set of steps that takes as input a set of characteristics and returns as output a set of locations in n-dimensional functional space.

Abstract: This application relates generally to defining a domain-specific syntax characterizing a functional information system and performing operations on data entities represented by the domain-specific syntax, including defining a domain-specific syntax, receiving and storing a domain-specific data entity, assigning a syntactic tag to the domain-specific data entity, and electronically storing the tag assigned to the data entity in the electronic data store so that the tag is logically linked to the stored data entity.

Abstract: The invention includes an algorithmic method for dynamically computing complex relationships among objects of an underlying functional system. The invention includes a method to algorithmically determine a set of functional locations in n-dimensional functional space of a set of elements of a functional system by electronically representing a set of data entities in a database system, the database system comprising a logical data model for structuring data sets from which functional information can be derived, using the logical data model to associate a set of characteristics with a reference point in the functional information system, selecting a functional positioning algorithm, and wherein the functional positioning algorithm executes a set of steps that takes as input a set of characteristics and returns as output a set of locations in n-dimensional functional space.

Abstract: This application relates generally to defining a domain-specific syntax characterizing a functional information system and performing operations on data entities represented by the domain-specific syntax, including defining a domain-specific syntax, receiving and storing a domain-specific data entity, assigning a syntactic tag to the domain-specific data entity, and electronically storing the tag assigned to the data entity in the electronic data store so that the tag is logically linked to the stored data entity.

Abstract: A stratified or segmented composite data structure can be formed by selecting a group of data entities, stratifying or segmenting them according to attributes, and assigning relative weights to the components based on their stratified or segmented positions. The attributes are selected from a universe of possible values. Further positive and negative biases can be applied at any arbitrary point or position, including to individual data entities, groups of arbitrarily selected data entities, or arbitrary positions.

Abstract: A stratified or segmented composite data structure can be formed by selecting a group of data entities, stratifying or segmenting them according to attributes, and assigning relative weights to the components based on their stratified or segmented positions. The attributes are selected from a universe of possible values. Further positive and negative biases can be applied at any arbitrary point or position, including to individual data entities, groups of arbitrarily selected data entities, or arbitrary positions.

Abstract: The invention includes an algorithmic method for dynamically computing complex relationships among objects of an underlying functional system. The invention includes a method to algorithmically determine a set of functional locations in n-dimensional functional space of a set of elements of a functional system by electronically representing a set of data entities in a database system, the database system comprising a logical data model for structuring data sets from which functional information can be derived, using the logical data model to associate a set of characteristics with a reference point in the functional information system, selecting a functional positioning algorithm, and wherein the functional positioning algorithm executes a set of steps that takes as input a set of characteristics and returns as output a set of locations in n-dimensional functional space.

Abstract: The invention includes an algorithmic method for dynamically computing complex relationships among objects of an underlying functional system. The invention includes a method to algorithmically determine a set of functional locations in n-dimensional functional space of a set of elements of a functional system by electronically representing a set of data entities in a database system, the database system comprising a logical data model for structuring data sets from which functional information can be derived, using the logical data model to associate a set of characteristics with a reference point in the functional information system, selecting a functional positioning algorithm, and wherein the functional positioning algorithm executes a set of steps that takes as input a set of characteristics and returns as output a set of locations in n-dimensional functional space.

Abstract: A stratified or segmented composite data structure can be formed by selecting a group of data entities, stratifying or segmenting them according to attributes, and assigning relative weights to the components based on their stratified or segmented positions. The attributes are selected from a universe of possible values. Further positive and negative biases can be applied at any arbitrary point or position, including to individual data entities, groups of arbitrarily selected data entities, or arbitrary positions.

Abstract: This application relates generally to defining a domain-specific syntax characterizing a functional information system and performing operations on data entities represented by the domain-specific syntax, including defining a domain-specific syntax, receiving and storing a domain-specific data entity, assigning a syntactic tag to the domain-specific data entity, and electronically storing the tag assigned to the data entity in the electronic data store so that the tag is logically linked to the stored data entity.

Abstract: This application relates generally to defining a domain-specific syntax characterizing a functional information system and performing operations on data entities represented by the domain-specific syntax, including defining a domain-specific syntax, receiving and storing a domain-specific data entity, assigning a syntactic tag to the domain-specific data entity, and electronically storing the tag assigned to the data entity in the electronic data store so that the tag is logically linked to the stored data entity.

Abstract: A stratified or segmented composite data structure can be formed by selecting a group of data entities, stratifying or segmenting them according to attributes, and assigning relative weights to the components based on their stratified or segmented positions. The attributes are selected from a universe of possible values. Further positive and negative biases can be applied at any arbitrary point or position, including to individual data entities, groups of arbitrarily selected data entities, or arbitrary positions.

Abstract: A stratified or segmented composite data structure can be formed by selecting a group of data entities, stratifying or segmenting them according to attributes, and assigning relative weights to the components based on their stratified or segmented positions. The attributes are selected from a universe of possible values. Further positive and negative biases can be applied at any arbitrary point or position, including to individual data entities, groups of arbitrarily selected data entities, or arbitrary positions.

Abstract: The invention includes an algorithmic method for dynamically computing complex relationships among objects of an underlying functional system. The invention includes a method to algorithmically determine a set of functional locations in n-dimensional functional space of a set of elements of a functional system by electronically representing a set of data entities in a database system, the database system comprising a logical data model for structuring data sets from which functional information can be derived, using the logical data model to associate a set of characteristics with a reference point in the functional information system, selecting a functional positioning algorithm, and wherein the functional positioning algorithm executes a set of steps that takes as input a set of characteristics and returns as output a set of locations in n-dimensional functional space.