109 results about "Linked list" patented technology

The application relates to the technical field of memory detection, in particular to a memory usage tracking method and a storage medium. The method constructs a target memory block containing a header space and a data space through obtaining a memory allocation request, records memory management information in the header space, and hangs the target memory block to a ring-shaped bidirectional linked list; in a memory access process, the validity of the target memory block is checked and access time information is updated, and safe release is performed according to the memory management information when releasing; through periodic traversal of the ring-shaped bidirectional linked list, in combination with the time information and the reference state of the target memory block, a memory usage tracking result is generated, and continuous monitoring and abnormal occupation analysis of the memory life cycle are realized. The application realizes traceability, checkability and analysis of the memory usage state, thereby effectively improving the safety, reliability and problem positioning efficiency of memory management.

This application discloses a buffering method, apparatus, computer device, and medium based on a dynamic linked list structure. The method includes: upon receiving a new request carrying a transaction identifier, obtaining the address of a free buffer item from the global buffer pool's available address management queue, allocating the free buffer item address to the new request, updating the information of the queue information table corresponding to the transaction identifier, recording the state information of the dynamic linked list in the queue information table, and recording the linking relationships of the dynamic linked list in the global buffer pool storage; upon receiving return data carrying a buffer item address and a transaction identifier, accessing the corresponding buffer item according to the buffer item address and storing the return data; querying the queue information table according to the transaction identifier, determining the submission order of the returned data based on the dynamic linked list state in the queue information table and the linking relationships in the buffer items, and performing a submission operation, while simultaneously reclaiming the addresses of submitted buffer items to the global buffer pool's available address management queue.

The present application provides a method for querying a high-connectivity shortest influence path between users, a device, and a product. The method includes: constructing an indexed linked list data structure based on an obtained social network graph; determining, based on the indexed linked list data structure, a start node, a target node, and a path connectivity in a current iteration, whether there is a shortest influence path satisfying the path connectivity in the current iteration; if yes, updating a minimum path connectivity in a previous iteration and determining the path connectivity in the current iteration based on the minimum path connectivity; or if no, determining the path connectivity in the current iteration as a maximum path connectivity in the previous iteration; and continuing the iteration based on the maximum path connectivity and the minimum path connectivity until a high-connectivity shortest influence path is determined.

This invention provides a method, medium, product, and device for session connection management during database playback. The method includes: receiving a session identifier from a session during playback; generating an allocation identifier based on the low-order byte of the session identifier; determining a target pointer array corresponding to the session in a pre-set session management table based on the allocation identifier, wherein the session management table pre-sets a predetermined number of pointer arrays, each pointer array corresponding to a singly linked list and pointing to the head node of the corresponding singly linked list; determining whether a target node matching the session identifier exists in the target singly linked list corresponding to the target pointer array; if no target node exists in the target singly linked list, creating a new connection node and inserting the new connection node into the target singly linked list. This method enables rapid generation of the allocation identifier based on the low-order byte, and achieves rapid location and efficient storage of session nodes using a singly linked list structure, ensuring the stability and smoothness of high-concurrency playback processes.

The present application belongs to the field of substation communication configuration, and particularly relates to a kind of SCL file comparison method and system.The present application establishes the node model corresponding to each node in SCL file, avoids traversing when comparing, saves traversal time, and when establishing node model, only the attribute information and the subnode information needed for node comparison are modeled, so the comparison of these nodes and attributes can be saved;when comparing nodes or their subnodes, the node content is first texturized, only the text content is compared to see if it is the same, and the text comparison method is optimized, which can quickly determine whether the node content is different, and if not, the comparison of the specific content of the node can be directly saved;and when comparing multiple node subnodes, the unique key attribute is matched, and the key attributes of each subnode in the two files are stored as a linked list and a hash table respectively, ensuring the order and retrieval speed of the results of multiple node subnodes.

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.

The invention provides a page transition display device and method and a related product. The device comprises a gesture recognition module, a page management module, a UI frame module, a linked list management module, a model transformation module and a rendering display module. Wherein the page management module monitors gesture operation executed by a user in real time through the gesture recognition module, when a page transition event is recognized, a GPU instruction is generated for the page transition event through the UI frame module, and a first linked list and a second linked list are created and managed through the linked list management module on the basis of the GPU instruction. According to the method, image rendering can be carried out while 2.5 D conversion is executed in a mode of running double linked lists through double threads, so that the idle waiting time of a GPU (Graphics Processing Unit) is shortened, and the smoothness of page transition animation is improved.

