21 results about "Segment structure" patented technology

The application discloses an integrated circuit manufacturing process vacuum transport simulation method, device, equipment and medium, relates to the field of integrated circuit manufacturing process simulation, and the integrated circuit manufacturing process vacuum transport simulation method takes the initial position of the transport particle, the motion direction vector of the simulation particle, and the sub-node region of the simulation region as the input of the finite state machine, simulates the motion of the transport particle by combining the method of the two-dimensional line segment tree, converts the process of moving the transport particle in the prior art and analyzing the motion of the transport particle into dividing the simulation region by the two-dimensional line segment tree, and simultaneously combines the process of updating the state of the transport particle by the finite state machine, so that the time complexity in the simulation process is reduced, and the running efficiency of the simulation is improved.

The invention relates to the technical field of pessimism elimination algorithms, in particular to a public path pessimism margin removal method, product and method and a storage medium, and the method comprises the steps: providing a clock tree, traversing the clock tree, and generating an index table, a sequence table and a hierarchical table based on information obtained through traversing; generating a line segment tree based on the sequence table and the hierarchical table; for a starting point and an ending point of any given time sequence path, obtaining a nearest common node through line segment tree query; and determining a sub-tree modified in the optimization process based on the nearest common node, correspondingly modifying an index table, a sequence table and / or a hierarchical table, and then carrying out common path pessimistic margin removal analysis to remove pessimistic margin. The method provided by the invention can solve the technical problem that the current public path pessimistic margin removal method consumes much time.

The embodiment of the invention discloses a block chain data processing method and device, equipment, a storage medium and a product. The method comprises the steps that an updating request for a line segment tree is obtained, the line segment tree comprises state data of a block with the height within a first interval, the updating request comprises a second interval, updating data and verification information, in response to verification of the verification information, uplink processing is carried out on the updating request, and in response to successful uplink of the updating request, uplink processing is carried out on the updating request. And establishing an association relationship between at least one node in the line segment tree and the update data, the update data associated with any node being used for updating the state data carried by the node, the at least one node including a target node, the target node being a non-leaf node, and the third interval corresponding to the target node being included in the second interval. Therefore, the state data in the third interval is updated in batches by establishing the incidence relation between the non-leaf nodes and the update data, and the data update efficiency of the block data in a certain height interval can be improved.

This application provides a data backup and recovery method, apparatus, electronic device, and storage medium. The method constructs BIO metadata containing segment information to be backed up, enabling the BIO data to be backed up to be backed up at the sector granularity based on this BIO metadata. Since the segment length of each segment to be backed up under different file systems is an integer multiple of the sector length, this backup method is compatible with file systems where the segment length is not block aligned. Each segment to be backed up can be stored in a corresponding set of target sectors without truncation issues. Furthermore, during recovery, the segment structure of the backed-up BIO data can be determined first based on this segment information, and then the backed-up BIO data can be recovered based on this segment structure. Since this segment structure is the same as the segment structure of the original BIO data, the recovered target BIO data can maintain consistency with the original BIO data.

The invention provides a data backup and recovery method and device, electronic equipment and a storage medium, and the method comprises the steps: constructing to-be-backed-up BIO metadata containing segment information, enabling the to-be-backed-up BIO data to be backed up in a sector granularity manner based on the to-be-backed-up BIO metadata, and enabling the to-be-backed-up BIO metadata to be backed up in a sector granularity manner. The segment length of each to-be-backed-up segment under different file systems is the integral multiple of the sector length, so that the backup mode can be compatible with file systems of which the segment length is not in block alignment, each to-be-backed-up segment can be stored in a corresponding group of target sectors, the problem of truncation does not exist, and in addition, the backup efficiency of the to-be-backed-up segment is improved. In the recovery process, the segment structure of the backed-up BIO data can be determined on the basis of the segment information, then data recovery is conducted on the backed-up BIO data on the basis of the segment structure, and due to the fact that the segment structure is the same as the segment structure of the original BIO data, the recovered target BIO data can be kept consistent with the original BIO data.

