49 results about "Space partitioning" patented technology

The invention relates to the technical field of industrial equipment state monitoring and fault diagnosis, and discloses a dynamic generation method for a multi-stage early warning threshold of a dynamic equipment fault, which comprises the following steps of: dividing a multi-dimensional process parameter space into a plurality of discrete working condition subspaces by utilizing a clustering algorithm, constructing a phase space manifold main hyperplane and a standard tangential velocity field atlas, and constructing a multi-stage early warning threshold of the dynamic equipment fault. Calculating an orthogonal projection residual error and a tangential velocity field consistency deviation of the real-time phase space state vector, synthesizing a space-time coupling deviation index based on the orthogonal projection residual error and the tangential velocity field consistency deviation, and quantifying the ergodic damage degree of each state, and dynamically generating a multi-stage early warning system based on the ergodic damage degree of each state and the space-time coupling deviation index. According to the method, the manifold geometry and dynamics evolution double constraint model is constructed, and the probability distribution evolution analysis is combined, so that multi-dimensional and graded early warning of the dynamic equipment fault under the variable working condition is realized.

Systems, apparatuses, methods, and computer-readable media are described for coding point cloud geometry using selected models. Dense portions of a point cloud may be coded using one model (e.g., a triangle-based model such as a TriSoup model), and non-dense portions may be coded using another model (e.g., a tree-based model such as a space-partitioning tree). Each model may be selected from a list of a plurality of models. Model information for each portion of the point cloud may be encoded or decoded. By representing portions of the point cloud using models, compression efficiency and / or modeling capability may be improved.

The invention discloses an improved particle swarm optimization algorithm-based unequal-area facility layout method with interference. The method belongs to the field of intelligent optimization algorithms, and comprises the following main steps: S1, constructing a mathematical model with an interference unequal area facility layout problem; s2, initializing a population, and calculating an objective function value; s3, selecting a global optimal particle by using a target space division method; s4, executing heuristic mutation operation by using an adaptive gradient method to improve the search precision; and S5, using a tabu search rule and a neighborhood transformation rule to prevent the algorithm from being caught in a local optimal solution trap too early. Compared with the existing method, the method has the following main advantages: (1) the influence caused by a physical interference object is considered in the unequal-area facility layout problem, so that the applicability of the problem is enhanced, and the method can be more suitable for actual application scenes such as factory workshop transportation scenes; and (2) a tabu search rule is introduced into the multi-target particle swarm optimization algorithm, so that the convergence speed and the global search capability of the algorithm are improved.

The embodiment of the invention provides a contact collision detection method and device and a storage medium, and relates to the technical field of computers. The method comprises the following steps: determining a patch bounding box of each triangular patch included in a first object and a second object respectively to obtain a processed first object and a processed second object; performing binning processing on the processed first object and the processed second object to obtain an object binning result; wherein the object binning result indicates a space division mode; according to a space division mode indicated by the object binning result, constructing a first tree structure of the processed first object and a second tree structure of the processed second object in parallel; and traversing the first tree structure and the second tree structure in parallel to obtain a to-be-detected node pair, and performing an intersection test on the to-be-detected node pair to obtain a contact collision detection result of the first object and the second object. According to the method, accelerated processing of the contact collision detection method can be realized.

The invention discloses a wartime art element heuristic optimization algorithm inspired by ancient Chinese wartime. The war art algorithm simulates a stratified command structure of commander decision, samson command and soldier execution to solve the complex optimization problem. The warfare art algorithm is mainly characterized in that layering and space division are carried out, wherein a solution space is divided into a plurality of warfare areas, and an optimal individual is selected as a commander and a samson; according to the dynamic strategic decision, the commander is switched between a global exploration strategy (petal blooming) and a local development strategy (petal contraction) according to the dynamic switching probability. And dynamic distribution of military strength: dynamically adjusting search military strength according to the combat work of each legion group so as to balance global and local search capabilities. The soldiers are divided into commander parents, samson parents and ordinary soldiers, and the commander parents, the samson parents and the ordinary soldiers adopt hierarchical step lengths, so that multi-level and high-precision search execution is realized. Experimental results show that the algorithm is superior to various existing mainstream optimization algorithms in the aspects of convergence precision, stability and robustness.

