520 results about "Tree network" patented technology

A system and method enrolls a speaker with an enrollment utterance and authenticates a user with a biometric analysis of an authentication utterance, without the need for a PIN (Personal Identification Number). During authentication, the system uses the same authentication utterance to identify who a speaker claims to be with speaker recognition, and verify whether is the speaker is actually the claimed person. Thus, it is not necessary for the speaker to identify biometric data using a PIN. The biometric analysis includes a neural tree network to determine unique aspects of the authentication utterances for comparison to the enrollment authentication. The biometric analysis leverages a statistical analysis using Hidden Markov Models to before authorizing the speaker.

A system and method for facilitating welding system diagnostics is provided. The invention includes a welder, a local system, a remote system, and / or an alarm component. The invention further provides for receiving sensor input(s), performing test sequence(s) based, at least in part, upon the sensor input(s) and / or performing internal diagnostics. The invention further provides for determining a health status of the welder and communicating the health status of the welder to the local system, the remote system and / or the alarm component. The health status of the welder can include welder alarm(s) and / or fault(s). Information regarding the health status of the welder can be sent by telephone, voicemail, e-mail and / or beeper. The welder can communicate with the local system and / or remote system to schedule maintenance. The invention further provides for a expert component to facilitate welding diagnostics based, at least in part, upon the health status of the welder, welder data, an expert data store, a local service support data store, a remote expert data store and / or a remote service support data store. The expert component can employ various artificial intelligence technique(s) (e.g., Bayesian model, probability tree network, fuzzy logic and / or neural network) to facilitate welding diagnostics based, at least in part, upon the health status received from the welder. The expert component can adaptively modify its modeling technique(s) based upon historical success (e.g., learn from success of previous welding diagnostics). The invention further provides for the welder, local system and / or remote system to initiate corrective action, at least temporarily, based, at least in part, upon the health status of the welder.

A method and system of data backup for a computer system is disclosed. Full and incremental backups of data stored to a first storage device coupled to the computer system are stored to a backup storage device coupled to the computer system. The backup storage device may be remotely located and coupled via a network. Data representative of the relationship of each incremental backup to its respective parent backup is stored in a dependency data structure, preferably a tree-like structure. Different types of incremental backups may be performed to provide different data granularity. When two or more storage media are used in a rotational manner, each medium always contains a complete backup. The backup storage device is automatically managed by paring at least one of a full and incremental backup at the backup storage device automatically in accordance with a plan. The plan is preferably configured to manage an amount of available storage space at the backup storage device. When restoring data from a backup, data to be restored that is stored in a parent backup is automatically located and restored. Stored backups may be encrypted and decrypted when restored.

A hierarchical wireless network is provided with a mesh backbone network portion and a switching tree network portion. The mesh backbone network portion includes first tier nodes each having at least one wireless link to another first tier node. The first tier nodes execute a link-state protocol for routing packets. The switching tree network portion includes second tier nodes each having a single wireless link to one first tier node and at least one wireless link to one third tier node, and third tier nodes each having a single wireless link to one second tier node. The second tier and the third tier nodes execute switching rules for switching packets.

A system and method are provided for delivery of broadcast data over an augmented tree network that includes a content server, a tree server, an augmentation server and at least one node. The content server streams a fraction of the broadcast data to the tree server, and streams a complement to the fraction of the broadcast data to the augmentation server. A node connects to the tree server, thereby receiving the fraction of the broadcast data, the fraction having a positive value less than one. The node connects to the augmentation server, thereby receiving the complement to the fraction of the broadcast data from the augmentation server. The node assembles the fraction of the broadcast data with the complement to the fraction of the broadcast data to reassemble the broadcast data, whereby broadcast data is delivered to the node.

A method and an apparatus for selecting test sequences that comprises preparing tree-structured state transition data associated with state transition weights from state transition data, extracting test sequences from the tree-structured state transition data, and repeating processes of determining averaged weight for each of the test sequences, selecting a test sequence by which the average is maximum, and decrementing the weights contained in the selected test sequence by one unit to prioritize the test sequences.

A system and method is provided for broadcasting content in two streams to a plurality of nodes using two tree networks. The two tree networks have a plurality of nodes where each node is a repeater node or a leaf node. The first data stream is retransmitted down the first tree network by each repeater node in the first tree network. The second data stream is retransmitted down the second tree network by each repeater node in the second tree network. At least one of the nodes acting as a repeater in the first tree network acts as a leaf node in the second tree network, and at least one of the nodes acting as a leaf in the first tree network acts as a repeater node in the second tree network.

