69 results about "Descendent" patented technology

Methods, programs (120) and apparatus (100) are disclosed for accessing and heterogenous data sources (150-153) and presenting information obtained therefrom. Specifically, the data sources may have hierarchical data, which may be presented by identifying a context data node from the data, the context data node having one or more descendent data nodes. At least one data pattern is determined in the descendent data nodes. At least one display type is assigned to the current context data node on the basis of the at least one data pattern. Thereafter, the method presents at least a subset of the descendent data nodes according to one of the assigned display types. Also disclosed is a method of browsing an hierarchically-represented data source. A user operation is interpreted to identify a context data node from the data source, the context data node having one or more descendent data nodes. At least one data pattern in the descendent data nodes is then determined and at least one display type is assigned to the current context data node on the basis of the at least one data pattern. A subset of the descendent data nodes is then presented according to one of the assigned display types, the subset including at least one hyperlink (3401,3402) having as its target a descendant data node of the current context data node. A further user operation is then interpreted to select the at least one hyperlink, the selection resulting in the current context data node being replaced with the data node corresponding to the target of the selected hyperlink. These steps may be repeated until no further hyperlinks to descendent data nodes are included in the subset. Other methods associated with access and presentation are also disclosed.

Techniques for managing XML data in an SQL compliant DBMS include receiving an SQL statement. The SQL statement includes a particular operator that operates on a first instance of XML type that represents a first set of XML elements. During execution of the SQL statement, the particular operator is evaluated by generating an ordered collection of instances of XML type. Each different instance in the ordered collection is based on a different XML element from the first set; and there is an instance in the ordered collection for every XML element from either the first set or from the first set and its descendents. When descendents are included, each entry in the ordered collection indicates a level in the XML tree. In another aspect, an aggregate operator in the SQL statement operates on a collection of instances, with associated levels, to generate a single instance of XML type.

The system has a collection of a plurality of objects. Each object defines a node in a k-partite graph, such that, the nodes can e divided into a number of mutually exclusive sets such that all of the nodes are in exactly one of the sets; further edges occur only between nodes in different sets; The system also has a simplification process that aggregates one or more of the nodes into one or more categories and identifies a category node corresponding to each category. The category node inherits the mode and the edges of all the nodes in the respective category. Further, the system contains Directed Acyclic Graphs Indices (DAGIs) whose nodes may have a 1-1 mapping with the nodes in the k-partite graph. These indices can be used to aggregate and hide nodes in the k-partite graph. Aggregation occurs by selecting one or more non-leaf nodes in the DAGI and aggregating all descendent nodes. Hiding occurs by selecting some set of DAGI nodes, thus selecting some corresponding set of nodes in the k-partite graph, and requesting this set of nodes be hidden which effectively removes them from further consideration until they are restored by explicit request.

An XML matching engine and method are provided, where policy rules expressed using XPath/XQuery policies are matched to streaming XML documents. Two distinct data structures are used: a combined modified DFA data structure for storing simple XPath queries (no wildcards or descendents) and a modified AFilter structure for storing complex queries (with wildcards or/and descendents). As the matching engine receives XML tags from XML parser, matching is performed in both structures in parallel.

Systems, methods, computer program product embodiments are provided for executing a function in a path-based query when extracting data from a markup language document for return as a relational table, the markup language document organized hierarchically into nodes. An embodiment includes receiving a path-based query including a complex row pattern and column definition, forming multiple sets of nodes based on a simplified row pattern and column definition, determining ancestor-descendent pairings for the nodes in the column definition set, and utilizing the ancestor-descendent pairings with the simplified row pattern to return a relational table satisfying the complex path-based query. An embodiment further includes extensible markup language (XML) as the markup language, and an XPath query expression as the complex path-based query.

A receiver employs low-rate processing to synthesize the effect of high-rate interference in a received multi-rate signal. Each high-rate subchannel is analyzed on its low-rate descendents to produce symbol estimates for each low-rate symbol interval. The symbol estimates are applied to low-rate descendent subchannels, which are then combined to synthesize the effects of the high-rate interference. An interference canceller processes the synthesized interference with the received signal for producing an interference-cancelled signal. Alternatively, analogous steps may be applied at high-rate to analyze, synthesize, and cancel the effects of low-rate interference in a multi-rate signal.

