45 results about "Constraint graph" patented technology

A method and system for solving an optimization problem comprising a plurality of dynamic constraints. A genetic algorithm is used to iteratively generate potential solutions to the problem. A constraint graph is used to model the plurality of dynamic constraints, and any potential solution that does not correspond to a connected subgraph of the constraint graph is infeasible and discarded. Real-time changes in dynamic constraints are incorporated by modification of the constraint graph between iterations of the genetic algorithm. An exemplary embodiment comprising the scheduling of air missions is presented.

A decomposition technique, for solving combinational constraint expressions, is presented. Decomposing a set of constraints can increase the opportunities for dividing them into independent sets that do not need to be conjoined in a constraint-solving process using a BDD representation. An AND decomposition, relying on a Theorem 1, is presented. An OR decomposition, relying on a corollary of Theorem 1, is presented. Theorem 1 provides an operation to test for, and create, a pair of sub-constraints G and H which are independent in any two variables x0 and x1. A decomposition procedure is presented for separating as many variables as possible, of an input constraint, into disjoint sub-constraints. A merging procedure is presented, that can be used if a decomposition does not only contain constraints whose support sets are disjoint from each other. The decomposition procedure can also be used to identify hold constraints.

The invention discloses an image classification method based on a high-constraint high-dispersion principal component analysis network. The image classification method comprises the following steps of a convolution and nonlinear variation step: in a convolution layer, obtaining a plurality of convolution kernels used for extracting the characteristics of each stage, and in a nonlinear transformation layer, utilizing the convolution kernels to carry out nonlinear transformation on an input image to obtain a characteristic pattern; a characteristic pooling step: in a characteristic pooling layer, importing a multiscale characteristic analysis formula, and outputting characteristics after a value meets a condition that a high-dispersion distribution formula and the optimal value of the scale zooming factor [Sigma] of the high-dispersion distribution formula are optimal is deduced; an integration step: unfolding the characteristics into vectors, and utilizing the vectors to form a characteristic matrix; and an image classification step: inputting the characteristics into a linear support vector machine to finish an image classification task. The image classification method is simple and efficient and exhibits self-adaption and expansibility, and only the structural parameter of the network needs to be input.

A control for defining data for setting the times for controlled events in a glass forming machine which is controlled by a programmable sequencer which defines the time of a machine cycle. A computerized model of a mathematical representation of a network constraint diagram of the unwrapped bottle forming process is provided with computer analysis for analyzing the computerized model as a constrained optimization problem for determining, with inputs including the following:1. the motion durations of each of the mechanisms from the retracted position to the advanced position and from the advanced position to the retracted position,2. the submotion durations,3. the machine cycle time, and4. the time in an unwrapped bottle forming process for each displacement to begin and for each valve to be turned "on" and "off", and5. the target time for an optimized machine cycle, the machine cycle time and the event times for an optimized process.

An initial layout of at least a portion of a given layer of an integrated circuit design is decomposed into multiple sub-layouts by splitting each of a plurality of shapes of the initial layout into multiple segments, constructing a constraint graph to represent relationships between the segments, reducing the constraint graph to a stitch graph, determining at least one cut line of the stitch graph, and generating a decomposed layout based on the determined cut line. The decomposed layout in an illustrative embodiment includes first and second sub-layouts comprising respective disjoint subsets of the segments, with each of the sub-layouts of the decomposed layout being associated with a different pattern mask of a double patterning lithography process. The layout decomposition process advantageously minimizes the number of stitches between the sub-layouts without introducing excessive computational complexity.

The invention provides a circuit schematic diagram generation method. The method comprises the steps that a hierarchy value of a netlist device is calculated to determine a column of the netlist device; a sorting value of the netlist device is calculated to generate a pseudo device according to the communication line or the feedback line; only signal connection between adjacent devices is needed,wiring algorithm is simplified, the netlist devices and the pseudo devices are sorted according to the sorting values to generate a sorting graph; a constraint graph is generated according to the sorting graph; wire bending is less, forward traversal is performed on constraint graph, a numerical value of the first longitudinal position is calculated and the constraint graph is reversely traversed,the numerical value of the first longitudinal position is adjusted to generate the numerical value of the second longitudinal position, the signal connecting lines are distributed to the longitudinalline rails, the numerical value of the transverse position is calculated, the signal connecting lines are connected to generate the circuit schematic diagram, device layout does not need to be basedon grids, and the graphical display effect is better. The invention also provides a circuit schematic diagram generation system for realizing the circuit schematic diagram generation method.

