70 results about "Descendent" patented technology

A system and method are disclosed for implementing dynamic set operations on data stored in a sorted array using a hybrid red-black binary search tree as a data structure. More particularly, the subject invention facilitates the implementation of a binary search to access data items stored in a sorted array by position, rather than by key value. This is accomplished by generating a balanced red-black binary search tree for a sorted array of data items wherein the information stored at each node of the tree includes: a key value; a color; a left pointer to indicate the presence of a child to the left of the node; a right pointer to indicate the presence of a child to the right of the node; a count of descendents along a branch to the left of the node; and a count of descendants along a branch to the right of the node.

A method of electrochemical deposition solar cell metallic electrode includes the following steps: the cathodic surface of the solar cell contacts with the electrolyte solution; the anodic of the solar cell connects with the solid metal; the main light surface of the solar cell execute light irradiation; the metallic ion in the electrolyte solution creates metal and deposits on the cathode surface of the solar cell, after accepting the electric produced by the cathode surface of the solar cell, meanwhile the solid metal creates metallic ion into electrolyte solution, after providing electric for anodic of the solar cell. The method resolves a battery efficiency descendent problem caused by the short circuit during depositing metal on anodic, at the same time breakage solar cell piece by any electroplating rack and the inhomogeneous probable by deposited metal are avoided, and can control the electrochemical reaction velocity effectively, assure the deposited metallic homogeneity, especially for producing a solar cell with selective diffusion structure.

Disclosed is an improved approach for managing, tracking, and querying hierarchical data in layouts. According to some aspects, hierarchical grids are employed utilizing a scheme that organizes physical objects into a set of gradually refined grids that avoids the need to maintain duplicates while enhancing the desirable characteristics of existing schemes, including fast query times, fast data structure initialization and reduced memory footprint. Each grid-cell may be further partitioned into sub-containers to more efficiently provide space pruning during query operations. According to one approach, structures maintained to track existence of objects in a descendent hierarchy.

A method for rendering a graphical user interface (GUI), comprising providing for the representation of the GUI as a set of controls wherein the controls are organized in a logical hierarchy and wherein each one of the controls has an entitlement that can be used to determine whether or not the control is visible when rendered, traversing the representation, wherein the traversing comprises associating a theme with a first control in the set of controls, rendering the first control according to the theme, rendering any descendents of the first control according to the theme, wherein any descendents of the first control can override the theme, and wherein one of the set of controls can communicate with another of the set of controls.

A topology discovery process is used to discover all of the links in an ad hoc network and thereby ascertain the topology of the entire network. One of the nodes of the network, referred to as the coordinator, receives the topology information which can then be used to, for example, distribute a routing table to each other node of the network. The process has a Diffusion phase in which a k-resilient mesh, k>1, is created by propagating a topology request message through the network. Through this process, the nodes obtain information from which they are able to discern their local neighbor information. In a subsequent, Gathering phase, the local neighbor information is reported upstream from a node to its parents in the mesh and thence to the parents' parents and so forth back to the coordinator. The robustness of the Diffusion phase is enhanced by allowing a node to have more than one parent as well as by a number of techniques, including use of a so-called diffusion acknowledgement message. The robustness of the Gathering phase is enhanced by a number of techniques including the use of timeouts that ensure that a node will report its neighbor information upstream even if it never receives neighbor information from one or more downstream neighbors and the use of a panic mode that enhances the probability that a node will get its neighbor information, and its descendents' neighbor information, reported upstream even if that node has lost connectivity with all of its parents.

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.

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.

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 be 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.