64 results about "Partition matrix" patented technology

The invention provides a gait recognition method based on a partitioned matrix. Firstly, extracting single-frame images from a video, then carrying out grey scale transformation on the single-frame images, using the background subtraction method to extract person body targets, using mathematical morphology to fill the holes of binary images, and extracting profiles of the person by means of single connection analysis so that the person bodies are positioned in the middle and are uniformly in the size of 64 * 64 pixels; observing the periodic change of the gait according to elliptical short axis and eccentricity fitted in image regions after the standard centralization of each frame image in a gait video sequence; using a gait energy diagram to extract the integral characteristic of the gait in the one period, dividing GEI into sub-blocks by means of the partitioned matrix, eliminating the sub-blocks which are useless to classification in a self-adapting manner, and adopting the method, which combines the two-dimensional principal component analysis of a sub-block mode with the two-dimensional linear discriminant analysis, to further extract local characteristics; and integrating the characteristics of each effective sub-block into a whole during the classification recognition, and adopting a nearest neighbor classifier to perform identification judgment. The method is effective for the recognition of the gait of knapsack change.

A non-disassembling partition assembly comprising a partition matrix made up of intersecting first and second slotted partitions, each of the partitions having at least one slot. The slots of the partitions are engaged with each other at a plurality of intersections. The partitions may be made by folding over a partition blank and securing a foam portion of the folded partition blank to itself. The foam may be heated before being cooled under pressure to secure opposed plies of the partition together. The partition assembly is held together by a floor parent welded to the intersecting partitions. The floor has a lower outer skin and a foam layer to which the partitions are parent welded.

A method of input/output (I/O) block placement assigned to an input/output bank includes formulating a placement algorithm using integer linear programming (ILP) and simultaneously placing single groups and Relatively Placed Module (RPM) groups of I/O blocks in the I/O bank. The method further includes determining a placeability matrix P and a binary assignment matrix X used for the ILP. The method can further eliminate all assignment matrix elements of X equal to 0 in the integer linear programming and re-index any remaining elements. The method can further place all I/O blocks according to a solution if solving of the standard ILP formulation results in a feasible solution. Optionally, the method generates a placement solution that is as close as possible to an external reference solution specified by designer. Optionally, the method analyzes which constraints were violated and generates useful error information.

The invention discloses a resource slice allocation method and device, and computer equipment. The resource slice allocation method comprises the steps of: acquiring the historical data of a target network in a preset time period, and predicting the flow value of each link in a future preset time period; determining a link resource partition matrix and a node resource partition matrix according to a preset initial link allocation state and a preset initial node allocation state; determining a plurality of resource allocation schemes at the current moment; respectively calculating an objective utility function of each resource allocation scheme meeting the reliability condition at the current moment; and taking the resource allocation scheme corresponding to the maximum objective utility function as a target resource allocation scheme at the current moment. Through the implementation of the resource slice allocation method, the historical data is combined and the future utility function is calculated, so that the network resource division state at the future moment influences the current division strategy, the current optimal strategy is obtained, and quick response to the future network demand change in the resource allocation process is ensured.

The present invention provides a system and process for creating an effective work schedule for a security checkpoint. The process includes the step of analyzing passenger flow to determine the coverage needed to sustain required service levels, generally through simulating the checkpoint to determine required staffing levels. Another step to optimize workforce levels and schedules is to create workforce schedules that are based on optimized person-hours and key variables. The schedule staffs as needed to achieve the required staffing levels and may consider numerous other factors, including acceptable ranges for shift lengths; a maximum number of start times; and a percentage of part-time or seasonal employees. In a particular embodiment, the schedule is formed by using linear programming to solve for a tour assignment matrix (defining a schedule) from a demand matrix representing the needed number of workers and a coefficient matrix representing the availability of workers.

