47 results about "Disjoint-set" patented technology

A frequency partitioning technique is introduced that amortizes the work of computing codeword lengths within a tuplecode by grouping together tuples that have the same pattern of codeword lengths. Specifically, the technique entropy codes and partitions column values in each column into disjoint sets called column partitions, assigns a codeword length to each of the column partitions, identifies cells (a combination of codeword lengths), and collectively storing tuples associated with each of the cells.

Coherent motion regions extend in time as well as space, enforcing consistency in detected objects over long time periods and making the algorithm robust to noisy or short point tracks. As a result of enforcing the constraint that selected coherent motion regions contain disjoint sets of tracks defined in a three-dimensional space including a time dimension. An algorithm operates directly on raw, unconditioned low-level feature point tracks, and minimizes a global measure of the coherent motion regions. At least one discrete moving object is identified in a time series of video images based on the trajectory similarity factors, which is a measure of a maximum distance between a pair of feature point tracks.

A method for displaying layout-fixing hints for resolving color-seeding violations in an IC design layout. The method receives a set of error paths within a disjoint set of shapes. For each error path, the method performs an analysis on the error path to identify a set of layout-fixing hints that eliminates the color-seeding violation on the error path and does not introduce any new color-seeding violation. The method displays the set of identified hints for each error path in order to aid a user to resolve the color-seeding violations. The method displays each identified layout-fixing hint as a set of moving instructions. The set of moving instructions provides a set of indications of a distance by which a shape or an edge of the shape needs to be moved in order to resolve a color-seeding violation.

A passive optical network (PON) has an optical line termination (OLT) that terminates an optical fiber servicing a plurality of optical network units (ONUs). Each ONU has one or more traffic containers (TCONTs) addressable by the OLT. The PON dynamic bandwidth allocation (DBA) implements a scheduling hierarchy, including several scheduling layers, such that disjoint sets of TCONTs can be grouped together, then disjoint sets of groups can be grouped, and so on. In such hierarchy, the residential traffic can be grouped separately from the business traffic. Further, within either the residential or business group, traffic may be grouped to define scheduling layers (“sub-groups”) within the residential or business group. Scheduling in one group or sub-group is performed independently of the scheduling in other groups or sub-groups, subject to the available bandwidth for each group. The scheduling may be controlled to allow the residential services to be oversubscribed while still ensuring compliance of service level performance metrics for the business services.

In a ring having first and second adjacent nodes, and two fibers carrying information between the first and second nodes, the first fiber carries information in one direction, while the second fiber carries information in another direction. Each fiber includes wavelength capacity allocated to working and protection traffic. The working and protection wavelength capacities in the first fiber are respectively assigned to first and second disjoint sets of wavelengths, while the working and protection wavelength capacities in the second fiber are respectively assigned to the second and first disjoint sets of wavelengths.

A controller of a non-volatile memory manages each of multiple disjoint sets of physical pages as a respective page group. The controller mitigates errors by repetitively performing background mitigation reads of each of the plurality of blocks including, in order, performing a background mitigation read of a first physical page in a first page group in a first block; prior to again performing a background mitigation read in the first block, performing a background mitigation read of a first physical page in a first page group in each other of the plurality of blocks; performing a background mitigation read of a first physical page in a second page group in the first block; and prior to again performing a background mitigation read in the first block, performing a background mitigation read of a first physical page in a second page group in each other of the plurality of blocks.

The invention provides a topology detection method based on a cloud computing network. The topology detection method is suitable for detecting a network topology under the environment of the cloud computing network, and is used for detecting the topology from two separate layers, wherein the first layer of the topology comprises a router and a computing node; time delay is detected by sending a socket 'sandwich' pack; the second layer of the topology comprises the distribution of virtual machines under the computing node in the cloud computing environment. The method is used for detecting the communication time delay between the virtual machines with an MPI, and merging and clustering by adopting the disjoint-set data structure algorithm after corresponding calculation, so as to obtain the distribution of the virtual machines. Through the adoption of the method, the integral topological structure under the whole cloud computing network environment can be detected more completely.

An improved system and method is provided for clustering objects using indexes for a matrix representing a collection of objects. Objects to be clustered may be represented as a rectangular matrix. An index may be created for accessing the rows of the matrix and an inverted index may be created for accessing the columns of the matrix based upon the connectivity of the edges between rows and columns of the matrix. Each node represented by a row may be joined to a nearest node represented by another row to produce disjoint sets of nodes. The disjoint sets of nodes may represent clusters that may then be output for use by an application. Moreover, the objects to be clustered may be clusters of objects that may be correlated into a hierarchy of clusters of objects.

