Abstract: A system includes a memory operable to store visualization rules. The system also includes a processor communicatively coupled to the memory. The processor is operable to receive a visualization request relating to information stored in an ontology. The processor is further operable to parse the visualization request to generate a search query. The processor is further operable to submit the search query to the ontology. The processor is further operable to receive, in response to the query, a result. The result includes a plurality of instances and a plurality of relationships between the instances. The processor is further operable to generate a visual representation of the result using the visualization rules.

Abstract: Methods may display a URI of a resource. Methods may determine the presence of a non-public data element in the URI. Methods may generate a random number in response to the determination of the presence of the non-public data element. Methods may compute a resultant number based on the exclusive or of the random number and the non-public data element. Methods may substitute the resultant number for the non-public data element in the URI. Methods may transmit the URI and the random number to a server. Methods may receive a resource from the server, in response to the transmission of the URI and the random number to the server. Methods may compute the non-public data element using the random number and the resultant number. Methods may substitute the non-public data element for the resultant number in the URI. Methods may re-determine the URI of the resource.

Abstract: Methods may display a URI of a resource. Methods may determine the presence of a non-public data element in the URI. Methods may generate a random number in response to the determination of the presence of the non-public data element. Methods may compute a resultant number based on the exclusive or of the random number and the non-public data element. Methods may substitute the resultant number for the non-public data element in the URI. Methods may transmit the URI and the random number to a server. Methods may receive a resource from the server, in response to the transmission of the URI and the random number to the server. Methods may compute the non-public data element using the random number and the resultant number. Methods may substitute the non-public data element for the resultant number in the URI. Methods may re-determine the URI of the resource.

Abstract: A system includes a memory operable to store a search index. The system also includes a processor communicatively coupled to the memory. The processor is operable to receive a search request relating to information stored in an ontology. The processor is further operable to parse the search request to determine a search type. The processor is further operable to query, based at least in part on the search type, one or more of the search index and the ontology.

Abstract: Methods may display a URI of a resource. Methods may determine the presence of a non-public data element in the URI. Methods may generate a random number in response to the determination of the presence of the non-public data element. Methods may compute a resultant number based on the exclusive or of the random number and the non-public data element. Methods may substitute the resultant number for the non-public data element in the URI. Methods may transmit the URI and the random number to a server. Methods may receive a resource from the server, in response to the transmission of the URI and the random number to the server. Methods may compute the non-public data element using the random number and the resultant number. Methods may substitute the non-public data element for the resultant number in the URI. Methods may re-determine the URI of the resource.

Abstract: Methods may display a URI of a resource. Methods may determine the presence of a non-public data element in the URI. Methods may generate a random number in response to the determination of the presence of the non-public data element. Methods may compute a resultant number based on the exclusive or of the random number and the non-public data element. Methods may substitute the resultant number for the non-public data element in the URI. Methods may transmit the URI and the random number to a server. Methods may receive a resource from the server, in response to the transmission of the URI and the random number to the server. Methods may compute the non-public data element using the random number and the resultant number. Methods may substitute the non-public data element for the resultant number in the URI. Methods may re-determine the URI of the resource.

Abstract: Methods may display a URI of a resource. Methods may determine the presence of a non-public data element in the URI. Methods may generate a random number in response to the determination of the presence of the non-public data element. Methods may compute a resultant number based on the exclusive or of the random number and the non-public data element. Methods may substitute the resultant number for the non-public data element in the URI. Methods may transmit the URI and the random number to a server. Methods may receive a resource from the server, in response to the transmission of the URI and the random number to the server. Methods may compute the non-public data element using the random number and the resultant number. Methods may substitute the non-public data element for the resultant number in the URI. Methods may re-determine the URI of the resource.

Abstract: A system includes a memory operable to store an ontology. The ontology includes a plurality of instances, and a plurality of relationships between the instances. The system also includes a processor communicatively coupled to the memory. The processor is operable to receive a proposed knowledge assertion. The proposed knowledge assertion includes a plurality of classified tokens and a plurality of relationships between the classified tokens. The processor is further operable to determine whether the classified tokens correspond to instances in the ontology. The processor is further operable to validate the proposed knowledge assertion based on the ontology. The processor is further operable to determine whether to update the ontology with the proposed knowledge assertion.