A computer program product, system, and computer implemented method for automatic, repetitive, and gradual shrink of very large database object structures. The approach disclosed herein generally comprises an iterative best efforts approach to automatically shrink a large database object structure(s). The process may comprise identifying a large object (LOB) structure shrink event and LOB structure or LOB structure segment to be shrunk. And executing a shrink operation on the LOB structure or LOB structure segment without blocking access to other extents in the LOB structure or LOB segment structure. This process allows an extent to be shrunk and deallocated. As a result, the process can operate to continually clean a LOB structure or LOB structure segment to decrease fragmentation within the extents of the LOB structure or LOB segment structure.

Embodiments of the present application provide a data processing method and device based on a line segment tree structure, equipment and medium, the method comprises: after the oracle contract receives the first transaction request sent by the business contract, the first request condition corresponding to the first condition hash value is obtained based on the first transaction request, and the condition hash value matched with the first condition hash value is found in the line segment tree structure of the on-chain storage space. If not found, the oracle contract is called to send the first off-chain query request for the first request condition to the off-chain oracle, so that the oracle returns the first off-chain business data to the oracle contract. The received first off-chain business data is taken as the first business data by calling the oracle contract, and the first business data and the first condition hash value are updated to the tree node associated with the first request condition in the on-chain storage space. By using the embodiments of the present application, the utilization rate of off-chain data can be improved, and the waste of storage resources can be avoided.

The embodiment of the invention relates to the technical field of data processing, and discloses an efficient management method and device for congestion degree data, a medium and a product. The method comprises the following steps: acquiring congestion degree data of at least two monitored target road sections; establishing a line segment tree, and initializing the line segment tree; determining congestion degree superposition data of the intermediate node and the root node according to the congestion degree data recorded in each leaf node and a data superposition rule of the line segment tree; a maximum heap is established, and the maximum heap is initialized; adjusting the position of each node in the maximum heap to obtain the maximum heap conforming to a data incremental rule; and in response to a query request of congestion degree data, feeding back a query result according to the line segment tree and / or the maximum heap. By the adoption of the scheme, real-time updating of the data can be achieved, after the query request is received, a quick response can be obtained, the query result can be accurately returned, and the processing efficiency of data query is improved.

An access object (AOB) service receives a restore stream from a client for a file managed by a deduplication filesystem. The file is represented by a segment tree including segments in an upper level referencing chunks of the file. The upper level segments are grouped into similarity groups and the similarity groups are assigned to deduplication object (DOB) services. The upper level segments are iterated over to open multiple internal read-ahead streams from the AOB service to the DOB service to populate a read-ahead cache maintained at the AOB service. The restore stream is serviced using the read-ahead cache.

This invention provides a method for constructing relationships in a land spatial information model (TIM), relating to the field of data processing. Specifically, it includes the following steps: generating a three-segment structured code for geographic entities; constructing a "topological potential field emergence engine for geographic entity relationships" based on the generated three-segment structured code, automatically deriving multi-dimensional relationships between geographic entities, and outputting a standardized and evolvable geographic entity relationship map; and achieving integrated coding fusion and application across provinces, cities, and counties based on a hierarchical mapping knowledge base and a resource code fusion model, supporting smooth migration of existing data and end-to-end business collaboration. The technical solution of this invention overcomes the problem in existing technologies where the association logic between various domains and TIM geographic entity relationships is not yet clear, making it difficult to support the integration of multi-dimensional geographic entity relationships based on time, attributes, and business.

The application provides a graph stream time query method based on a FlatMap line segment tree, and belongs to the technical field of data processing, and comprises the following steps: finding a corresponding storage location in a graph stream summary storage structure according to a target query edge; the graph stream summary storage structure comprises a hash compression matrix and a buffer area, each cell in the hash compression matrix comprises a fingerprint pair of a stream edge and a group of FlatMap line segment trees; decomposing a target query range to corresponding intervals in the pre-updated FlatMap line segment trees to obtain a queryable subinterval set; finding all nodes corresponding to the queryable subintervals in the pre-updated FlatMap line segment trees according to the corresponding storage location found in the graph stream summary storage structure and the queryable subinterval set, and taking the sum of the weights saved in the found nodes as a graph stream time query result. The method provided by the application reduces hash collision, improves query accuracy, and effectively reduces query delay.

