Abstract:
A grammar for mapping a first grouping of XML data into a second grouping of XML data and a method for accomplishing same to incorporate the first grouping into the second grouping. The grammar includes a first rule for computing a first child element attribute and a second rule for computing a second parent element attribute. The first rule and second rule vary according to a production of an element type of the first grouping. The element types include PCDATA, disjunctive, conjunctive and Kleene star, each having a unique rule set for defining inherited and synthesized attributes of the parent and child elements. The method includes the step of executing a mapping of a first grouping having at least one parent element and a set of corresponding child elements into a second grouping in accordance with the grammar rules based on the production of the element type.
Abstract:
Methods and apparatus are provided for propagating functional dependencies with conditions. Propagation covers are computed using an SPC view of a dataset, wherein the SPC view comprises selection, projection and Cartesian product operations. Selection operations are processed to extract equivalence classes. Cartesian product operations are processed to obtain a renamed set of the plurality of conditional functional dependencies, that have attributes appearing in the SPC view. Domain constraints from the equivalence classes are applied to the renamed set to remove attributes not in the SPC view. Projection operations are processed using a reduction by resolution procedure to identify inferences that can be propagated to the SPC view from the conditional functional dependencies having attributes that do not appear in the SPC view. Domain constraints of the equivalence classes are converted to conditional functional dependencies; and a minimal cover of the SPC view is determined.
Abstract:
A grammar for mapping a first grouping of XML data into a second grouping of XML data and a method for accomplishing same to incorporate the first grouping into the second grouping. The grammar includes a first rule for computing a first child element attribute and a second rule for computing a second parent element attribute. The first rule and second rule vary according to a production of an element type of the first grouping. The element types include PCDATA, disjunctive, conjunctive and Kleene star, each having a unique rule set for defining inherited and synthesized attributes of the parent and child elements. The method includes the step of executing a mapping of a first grouping having at least one parent element and a set of corresponding child elements into a second grouping in accordance with the grammar rules based on the production of the element type.
Abstract:
Methods and apparatus are provided for propagating functional dependencies with conditions. Propagation covers are computed using an SPC view of a dataset, wherein the SPC view comprises selection, projection and Cartesian product operations. Selection operations are processed to extract equivalence classes. Cartesian product operations are processed to obtain a renamed set of the plurality of conditional functional dependencies, that have attributes appearing in the SPC view. Domain constraints from the equivalence classes are applied to the renamed set to remove attributes not in the SPC view. Projection operations are processed using a reduction by resolution procedure to identify inferences that can be propagated to the SPC view from the conditional functional dependencies having attributes that do not appear in the SPC view. Domain constraints of the equivalence classes are converted to conditional functional dependencies; and a minimal cover of the SPC view is determined.
Abstract:
Methods and apparatus are provided for discovering minimal conditional functional dependencies (CFDs). CFDs extend functional dependencies by supporting patterns of semantically related constants, and can be used as rules for cleaning relational data. A disclosed CFDMiner algorithm, based on techniques for mining closed itemsets, discovers constant minimal CFDs. A disclosed CTANE algorithm discovers general minimal CFDs based on the levelwise approach. A disclosed FastCFD algorithm discovers general minimal CFDs based on a depth-first search strategy, and an optimization technique via closed-itemset mining to reduce search space.
Abstract:
A processing device of an information processing system is operative to obtain a plurality of records, documents, web pages or other data objects, and to construct a binary tree using a bipartition procedure in which subsets of the data objects are associated with respective nodes of the tree. Evaluation of a designated modularity for a given one of the nodes of the tree is used as a stopping criterion to prevent further partitioning of that node and to indicate designation of that node as a leaf node of the tree. The resulting leaf nodes of the tree provide a non-overlapping partitioning of the plurality of data objects. The processing device is further operative to perform a neighborhood search on the tree to identify pairs of the plurality of data objects that match the same entity, and to store an indication of the matching pairs of data objects.
Abstract:
An optimized gateway selection process of the present invention is based on a universal mobility manager (UMM), a component for inter-technology location management. The UMM is capable of holding location information for diverse cellular networks, as well as for Internet telephony systems. For cellular networks, UMM acts as a traditional HLR; for an Internet telephony network, it acts as the entities that are responsible for user/terminal registration (registrar in SIP, gatekeeper in H.323) and address resolution (proxy server in SIP, gatekeeper in H.323). An optimal gateway selection is possible based on location related information provided by the UMM which had not previously been available. Utilizing the newly available information enables a gateway to be selected which may, for example, enable the circuit switched portion of a call to now be minimized.
Abstract:
An optimized gateway selection process of the present invention is based on a universal mobility manager (UMM), a component for inter-technology location management. The UMM is capable of holding location information for diverse cellular networks, as well as for Internet telephony systems. For cellular networks, UMM acts as a traditional HLR; for an Internet telephony network, it acts as the entities that are responsible for user/terminal registration (registrar in SIP, gatekeeper in H.323) and address resolution (proxy server in SIP, gatekeeper in H.323). An optimal gateway selection is possible based on location related information provided by the UMM which had not previously been available. Utilizing the newly available information enables a gateway to be selected which may, for example, enable the circuit switched portion of a call to now be minimized.
Abstract:
Systems, methods, and computer-readable media are disclosed for calculating a housing volatility index. An exemplary embodiment includes accessing stored property value data reflecting first values of real estate properties during a first time period and second values of the real estate properties during a second time period. The second time period may be subsequent to the first time period. The property value data may be processed to identify the first values and the second values, and time intervals between dates of the first values and dates of the second values may be calculated. Value changes of the real estate properties over the time intervals may also be calculated, based on the first values and the second values. A volatility measure for the real estate properties may be determined based on the value changes of the real estate properties over the time intervals, and the volatility measure may be output to a user.
Abstract:
A processing device of an information processing system is operative to obtain a plurality of records, documents, web pages or other data objects, and to construct a binary tree using a bipartition procedure in which subsets of the data objects are associated with respective nodes of the tree. Evaluation of a designated modularity for a given one of the nodes of the tree is used as a stopping criterion to prevent further partitioning of that node and to indicate designation of that node as a leaf node of the tree. The resulting leaf nodes of the tree provide a non-overlapping partitioning of the plurality of data objects. The processing device is further operative to perform a neighborhood search on the tree to identify pairs of the plurality of data objects that match the same entity, and to store an indication of the matching pairs of data objects.