Patents
Literature
Patsnap Copilot is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Patsnap Copilot

32 results about "Compatibility matrix" patented technology

Method and apparatus providing interoperation of execution images of different versions

A method is disclosed for providing interoperation of a first execution image of a first version and a second execution image of a second version. A compatibility matrix specifies whether the versions are compatible, base-level compatible, or incompatible. In one embodiment, the compatibility matrix may comprise a sparse table that stores a compatibility indicator for all permutations of a plurality of versions of a network operating system. As part of initialization of a system that includes the first execution image and second execution image, version information for the execution images is determined. An entry in the compatibility matrix corresponding to the versions is identified. The execution images are operated in a fully synchronized state when the identified entry of the compatibility matrix specifies that the versions are either compatible or base-level compatible. Individual components of the execution images interoperate according to the results of individual session negotiations. If the versions are incompatible, an alternative redundancy operation mode may be used. Embodiments provide for negotiation of compatible message versions and capabilities among peer components or clients of the execution images as source information to generate the compatibility matrix.
Owner:CISCO TECH INC

Cooperative game method and trapezium-cloud model-based power distribution network operation state fuzzy and comprehensive evaluation method

A cooperative game method and trapezium-cloud model-based power distribution network operation state fuzzy and comprehensive evaluation method is characterized by comprising the steps of considering the purposiveness, the systematicness, the operability, the independence, the significance and the dynamism, and constructing a multi-dimension hierarchical power distribution network index system based on the safety, the high quality, the economy, the Intelligence, the environmental protection property and the sustainability; utilizing a weight method, an entropy weight method, a anti-entropy weight method and a compatibility matrix analysis method to calculate the power distribution network index weights separately; carrying out the cooperative game on the determined weights to obtain an optimal combined weight; carrying out the variable weight correction on the combined weight to obtain a final weight value; dividing the evaluation grades of a power distribution network to obtain an evaluation set; calculating a trapezium-cloud model parameter that each index corresponds to each evaluation grade, utilizing a trapezium-cloud model to calculate the membership degree values of the indexes of the to-be-evaluated power distribution network, and calculating a membership degree vector and an evaluation result of the whole power distribution network layer by layer and upwards on a fuzzyand comprehensive evaluation frame.
Owner:STATE GRID CORP OF CHINA +2

RNA secondary structure prediction method for quantum genetic algorithm based on multi-population assistance

The invention belongs to the technical field of bioinformatics and discloses an RNA secondary structure prediction method for a quantum genetic algorithm based on multi-population assistance. According to the method, a stem pool and a stem compatibility matrix of an RNA sequence is established according to the RNA sequence; quantum bit vectors are used to initialize multiple chromosome populations; quantum measurement is performed on each population; optimal individuals are acquired according to measurement results; the optimal individual b in all the populations is obtained and used to replace worst individuals, nonhomologous to b, among the optimal individuals in other populations, then all the populations are updated by use of different rotational angles, and other populations not participating in replacement are updated by use of a fixed rotational angle; and the process is iterated till a stop condition is met. Through the method, the global search capability and search efficiencyof the quantum genetic algorithm are effectively improved, and the evolution algebra of the genetic algorithm is lowered. Meanwhile, all the populations suppress competition and cooperate mutually, so that the globality of the algorithm is improved, and prediction accuracy is substantially enhanced.
Owner:XIDIAN UNIV

Demand response connection bus path optimization method

The present invention discloses a demand response connection bus path optimization method. The method comprises the following steps of: 1) constructing a mutual constrained relationship of passenger travel time parameters; 2) determining passenger compatibility to construct a corresponding compatibility matrix and find out a maximum incompatible passenger set to obtain the initial required numberof vehicles and seed passengers of each initial path; 3) determining the path neighbourhood of each passenger, searching feasible insertion in the path of each passenger in the path neighbourhood, determining an optimal insertion of the passengers in the neighbourhood paths to achieve preliminary planning of the paths; and 4) for passengers which cannot be inserted into the current paths, repeatedly executing the steps 2-3 until the number of residual passengers of the obtained passenger load factor of the paths is lower than an assigned threshold value. The demand response connection bus pathoptimization method fully employs the mutual constrained relationship of passenger travel time parameters in the same bus number and provides the concept reduction feasible solution search domain ofthe path neighbourhood so as to improve the algorithm solution efficiency and construct the multi-vehicle and multi-path travel plan with high efficiency and low cost.
Owner:SOUTHEAST UNIV

Local structural dynamical modeling method and device

The invention provides a local structural dynamical modeling method and a device. The method is adopted for solving the problems of big data volume, low calculation efficiency and difficulty in locally dynamical responding and finely analyzing as required of the present dynamical modeling. The method comprises the following steps: dividing a whole structure into a first structure and a second structure; establishing an interface multipoint restriction equation for the first structure under the first grid and the second structure under the second grid according to the finite element stiffness matrix and mass matrix of the first structure and the finite element stiffness matrix and mass matrix of the second structure; confirming a vibration mode of the first structure and a vibration mode of the second structure according to the equation; and confirming a deformation compatibility matrix between the DOF (Degree of Freedom) modal displacement of the first structure and the DOF modal displacement of the second structure according to a Moore-Penrose pseudo-inverse method, thereby confirming a dynamical equivalent support effect matrix of the second structure and a fine dynamical finite element model of the first structure.
Owner:NORTHWESTERN POLYTECHNICAL UNIV

Default revising method for generalized coordinate of movable structure based on cluster theory