The invention provides for a remote patient management system comprising a computing device. The computing device comprises a processor and a computer readable storage medium. The computer readable storage medium contains instructions that when executed cause the processor to perform a method of generating a teleconsultation report. The method comprises the step of recording a teleconsultation between a health professional and a patient using a microphone. The method further comprises the step of converting the recording of the teleconsultation into a text file. The method further comprises the step of parsing the text file into tokens. The method further comprises the step of filling a teleconsultation parse tree using the tokens. The teleconsultation parse tree has nodes arranged in a tree like structure. The method further comprises the step of generate the teleconsultation report using the teleconsultation parse tree.

A communications network is provided with a self-healing topological architecture. Each node in the network detects continuously transmitted beacon packets that are propagated through the network at regular intervals by a root node. Upon failure to detect a new beacon packet after a predetermined time from a parent node, a network node determines a network isolation condition and searches for another node that is still actively connected in the network. Algorithms are provided for registering with and identifying active parent node candidates during a network failure so as to prevent the creation of network loops.

The invention discloses a clock synchronizing method for a wireless sensor network. The clock synchronizing method for the wireless sensor network comprises the following steps: firstly, constructing the wireless sensor network into a tree network topology, using the time value of a root node as a reference time, and synchronizing the root node and a base station of the network through pair-wise algorithm; then, broadcasting a synchronous data packet containing time information of the root node along each subtree by the root node, and synchronizing a father node of each subtree and a child node thereof through the pair-wise algorithm; and finally synchronizing layers of each subtree till each node of the tree network has a unified time signal. Based on the technical proposal, the clock synchronizing method for the wireless sensor network can improve the transmission capacity of the data packet and effectively improve the synchronizing precision.

The invention discloses a method, network equipment and a system for data transmission, which can be applied to star and tree networks and dual-homing looped networks. The method comprises that: in a downlink direction, a master node transmits a downlink service signal to a slave node in a mode of optical layer broadcast, wherein a continuous optical signal which carries the downlink service signal also comprises an uplink bandwidth map; the slave node and the master node are connected by an OB (Optical Burst optical burst) channel; and the slave node adapts an uplink service signal to different OBUs for performing photoelectric conversion and transmitting a burst optical signal in a burst mode according to the number and serial number of the OBUs distributed to nodes in the uplink bandwidth map transmitted by the master node. The method, equipment and system easily realize burst amplification and high-speed burst receiving so as to better meet the requirements on long distance, large bandwidth and high transmission quality.

A mapping mechanism for a primary B+tree in a database management system. The primary B+tree includes a plurality of rows. The mapping mechanism includes introducing a mapping table that includes a plurality of rows, including a row for each row of the primary B+tree, and that stores the logical identifier of the corresponding primary B+tree row. In addition, reverse mapping is provided by augmenting a primary B+tree to include in each primary B+tree row a physical row identifier of the corresponding mapping table row. An auxiliary structure created on a primary B+tree can make use of the proposed mapping mechanism. Specifically, the auxiliary structures refers to primary B+tree rows indirectly by storing the physical row identifier of the corresponding mapping table row.

The invention discloses a hierarchical landmark identification method integrating global visual characteristics and local visual characteristics. High-dimensional characteristic vectors of landmark images are obtained and are used as the global visual characteristics of the landmark images; the local visual characteristics of the landmark images are obtained; the global visual characteristics andthe local visual characteristics are stored by adopting a hierarchical tree-shaped structure, and a visual characteristic set is obtained; each image is characterized according to the visual characteristic set; the images are pre-retrieved according to the global visual characteristics xi, and first candidate images are obtained; the first candidate images are further retrieved according to statistical characteristics vi of local outstanding points, and second candidate images are obtained; and the second candidate images are further retrieved according to a characteristic set yi of the localoutstanding points, and final candidate images are obtained and are fed back to a user. By adopting the hierarchical landmark identification method, the images to be identified can be rapidly and accurately retrieved, so the requirement of the user for convenient information acquisition is satisfied; and besides, through removing certain mismatching points, the landmark identification accuracy isimproved and the landmark identification complexity is reduced.

A method and system of applying modulated carrier signals to tree networks and processing signals tapped from the tree networks to generate output signals with phase-synchronized carriers are disclosed.

The invention relates to a comprehensive body similarity detection method, which comprises the steps of constructing tree structures of bodies, calculating semantic similarity, pragmatic similarity, structural similarity and attribute similarity of a source node and a target node, and obtaining an integral similarity by weighted summation. The attribute characteristics and structural characteristics of the bodies are considered, semantic information contained in the bodies is taken as an important index for balancing the similarity, and weight assignments and network search results are added for dynamic update aiming at the characteristics of different bodies, so the accuracy of body similarity detection is improved by fully using the characteristics of the bodies to calculate the similarity of the bodies without obviously increasing the calculation complexity.