The invention belongs to the technical field of modeling and analysis of a shield tunnel segment lining structure, particularly relates to an intelligent modeling and analysis method for a shield tunnel distributed tenon type segment lining structure, and aims to solve the problems of high manual dependence, difficulty in batch operation, low result processing efficiency and the like in the modeling process of the shield tunnel segment structure. A whole set of shield segment modeling and simulation full-process automation method which takes a Python script as a core and is based on an Abaqus secondary development platform is provided. According to the method, a traditional modeling process of gradual interaction of a graphical user interface depending on Abaqus is converted into an automatic modeling mode driven by a full-process script, and a complete closed loop of automatic input of structural parameters, automatic construction of a geometric structure, automatic execution of Boolean cutting and automatic deployment of grid division is achieved. Meanwhile, the technology of the patent supports parameterized modification, can easily adapt to various structures with different radiuses, concave-convex tenon arrangements and bolt angles, and greatly enhances the reusability and engineering universality of the model.

Cloud units are maintained in cloud storage. Each cloud unit includes containers including data containers storing segments of files, segment tree containers storing upper-level segments of segment trees representing the files, and cloud containers storing headers from the data and segment tree containers. A header for a data container includes fingerprints identifying the segments of files. A header for a segment tree container includes fingerprints identifying the upper-level segments. A cloud unit is attached to a storage appliance in one of a read-write state or a read-only state by recovering, from cloud storage, to a local storage of the appliance, at least the cloud containers associated with the first cloud unit. While the cloud containers are being recovered, a request is received to access a segment tree of the cloud unit. The request is redirected to cloud storage.

The embodiment of the application belongs to the technical field of research and development design, is applied to the data management and statistics scene under the big data scale, relates to a data management and statistics method based on a dynamic open point line segment tree and related equipment thereof, all task index data in the source database is arranged and analyzed by the dynamic open point line segment tree data structure, when secondary analysis is performed on all task index data in the source database subsequently, the arrangement and summary results of the dynamic open point line segment tree data structure can be directly used for secondary analysis, compared with direct analysis from the source database, the time complexity of query and update is reduced from O(N) to O(logN), and the analysis efficiency of subsequent secondary analysis is improved. The application can be applied to the management and statistics between insurance sales prices and sales, the insurance sales price is taken as task index data, and the sales is taken as the statistical result at different nodes, so that the statistical analysis efficiency between the insurance sales price and the sales is improved.

Cloud units in cloud storage include containers including data containers storing file segments, segment tree containers storing upper-level segments of segment trees representing the files, and cloud containers storing headers from the data and segment tree containers. A header for a data container includes fingerprints identifying the file segments. A header for a segment tree container includes fingerprints identifying the upper-level segments. A storage appliance stores a first level of metadata for each cloud unit in a read-write state, a second level of metadata for each cloud unit in a read-only state, and a third level of metadata for each cloud unit in an offline state. The third level requires less storage than the first and second levels. The second level requires less storage than the first level. The limited metadata space of the appliance is managed by maintaining at least a subset of cloud units in the read-only state.

The application discloses a kind of secondary design methods of topologically optimized bridge, comprising: the shape profile and size of bridge are preliminarily designed;The grid structure of bridge is generated to determine the material distribution and geometry of bridge;The grid structure is generated 3D structure with cavity by scaling and stretching;3D structure is divided into multiple segmented structures to facilitate the 3D printing of segmented structure;Determine the reinforcement of bridge and its arrangement to improve the tensile and crack resistance of bridge;Finite element analysis is carried out on the bridge after secondary design;Judge the strength, deformation and whether reasonable of bridge, if reasonable, then proceed to the next step, if not reasonable, then repeat the foregoing steps;Based on 3D structure, multiple segmented structures and the reinforcement of bridge and its arrangement, generate secondary design structure and generate the 3D printing file of bridge.The application solves the problem of insufficient structural performance, high manufacturing complexity and high cost of topologically optimized design bridge.