The invention relates to two computer-implemented methods for storing medical data. One of the methods comprises: continuously receiving successively generated medical data packets (2), each comprising a start time (3), an end time (4), and a data packet value (5) that describes a sum of medical measurements (1) acquired between the start time (3) and the end time (4); determining a total value (6) for each received medical data packet (2) by adding the data packet value (5) according to the respective medical data packet (2) with the data packet values ​​of at least some of the received medical data packets (2) generated prior to the respective medical data packet (2); and storing medical data by storing the respective medical data packet (2) together with the respective determined total value (6) in a linked list (7) and / or in a data field (8).

This disclosure provides a mapping table caching control method, a mapping table query method, and related apparatus. The method includes: when the current mapping relationship is continuous with the previous mapping relationship cached in the memory controller, incrementing the continuity count by 1 and caching the current mapping relationship in the memory controller; when the current mapping relationship is not continuous with the previous mapping relationship, comparing the continuity count with a preset threshold; if the continuity count is greater than the preset threshold, organizing the continuous mapping relationships cached in the memory controller using a combination of a first data structure and a linked list and storing them in a first mapping table cache unit; clearing the continuous mapping relationships cached in the memory controller; caching the current mapping relationship in the memory controller and setting the continuity count to 1; the preset threshold is a positive integer greater than 1, which improves storage space utilization and the efficiency of updating the mapping table, and reduces the table refresh frequency.

The disclosure reduces a memory footprint of a hash table that employs chaining as a collision avoidance solution. The methods and systems disclosed herein enable the use of chaining collision handling while reducing a memory footprint by storing parts of a tag and a link list pointer associated with a linked list that contain useful information, without storing parts of the tag and pointer that do not contain useful information. The linked list pointer and a hash key are packed together without reducing either size, and without using additional memory overhead.

A memory system with content-addressable entries supporting scalable, low overhead, in-fight establishment and retirement of resource-based linked lists, and related methods of operation and computer-readable media. The memory system can be used to track and establish an ordering of in-flight instances of access to a resource through a linked-list of content-addressable entries established in the memory system corresponding to such resource. Entries in the memory system that represent instances of access to a given resource can each be established as part of a linked list associated for the given resource to track a priority order for multiple instances of access the resource and then retired when an instance of access has been completed as part of a tracking system, such as to avoid hazards. The memory system provides a way to establish entries in a linked list for in flight instances of access to a resource for ordering and tracking.

The application relates to a one-way scanning method, device, storage medium and simulation method, which are used for layout feature parameter extraction. The method comprises the following steps: scanning all polygons in a layout, recording vertex coordinates of the polygons, and reserving vertical edges and oblique edges of the polygons; traversing the oblique edges of the polygons, obtaining intersection coordinates of the oblique edges and the vertical edges and intersection coordinates of the oblique edges and the oblique edges; determining scanning nodes after removing and sorting all the obtained coordinates, and forming scanning areas between two adjacent scanning nodes; respectively scanning the scanning areas along a first axis direction, reserving effective result edges of all the scanning areas according to a result of Boolean processing of the polygons, and constructing an effective result edge linked list according to a pairing condition of the effective result edges of adjacent scanning areas; and based on the effective result edge linked list, arranging to obtain result polygons as the result of the Boolean processing of the polygons in the layout. Through management of the effective result edges and the linked list, the layout graph scanning processing efficiency is improved.

This application discloses a data processing method, apparatus, computer device, and storage medium, belonging to the field of computer technology. The method includes: acquiring three-dimensional model data, which is used to render to a screen; rasterizing the three-dimensional model data to obtain multiple fragments, adding each fragment to a linked list of its respective pixel position, each fragment including a pixel position and depth; for any pixel position on the screen, merging the multiple fragments in the linked list according to their depth order to obtain display information for the pixel position; and displaying the image on the screen based on the display information for each pixel position. This application uses a dynamic linked list to maintain multiple fragments corresponding to each pixel position, enabling correct merging without relying on hardware mechanisms, reducing GPU computing resources, saving video memory, and improving rendering performance.

This invention provides a method, apparatus, electronic device, and storage medium for converting control programs. The method includes: storing instructions from a non-standard control program in a first global instruction list in line-by-line order; storing variables and their data types in a variable mapping table; inserting and deleting ladder identifiers in the first global instruction list according to the positions of the first operator and the serial block operator of the parallel loop to obtain a second global instruction list; inserting omitted instructions in the second global instruction list according to the operators of each instruction in the second global instruction list to obtain a third global instruction list; and determining a standard control program based on the third global instruction list and the variable mapping table. This invention enables the conversion of non-standard control programs into standard control programs.