The invention provides a target tracking method and a target tracking device in video monitoring. The method comprises the steps that the state value corresponding to a target in a previous frame is obtained; a current frame is subjected to target detection, and the observed value corresponding to the target observing in the current frame is obtained; a cost matrix is built according to the state value and the observing value, in addition, an EMD (earth mover's distance) algorithm is applied for solving the cost matrix, and an allocation matrix is obtained; and the target in the current frame is recognized according to the allocation matrix. The device comprises an obtaining module, a target detecting module, an operation module and a recognition module, wherein the obtaining module is used for obtaining the state value corresponding to the target in the previous frame, the target detecting module is used for carrying out the target detection on the current frame to obtain the observed value corresponding to the target observing in the current frame, the operation module is used for building the cost matrix according to the state value and the observing valve and applying the EMD algorithm for solving the cost matrix to obtain the allocation matrix, and the recognition module is used for recognizing the target in the current frame according to the allocation matrix. When the target tracking method and the target tracking device are adopted, the accuracy can be improved.

The embodiment of the invention relates to a signal processing method and a device. The method includes the following steps: in a period of time, receiving a mixed signal and obtaining the amplitude information of the received mixed signal; according to the third-order cumulant and the fourth-order cumulant of the amplitude information of the mixed signal, obtaining objective function through calculation; and using the objective function to obtain an independent signal in the mixed signal. The method can cause ICA algorithm to be applicable to unmixing treatment of various signals. Another method includes the following steps: using Newton iteration formula with a regulatory factor that can cause the objective function to descend according to given norm to conduct iterative treatment on initial weight vector until the iterated weight vector is converged, and obtaining the converged weight vector; receiving the mixed signal in a period of time and acquiring the amplitude information of the received mixed signal; and according to the converged weight vector, conducting unmixing treatment on the mixed signal and acquiring the independent signal in the mixed signal. The method has little restraint in selection of the initial value of the weight vector in partitioning matrix and high operation efficiency.

A lipstick sorting container is provided which includes a ridged box shaped holder having a bottom wall, side walls, an opening, and a first partition matrix housed within the sidewalls. The first partition matrix is housed within the sidewalls and is an arrangement of lipstick tube containers into rows and columns. Each container is configured in order to receive a lipstick tube when inserted into the box opening. A top includes a transparent top wall with a lower surface, side walls, and a second partition matrix connected to the lower surface. The second partition matrix is an arrangement of erasable indicia cells into rows and columns. The rows and columns of the second partition matrix are configured in alignment with the rows and columns or the first partition matrix. Each of the cells receives a separate lipstick color indicia, when marked on the lower surface, corresponding to a lipstick color of the lipstick tube contained in alignment with the indicia cell.

The related two short-cut calculation methods for ZF-BLE in TD-SCDMA system comprise: with the first method, calculating simplified system matrix B and the correlation matrix BHB, then the inverse matrix as (BHB)-1 to take MAI balance directly to data MF for the estimated data d; with the second method, using simplified matrix B to obtain are and its inverse are-1, and applying partitioned matrix a, b, c and d for ISI and MAI balance to the data MF, adding to obtain final d.

A partition assembly comprising a partition matrix made up of intersecting first and second slotted partitions, each of the partitions having at least one slot and a rounded edge. The slots of the partitions are engaged with each other at a plurality of intersections. The partitions are made by rounding an edge of a multi-layered blank using a rotatable tool and then cutting the partition material to a desired size. Slots may then be formed in the edge sealed material.

A method, computer program product, and system for allocating resources on computer systems are provided. The method, computer program product, and system provide for displaying a resource allocation matrix, the resource allocation matrix including a plurality of cells, each of the plurality of cells indicating a quantity of one of a plurality of resources on one of a plurality of physical systems allocated to one of a plurality of virtual systems hosted by the one physical system, receiving an input changing the quantity indicated in a cell, the cell indicating the quantity of a resource on a physical system allocated to a virtual system hosted by the physical system, and adjusting the quantity of the resource allocated to the virtual system based on the input.

A collapsible, non-disassembling intersecting partition assembly for insertion into a container divides the space inside the container into individual cells for holding products. The assembly comprises a plurality of first slotted partitions intersecting with a plurality of second slotted partitions to form a collapsible matrix. Each of the first slotted partitions has opposed slots extending inwardly from opposed edges of the partition to facilitate folding the partition. An outer portion or tab of each folded partition is secured to one of the other partitions to prevent disassembly of the matrix. Each of the partitions has hooks and notches to help hold the assembly together.

The invention relates to a distributed soft clustering method in an Internet-of-Things environment based on an average consensus algorithm, and the method comprises the following specific steps: S1, obtaining a topological network where a target Internet-of-Things node is located, and inputting a distributed data set, a clustering number, a fuzzy coefficient and a stop criterion parameter into thetopological network; S2, initializing set elements of the distributed data set, and calculating the initial clustering center of the target Internet-of-Things node; S3, calculating a distribution matrix from the distributed data set to the initial clustering center; S4, calculating a clustering center in the target Internet-of-Things according to the distribution matrix, and obtaining a global clustering center through an average consensus algorithm; and S5, repeating the steps S1-S4, iteratively updating the global clustering center, judging the current global clustering center and the global clustering center of the previous round according to the stop criterion parameters, and outputting a final global clustering center. Compared with the prior art, the method has the advantages that the clustering result quality and the algorithm stability can be effectively improved, and the like.

The invention relates to a partitioning solving method for the linear simultaneous equations of the dynamic simulation of a power system. The partitioning solving method comprises the following steps: (1) partitioning a simulation sparse matrix; (2) decomposing the notation of a diagonal matrix; (3) decomposing the numerical value LU (Lower Upper) of the diagonal matrix; and (4) according to the partitioned matrices, performing forward and backward substitution to solve the linear simultaneous equations. The partitioning solving method provided by the invention effectively utilizes the characteristic of the sparse matrix of large-scale linear simultaneous equations in the simulation, greatly shortens the time of the whole dynamic simulation of the power system under the premise of guaranteeing the correct result and the simulation precision, improves the computing efficiency of solving the linear simultaneous equations, and overcomes the defect that a frequently-used non-partitioning solving method is low in efficiency and can not make full use of the structural characteristic of a to-be-solved matrix.

The invention relates to a harmonic wave state estimation method for a single transformer substation. According to the method, all elements in the node voltage phasor quantity and the injected current phasor quantity are classified according to the quantity measurement and the state measurement and sorted according to the sequence of measuring the quantity first and then the state, and a node admittance matrix is partitioned correspondingly and transformed to obtain a quantity measurement equation; according to a network topology structure operates independently for a single three-winding transformer, known current quantity measurement points and known voltage measurement points are numbered, node number combinations are written out of partitioned matrix bodies of the admittance matrix and then substituted into the quantity measurement equation for calculating the state phasor quantity. The method is high in estimation accuracy, easy to realize and low in cost.

A partition assembly comprising a partition matrix made up of intersecting first and second slotted partitions, each of the partitions having at least one slot. The slots of the partitions are engaged with each other at a plurality of intersections. The partitions are made by folding over a partition blank and securing a foam portion of the folded partition blank to itself. The foam may be heated with hot air before being cooled under pressure to secure opposed plies of the partition together.

The invention relates to an optimization theory-based parallel clustering method with scale constraint, which comprises the following steps of: S1, acquiring a data set to be clustered and a scale constraint vector, and initializing parameters according to the data set and the scale constraint vector; S2, decomposing the data set subjected to parameter initialization into a plurality of sub-problems through a distribution matrix; S3, introducing a Lagrange multiplier vector, solving and clustering the sub-problems in parallel through a projection matrix, and updating the allocation matrix according to solving results of the sub-problems; and S4, calculating a convergence judgment parameter, judging whether clustering reaches a convergence stopping criterion or not according to the convergence judgment parameter, stopping iteration and outputting the current allocation matrix and the corresponding clustering result if the convergence stopping criterion is met, and otherwise, continuingto execute the steps S1-S3 for iteration. Compared with the prior art, the method has the advantages that a large-scale data set is processed in finite iterations, and a high-quality clustering resultis provided.

The invention provides an attribute graph group discovery method based on maximum mutual information and a graph neural network. The method is characterized in that the method comprises steps of carrying out the representation learning of a to-be-processed matrix through a pre-trained graph neural network, obtaining a preliminary node representation, and carrying out the mutual information calculation of a to-be-processed attribute graph, and obtaining a global mutual information value; dividing the preliminary node representation to the centers of a plurality of groups by using soft clustering to obtain an allocation matrix; carrying out modularity and mutual information calculation in the to-be-processed attribute graph on the original group according to the allocation matrix to obtain amodularity value and group mutual information; and calculating total loss according to the modularity value, the group mutual information and the global mutual information value, and iteratively updating the graph neural network through gradient return according to the total loss till a group discovery result is obtained. According to the method, the end-to-end updating graph neural network doesnot need to be realized step by step, the node attribute relationship can be better captured, and a group discovery result with higher accuracy is obtained.

The invention discloses an anti-radiation multibit-flip partitioned-matrix-code strengthening method for storers, relates to the field of anti-radiation strengthening circuits and solves problems that an error correcting code is low in correcting capability, poor in reliability, high in hardware performance overhead and high in cost. Date to be protected are logically subjected to modular division and matrix layout, high level of error correcting capability is achieved through a corresponding coding module and a decoding module, and area and power consumption is quite low; in addition, a user can adjust parameters of a data matrix according to different requirements, balance is concerned between the error correcting capability and performance consumption, and an optimal scheme is obtained. The anti-radiation multibit-flip partitioned-matrix-code strengthening method is higher in error correcting capability as compared with a traditional method with a two-dimension code and even higher than the error correcting capability of difference-set code, characteristics of smaller area and lower functional consumption are achieved as compared with the difference-set code, and the method is suitable for the storers with higher demands on reliability and performance.