The memorial with cremains provides a transparent or translucent glass memorial containing the cremains of the deceased with an article(s) of significance to the deceased and/or family and descendents. A method of forming the memorial comprises melting the glass to at least a plastic consistency, mixing the cremains therein, adding the article(s) of significance either in its entirety or disintegrated, optionally adding an inscribed placard within the molten glass, forming the glass to the desired shape, cooling the glass, and adding an inscription directly to the glass or separate placard if not included within the glass earlier. The glass may comprise or contain glass from another article favored by the deceased, e.g., a wine glass or bottle from a favorite beverage, etc. The article included therein may survive in its solid state or may be melted and fused with the glass, depending upon its melting point relative to the glass.

When a special relationship is present between IC card owners, authority of one of the IC card owners cannot be easily given to the other owner of the IC card. However, an IC card of a second owner can issue a public key certificate of the IC card of a first owner so that the IC card of the first owner can be recognized as a child card of the IC card of the second owner. Thus, the first generation card authenticated by a route authentication station is set as an ancestor which can generate a descendent card which receives the authentication. By checking which parent card has issued the public key authentication owned by the child card, it is possible to given the authority of the parent card to the child card.

The invention provides methods for identifying related data in a directed graph (e.g., an RDF data set). A “first” step—though the steps are not necessarily executed in sequential order—includes identifying (or marking) as related data expressly satisfying the criteria. A “second” step includes identifying as related ancestors of any data identified as related, e.g., in the first step, unless that ancestor conflicts with the criteria. A “third” step of the method is identifying descendents of any data identified, e.g., in the prior steps, unless that descendent conflicts with the criteria or has a certain relationship with the ancestor from which it descends. The methods generates, e.g., as output, an indication of each of the nodes identified as related in the three steps.

A method of rendering a graphical image described by an expression tree is disclosed. The expression tree has one or more parent nodes and one or more leaf nodes, each parent node representing a graphical operator and having branches to respective descendent nodes. Each of the leaf node represents a graphic object. The method determines regions of one or more pixel locations in an output space of the image, with each region corresponding to a combination in the image of one or more the graphical objects. Next, for each said region, an activity state of corresponding parent nodes is determined using a predefined function for each corresponding operator. The method then generates, in parallel (1098), for each active one of the operators, compositing instructions and pixel generation instructions. The compositing instructions are stored in an operator queue and pixel colors are generated using the pixel generation instructions, the pixel colors being buffered in an operand queue (1300). Lastly, the generated pixel colors are composited (1400), for each pixel in the region, using the operators defined in the operator queue, to output (800) a composited pixel value for each pixel in the region. Other processing operations including operator reduction, flat color bypass, and operand comparison are also discussed.

A mechanism for dynamically resolving polymorphic type dependencies between parallel heterogenous run-time environments is provided. The mechanism comprises a registry of class types for software objects, in which each class type is linked to a hierarchy of bindings rooted at the binding for that class type with descendent bindings in the hierarchy relating to more specific sub-classes. At run-time a pointer to an object is received, and the received static type of that pointer can be looked up in the registry to determine the location in the hierarchy of bindings at which to make an initial query for the most specific sub-class compatible with the dynamic type of the object. Subsequently, beginning at the determined location in the hierarchy of bindings, the most specific sub-class compatible with the dynamic type of the object is determined, and a run-time binding based on the most specific sub-class identified can be selected.

A process for identifying potentially harmful malware, comprises the steps of: a) identifying an executable that is about to run; b) providing a monitoring agent that monitors all threads that are descendent of a thread initiated by the process of said executable; and c) configuring said monitoring agent to conclude that a high probability of malware presence exists, if one of said descendent threads reaches a target process in which suspicious patches are created.