Abstract: Methods may display a URI of a resource. Methods may determine the presence of a non-public data element in the URI. Methods may generate a random number in response to the determination of the presence of the non-public data element. Methods may compute a resultant number based on the exclusive or of the random number and the non-public data element. Methods may substitute the resultant number for the non-public data element in the URI. Methods may transmit the URI and the random number to a server. Methods may receive a resource from the server, in response to the transmission of the URI and the random number to the server. Methods may compute the non-public data element using the random number and the resultant number. Methods may substitute the non-public data element for the resultant number in the URI. Methods may re-determine the URI of the resource.

Abstract: A system includes a memory operable to store one or more classification rules. The system also includes a processor communicatively coupled to the memory. The processor is operable to retrieve one or more data elements from a data source. The processor is further operable to identify a structured data element among the one or more data elements. The processor is further operable to parse the structured data element using one or more filter processes to produce a plurality of tokens. The processor is further operable to classify the plurality of tokens based at least in part on the one or more classification rules and an ontology, which includes a plurality of concepts and a plurality of relationships between the concepts. The processor is further operable to generate a knowledge assertion, which includes the plurality of classified tokens and one or more relationships between the classified tokens.

Abstract: A system includes a memory operable to store visualization rules. The system also includes a processor communicatively coupled to the memory. The processor is operable to receive a visualization request relating to information stored in an ontology. The processor is further operable to parse the visualization request to generate a search query. The processor is further operable to submit the search query to the ontology. The processor is further operable to receive, in response to the query, a result. The result includes a plurality of instances and a plurality of relationships between the instances. The processor is further operable to generate a visual representation of the result using the visualization rules.

Abstract: A system includes a memory operable to store a search index. The system also includes a processor communicatively coupled to the memory. The processor is operable to receive a search request relating to information stored in an ontology. The processor is further operable to parse the search request to determine a search type. The processor is further operable to query, based at least in part on the search type, one or more of the search index and the ontology.

Abstract: A system includes a memory operable to store an ontology and a search index. The system also includes a data agent operable to generate a knowledge assertion by parsing one or more data elements retrieved from a data source. The system also includes a knowledge management engine comprising a processor. The knowledge management engine is operable to validate the knowledge assertion based on the ontology. The knowledge management engine is further operable to determine whether to update the ontology with the knowledge assertion. The system also includes a search engine operable to generate the search index at least in part by indexing data stored in the ontology.

Abstract: A system includes a memory operable to store one or more classification rules. The system also includes a processor communicatively coupled to the memory. The processor is operable to retrieve one or more data elements from a data source. The processor is further operable to identify a structured data element among the one or more data elements. The processor is further operable to parse the structured data element using one or more filter processes to produce a plurality of tokens. The processor is further operable to classify the plurality of tokens based at least in part on the one or more classification rules and an ontology, which includes a plurality of concepts and a plurality of relationships between the concepts. The processor is further operable to generate a knowledge assertion, which includes the plurality of classified tokens and one or more relationships between the classified tokens.

Abstract: A system includes a memory operable to store an ontology. The ontology includes a plurality of instances, and a plurality of relationships between the instances. The system also includes a processor communicatively coupled to the memory. The processor is operable to receive a proposed knowledge assertion. The proposed knowledge assertion includes a plurality of classified tokens and a plurality of relationships between the classified tokens. The processor is further operable to determine whether the classified tokens correspond to instances in the ontology. The processor is further operable to validate the proposed knowledge assertion based on the ontology. The processor is further operable to determine whether to update the ontology with the proposed knowledge assertion.

Abstract: An apparatus for rapidly displacing an object comprises a lever with an object end and a power end. The lever is mounted to a fulcrum between the ends. A driven cam has a trunnion attached proximal to an outer edge thereof, and a tie rod member has an end pivotally attached to the power end of the lever and a second end pivotally attached to the trunnion such that about 180° of rotation of the cam causes about 90° displacement of the power end of said lever. Also, a tension member is coupled to the power end such that restorative force of the tension member contributes to displacement of the power end in one direction. A motor drives rotation of the cam.