The application discloses a kind of based on message dissemination rate's cache management strategy, comprising the following steps: S1, entire map is divided into different areas, and map model is established;S2, according to the hop number that message experiences, the time length that message enters cache queue, node residual cache space size and message size, message preservation rate is calculated;S3, message model is established, and according to the link information in message model, the moving entropy of message is calculated;S4, according to message moving entropy and message preservation rate, message dissemination rate is calculated;S5, the cache queue of node is divided into protection queue and ordinary queue, and according to message dissemination rate and the queue of division, different forwarding strategy and message discarding strategy are executed.The application calculates the moving entropy of message by researching the area that message forwarding passes through to evaluate the degree of message diffusion.Meanwhile, cache queue is divided, and according to the length of time that message enters queue, it is placed in different queue, and the overall performance of algorithm is improved.

This application provides a data processing method, electronic device, medium, and product; wherein, the method includes: obtaining a time parameter when target data enters the cache and the lifespan of the target data; the time parameter includes a count value of a global counter; inserting the target data into a classification list based on the lifespan and the count value; the classification list is used to aggregate data with the same expiration time and expiration cycle; cleaning the target data based on the classification list, which can aggregate data with the same expiration time and expiration cycle together, and realize efficient querying and cleaning of expired data.

The application discloses a grid division method for a closed cylindrical surface with complex boundary constraints, and comprises the following steps: obtaining a plurality of boundary rings of the closed cylindrical surface and a plurality of parameters from a solid model, wherein the parameters comprise a coordinate system of the closed cylindrical surface, a radius of the closed cylindrical surface and an axial direction of the closed cylindrical surface; sequentially performing discrete calculation on each edge in each boundary ring of the closed cylindrical surface to obtain a plurality of discrete points; all the discrete points corresponding to the boundary ring form a discrete point linked list corresponding to the boundary ring; the arrangement order of the discrete points in the discrete point linked list is consistent with the arrangement order of the discrete points in the edge; each discrete point in the discrete point linked list corresponding to each boundary ring is subjected to mapping transformation to obtain a corresponding plane mapping point, and a mapping relationship between the plane mapping point and the corresponding discrete point is established. The application can solve the technical problem that there is no grid division method for a closed cylindrical surface with complex boundary constraints.

This invention discloses a digital video receiving control system and method based on an airborne hybrid fiber optic link, relating to the field of digital video transmission and processing. The system includes multiple fiber optic channel MAC units, a receive scheduling and management unit, a line image framing unit, a receive buffer, a line image logical ID linked list, a receive buffer management unit, an image restoration unit, and a configuration and status register group. The receive scheduling and management unit receives video data frames from the available fiber optic channels; the line image framing unit reassembles the video line data and generates the first line arrival signal; the receive buffer management unit writes the data into the buffer and updates the linked list; the image restoration unit responds to the first line arrival signal and reads the data in the linked list order to restore the image. This invention solves the problem of reliable reception and image restoration of asynchronous video streams from multiple fiber optic channels, and has the advantages of clear structure, flexible configuration, and high reliability.

This invention aligns with the development trend of multi-scenario and multi-mode civilian radar. Addressing the core needs of multi-task adaptation, electromagnetic interference suppression, and flexible performance upgrades, it designs an intelligent radar signal processing architecture that meets the three standards of "functional scalability, performance upgradeability, modularity, and standardization," with deep decoupling of hardware and software and support for online software upgrades. This architecture adapts to the radar sensing and detection needs in complex electromagnetic environments. The architecture consists of three layers: hardware, system software, and intelligent applications. The hardware layer adopts a 3U VPX cableless platform, achieving flexible interconnection and expansion of multiple modules through star-flash technology. The system software layer extracts the common functionalities of radar imaging, altimetry, monopulse detection, and electronic reconnaissance, breaking them down into 4 categories and 8 standard modules, supporting dynamic module reconfiguration based on a linked list structure. The intelligent application layer includes 8 types of software applications (APPs). The intelligent decision-making APP generates radar operating modes, parameters, and timing strategies, driving other APPs to complete parameter configuration and achieving adaptive adaptation to multiple civilian scenarios.

This invention discloses a dynamic memory scheduling method and apparatus for an industrial control terminal collaborative response system. The method includes creating a free linked list block based on the memory space status of the industrial control terminal collaborative response system; when a process requests memory space, allocating a free memory block to the process using a pre-set algorithm; when a free memory block is allocated to the requesting process, tracking ownership of the code segment, data segment, and stack segment; and when the process finishes running, releasing the memory and reclaiming ownership of the memory address space occupied by the process. This method, based on the ownership mechanism and type-safe language features of the system programming language Rust, designs a memory storage manager, achieving performance and reliability assurance for dynamic memory scheduling, and improving the overall operating performance and security of the industrial control terminal collaborative response system.