The invention discloses a default revising method for a generalized coordinate of a movable structure based on a cluster theory and relates to the fields of design of an unfoldable structure, space structure construction analysis and the like. According to the method disclosed by the invention, the default revising problem of the generalized coordinate of the movable structure is changed into a plurality of mutually independent subproblems, each subproblem is solved by parallel computation, and time consumed in the default revising process of the generalized coordinate of the movable structure is effectively reduced. The method mainly comprises the following steps: a generalized displacement compatibility equation of the movable structure is established, and the symmetric group which the movable structure belongs to is determined; then each partitioned submatrix of a symmetric generalized displacement compatibility matrix is respectively computed, and corresponding generalized inverse is solved; and finally, the generalized inverse of the symmetric displacement compatibility matrix of the whole structure is built along a diagonal line, and the generalized coordinate of each node of the movable structure is revised. The higher the symmetry of the movable structure is, the more remarkable the improvement of the solving efficiency of the fault revising process of the generalized coordinate is.
Owner:SOUTHEAST UNIV

Group scheduling method and system between base stations based on interference coordination

InactiveCN105813088ANot affected by co-channel interferenceMultiple and flexible groupingBroadcast service distributionNetwork planningGroup schedulingBasic service
The invention provides a group scheduling method between base stations based on interference coordination, and the method comprises the following steps: enabling N user terminals in a basic service set to serve as edge user terminals or non-edge user terminals; defining each base station and each edge user terminal correlated with the base station as a transmitting-receiving/receiving-transmitting pair; obtaining the emission performance requirements for each edge user terminal or base station serving as a transmitting end under the condition that each base station or edge user terminal serving as a receiving end is not affected by co-channel interference; building a compatibility matrix formed based on the transmitting-receiving/receiving-transmitting pair; searching the transmitting-receiving/receiving-transmitting pair with the emission performance requirements being able to coexist in the compatibility matrix according to the emission performance requirements of the receiving end for the transmitting end, and forming a scheduling group through the transmitting-receiving/receiving-transmitting pair; and carrying out the call of the scheduling group. According to the invention, the method carries out flexible group selection according to the demands for current business, does not need to divide an orthogonal time slice, makes the most of time resources for business interaction, improves the probability that an edge user obtains a channel, and improves the user experience of the edge user.
Owner:SHANGHAI RES CENT FOR WIRELESS COMM +1

Method for acquiring process task block dependency based on matrixes

The invention relates to a method for acquiring process task block dependency based on matrixes. The method aims to solve the problem that in existing exhaustion method search, it is needed to traverse all possibly occurring orders and meanwhile continuously construct test cases, and consequently time and labor are wasted. According to the method, first, test cases are input; second, the test cases are converted into a relation matrix; third, when alpha is greater than or equal to beta, the fourth step is turned to, and when alpha is smaller than beta, the ninth step is turned to; fourth, correct test cases different from wrong test cases are determined, and the fifth step is turned to; fifth, when alpha is greater than beta, the sixth step is turned to, and when alpha is equal to beta, the seventh step is turned to; sixth, a relation compatibility matrix is obtained, and the eighth step is turned to; seventh, a dependency matrix is obtained, and the thirteenth step is turned to; eighth, a dependency matrix is obtained, and the thirteenth step is turned to; ninth, correct test cases different from wrong test cases are determined, and the tenth step is executed; tenth, a complementary relation matrix is obtained, and the eleventh step is turned to; eleventh, a new complementary relation matrix is obtained; twelfth, a dependency matrix is obtained, and the thirteenth step is turned to; and thirteenth, dependency is obtained and output. The method is applied to the field of task block dependency determination.
Owner:哈尔滨中逻智科技有限公司

A kind of local structural dynamics modeling method and device

The invention provides a local structural dynamical modeling method and a device. The method is adopted for solving the problems of big data volume, low calculation efficiency and difficulty in locally dynamical responding and finely analyzing as required of the present dynamical modeling. The method comprises the following steps: dividing a whole structure into a first structure and a second structure; establishing an interface multipoint restriction equation for the first structure under the first grid and the second structure under the second grid according to the finite element stiffness matrix and mass matrix of the first structure and the finite element stiffness matrix and mass matrix of the second structure; confirming a vibration mode of the first structure and a vibration mode of the second structure according to the equation; and confirming a deformation compatibility matrix between the DOF (Degree of Freedom) modal displacement of the first structure and the DOF modal displacement of the second structure according to a Moore-Penrose pseudo-inverse method, thereby confirming a dynamical equivalent support effect matrix of the second structure and a fine dynamical finite element model of the first structure.
Owner:NORTHWESTERN POLYTECHNICAL UNIV

Default revising method for generalized coordinate of movable structure based on cluster theory

The invention discloses a default revising method for a generalized coordinate of a movable structure based on a cluster theory and relates to the fields of design of an unfoldable structure, space structure construction analysis and the like. According to the method disclosed by the invention, the default revising problem of the generalized coordinate of the movable structure is changed into a plurality of mutually independent subproblems, each subproblem is solved by parallel computation, and time consumed in the default revising process of the generalized coordinate of the movable structure is effectively reduced. The method mainly comprises the following steps: a generalized displacement compatibility equation of the movable structure is established, and the symmetric group which the movable structure belongs to is determined; then each partitioned submatrix of a symmetric generalized displacement compatibility matrix is respectively computed, and corresponding generalized inverse is solved; and finally, the generalized inverse of the symmetric displacement compatibility matrix of the whole structure is built along a diagonal line, and the generalized coordinate of each node of the movable structure is revised. The higher the symmetry of the movable structure is, the more remarkable the improvement of the solving efficiency of the fault revising process of the generalized coordinate is.
Owner:SOUTHEAST UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products