A space division method, device and storage medium, the method comprising: obtaining attribute data and / or interaction data of a preset area; obtaining attribute data sets corresponding to a plurality of atomic TAZs according to the attribute data of the preset area, and / or obtaining interaction data sets corresponding to the plurality of atomic TAZs according to the interaction data of the preset area, and obtaining a space proximity data set according to the plurality of atomic TAZs; obtaining a space division result of the preset area according to the attribute data sets and / or the interaction data sets corresponding to the plurality of atomic TAZs, and the space proximity data set corresponding to the plurality of atomic TAZs. Space division is realized based on multiple source data, which facilitates the introduction of various data for AtomTAZ in different scenarios, and the division is based on AtomTAZ units, making the division result more in line with the needs of the real world.

Provided in the present disclosure are a lock-free learning index method and apparatus, and an electronic device, a computer-readable storage medium and a computer program product. The method comprises: performing grouping and space partitioning processing on data to be indexed, so as to obtain a plurality of pieces of leaf node data, and performing model training processing on the basis of the leaf node data, so as to obtain a first model; performing memory pre-allocation processing in the first model, so as to obtain a storage space, and storing a corresponding lock-free linked list in the storage space; determining a remaining space corresponding to the storage space, performing recombination optimization processing on the leaf node data corresponding to the storage space the remaining space of which is less than a preset space threshold value, so as to obtain an initial index structure, and on the basis of the lock-free linked list, connecting the initial index structure to a preset tree structure, so as to obtain a target index structure; and performing index processing on a target element by means of the target index structure, so as to obtain target position information of the target element in the data to be indexed.

1. The name of this design product: Ceramic Partition (D Combination). 2. Purpose of this design product: used for space partitioning and decoration. 3. The key point of the design of this product lies in its shape. 4. The picture or photo that best illustrates the design points: three-dimensional picture.

The invention relates to the field of data query, and discloses a space grid data query method based on AABB and KDTree composite index, comprising the following steps: step 1, acquiring simulation data of a part, establishing a space mapping relationship between the simulation data and a geometry of a die casting, and performing AABB space division on the geometry, the AABB space including primary AABB space division and secondary AABB space division; the primary AABB space division divides the geometry of the die casting into a plurality of topologically associated sub-regions; the sub-region is divided into a plurality of tetrahedron units by the secondary AABB space division; performing binary tree structure recombination on the tetrahedron units in the sub-regions by adopting KDTree; and 2, judging whether the target coordinate point is in the sub-region or not, traversing the tetrahedron unit of the sub-region, and remarkably reducing the calculation complexity and improving the spatial query efficiency of the large-scale grid model by introducing a spatial index structure and an algorithm optimization strategy.

The application discloses a method for dividing different cleanliness grade areas in a constant-temperature and constant-humidity dust-free workshop in the field of information technology, and comprises the following steps: preliminarily dividing different cleanliness grade areas according to production process requirements and functions of each area, obtaining a region division scheme by using a space division algorithm, including space position coordinates, area and cleanliness grade requirement parameters of each area; setting a buffer zone between different cleanliness grade areas, determining the spatial layout of the buffer zone, including position coordinates, area and shape parameters, by calculating the space position coordinates and area of each area, and determining the cleanliness grade transition requirements of the buffer zone according to the cleanliness grade difference between adjacent areas; analyzing airflow organization and pressure difference control conditions under the optimized region division scheme, obtaining airflow velocity, airflow direction and pressure difference parameters of each area, and obtaining an airflow organization and pressure difference control scheme meeting the cleanliness grade requirements of each area by using a gradient descent iterative optimization algorithm.

A circuit breaker closing vibration signal state evaluation method and system based on multi-feature extraction and multi-classifier fusion are characterized in that the method comprises the following steps: extracting closing signal features from three dimensions of a time domain, a frequency domain and a time-frequency domain, and comprehensively applying a plurality of feature selection methods to calculate feature importance scores; determining the number of finally selected features according to cumulative distribution of feature importance, and performing fault classification on the finally selected features by adopting a multi-classifier optimization integration framework; a high-dimensional feature space is reduced to a 2D or 3D space through a t-SNE technology, and space division of different fault types is realized.