The invention discloses a cooperative tracking and surrounding method and system based on an improved MADDPG, and relates to the technical field of multi-agent cooperative decision making, and the method mainly comprises the steps: constructing a reward function, setting the priority of each experience sample in an experience library, constructing a line segment tree, carrying out the sampling of the experience library through the line segment tree, and carrying out the calculation of the priority of each experience sample in the experience library. And independently updating each agent, updating the priority of the experience samples in the experience library, carrying out circular sampling until training convergence is carried out to obtain the trained agents, and carrying out cooperative tracking and hunting according to the trained agents. By implementing the cooperative tracking hunting method and system based on the improved MADDPG provided by the invention, the high cooperative tracking hunting efficiency of the unmanned aerial vehicle and the unmanned ship can be improved.

Data migrated from a deduplicated storage appliance are stored as cloud units at cloud storage. Each cloud unit includes containers including data containers storing segments of files, segment tree containers storing upper-level segments of segment trees representing the files, and cloud containers storing headers from the data and segment tree containers. A header for a data container includes fingerprints identifying the segments of files. A header for a segment tree container includes fingerprints identifying the upper-level segments. The cloud units are maintained in different states of accessibility including read-write, read-only, and offline. Upon detecting that local storage of the appliance does not have space to support a cloud unit in a read-write or read-only state, another cloud unit that is in a first state is selected, the first state being the read-write or read-only state. The selected cloud unit is placed in a second state, different from the first state.

The invention relates to the technical field of model training, in particular to a large-scale GPU (Graphics Processing Unit) cluster hybrid parallel model training method, which comprises the following steps of: acquiring a model parameter updating record of each node of a GPU cluster, counting parameter occurrence density and generating density characteristics; extracting a maximum density parameter, comparing the maximum density parameter with the minimum node offset, and obtaining a task parameter segment structure offset block; constructing a path complexity score, and generating a path complexity result after sorting; the uploading delay proportion is compared with the maximum value, and a delay difference analysis result is generated; and generating a node training rhythm regulation and control result according to an analysis adjustment task segment state. According to the method, the task segment structure in the GPU cluster is optimized and adjusted, the occurrence frequency of each model parameter in continuous training rounds is counted, the parameter density feature of each node is analyzed, and then the parameter with the highest density is extracted, so that the problem of uneven load in model training is solved.

An access object (AOB) service receives a restore stream from a client for a file managed by a deduplication filesystem. The file is represented by a segment tree including segments in an upper level referencing chunks of the file. The upper level segments are grouped into similarity groups and the similarity groups are assigned to deduplication object (DOB) services. The upper level segments are iterated over to open multiple internal read-ahead streams from the AOB service to the DOB service to populate a read-ahead cache maintained at the AOB service. The restore stream is serviced using the read-ahead cache.

The invention provides a ship body section shelving deformation simulation analysis method considering a time effect, and aims to solve the safety problem that an evaluation result deviates from reality due to the fact that a time factor is not counted in a long-term shelving scene in traditional finite element analysis. According to the method, stress and deformation data of existing real ship construction segments in shelving states in different time periods are obtained, a segment structure stress and deformation data set in an ideal state is obtained through a segment structure simulation model, and a structure simulation analysis deduction model under a time effect is constructed in combination with a machine learning algorithm. Therefore, analysis of structural deformation of a time factor is added. According to the method, the stress and deformation data of the segmented shelving state under the time effect are obtained through a machine learning algorithm, the stress and deformation under the time effect are further considered on the basis of traditional finite element analysis, the segmented shelving safety is evaluated more comprehensively, a judgment basis is provided for a shelving scheme, and the safety of the shelving scheme is improved. And the safety and reliability of the ship building process are ensured.