Abstract: A method, system and computer program product for retrieving information from a relational database using user defined facets in a faceted query may include receiving a faceted query and receiving at least one user defined facet group query. The method may also include filtering out facets in the faceted query that relate to metadata in the relational database. The method may additionally include associating each remaining facet in the faceted query with a corresponding user defined facet group query of the at least one user defined facet group query to provide a set of user defined facet groups. An SQL query may be generated for the faceted query using the set of user defined facet groups. Information from the relational database may be retrieved responsive to the SQL query.

Abstract: A processor implemented method, system and computer program product presents and retrieves data directories. A facet tree is initialized to present facet-converted stored tabular data and dynamically entered user-input data on multiple facet nodes. The facet nodes represent directories for the facet-converted stored tabular data and user-input data. In response to a single facet node from the multiple facet nodes being selected by a user, the single facet node is expanded by presenting, on the facet tree, all other facet nodes from the multiple facet nodes as children of the single facet node that was selected by the user. In response to a child of the single facet node being selected, value directories for the child are retrieved and presented according to a definition of the single facet node that was expanded.

Abstract: A computer implemented method, system and/or computer program product presents data on a user interface. Tabular data for a particular type of data is converted into faceted data. The tabular data is stored according to headings in a table storing the particular type of data, and the faceted data is stored according to facets of the particular type of data. A set of facet names from the faceted data is mapped to a coordinate system on a user interface in order to assign each of the facet names to a predetermined area of a user interface. Facet values are associated with and mapped to the facet names in order to proximately display the facet values to their corresponding facet names according to the coordinate system.

Abstract: A method, system and computer program product to generate selected tabular data from an object relational data model using a faceted interaction interface may include providing a faceted interaction interface to specify a faceted query to provide the selected tabular data from the object relational data model. The faceted query may include at least one facet and at least one facet condition. The method may also include constructing an object relational graph from a plurality of input object tables of the object relational data model. The method may also include selecting each object in the object relational graph which contains at least one facet and identifying each object in the object relational graph on which at least one facet condition applies. The method may additionally include generating at least one object group from the object relational graph.

Abstract: To determine optimal alignment of two molecules, an alignment space of two strings representing element sequences of the molecules is conceived as a grid of cells, where each cell represents alignments between substrings of the two strings. The cells are tested against conditions that are framed, in the context of the (wh)-density global alignment problem. Two such conditions do not require an examination of the actual characters of the strings, and are hence computed with relative speed. A third condition, which involves examination of the characters in the string further prunes the cells that are to be considered.

Abstract: A method, system and computer program product for retrieving information from a relational database using user defined facets in a faceted query may include receiving a faceted query and receiving at least one user defined facet group query. The method may also include filtering out facets in the faceted query that relate to metadata in the relational database. The method may additionally include associating each remaining facet in the faceted query with a corresponding user defined facet group query of the at least one user defined facet group query to provide a set of user defined facet groups. An SQL query may be generated for the faceted query using the set of user defined facet groups Information from the relational database may be retrieved responsive to the SQL query.

Abstract: A method, system and computer program product to generate selected tabular data from an object relational data model using a faceted interaction interface may include providing a faceted interaction interface to specify a faceted query to provide the selected tabular data from the object relational data model. The faceted query may include at least one facet and at least one facet condition. The method may also include constructing an object relational graph from a plurality of input object tables of the object relational data model. The method may also include selecting each object in the object relational graph which contains at least one facet and identifying each object in the object relational graph on which at least one facet condition applies. The method may additionally include generating at least one object group from the object relational graph.

Abstract: The complexities of actions and recipes used in collaborative planning are defined using set theory and an accompanying formalization. The formalizations presented can be used as a basis for making decisions in relation choosing recipes, and other activities concerning collaborative task execution in a multi-agent environment. Introducing the notion of the complexity of a recipe and an action provides a measure of the difficulty of a task, based upon which decisions regarding the use of particular recipes and contractors can be made.

Abstract: A processor implemented method, system and computer program product presents and retrieves data directories. A facet tree is initialized to present facet-converted stored tabular data and dynamically entered user-input data on multiple facet nodes. The facet nodes represent directories for the facet-converted stored tabular data and user-input data. In response to a single facet node from the multiple facet nodes being selected by a user, the single facet node is expanded by presenting, on the facet tree, all other facet nodes from the multiple facet nodes as children of the single facet node that was selected by the user. In response to a child of the single facet node being selected, value directories for the child are retrieved and presented according to a definition of the single facet node that was expanded.

Abstract: A computer implemented method, system and/or computer program product presents data on a user interface. Tabular data for a particular type of data is converted into faceted data. The tabular data is stored according to headings in a table storing the particular type of data, and the faceted data is stored according to facets of the particular type of data. A set of facet names from the faceted data is mapped to a coordinate system on a user interface in order to assign each of the facet names to a predetermined area of a user interface. Facet values are associated with and mapped to the facet names in order to proximately display the facet values to their corresponding facet names according to the coordinate system.