To provide a quantum search algorithm, when searching for feasible solutions to combinatorial optimization problems with constraints on a quantum computer, using a divide-and-conquer method to search for all feasible solutions that satisfy the constraints with a small amount of computation.SOLUTION: An optimization problem solving algorithm 1 primarily consists of an initialization unit 10, a space division unit 20, and an integration unit 30. The initialization unit 10 prepares operators for an entire space (initial state) that represents all combination states relating to a feasible solution. The space division unit 20 divides the operators representing the entire space of the search range into a plurality of subspaces for every constraint condition in order to divide the constraint conditions of the combinatorial optimization problem into a plurality of subproblems. The integration unit 30 embeds each divided operator an appropriate number of times in the same way, executes calculation processing, and executes measurement.SELECTED DRAWING: Figure 1

The utility model discloses a space separating device for hydraulic facilities, which belongs to the technical field of hydraulic engineering and comprises a U-shaped separating seat, a lifting separating plate is inserted into the U-shaped separating seat in a sliding manner, a vertical mounting strip block is fixedly mounted on the side wall of the U-shaped separating seat, and a vertical mounting groove is formed in the inner wall of the vertical mounting strip block. A lifting adjusting assembly is mounted in the vertical mounting groove, the lifting partition plate is fixedly connected with the lifting adjusting assembly, and a first lateral packaging strip and a second lateral packaging strip are mounted on the side wall of the lifting partition plate and the side wall of the U-shaped partition seat correspondingly. The first lateral packaging strip and the second lateral packaging strip are fixedly connected with the lifting partition plate and the U-shaped partition base through positioning connecting assemblies correspondingly. According to the utility model, the stability and the sealing performance of separation are ensured, the first lateral packaging strip and the second lateral packaging strip are convenient to replace so as to adapt to different width requirements, meanwhile, the flexible adjustment of space separation can be realized, and the requirements of different heights are met.

The method may include inputting a first set of data into a first model; for each user in the second group, generating a first similarity score; generating a relevance score for each parameter; determining a subset of parameters based on relevance; inputting the subset of parameters, a second set of data, and a third set of data into a second model; generating a space-partitioning data structure based on the second set of data; for each user in the first group, determining a feature distance between a representation of the user in the first group and a representation of a user in the second group based on the third set of data and the space-partitioning data structure; for each user in the second group, generating a second similarity score; and for each user in the second group, generating an overall similarity score.

This invention discloses a method and apparatus for constructing a true 3D model of an open-pit mine driven by multimodal data. The method and apparatus involve processing and fusing multi-source data from the open-pit mine to obtain a multimodal information database. Based on the multimodal data in the database, a single 3D model of the open-pit mine is constructed. A quadtree-based spatial partitioning method and preset mesh coding rules are used to obtain the mesh code corresponding to the open-pit mine area. A mapping relationship is established between the mesh code and the model entities in the single 3D model of the open-pit mine, resulting in a mesh-coded true 3D model of the open-pit mine. This invention, based on the mapping relationship between the mesh code corresponding to the open-pit mine area and the model entities in the single 3D model of the open-pit mine, obtains a mesh-coded true 3D model of the open-pit mine, thereby improving the detection accuracy and precision of key information in open-pit mine disasters.

The present invention discloses a method for optimizing the path of an unmanned aerial vehicle based on an improved branch and bound algorithm. First, the task points are divided into different priority levels, and a dynamic weight mechanism is designed to drive high-priority tasks to be preferentially responded to. Secondly, the global MTSP problem is transformed into the clustering of a planar point set and the local TSP problem, and collaborative solution is achieved by fusing the K-means clustering and the branch and bound algorithm. Aiming at the challenge of computational complexity in large-scale task scenarios, an approximate optimization strategy based on space partitioning is proposed, and a multi-level optimization architecture is adopted to balance the solution accuracy and the computational efficiency. Compared with the traditional heuristic algorithm and the branch and bound algorithm, the method of the present invention can obtain a better solution in small-scale TSP instances. For large-scale task scenarios, the computational efficiency of the algorithm is greatly improved. And through the dynamic weight mechanism, the access timing of high-priority task nodes is optimized and advanced, so that both the system response timeliness and the system comprehensive QoS are improved.

