35 results about "Recursive partitioning" patented technology

A device and related methods for word-sense disambiguation during a text-to-speech conversion are provided. The device, for use with a computer-based system capable of converting text data to synthesized speech, includes an identification module for identifying a homograph contained in the text data. The device also includes an assignment module for assigning a pronunciation to the homograph using a statistical test constructed from a recursive partitioning of training samples, each training sample being a word string containing the homograph. The recursive partitioning is based on determining for each training sample an order and a distance of each word indicator relative to the homograph in the training sample. An absence of one of the word indicators in a training sample is treated as equivalent to the absent word indicator being more than a predefined distance from the homograph.

A recursively partitioned static router-table, the data structure incorporating a first-level partition including subtries and an auxiliary trie. A node of the subtrie includes a path Q(N) from the root R of a trie T to a root N of the subtrie, a stride s for a next-level partition, a mask that characterizes a next-level perfect hash function, and a pointer to the hash table for the next-level partition. At least one of the trie T, the first-level partition, the auxiliary trie, and the next-level partition is represented by a base structure selected from the group consisting of MBT and HSST.

A method and computer workstation are disclosed which determine the location in the ground space of selected point in a digital image of the earth obtained by an airborne camera. The image is rectangular and has four corners and corresponds to an image space. The image is associated with data indicating the geo-location coordinates for the points in the ground space corresponding to the four corners of the image, e.g., an image formatted in accordance with the NITF standard. The method includes the steps of: (a) performing independently and in parallel a recursive partitioning of the image space and the ground space into successively smaller quadrants until a pixel coordinate in the image assigned to the selected point is within a predetermined limit (Δ) of the center of a final recursively partitioned quadrant in the image space. The method further includes a step of (b) calculating a geo-location of the point in the ground space corresponding to the selected point in the image space from the final recursively partitioned quadrant in the ground space corresponding to the final recursively partitioned quadrant in the image space. The methods are particularly useful for geo-location from oblique reconnaissance imagery.

A database for predicting clinical outcomes based upon quantitative tumor burden in lymph node samples from an individual is provided. The database comprises data sets from a plurality of individuals. The data sets include clinical outcome data and data regarding number of lymph nodes evaluated, maximum number of biomarker detected in any single node, median normalized expression levels detected across all evaluated lymph nodes and the maximum normalized expression levels detected in any evaluated lymph nodes and the database also includes stratified risk categories based upon recursive partitioning of data. A system for predicting clinical outcomes based upon quantitative tumor burden in lymph node samples from an individual is provided which includes the database linked to a data processor, an input interface and an output interface. Method of preparing a database and method for predicting clinical outcome for a test patient based upon quantitative tumor burden in lymph node samples from an individual using a system that includes the database linked to a data processor, an input interface and an output interface. The method comprises measuring quantitative tumor burden in a plurality of lymph node samples from an individual, inputting the results into the system and processing with data in the database. The results of the processing of the data is the assignment of data test patient to a stratified risk category. Output is produced that displays test patient's identity and assigned stratified risk category.

One embodiment of the invention is a recursive partitioning method that places circuit elements in an IC layout. This method initially defines a number of partitioning lines that divide an IC region into several sub-regions (also called slots). For a net in the region, the method then identifies the set of sub-regions (i.e., the set of slots) that contain the circuit elements (e.g., the pins or circuit modules) of that net. The set of sub-regions for the net represents the net's configuration with respect to the defined partitioning lines. Next, the placement method identifies attribute or attributes of a connection graph that models the net's configuration with respect to the partitioning lines. The connection graph for each net provides a topology of interconnect lines that connect the slots that contain the net's circuit elements. According to some embodiments of the invention, the connection graph for each net can have edges that are completely or partially diagonal.

A device and related methods for word-sense disambiguation during a text-to-speech conversion are provided. The device, for use with a computer-based system capable of converting text data to synthesized speech, includes an identification module for identifying a homograph contained in the text data. The device also includes an assignment module for assigning a pronunciation to the homograph using a statistical test constructed from a recursive partitioning of training samples, each training sample being a word string containing the homograph. The recursive partitioning is based on determining for each training sample an order and a distance of each word indicator relative to the homograph in the training sample. An absence of one of the word indicators in a training sample is treated as equivalent to the absent word indicator being more than a predefined distance from the homograph.