Abstract: Provided are methods, apparatus or computer programs for collaborative problem solving and/or automated discovery and dynamic integration of capabilities in a distributed, multidisciplinary work environment. A set of software-implemented agents distributed across a network are used to identify agents and resources on the network that are capable of performing required tasks. The agents collaborate to generate a plan comprising a task allocation and task execution sequence in which tasks are allocated to selected ones of the agents and identified resources, and then the selected agents and resources execute the allocated tasks in accordance with the generated plan. Services (such as processing functions and knowledge) provided by hardware and software resources in a network are represented as ‘capabilities’ of an associated agent. The functions implemented by each agent are also represented as ‘capabilities’.

Abstract: Sprite identification in animated sequences is achieved by performing three separate but related procedures, namely (i) identification of the sprite, (ii) identification of the background and (iii) identification of the identified sprite's translation path. By analyzing a sequence of frames, sprite definition is first established. Then, using the definition of the sprite, a determination is made of the background image and translation path taken. This analysis allows the animated sequence to be compressed in a format in which the background and the sprites are separately identified.

Abstract: The complexities of actions and recipes used in collaborative planning are defined using set theory and an accompanying formalization. The formalizations presented can be used as a basis for making decisions in relation choosing recipes, and other activities concerning collaborative task execution in a multi-agent environment. Introducing the notion of the complexity of a recipe and an action provides a measure of the difficulty of a task, based upon which decisions regarding the use of particular recipes and contractors can be made.

Abstract: The complexities of actions and recipes used in collaborative planning are defined using set theory and an accompanying formalization. The formalizations presented can be used as a basis for making decisions in relation choosing recipes, and other activities concerning collaborative task execution in a multi-agent environment. Introducing the notion of the complexity of a recipe and an action provides a measure of the difficulty of a task, based upon which decisions regarding the use of particular recipes and contractors can be made.

Abstract: A method for determining Teiresias patterns. Provided as input to the method are: a set S?0 of n sequences denoted as S1, S2, . . . Sn; positive integers L, W, and K; and Teiresias patterns P?0 consisting of all <L, W, K> patterns for the set S?0. Each sequence of the n sequences consists of characters from an alphabet. A sequence index i equals 1. A sequence Sn+1 is supplied to form a set S?i consisting of S?i?1?Sn+1, where Sn+1 consists of characters from the alphabet. The Teiresias patterns P?i are determined by performing an algorithm that utilizes S?i?1, L, W, K, P?i?1, and Sn+i as input. The Teiresias patterns P?i consist of all <L, W, K> patterns for the set S?i.

Abstract: Sprite identification in animated sequences is achieved by performing three separate but related procedures, namely (i) identification of the sprite, (ii) identification of the background and (iii) identification of the identified sprite's translation path. By analyzing a sequence of frames, sprite definition is first established. Then, using the definition of the sprite, a determination is made of the background image and translation path taken. This analysis allows the animated sequence to be compressed in a format in which the background and the sprites are separately identified.

Abstract: A method, system, software tool and computer program product for different modeling environments is described. A metamodel representation, termed a “definition graph” is configured as a directed weighted multi-graph representation of ordered pairs, being node and edge pairs. Each node and edge has an associated weight and attributes. The definition graph is validated. A user-generated model is then defined, and checked for compatibility with a validated metamodel. This is achieved by extracting a template graph from the instance graph of the user model as the basis for the comparison.

Abstract: This invention provides a method, system and computer program product for reducing transmission time and improving network utilization while broadcasting over a filly connected network, wherein it comprises simultaneous transmission of individual sequential packets by the broadcaster to each recipient in a round robin sequence until all the packets have been transmitted, retransmission of received packets by each recipients to each other recipient, and reassembly of received packets at each recipient in the original sequence of said transmission. The said transmission and said retransmission are overlapped in time.

Abstract: Sprite identification in animated sequences is achieved by performing three separate but related procedures, namely (i) identification of the sprite, (ii) identification of the background and (iii) identification of the identified sprite's translation path. By analysing a sequence of frames, sprite definition is first established. Then, using the definition of the sprite, a determination is made of the background image and translation path taken. This analysis allows the animated sequence to be compressed in a format in which the background and the sprites are separately identified.

Abstract: This invention provides a method, system and computer program product for reducing transmission time and improving network utilization while broadcasting over a filly connected network, wherein it comprises simultaneous transmission of individual sequential packets by the broadcaster to each recipient in a round robin sequence until all the packets have been transmitted, retransmission of received packets by each recipients to each other recipient, and reassembly of received packets at each recipient in the original sequence of said transmission. The said transmission and said retransmission are overlapped in time.