1. Name of the design product: Ceramic partition (Combination B). 2. Use of the design product: For space partitioning and space decoration. 3. Design key points of the design product: Lies in the shape. 4. Picture or photo that best shows the design key points: Stereogram.

The application discloses a data analysis method and device based on an improved random forest and a medium. The method comprises the following steps: integrating basic multi-source data; obtaining data samples based on the basic multi-source data; constructing a basic model based on a random forest algorithm; dividing the basic model based on a space division strategy to obtain an improved model; training a subspace based on a training set and a pre-test set to obtain a weight value corresponding to each subspace, and analyzing the subspace by using a corresponding weighted voting mechanism through the weight value; and training the improved model based on the training set and a test set, and performing data analysis through the trained improved model. The method can effectively analyze the data characteristics of basic information and application information data, and can effectively realize dimension reduction of high-dimensional data and obtain main control indexes of relevant analysis data, so that production guidance can be better performed.

This invention relates to the field of data processing technology, providing a method and apparatus for segmenting action time-series data based on multi-view features. This method fully utilizes the complementarity between multi-view data and introduces a latent representation learning mechanism, enabling features from different views to share a unified latent representation, thereby more comprehensively describing the subspace structure of the action time-series data. Simultaneously, introducing two temporal regularization terms into the objective function ensures the continuity of the latent representation and subspace representation of adjacent data frames in the action time-series data, enhancing temporal consistency between adjacent data frames and making subspace partitioning more stable, thus achieving effective segmentation of the action time-series data. Compared to traditional time-series data segmentation methods, this method can more effectively combine the multi-view features and time-series characteristics of action time-series data, improving the segmentation effect of action time-series data through collaborative optimization of latent representation and subspace representation.

The application discloses an anti-fragmentation method for a portable flash memory device and relates to the technical field of computer storage systems and operating system kernels. The method comprises the following steps: S1, in the file system initialization stage, a hybrid granularity partition model is established, and a storage space is proportionally divided into a small cluster area and a large cluster area according to functional requirements; S2, an extended allocation bitmap management structure is constructed in the memory; S3, in response to a space allocation request, an allocation strategy is selected according to the data characteristics of the request; and S4, an allocation process in the large cluster area. According to the application, the cluster space of the flash memory device is divided into the small cluster area and the large cluster area, various requests are classified and processed based on prompt information when allocating the space, and a relaxed reuse mechanism is introduced, so that the fragmentation process of the storage space is significantly delayed, and the average bandwidth of multi-threaded writing and the space utilization are significantly improved without affecting compatibility and space utilization.

The application provides a building space segmentation method and system based on a maximum inscribed rectangle, comprising: acquiring a building space image to be segmented, reading the number of marked text points in the building space image to be segmented; solving the maximum inscribed rectangle of the building space image to be segmented based on the marked text points, obtaining the maximum inscribed rectangle of the marked text points; for the building space image to be segmented with different numbers of marked text points, different processing is performed on the maximum inscribed rectangle of each marked text point to obtain a space segmentation result, and a building space segmentation image is output; the method performs multi-space division based on the maximum inscribed rectangle, turns the abstract space division problem into an actual image processing problem, and accurately divides the building space in various marked text point situations in accordance with the building specification.

1. The name of this design product: Ceramic Partition (C Combination). 2. Purpose of this design product: used for space partitioning and decoration. 3. The key point of the design of this product lies in its shape. 4. The picture or photo that best illustrates the design points: three-dimensional picture.

1. Name of the product in this design: Screen (Oriental Dragon). 2. Purpose of this design: A screen for space partitioning. 3. The key design feature of this product is its shape. 4. The image or photograph that best illustrates the design's key points: a 3D model. 5. Other situations requiring explanation: The top and bottom surfaces are not commonly used, so the top and bottom views are omitted.