A method for circuit layout migration comprises creating a list of layout components in a source layout; determining a plurality of first groups of layout components being regularly aligned horizontally or vertically; determining first subsets of layout components which each belong to at least two of a respective set of determined first groups; determining a plurality of second groups of layout components, each second group comprising mutually exclusive ones of the first subsets of layout components; determining symmetry axes for pairs of second groups; building a constraint graph of the layout components of the source layout using alignment constraints for the alignment of layout components within each of the second groups and distance constraints for preserving a regularity pattern within each of the second groups and symmetry constraints for the determined symmetry axes for pairs of second groups; and performing constraint-graph-based compaction of the source layout.

A distributed method for dynamically assigning time-frequency resources in a network comprising several stations is disclosed. The stations are organized in groups (or interfaces) of several stations with each group comprising an allocation table Tsi. Each group exchanges this allocation table by means of a signaling protocol with groups that are defined as being in conflict with it by a constraints graph. The method uses an arbitration function to settle the conflicts and the assignments of allocations between the groups in conflict according to the constraints graph. In performing the method, each interface Ji transmits the allocation table TJi associated with it to the interfaces K indicated as being in conflict in the constraints graph. An interface Ji looks, for each allocation AJi that it has entered in its table TJi, whether the allocation AJi is used in the table received from an interface K that is in conflict. The interface Ji uses the arbitration function to modify the allocation AJi in the table TJi.

A method for reconstructing—three-dimensional (3D) lines in a 3D world coordinate system from two-dimensional (2D) lines in a single image of scene detects and clusters the 2D lines using vanishing points. A constraint graph of vertices and edges is generated, wherein the vertices represent the 2D lines, and the edges represents constraints on the 2D lines, then identifying the 3D lines that satisfy the constraints and reconstructing the 3D lines using the identified constraints.

The invention provides a group activity recognition method based on a coherence constraint graph long-short-term memory network, and the method comprises the following steps: (1), enabling the CNN features of all persons to serve as the input of the coherence constraint graph long-short-term memory network, and jointly learning the individual motion states of all persons along with time under thecoherence constraint of a space-time context; (2) quantifying contributions of related motions by learning attention factors corresponding to different motions by utilizing an attention mechanism of global context coherence; (3) aggregating all single motion states weighted by different attention factors into a hidden representation of the whole activity by adopting aggregation LSTM in each time step, and inputting the hidden representation of each activity into a softmax classifier; and (4) averaging the output of the softmax classifier of each time step to obtain a probability class vector of the group activity so as to deduce the class of the group activity.

A method allocates resources in an orthogonal frequency-division multiple access (OFDMA) network including a set of base stations (BSs), and a set of mobile stations (MSs) for each BS. Each cell includes a center and edge zone. A node weighted constraint graph is constructed for the network. Maximal independent sets in the graph are searched as sub-channels are allocated to the MSs in edge zones. Remaining bandwidth is allocated to the MSs in the center zones. Power is assigned to the sub-channels so that inter-cell interference is minimized and traffic load is maximized.

The invention discloses a graph optimization-based collaborative navigation method in a communication limited environment. The graph optimization-based collaborative navigation method comprises the following steps: S1, establishing a sensor observation model composed of an agent dead reckoning constraint and a UWB (Ultra Wideband) relative distance measurement constraint; s2, setting a connection form of graph vertexes and edges of the factor graph model, and constructing the factor graph model; s3, based on the factor graph model of each cooperative node, solving the objective function by using an LM algorithm to obtain an optimization result of the state variable of each node at the k moment; according to the collaborative navigation method, a factor graph model is constructed, a real-time established model of gyroscope zero offset is realized by utilizing an established factor graph constraint graph optimization model containing inertial dead reckoning, the gyroscope zero offset can be accurately estimated, and distributed collaborative navigation and positioning are carried out by utilizing relative distance measurement information between nodes. Navigation error divergence of the node in a complex denial environment is effectively inhibited, and the navigation positioning precision has no obvious change compared with continuous synchronous observation under the condition that anchor point observation is discontinuous and asynchronous.

An authorization system provides fine grain entitlements to a resource server by retrieving a dynamic constraint graph as a function of an authorization request, and traversing the dynamic constraint graph as a function of the contextual attributes of the request. The contextual attributes can include local contextual attributes specific to the user or user group, and global contextual attributes specific to the current environment of the authorization system. Traversing the dynamic constraint graph provides an access result that can provide fine grain entitlements for a request.