Disclosed is a method for designing a network with a given set of network flow requirements, each flow requirement having a source, a destination and a bandwidth. The method comprises the steps of assigning each flow to a port on its associated source and destination, determining the partition of source and destination ports into port groups which are disjoint sets, and generating network modules to support the assignment of flows by using an appropriate interconnected combination of links, hubs and switches. The design of the module accounts for the relative costs of the links, hubs and switches and finds the allocation and subsequent module design that produces a cost effective interconnection fabric that supports all flow requirements.

A method for extracting capacitance from a layout record includes solving a matrix equation to obtain a set of capacitors that account for metal fill while eliminating floaters. A method for extracting capacitance from a layout record includes partitioning floaters into disjoint sets, and converting a capacitance matrix into block-diagonal form by ordering conductors according to the disjoint sets.

A system records a sequence of frames of a video in circular buffers. Each buffer is configured to store the frames in a sequential order. Disjoint sets of frames are selected from the video. There is one set of frames for each buffer such that a first set selects a first fraction of the frames, each subsequent set of frames is a smaller fraction then a previous set of frames, and a last set of selected frames includes remaining frames. The sets of frames are stored sequentially in the corresponding buffers.

The present invention provides an automatic segmentation method of a tooth three-dimensional network model. The method comprises four special functions and the steps of: automatic curvature thresholdselection operation, feature area skeletonizing operation, closing of feature area gaps by employing a distance field constraint method, and distribution of different colors for segmented disjoint sets. The algorithm comprises the steps of: initial feature area extraction, morphology operation, removal of redundant branches in the initial segmentation, closing of gaps in the feature skeleton, andprocessing of excessive segmentation. The automatic segmentation method of a tooth three-dimensional network model is high in degree of automation and only needs to input the quantity of teeth to completely segment each tooth in a tooth model so as to greatly relieve the medical workers' working pressure.

A model checker includes a model checker to generate a model of a piece of generally asynchronous hardware in which the set of variables includes a separate process chooser variable and the remainder of the variables are divided into disjoint sets of groups. At each cycle of the model, the process chooser and maximally, variables from one group of variables change values.

The invention discloses a generation method of a minimum test case suite and a device thereof. The method comprises the following steps: according to the interrelation of a test requirement r, dividing a total test case suite T into a plurality of mutually disjoint sets, wherein the union set of the mutually disjoint sets is T; according to the mutually disjoint sets, obtaining the minimum test case suite. According to the method, the inherent minimum test case suite determined by all test requirements in a test target can be generated so as to fundamentally solve a test case suite simplification problem and improve test efficiency.

The present invention provides a traffic management method for a mobile robotics system, including: step 1, defining the physical size of a mobile robot and the position of a point on a traveling path; step 2, for each point on the traveling path, obtaining profile information of the mobile robot on this point in combination with the physical size of the mobile robot, so as to further obtain the profile information of the mobile robots over the whole traveling path; step 3, with respect to a first path, calculating whether the profiles of the mobile robots on the first path and on a second path intersect, and if the profiles thereof intersect, then the first path and the second path are disjoint; step 4, calculating whether the profiles of the mobile robots on the first path and all other paths intersect, so as to further obtain the disjoint sets of all paths. The method of the present invention realizes full automation of the disjoint sets among the paths, avoids dead locks as a result of the configuration as much as possible, and solves the problems of error-prone disjoint sets and heavy workload in the manual configuration.

The invention discloses a D2D network setup method based on scalable video streaming user quality of experience. D2D communication is organized into a spanning tree for transmitting scalable adaptivevideo streaming. In an initialization phase, a D2D network is organized into the spanning tree with acceptable user quality of experience and fairness. In a management phase, the service continuity isrespectively maintained under the condition that different devices arrive or depart. On the basis of a local search technology, according to the scheme, data structures of disjoint sets and the localsearch technology are combined, the reachable operation time is O [mn alpha (m, n)]. According to the scheme, the capacity of a service network can be improved, the quality of experience, fairness and continuity of the service are ensured, and a great number of users can be supported.

A method for tracking objects in a first memory during a plurality of time intervals is provided, wherein the method comprises: updating, by one or more update threads, copying, by the one or more test threads, the one or more non-copied shadow objects to a second memory, determining, by the one or more test threads whether the step of copying the one or more non-copied shadow objects was successful, and updating, by the one or more test threads, the status variables of corresponding objects that correspond to the one or more non-copied shadow objects that were copied successfully, wherein subsequent bits of the status variables correspond to subsequent time intervals and wherein the one or more update threads and the one or more test threads operate on disjoint sets of bits of the status variables.