The invention discloses a building vector model reconstruction method and device, equipment and a medium, and the method comprises the steps: extracting a feature image set and a plane primitive of point cloud data, and carrying out the space partitioning of the point cloud data based on the plane primitive, so as to obtain a space slice set; determining slice features corresponding to the spatial slices according to the feature image set; constructing a space slice graph by taking the space slices as nodes and the adjacent relation between the space slices as edges; determining an occupation probability corresponding to the space slice according to the space slice map; and according to the occupancy probability corresponding to each space slice, extracting boundaries between the space sections and splicing the boundaries to obtain a building vector model. According to the method, the point cloud data is divided into the space slice set through the plane primitives, the slice features of the space slices are determined according to the feature image set to obtain geometric details in the attached partitions, and the correlation between the space slices is captured by using a multi-scale attention mechanism to accurately deduce the complex inter-partition relationship. And the accuracy of the reconstructed building vector model is improved.

This invention relates to the field of geostress field data processing technology, and particularly to a three-dimensional dynamic inversion method for geostress fields based on a multi-scale adaptive algorithm. The method includes the following steps: acquiring a geological dataset of the target region; constructing a three-dimensional initial model of the geostress field based on the geological dataset, and performing spatial partitioning and meshing of the geological bodies to obtain three-dimensional mesh model data of the geostress field; performing multi-scale regional partitioning on the three-dimensional mesh model data of the geostress field, and establishing a multi-scale weighting function to obtain multi-scale partition mapping information; constructing a cross-scale boundary adaptive transfer mechanism, establishing a stress tensor continuity constraint model at the multi-scale partition boundaries, and obtaining cross-scale stress boundary coupling data. This invention achieves high-precision, dynamic, and continuous inversion of geostress fields in complex geological structures through a multi-scale adaptive algorithm and dynamic closed-loop optimization.

The invention relates to the field of digital twinning, in particular to a digital twinning progress model processing method and system based on BIM semantics and laser point cloud mapping, and the method comprises the steps: obtaining geometric data of all components in a corresponding BIM model according to an engineering structure; a first directional bounding box is extracted according to component geometric data of the BIM model, a space division KD tree of the engineering structure is generated, and spatial semantics of the engineering structure are obtained; spatial geometric point cloud distribution is obtained through actual measurement on an engineering construction site and is divided into KD tree nodes; determining the construction state of the corresponding engineering structure by comparing the size relation of the second directional bounding box and the third directional bounding box; the second directional bounding box is a directional bounding box of KD tree nodes, and the third directional bounding box is a directional bounding box of space geometric point clouds contained in the KD tree nodes; counting construction states of all nodes of the KD tree to obtain a current project progress; the progress data can be ensured to accord with engineering practice, and the method has high application and popularization value.

1. Name of this design product: Paper Wall Partition (White Swan Paper Wall). 2. Purpose of this design: for space partitioning and decoration. 3. The key design feature of this product is its shape. 4. The image or photograph that best illustrates the design's key points: a 3D model.

The application belongs to the technical field of data processing, and particularly relates to a hybrid tetrahedral mesh generation method based on ray tracing and A15 lattice, which comprises the following steps: S1, space division and intersection detection; S2, region division and filling object; S3, octree construction and ray filling method; and S4, hierarchical mesh generation. The method has the advantages that the technical problems that the existing mesh filling method cannot accurately restore sharp surface features, and the sign distance field method has low calculation efficiency and large storage overhead are solved, high-quality and high-efficiency tetrahedral mesh generation is achieved, and a reliable mesh discretization solution is provided for finite element analysis and engineering simulation of a complex three-dimensional model.

The invention discloses a building model reconstruction method and device based on an adaptive graph convolutional network, and the method comprises the steps: obtaining three-dimensional point cloud data; processing the three-dimensional point cloud data by adopting an adaptive binary space division method to obtain a plurality of polyhedrons, and dynamically constructing a binary tree in the processing process to analyze the adjacency between the polyhedrons to obtain an adjacency matrix; obtaining a global implicit code according to the three-dimensional point cloud data, sampling a group of query points in each polyhedron, and obtaining polyhedron features according to coordinates of the query points and the global implicit code; constructing an adaptive graph convolutional network, and updating polyhedral features by combining the adjacent matrix and an attention adjacent matrix obtained through attention mechanism learning; performing three-dimensional building model reconstruction according to the updated polyhedral features; therefore, efficient and accurate conversion from the point cloud data to the three-dimensional building model is realized.