A language model structure for use in a speech recognition system employs a tree-structured network model. The language model is structured such that identifiers associated with each word and contained therein are arranged such that each node of the network model with which the language model is associated spans a continuous range of identifiers. A method of transferring tokens through a tree-structured network in a speech recognition process is also provided.

Methods for the optimal allocation of bandwidth among a plurality of video-on-demand (VOD) programs available on each link of a VOD tree network, where a server at the root node of the tree network broadcasts the multiple VOD programs. Each node in the network has demands for a subset of the programs and each link connecting nodes in the network has a limited amount of available bandwidth capacity. The available bandwidth is allocated on each link optimally among all programs that are carried on that link. The bandwidth allocated to a specific program may be different on different links of the network, as the bandwidth allocated may be decreased, but not increased, from one link to the next along the paths from the root node to the destination nodes. The methods use equitable resource allocation models with a lexicographic minimax objective function. The first method finds optimal solutions while satisfying the capacity constraints on all links, tree-like ordering constraints for the bandwidth allocated to each of the programs, and lower and upper bounds on bandwidth allocation for each program. The second method finds optimal solutions to a more restrictive scheme that imposes additional constraints which require equal bandwidth allocation for a specific program on all relevant links emanating from the same node.

Physical architecture of the system includes front-end unit connected to IP load carrying network, client end units and central service platform. The platform is composed of central management server, authentication / authority / charging servers, video forwarding and distributing unit, and network image recording unit. Characters are that the physical architecture is divided into the operation support layer, the media exchange layer, and the user access layer. The central service platform, front-end unit and client end units constitute an edge domain, and multiple edge domains are managed by a management center in upper level so as to form a domain in second level. Analogically, a domain in third level is formed in tree structure, which is defined as architecture of provincial and nationwide management center as well as operation and support layer of edge domain on the dedicated IP network. Devices are on the IP network and front-end units and client end units are connected to the devices.

LDPC coding systems for 60 GHz millimeter wave based physical layer extension. LDPC (Low Density Parity Check) encoding in cooperation with sub-carrier interleaving, in the context of orthogonal frequency division multiplexing (OFDM), and appropriate symbol mapping is performed in accordance with transmit processing as may be performed within a communication device. In a receiving communication device, receive processing may be performed on a received signal based on the type of LDPC, sub-carrier interleaving, and symbol mapping thereof. The LDPC code employed in accordance with such LDPC encoding may have a partial-tree like structure. In addition, appropriate manipulation of the bits assigned to respective sub-carriers may be performed to ensure that the bits emplaced in the MSB (Most Significant Bit) location of various symbols has some desired diversity (e.g., from different codewords, from appropriately different locations within a given codeword, etc.).

A communications network is provided with a self-healing topological architecture. Each node in the network detects continuously transmitted beacon packets that are propagated through the network at regular intervals by a root node. Upon failure to detect a new beacon packet after a predetermined time from a parent node, a network node determines a network isolation condition and searches for another node that is still actively connected in the network. Algorithms are provided for registering with and identifying active parent node candidates during a network failure so as to prevent the creation of network loops.

The invention provides a method for achieving the automatic configuration of IPv6 addresses for a wireless sensor network. In the method, the wireless sensor network is provided with four types of nodes including isolated sensor nodes, IPv6 access nodes, cluster head nodes and intra-cluster nodes, wherein one of the IPv6 access nodes and a plurality of the cluster head nodes form a dendritic structure. The wireless sensor network consists of a plurality of clusters, and each cluster comprises one cluster head node and a plurality of intra-cluster nodes. The IPv6 access nodes / cluster head nodes adopt a state-full address configuration scheme for recording address assignment to allocate the IPv6 addresses to the other cluster head nodes; the cluster head nodes adopt the state-full address configuration scheme for recording the address assignment and a state-less address configuration scheme for random assignment to allocate the IPv6 addresses to the intra-cluster nodes in the clusters to which the cluster head nodes belong; and when the cluster head nodes adopt the address configuration scheme for the random assignment to allocate the IPv6 addresses to the intra-cluster nodes in the clusters to which the cluster head nodes belong, repeat addresses of the allocated IPv6 addresses are only detected in the clusters.