A system for bathing, showering, drying, massaging and sauna, which includes a container having a vertical arrangement, a main body, a bottom surface, a water-drainage orifice and a door for allowing entrance of a user in a wheelchair. The bottom surface is at the same level as the door in an open position. The bottom surface has a small descendent inclination towards the water-drainage orifice. The door has an edge acting as slight connecting ramp with a floor of a room in which the system is placed. The door has pawls or iron straps, which lodge and are retained in recesses formed the main body for fastening the door, and the door has magnets for maintaining the door in a closed position.

Disclosed are methods for identifying topical experts from a seed set of experts by identifying “second tier” influencers for the topic. New concepts detected among a pool of experts and second tier influencers are monitored among the general population and their significance evaluated. Reports may be generated for these detected trends. Trends in social media for a concept represented in a taxonomy may be detected by monitoring content for descendent nodes for the concept. Correlations between social media activity with respect to the concept and sales of products corresponding to the concept may be made and sales predicted for the same or different products that correspond to descendants of the concept in the taxonomy.

A system that persistently maintains and exposes one or more previous object hierarchies to which an object belonged across one or more hierarchy destroying operations, such as operations that delete parent objects, add parent objects subsequent to addition of their descendent objects, forward objects to or from the hierarchy, and/or modify hierarchy determining rules. A user interface object allows user access to one or more persistent hierarchies for the corresponding object. A hierarchy list or the like allows a user to select a desired one of the persistent hierarchies. A persistent hierarchy can be accessed in the disclosed system through a display object associated with any object within the hierarchy, including the root, leaves, and any intervening objects. When objects are deleted, “ghost” objects are maintained and displayed to the user in the hierarchical positions of the deleted objects when a persistent hierarchy is displayed.

A user interface presents views of entities and their attributes relative to any subset of associated parameters. A view may present views of entities as a function of one or more parameters. A selection of a subset of entities in one view with respect to parameters may be presented in another view with respect to different parameters. Entities may be manipulated in any supplemental view to change their values or their parameter associations. A view may present components and parameters associated with layers or any subset of layers and/or after layer compositing. A view can include resolved values of components and their attributes. A supplemental view may include visual indicators to indicate the layer or other parameter defining its resolved value. Hierarchical relationships may be presented in views, with ancestor entities expanded within a view to show its descendent entities or collapsed to hide its descendent entities.

A method of administration in a JMX environment of software systems to be administered, represented by first respective MBeans, and at least one administration application, in which the administration acts produce the exposure of MBeans in at least one MBeanServer server, characterized in that it is implemented by means of a mediation device and that it comprises the following steps: a tree structure of administration components representing first MBeans, in which each component is identified by a unique name, is constructed following the receipt of the name of an administration component, the mediation device dispatches a determined command to the administration component thus identified which, if it represents an MBean, exposes in the MBeanServer this Mbean; when the administration component possesses descendent administration components in the hierarchical structure, the mediation device propagates the command to the descendents.

An XML wrapper queries an XML document in an on-the-fly manner so that only parent nodes in the document that satisfy the query are extracted and then unnested. The parent nodes and associated descendent nodes are located using XPath expressions contained as options in data definition language (DDL) statements. The parent nodes satisfying the query and associated descendent nodes are extracted and stored outside of a database according to a relational schema. The wrapper facilitates applications that use convention SQL queries and views to operate on that information stored according to the relational schema. The wrapper also responds to query optimizer requests for costs associated with queries against external data sources associated with the wrapper.

Optical bypass circuits are selected and created with a desired amount of traffic on each circuit to offload from the IP routers, the maximum possible amount of traffic. In a first phase, each node in a network independently determines the maximum number of optical bypass circuits, configured to their maximum capacity, to as many destinations, that could possibly originate at that node. The determination is made by aggregating traffic from a given traffic matrix. The optical bypass circuit transports traffic that originates at the node plus transient traffic that the node receives from other nodes. In the second phase, the node will eliminate an optical bypass circuit found in the first phase if any of its parent nodes created a necessarily longer optical bypass circuit to the same destination. In addition, if a descendent node has more aggregate traffic to fill more bypass circuits than the parent node, then the extra optical bypass circuits from the descendent node are also created.