353 results about "Link relation" patented technology

Systems and methods for publishing a first document object on a network wherein the first document object is not available or not easily accessible by users of the network. One method includes steps for allowing a first user of the network to create a link relationship between the first document object and a second document object that is available to other users of the network, for storing the link relationship in one or more link directories, and for making the first document object accessible to users of the network. The method may also include steps for providing users of the network access to the link relationship and for enabling users of the network to use the link relationship to retrieve the first document object. One method of providing access to a first document object to users of a network uses the link relationship to provide users of the network with information relating the first document object to the second document object accessed by users of the network.

Each network node having at least one destination-oriented link toward a directed acyclic graph (DAG) destination can receive a corresponding set of path performance metrics via the destination-oriented link. The set of path performance metrics, initiated by the DAG destination outputting initial link metrics on each of its source-connecting links, identifies aggregate link metrics for a corresponding path to the DAG destination via the corresponding destination-oriented link. The network node outputs a corresponding updated set of path performance metrics on each of its source-connecting links based on the received set of path performance metrics and the corresponding link metric for the corresponding source-connecting link. Hence, each network node in the DAG can assess the performance of each connected path to the DAG destination, and forward a data packet via a selected destination-oriented link based on the corresponding path performance metrics and forwarding policies for the forwarded data packet.

A method for extracting a relations graph uses an ontology graph in which nodes represent entity classes or concepts and edges represent properties of the classes. A property is associated with a constraint which defines a range of values that can be taken without incurring a cost. Input text in which entity and concept mentions are identified is received. An optimal set of alignments between a subgraph of the ontology graph and the identified mentions is identified by optimizing a function of constraint costs incurred by the alignments and a distance measure computed over the set of alignments. The relations graph is generated, based on the optimal set of alignments. The relations graph represents a linked set of relations instantiating a subgraph of the ontology. The relations graph can include relations involving implicit mentions corresponding to subgraph nodes that are not aligned to any of the concept or entity mentions.

A reception apparatus includes: a reception section adapted to receive an AV content; a trigger extraction section adapted to extract trigger information transmitted together with the AV content for rendering an application program, which is to be executed in a linked relationship with the AV content, operative; a command acquisition section adapted to acquire a command for controlling the operation of the application program in response to the extracted trigger information; and a control section adapted to control the operation of the application program in response to the acquired command.

A method for extracting a relations graph uses an ontology graph in which nodes represent entity classes or concepts and edges represent properties of the classes. A property is associated with a constraint which defines a range of values that can be taken without incurring a cost. Input text in which entity and concept mentions are identified is received. An optimal set of alignments between a subgraph of the ontology graph and the identified mentions is identified by optimizing a function of the costs of the constraints incurred by the alignments and a distance measure computed over the set of alignments. A relations graph is generated, based on the optimal set of alignments. The relations graph represents a linked set of relations instantiating a subgraph of the ontology. The relations graph can include relations involving implicit mentions corresponding to subgraph nodes that are not aligned to any of the concept or entity mentions.

The present invention creates a model that maps object classes in an object-oriented environment to a data source. The model maps the relationship between properties of each object class and data of the data source. The present invention can be used with a data source such as a relational database, user interface, file system, or object-oriented database. An application's object classes and data source schema are designed independent of the other since the model can be used to map one to the other. The model is comprised of entities and attributes. An entity maps to an object class and to at least one table of the DBMS. An entity contains attributes either simple or derived. A simple attribute maps to a DBMS column. A derived attribute is a combination of other attributes and does not directly map to a DBMS column. A relationship creates a link between entities of the model. A relationship can be used to flatten an attribute or flatten a relationship. A flattened attribute is an attribute of one entity that is added to another entity. A flattened relationship is created by the elimination of intermediate relationships between two entities. Relationships can be either unidirectional or bi-directional. A unidirectional relationship has a single traversal path that has a source entity and a destination. A bi-directional relationship has two traversal paths. A reflexive relationship can be created using a single entity. The model is used to synchronize object properties and the data of the data source.

The invention provides a page loading method and device, and relates to the technical field of networks. The page loading method and device are used for solving the problem that in the prior art, the page loading speed is low due to the fact that interface codes required to be loaded are multiple when pages are loaded is solved. According to the scheme, the page loading method comprises the steps of enabling a terminal to obtain interface codes and service codes of display pages according to received first obtaining commands, loading the interface codes and the service codes of the display pages to display the display pages, obtaining relevance interface codes of a relevance page, saving the relevance interface codes in a local device, enabling the relevance page and the display pages to have a link relationship, enabling the terminal to obtain relevance service codes of the relevance interface according to received second obtaining commands, and enabling the terminal to load the relevance service codes and the relevance interface codes saved in the local device to display the relevance interface. The page loading method and device are applied to page loading display.