A system and method for tree matching are provided. The method for tree matching includes: acquiring tree-like structures representing a physical object or model; extracting a path from a first tree-like structure and a path from a second tree-like structure; comparing the paths of the first and second tree-like structures by computing a similarity measurement for the paths; and determining if the paths match based on the similarity measurement.

A method optimizes a tree depth of an H-tree network for distributing a clock signal to elements of a semiconductor integrated circuit, in a way as to minimize power consumption of the H-tree network. The method has the steps of entering parameters, defining a short circuit current component PS, cell internal switching current component PI, and switching current of interconnect capacitance component PW of the power consumption of the H-tree network with equations employing a tree depth m as a variable, defining the power consumption F of the H-tree network as the sum of the components PS, PI, and PW, and finding a tree depth that minimizes the power consumption F. The method differentiates the power consumption F, i.e., the sum of the components PS, PI, and PW with respect to the tree depth m as ∂F / ∂m and solves "∂F / ∂m=0" to find the optimum tree depth of the H-tree network.

A synchronies method of wireless sensor network time based on error statistics includes steps: uses the flood course of synchronous command message to reach the time synchronism with low accuracy in short time, and build network tree hierarchical structure at same time; dynamic choosing part or whole edge nodes of network are the delay statistical node; statistical synchronizes message is from concourse nodes to delay statistical node, and delay statistical message is from delay statistical node to concourse node; calculates the transmission delay of every jump; compensate the synchronizing accuracy according to transmission delay of every jump and the jump number of concourse node to reach the time synchronism with high accuracy, which is used in wireless transmission network, containing concourse node and sensor node, and all nodes are tree structure whose root nodes are concourse node. The method has good adaptability, extension, and high synchronism accuracy, and it has good split between synchronism accuracy and power consumption.

The invention discloses a routing method and device as well as sensor equipment based on a wireless sensor tree network. The method comprises the steps of: allocating short addresses for sensor nodes in advance according to the layer and the intra-layer position, where each sensor node is in, in the tree network; inquiring the short address of a target sensor node according to a message to be transmitted; inquiring a pre-established neighbor table to acquire the short address of each neighbor node of the current sensor node; respectively calculating number of the basic routing hops from each neighbor node to the target sensor node according to the short address of each neighbor node and the target sensor node; and selecting a next-hop node from the neighbor nodes according to the basic routing hop number obtained through calculation, and forwarding the message to the next-hop node. The method disclosed by the invention benefits the increase of the routing transmission efficiency of the sensor nodes in a message forwarding process.

The invention discloses a loop detection method used for detection of a downlink loop of a tree network, including the following steps: the network side node sends the loop detection packet to the user side node; the user side node receives and forwards the detection packet to the down stream; the network side node receives and analyzes the detection packet carrying the node information which is sent back from the user side node, so as to determine the user side node which generates or participates in the loop. The invention also discloses a loop detection device and an EPON network. The loop detection method of the invention can precisely position the generating position of the loop and reduce the transceiver packet pressure of the network side node.

The invention provides a wide-range high-precision matched digital channel three-dimensional visualization method. For a scene graph technology-based channel scene organization method and an incremental component-based similar model modeling method, a wide-range channel terrain which accords with earth curvature change and is completely matched with an electronic chart is established, a k-crossing tree structure scene graph of a channel scene three-dimensional entity model is established, and the channel scene three-dimensional entity model which has the characteristics of wide ranges of three dimension, dynamic and scene, irregular entity and the like is organized, expressed, multiplexed and parallelly quickly developed; and based on a dynamic data configuration technology, a database paging scheduling policy is combined, and the wide-range channel three-dimensional entity model is subjected to high-precision matching, dynamic management and real-time smooth drawing. By the method, wide-range channel high-precision and high-efficiency three-dimensional visualization is realized, and inland water transportation boatmanship training and the visualization construction of Yangtze River digital channels are promoted.

A tree-structured index to multidimensional data is created using occurring patterns and clusters within the data which permit efficient search and retrieval strategies in a database of DNA profiles. A search engine utilizes hierarchical decomposition of the database by identifying clusters of similar DNA profiles and maps to parallel computer architecture, allowing scale up past previously feasible limits. Key benefits of the new method are logarithmic scale up and parallelization. These benefits are achieved by identification and utilization of occurring patterns and clusters within stored data. The patterns and clusters enable the stored data to be partitioned into subsets of roughly equal size. The method can be applied recursively, resulting in a database tree that is balanced, meaning that all paths or branches through the tree have roughly the same length. The method achieves high performance by exploiting the natural structure of the data in a manner that maintains balanced trees. Implementation of the method maps to parallel computer architectures, allowing scale up to very large databases.