Decoding and encoding methods, systems, and devices for wireless communication are described. One method may include receiving a codeword over a wireless channel, the codeword being encoded using a polar code, identifying a set of repeated bit locations in the received codeword, and identifying a set of bit locations of the polar code used for information bits for the encoding. The set of bit locations may be determined based at least in part on recursively partitioning bit-channels of the polar code for each stage of polarization and assigning portions of a number of the information bits to bit-channel partitions of each stage of polarization based on a mutual information transfer function of respective aggregate capacities of the bit-channel partitions. The method may also include decoding the received codeword according to the polar code to obtain an information bit vector at the set of bit locations, and other aspects and features.

The invention discloses a recursive cutting type zone control method of reactive voltage, belongs to the field of electrical power system safety analysis and operation control, and particularly relates to a node coupling relationship analysis and reactive voltage zone control method of an electrical power system. The problem that when the zone control method of the reactive voltage is applied to interconnected grids with non-uniform grid structures, the adaptability is poor is solved. The method comprises the steps as follows: a power supply node coupling relationship matrix and a voltage control sensitivity matrix HLG of power supply nodes to load nodes are calculated firstly; power supply nodes in a to-be-cut zone is divided into two groups, wherein one group has an intra-group coupling degree lager than Gamma (k), and the other group has an inter-group coupling degree smaller than Gamma (k); load nodes in the to-be-cut zone are merged into node sets of corresponding power supply nodes; whether sub-zones of the node sets meet the termination conditions of the sub-zones is judged, and if the termination conditions are met, the partition of nodes and sets is ended; then grid voltage of the zones is controlled, and operation control of the grid voltage of the zones is completed; otherwise, partition is performed continuously. The recursive cutting type zone control method of the reactive voltage is applicable to electrical power system safety analysis and operation control.

The present invention discloses an image encoding method and an image encoding device. The method comprises the following steps: dividing domain blocks according to a value block scale range; performing isomorphic transformation on a matrix composed of 4 low frequency coefficients obtained by performing wavelet transformation on the domain blocks; performing recursive partitioning on value blocks until scale of the value blocks is less than the maximum scale; performing wavelet transformation on the value blocks to obtain 4 low frequency coefficients, calculating a value block direction K1 and a domain block direction K2, calculating a luminance factor and a shift factor and error thereof if the K1 is identical with the K2, and judging if the error is less than 5; if yes, writing position information of the value block and the domain blocks, transformation information and value block scale information into a code stream file, or performing quadtree partitioning on the value blocks; and writing ending information into the code stream file when all the value blocks find corresponding domain blocks. The image encoding method and the image encoding device provided by the present invention accelerates encoding speed and effectively improves compression ratio and decoded image quality, thus realizing effective image compression.

The invention discloses an efficient distributed and parallel Delaunay triangle construction method. The method comprises the following steps of firstly, determining the recursive partitioning frequency k of problem solving and the number 2k of leaf problems according to the scale p of a distributed and parallel computing environment; secondly, sorting data sets of to-be-solved problems with the scale of n in a flat scanning sequence mode; thirdly, performing gradual partitioning from top to bottom by adopting a partitioning strategy of a divide-and-conquer method, and recursively partitioning the to-be-solved problems with the scale of n into the 2k leaf problems; fourthly, performing convex-hull-method Delaunay triangular net parallel construction of sub-problems on the 2k leaf problems by using 2k parallel computing nodes; and finally, gradually combining solutions of the sub-problems from bottom to top by adopting a combination strategy of the divide-and-conquer method, and performing distributed and parallel combination processing by using t / 2 computing nodes during combination each time until a global solution of a global problem is obtained, wherein the number of the sub-problems is n. According to the method, the efficiency is remarkably improved.

The invention discloses a hypertension medication recommendation model based on recursive partitioning calculation and a construction method thereof. The method comprises the steps: obtaining a hypertension data set through ICD coding, and analyzing and processing the data set to be in a standardized text medical record format; formatting a text medical record into a classification variable containing hypertension medication characteristics, and defining a model framework; dividing the data set into a test sample set and a verification sample set through an age stratified sampling method; based on the test sample set, calculating the fitting degree of the model and judging the complexity of medication nodes by using a recursive partitioning algorithm; establishing a model parameter pool, and setting parameter composition; and solving optimal model parameters based on the verification sample set to realize construction and optimization of the hypertension medication recommendation model. By means of big data analysis, recognition methods of different medication schemes in individualized application of hypertension patients are analyzed, and rapid selection of a single medication scheme or a combined medication scheme is achieved according to treatment classification characteristics of the patients.