This application provides a method for generating an embedded instrument display settings interface, an embedded instrument, a product, and a medium, relating to the field of display technology in industrial software. The model layer generates a linked list structure to manage menus and pages; the controller layer parses key events into logical instructions; the model layer updates IDs and retrieves page information accordingly; and the view layer fills display units to complete the interface refresh. Each layer has clearly defined responsibilities, separating data, logic, and display. Modifying a page only requires adjusting the content of the corresponding layer, without affecting other parts. This avoids high code coupling, reduces the workload and error rate for developers in identifying relationships and modifying code, improves development efficiency, enhances the flexibility and maintainability of interface development, and achieves system-level optimization.

This disclosure relates to the field of garbage collection technology, and discloses a method, apparatus, computer device, and storage medium for garbage collection of solid-state drives (SSDs). The method includes: determining a first collection unit requiring garbage collection when garbage collection is needed; obtaining a first collection unit segment list from the host file system; the first collection unit segment list records segments belonging to the first collection unit; determining whether each segment in the first collection unit segment list is valid; if valid segments exist in the first collection unit segment list, rewriting the data corresponding to the valid segments to a second collection unit, and writing the valid segments to the second collection unit segment list of the second collection unit; if invalid segments exist in the first collection unit segment list, releasing the storage space corresponding to the invalid segments. This disclosure allows garbage collection at the host file system level, helping to improve system QoS.

This invention discloses a method, apparatus, computer device, and storage medium for data augmentation in multi-turn dialogue. The method includes: acquiring text corpus to create a knowledge point tree structure; traversing the nodes in the tree structure to create a knowledge singly linked list path; performing question-and-answer pairing based on the nodes in the singly linked list path to obtain a first question-and-answer pair; acquiring seed tasks and filling them into the singly linked list path; generating answers for the singly linked list path using a generative language model; then pairing the nodes and answers in the singly linked list path to obtain a second question-and-answer pair; concatenating the first and second question-and-answer pairs into a third question-and-answer pair and converting it into a question-and-answer pair vector to construct a dataset for augmenting and training the generative language model to obtain a dialogue prediction model for dialogue prediction. This invention solves the problem of low accuracy in dialogue prediction generated by generative language models in multi-turn dialogue tasks by obtaining a dialogue prediction model through data augmentation training and performing dialogue prediction.

This application discloses a page positioning and verification method and system based on AI planning, relating to the field of interface execution control technology. The method includes: obtaining a target description sheet based on an artificial intelligence planning model; identifying the page to obtain a page fragment table; driving the page to scroll according to a set scrolling step size based on the page fragment table, and recording the scrolling to obtain a transit record table; associating page fragments determined to be continuous segments to obtain a same-body linked list; filtering objects based on the target description sheet, transit record table, and same-body linked list to obtain a same-object positioning table; obtaining an operation landing point table based on the same-object positioning table and same-body linked list, and determining the target action position; determining the state region boundary to obtain a state region table; and performing consistency verification to obtain the verification result. This application can improve the stability of page positioning and verification.

The application discloses a kind of security chip and its multi-application management method, device and storage medium, it is related to chip technical field.The method comprises the following steps: in response to external command, target application and target management requirement are determined according to external command by management task;If target management requirement is to create target application, the application management handle of target application is created, and the application management handle is added to application management linked list, and the processing task of target application is created;When the processing task of target application is scheduled to execute, the application management handle of target application is obtained from application management linked list, and the command set in application management handle is searched using application processing framework function to find security function function table, obtain target security function function, and execute target security function function based on command data in application management handle.The method not only can realize the dynamic management of application, including dynamic creation, but also can reduce code compilation, application loading complexity, and reduce storage space occupation.

The application discloses a kind of electric power communication service data translation method, system, device and storage medium, method includes steps: obtaining electric power communication service data, obtaining service routing data from the electric power communication service data;The service routing data is converted into structured linked list data;The structured linked list data is input to pre-trained bidirectional LSTM network and carries out machine translation, and the bidirectional LSTM network output restores link sequence.The application does not need to rely on character level matching large-scale data set, and fully utilizes data context semantic information, solves the problem that site meaning is not clear due to data multi-sourcing, improves the accuracy and reliability of data matching, reduces the labor cost of carrying out data cleaning work.

This invention provides a shared receive queue (SRQ) cache management method, device, and medium, relating to the field of SRQ cache management technology. The method includes: maintaining a cache queue of software SRQ objects in the kernel driver; determining the number of nodes n to be retrieved this time based on the number of descriptors that the target queue needs to supplement in the hardware receive queue; managing the retrieved n nodes through the private head and tail pointers of the target queue to form a private incomplete receive request linked list for the target queue; when the target queue is destroyed or the receive request in the corresponding private linked list fails to be issued, returning the incomplete node linked list in the private linked list to the cache queue; appending the returned linked list to the tail or head of the cache queue according to the current state of the cache queue; this invention enables efficient and secure flow of receive request.