The present invention relates to a method and apparatus for analysing a pair of data sets with respect to a predicate, the predicate having a predicate criterion, each data set comprising one or more elements sorted according to the predicate criterion. The invention comprises recursive partitioning of the data sets in a parallel manner across multiple computing cores until a base case is reached. The invention is particularly suited for carrying out join, filter and sort operations on large data sets within database management systems.

The invention discloses a method for file recursive subdivision, transmission and recombination under a multi-streaming and multi-homing environment. A sender is connected with a receiver through multiple links. The method comprises the following steps that: 1) before the sender sends a file, recursive subdivision is conducted to the file according to the quantity of connected links to subdivide the file into file fragments M with the same size, the file fragments M are numbered and coded, and the file fragments together with numbers and codes are sent to the receiver through the corresponding links; and 2) when the receiver receives the file fragments together with the numbers and the codes, the corresponding received file fragments are stored in a temporary folder according to the codes and the numbers of the file fragments and the directory structures of the temporary folder is created according to the codes and the numbers; and after all file fragments are received, all file fragments form a temporary folder with tree directory structures which are nested layer by layer in the receiver, the temporary folder is regarded as a tree root , the file fragments are regarded as leaves and the file fragments are combined by starting from the directory on the outermost layer through a binary-tree post-order traversal method to form the file. The method has the advantages of high file transmission efficiency, high network link dynamic adaptability and high simplicity and practicability.

The present invention proposes a scalable object representation method in a video codec. In the encoding process, the method determines the object attributes of the coding unit according to the division structure of the coding unit and the object information, so as to encode the object attributes into the output video In the decoding process, the object attributes are decoded to obtain object information including shape and position. Using this method, the present invention proposes scalable object representation means in video codecs. For a maximum coding unit, it is recursively divided according to the mode decision; for the coding unit that terminates the division, judge whether it belongs to the object: if it does not belong to the object, enter the identification coding module as its coding object index identification; if it belongs to the object, enter the object representation precision decision module.

The invention discloses a method and device for protecting program memory space through precise partitioning, and relate to the technical field of digital memory. The method comprises the steps that a first memory space is obtained according to the program memory space, the first memory space is processed to obtain a front end region and a rear end region, the front end region and the rear end region are subjected to recursive partitioning, and the access permission of sub-regions obtained through partitioning is set. The device comprises a first memory space generating module, a first judgment module, a first portioning module, a second judgment module, a front end region generating module, a rear end region generating module, a front end region processing module, a rear end region processing module, a third judgment module, a fourth judgment module, a front end region updating module and a rear end region updating module. The program memory space is protected through precise partitioning, the situation that due to inaccurate partitioning, the program cannot operate normally is avoided, and waste of system resources is avoided.

The invention discloses a QTBT fast judgment method and system based on a KB filter. The system comprises an obtaining module, a selection module, a search module and a judgment module. The method comprises the following steps: carrying out filtering processing on a video frame image through the KB filter to obtain a filtered image; selecting a corresponding high frequency point threshold value; searching high frequency point maximum value of an image region; judging whether the searched high frequency point maximum value is smaller than the selected high frequency point threshold value; if so, jumping out of the current coding unit recursive partitioning program; or otherwise, carrying out recursive partitioning continuously on a current coding unit based on a QTBT algorithm. Through the method and system, whether the CU is subjected to recursive partitioning continuously can be pre-judged based on the image features, thereby greatly reducing video encoding time; and the QTBT fast judgment method and system based on the KB filter can be widely applied to the QTBT algorithm video coding field.

The invention discloses an efficient distributed and parallel Delaunay triangle construction method. The method comprises the following steps of firstly, determining the recursive partitioning frequency k of problem solving and the number 2k of leaf problems according to the scale p of a distributed and parallel computing environment; secondly, sorting data sets of to-be-solved problems with the scale of n in a flat scanning sequence mode; thirdly, performing gradual partitioning from top to bottom by adopting a partitioning strategy of a divide-and-conquer method, and recursively partitioning the to-be-solved problems with the scale of n into the 2k leaf problems; fourthly, performing convex-hull-method Delaunay triangular net parallel construction of sub-problems on the 2k leaf problems by using 2k parallel computing nodes; and finally, gradually combining solutions of the sub-problems from bottom to top by adopting a combination strategy of the divide-and-conquer method, and performing distributed and parallel combination processing by using t / 2 computing nodes during combination each time until a global solution of a global problem is obtained, wherein the number of the sub-problems is n. According to the method, the efficiency is remarkably improved.