54 results about "Doubly linked list" patented technology

The invention provides a method and a system for quickly and accurately jumping and playing an HLS (HTTP Live Streaming) video, which are characterized in that an m3u8 file is downloaded and analyzed, a detailed index of a TS (Transport Stream) fragment is constructed, the TS fragment is downloaded and stored in a local cache in a multi-cache mode, an FFmpeg tool is adopted to pull data in the local cache, then de-multiplexing, decoding and rendering are performed, and an intelligent Seek algorithm is utilized to quickly and accurately jump and play the HLS video. The TS fragment near the target time point can be quickly positioned in Seek, and the TS fragment is intelligently shifted forwards for a certain time to start downloading. The system comprises an m3u8 index file downloading and analyzing module, a double linked list construction module of TS fragments, a total byte number acquisition module of the TS fragments, a multiple cache module, an FFmpeg tool module and a Seek jump module. The method has the beneficial effects that rapid and accurate jump playing of the HLS video is realized, when the TS fragment is too long and the network condition is not ideal, the Seek operation waiting time of the user is effectively reduced, and the watching experience of the user is improved.

Embodiments of the invention relate to the technical field of data processing, and disclose a PDF document generation method and apparatus, an electronic device and a storage medium, the method comprising: obtaining first page data, the first page data being determined by first HTML data input by a user on a target layout style; according to the first page data, a double linked list is constructed, and nodes in the double linked list are used for storing types, contents and styles of HTML elements; converting nodes in the double linked list into document object model (DOM) elements; and generating the PDF document according to the DOM element. By applying the technical scheme, the accuracy of exporting the HTML data into the PDF document can be improved.

The invention discloses a SOCKET communication receiving method for variable-length data packets, which relates to the technical field of computer network data transmission, and comprises the following steps of: establishing a user-defined communication protocol containing a length field, a number field and a CRC-32 checksum field, and matching with a dynamic management mechanism of a double linked list segmented buffer area of a receiving end, so that the data packets with different lengths can be received. According to the method and the device provided by the invention, the efficient receiving of the variable-length data packet is realized, a receiving end predicts the buffer extension amount through a sliding window historical array, and the problems of memory waste, data loss, packet sticking, disorder and the like caused by a traditional fixed buffer are solved by combining incremental CRC-32 verification and segmentation-level accurate retransmission, so that the memory utilization rate and the data transmission integrity are improved.

The invention discloses a page table data distribution method and device, equipment and a medium. The page table data distribution method comprises the following steps: based on a test request of an MMU circuit, reading non-required parameter interface input data and required parameter interface input data; inputting data based on the non-necessary parameter interface, and creating a target page table tree; and managing an address allocation space of the target page table tree according to the necessary parameter interface input data and the double linked list structure, and allocating page table data to the address allocation space of the target page table tree while traversing the target page table tree. According to the technical scheme provided by the embodiment of the invention, the page table data generation efficiency can be improved, the data dependence of page table data distribution is broken, and the requirement of MMU IP level large-scale random testing can be met.

The invention discloses a hierarchical access authority management method of a behavior monitoring system, which relates to the technical field of authority management, and comprises the following steps: generating situation nodes according to multi-dimensional characteristics of behavior events, packaging changes into a traceability log, and incrementally updating affected sub-graphs; abstracting multi-level element roles according to activity and sensitivity threshold domains, maintaining a sorting double linked list and constructing a skip list index; mapping the element role into a fuzzy cognitive node, establishing a bidirectional fuzzy edge weight, and dynamically adjusting to generate a credible factor; constructing a cross authorization matrix storage basic permission set; and mapping an authorization request to a situation node, retrieving a latest state, positioning a user element role level, extracting a matrix basic permission set through a skip list index, and generating and issuing an authorization result after cutting based on a credible factor. Incremental maintenance is realized by updating a local sub-graph and a skip list index through a traceability log, and authorization efficiency, flexibility and security are improved by combining fuzzy cognitive mapping and dynamic credible factor fine permission through context mapping of a cross authorization matrix.

The invention provides a processing device and system for realizing high-performance cache based on a single-port RAM (Random Access Memory) and a data reading and writing method. The processing device comprises an array module for dividing a high-capacity RAM into n single-port RAM arrays; the bank balanced scheduling module is used for realizing read-write operation in the same beat through bank balanced scheduling and a conflict avoidance mechanism; and the freeaddrctrl module and the nextpoint module are used for managing a data address through a double linked list so as to realize dynamic address management. According to the technical scheme, the processing device and system and the data reading and writing method have the advantages that high performance is guaranteed, the area and power consumption are remarkably reduced, time sequence design is simplified, and the method is suitable for high-bandwidth data processing scenes.

The invention discloses a data recommendation method and device, electronic equipment and a computer readable medium, and relates to the technical field of computers.The method comprises the steps that in response to a data recommendation request, a corresponding grouping identifier and an abnormal identifier are obtained, and a corresponding recommendation value hash table and a follow-up visit plan identifier hash table are determined according to the grouping identifier and the abnormal identifier; the recommendation value hash table stores recommendation values and corresponding double linked lists, and the follow-up plan identifier hash table stores follow-up plan identifiers and corresponding linked list nodes; obtaining preset index updating data in real time, obtaining a new recommendation value based on the preset index updating data, and updating the position of the corresponding linked list node according to the new recommendation value in response to the fact that the new recommendation value is inconsistent with the original recommendation value to obtain an updated double linked list; and based on the updated double linked list, generating a target recommended follow-up visit plan identifier list and pushing the target recommended follow-up visit plan identifier list to the target terminal. The efficiency of doctor screening and follow-up visit plan sending is improved, and the matching degree of the follow-up visit plan and the current condition of the patient is improved.

The application discloses a kind of real-time database monitoring methods based on ordered queue, including according to system design throughput and machine configuration, set initial parameter respectively set working thread and distribution thread number and memory capacity alarm threshold, according to the number of working thread adjustment shunt storage queue number ensure that thread queue number match, management node starts, start receiving heartbeat request, and according to preset hash algorithm is shunted storage, new received heartbeat request is stored in ordered double linked list queue head, then according to host IP information to hash table inquires whether heartbeat record exists, if the new received heartbeat record does not exist, for new online client, client information is stored to hash table then triggers new online event and persists to client database table write-in process ends.The application solves the problem that a large amount of data heartbeat information detection detection complexity rises exponentially with data volume rising by hash and double linked list structure.

The application provides a method for optimizing virtual NVMe read-write performance through an LRU algorithm and a virtual NVMe system, and the method comprises the following steps: constructing a cache management architecture in cooperation with a hash table and a double-linked list, quickly positioning a cache node corresponding to an internal address of an SSD through the hash table, and managing the access order of the SSD address through the double-linked list; when the NVMe performs an SSD read-write operation, the LRU algorithm is first called, and if there is no address in the hash table to execute the read-write file; a linked list order adjustment thread is created when the LRU algorithm is initialized, the node data of the longest non-accessed node exceeding the length of the linked list is flushed to the SSD mirror file, and then the node is deleted; when the read-write data is greater than the size of the linked list node data, the hash mapping is refreshed. The application combines the LRU algorithm, maps the commonly used internal address of the SSD and the corresponding data block, directly operates the memory to read and write the commonly used data, optimizes the read-write mode of the existing virtual simulation NVMe, and further improves the performance of the virtual simulation NVMe in the virtual hardware system.

According to the updating method of the FC switch monitoring lookup table based on the LFU, the storage of the monitoring port lookup table is realized by adopting the idea of Robin Hood Hashing, and according to the strategy, a key with a longer detection distance hijacks the position of a key with a shorter detection distance when a Hash conflict occurs during insertion, so that the query performance is optimized, and the updating method is suitable for a high-performance network scene; secondly, modular design is adopted, message IDs existing in a monitoring port lookup table are stored in a grouped mode according to the access frequency through a dictionary and a double-linked list structure, and global sorting is avoided; thirdly, when the message ID stored in the monitoring port query table is full and updated, a double-layer elimination strategy is adopted, the message ID which is least recently used can be efficiently positioned, all frequencies do not need to be traversed, rapid updating is achieved, the method is suitable for a high-concurrency or large-scale FC network communication scene, and therefore the judgment efficiency of the target motion state is improved.

This application provides an intelligent routing function optimization method and system based on an intelligent vehicle power domain control platform, belonging to the field of intelligent vehicle electronic control technology. It addresses the problems of resource contention, excessive processor load, insufficient real-time performance, and poor scalability in in-vehicle network routing functions in related technologies. This method employs an architecture that separates the management plane and data plane. It pre-generates routing numbers encoding source, path, and destination information for communication relationships, and quickly extracts information based on these numbers through bit operations to execute routing decisions. Furthermore, it combines doubly linked list cache management, multi-core affinity scheduling, and multi-level resource provisioning strategies to achieve efficient cache resource management, significant optimization of processor load, and an overall improvement in system real-time performance and reliability.

This invention discloses a workshop-attached mother-daughter vehicle joint scheduling method and system, belonging to the field of intelligent manufacturing and automated logistics technology. The method is based on the Discrete Invading Weeds Optimization Algorithm. First, it reads task and vehicle information and encodes the scheduling solution using a doubly linked list structure, uniformly representing the task sequences of the mother and daughter vehicles. It calculates the fitness of the scheduling solution and determines the number of seed individuals to be generated based on the fitness. New scheduling solutions are generated using neighborhood insertion, neighborhood swapping, and path swapping operations, ensuring the logical consistency of the mother and daughter vehicle sequences and that dependency constraints are not violated. The current population is merged with the newly generated seed individuals, sorted by fitness, and the optimal individual is retained to update the global optimal solution. When the termination condition is met, the optimal solution is output as the mother-daughter vehicle scheduling scheme. This invention effectively solves the problems of complex dependency constraints, deadlock susceptibility, and low optimization efficiency in mother-daughter vehicle collaborative scheduling, achieving efficient collaborative utilization of vehicle resources.

The invention provides a method for optimizing the read-write performance of a virtual NVMe through an LRU algorithm and a virtual NVMe system. The method comprises the steps that a cache management architecture with a hash table and a double linked list cooperating is constructed, cache nodes corresponding to SSD internal addresses are rapidly positioned through the hash table, and the access sequence of the SSD addresses is managed through the double linked list; when the NVMe performs SSD read-write operation, the LRU algorithm is called firstly, and if the address does not exist in the hash table, file read-write is executed; creating a linked list sequence adjusting thread when the LRU algorithm is initialized, brushing node data which is not accessed for the longest time and is beyond the linked list length to an SSD mirror image file, and deleting nodes; and when the read-write data is larger than the linked list node data, refreshing the Hash mapping. According to the method, the LRU algorithm is combined, the common SSD internal address and the corresponding data block are mapped, the memory is directly operated to read and write common data, the read-write mode of the existing virtual simulation NVMe is optimized, and then the performance of the virtual simulation NVMe in a virtual hardware system is improved.

The invention discloses an inter-core communication method based on a PLC multi-core system, and relates to the technical field of inter-core communication, the PLC multi-core system is divided into a control core and a calculation core, and initialization configuration is carried out for different types of cores; a hybrid communication mechanism is set, the hybrid communication mechanism comprises an openAMP architecture and a shared memory mechanism, and environment establishment is carried out for the two communication modes; establishing a message type identification mechanism, and automatically classifying according to message features; constructing a self-adaptive routing algorithm to select an optimal communication mode; constructing a double linked list optimization management mechanism, calculating message priorities, and setting message sending time in a double linked list; when the PLC multi-core system sends a message, a sending core selects a core type according to the optimal communication mode, and openAMP architecture communication and shared memory mechanism communication are executed respectively according to the core type; and checking a communication result, executing an automatic retransmission strategy when the communication fails, and calculating retransmission times and retransmission intervals.

The present invention discloses a method, apparatus, device, and medium for allocating page table data. The method comprises: reading non-mandatory parameter interface input data and mandatory parameter interface input data based on a test request from an MMU circuit; creating a target page table tree based on the non-mandatory parameter interface input data; managing the address allocation space of the target page table tree according to the mandatory parameter interface input data and a bidirectional linked list structure, and allocating address space and page table data for the target page table tree while traversing the target page table tree. The technical solution of the embodiment of the present invention can improve the efficiency of page table data generation, break the data dependency of page table data allocation, and meet the requirements of large-scale random testing at the MMU IP level.

This invention relates to a dynamic bidirectional skip list storage structure and processing method for matrix data sets. The dynamic bidirectional skip list storage structure includes a data field at the bottom and an index field above the data field. The data field stores the original data, and the index field stores index data. The data field includes multiple data unit structures at the same level, and the index field includes multiple levels, each level containing multiple data unit structures. Data unit structures within the same level are linked from smallest to largest using a doubly linked list, and data unit structures at different levels are linked to the same data range using inter-level linked lists. Based on this dynamic bidirectional skip list storage structure, the calculation processes of dataset merging, difference, searching, and deletion during the optimal reordering of the power flow Jacobian matrix can be efficiently implemented, thus achieving a balance between storage and computational efficiency.

The present invention relates to a multi-channel data selection method with timing control, belonging to the field of real-time data processing for aircraft. The present invention employs a circular queue connected end to end, with each data bit in the circular queue used to store the first address of a linked list; multiple linked lists are used to store received homologous data, each linked list storing data corresponding to a data packet; a queue read pointer points to the currently read circular queue data bit; and a read sequence number variable is used to store the packet sequence number of the data packet stored in the linked list corresponding to the currently read circular queue data bit. The present invention designs a data structure combining a circular queue and a bidirectional linked list, employing a specific read and write strategy, which greatly simplifies the development difficulty of a real-time data processing system and improves data utilization.

The invention discloses a method for quickly checking whether free data exists in a qcow2 file or not. The method comprises the following steps of: 1, establishing an empty double linked list; 2, analyzing the qcow2 file, and circularly obtaining table item records of all secondary tables; step 3, establishing a chain table node for the table item of each secondary table, wherein the node comprises starting position information and ending position information; compared with the prior art, the method has the advantages that through recursion and combination of the linked list nodes, the length of the linked list is remarkably reduced, the checking efficiency of the high-capacity qcow2 file is improved, and the method is suitable for rapid fault diagnosis in the cloud computing environment.

The invention provides a multi-scale triangulation network three-dimensional reconstruction method based on Sweep-line, and the method comprises the following steps: S1, constructing a double linked list data structure which comprises a data field, a precursor pointer and a subsequent pointer; s2, on the basis of the double linked list data structure in S1, using a counter to update the number of points, edges and triangles of any data set; s3, constructing a Delaunay triangulation network by using a Sweep-line algorithm on the basis of the number of the points, the edges and the triangles of any data set updated in the S2, including processing point sorting, creating an initial triangle and inserting subsequent points; and S4, based on the grid constructed in the S3, developing an interface to add or delete points on the interior and the boundary, and meanwhile, maintaining a Delaunay condition by using an LOP process algorithm. According to the method, the grids can be quickly constructed for various or certain types of data, and the method is easily applied to different problems in the same field.

The application provides a multi-garden intelligent water meter data management method, which comprises the following steps: obtaining and numbering the equipment information of all intelligent water meters on a third-party platform; constructing a binary tree for storing the positions of the intelligent water meters, a double-linked list for storing daily water metering, and a dictionary for storing monthly water metering and water fee unit prices; setting node information of the binary tree structure according to the numbering of the equipment information of the intelligent water meters; receiving daily metering of the intelligent water meters pushed by the third-party platform by the water meter management system every day, and storing the daily metering in the double-linked list; obtaining the daily metering and water fee unit price data of the last day of the month in the double-linked list and storing them in the dictionary; and sequentially traversing the data of the binary tree, the double-linked list and the dictionary to generate a monthly metering bill. The application stores the metering of all intelligent water meters in different positions of multiple gardens in an alternating manner of hierarchical data structures of the binary tree, the double-linked list and the dictionary, so that the monthly metering bill can be intuitively queried and generated subsequently.

The embodiments of the present disclosure disclose a method, device, and electronic device for picking goods. A specific implementation of the method includes: querying the location information of the goods to be picked from a goods location database based on the identification of the goods to be picked, wherein the data in the goods location database is stored in a multidimensional data structure, and the multidimensional data structure includes multiple basic data structures, each basic data structure is used to store a key-value pair consisting of the identification and location information of a goods in the warehouse, and each basic data structure is also configured with at least three sets of bidirectional linked lists, and the at least three sets of bidirectional linked lists are used to identify the relative position of the goods relative to the surrounding goods; the location information is sent to the picking device so that the picking device runs to the position corresponding to the location information and picks the goods to be picked. This implementation method improves the efficiency of picking goods.

The invention relates to the technical field of business process approval, and provides a process data processing method, device and equipment. The process data processing method comprises the steps of obtaining record data generated in an approval process circulation process; according to the record data, the newest record data of each level of approval node is written into each linked list node of a double linked list to form the double linked list representing an approval process flow track, each linked list node corresponds to each level of approval node, and each linked list node is linked in sequence according to the order of the approval nodes; and in response to the target search request, starting from the current linked list node, searching a target linked list node from each linked list node of the double linked list according to the trend of each linked list node in the double linked list. According to the flow data processing method, the double linked list representing the flow circulation track can be generated based on the recorded data, so that tracing can be performed according to the double linked list, and the tracing efficiency is improved.

The application discloses a method and device for automatically generating a node graph based on an IROS system and a medium, to solve the technical problems of complex relationship between existing service nodes, large learning cost and low work efficiency. The method comprises the following steps: acquiring the topics and services of all services in the IROS system by calling the interface of the IROS system, and determining a plurality of service nodes and the data flow direction between the plurality of service nodes; determining the publisher and the subscriber corresponding to the topic or the service according to the data flow direction; adding the publisher and the subscriber corresponding to the topic or the service to a visual interface through a preset application development framework, and associating the publisher and the subscriber with the topic or the service through a preset connection mode; and drawing the connection relationship between the publisher, the subscriber and the topic or the service according to the data flow direction between the plurality of service nodes through a double-linked list method, to generate a corresponding node graph, thereby reducing the learning cost and improving the work efficiency in a visual manner.

The embodiment of the invention provides a page updating method based on a double linked list, electronic equipment, a storage medium and a program product. The method comprises the following steps: in response to an updating instruction of a target page, synchronizing updating information in the updating instruction to a linked list node matched with the updating information in a preset double linked list; wherein the updating instruction is used for indicating to update contents in a target page, and the updating instruction comprises updating information; the double linked list comprises at least one linked list node, and the linked list node corresponds to a sub-view in a target page; the preset double linked list is a double linked list corresponding to a target page; and based on the preset double linked list, updating a sub-view corresponding to a linked list node in the preset double linked list so as to update the target page. The method is used for achieving the effects of saving the maintenance cost and realizing stable updating of the front-end page.

The application discloses a search method and system for a Costas sequence based on multithreading, and the method comprises the following steps: inputting the order of the Costas sequence to be searched; establishing a framework data structure of a bidirectional linked list, and generating a permutation matrix corresponding to the order through recursive iteration; generating a task for judging a check matrix corresponding to the permutation matrix, and submitting the task; submitting the task received by S2 and S3, creating a thread pool by using a thread pool technology, and performing multithread operation by combining a task stealing technology, so as to accelerate the judgment on the check matrix; and collecting the tasks, finally obtaining the number of the Costas sequences and the search time, and comparing with a traditional multithread search. The search method and system for the Costas sequence based on the multithreading realize efficient utilization of threads, improve the search speed, and provide a wider application prospect.

The present invention provides a memory structure for storing JSON data and a data processing method thereof. The memory data structure is a layered structure, with each layer corresponding to a layer of the JSON structure. JSON objects are implemented in the memory data structure using a hash table with a concurrency control mechanism, and arrays in the JSON are implemented in the memory data structure using a doubly linked list with a concurrency control mechanism. Connections between layers are implemented using memory pointers, and values ​​are implemented using a structure. By employing a memory data structure comprising a hash table and a doubly linked list with a concurrency control mechanism, the present invention solves the problem of concurrent reading and writing of values ​​in a single JSON structure. This significantly improves the processing speed of JSON structured data on computers with multiple CPUs or multi-core CPUs.

The application discloses a method for quickly checking whether free data exists in a qcow2 file, and comprises the following steps: step one, establishing an empty bidirectional linked list; step two, analyzing the qcow2 file and cyclically obtaining all table entry records of secondary tables; and step three, establishing a linked list node for each table entry of the secondary table, and the node comprises start position and end position information; compared with the prior art, the application significantly reduces the length of the linked list by recursively merging the linked list nodes, improves the checking efficiency of large-capacity qcow2 files, and is suitable for quick fault diagnosis in a cloud computing environment.

The invention provides a cold and hot data distribution management method and device for a nonvolatile storage device. Aiming at the mixed storage requirement of real-time data and historical data in an industrial control scene, a dynamic shunting method based on logic space popularity evaluation is provided. A 512GB SSD user address space is divided into 64000 logic spaces, an exponential weighting algorithm is adopted to collect operation frequency data in real time, an access sequence Order array is generated in combination with a DRAM historical double linked list, and a comprehensive heat value is calculated. And dynamically generating a threshold value based on the quantile coefficient, distributing the logic space with the heat value greater than the threshold value to the low-wear flash memory block with the erasure times less than or equal to 5000, and distributing the logic space with the heat value less than the threshold value to the high-wear block. According to the scheme, the storage life is greatly prolonged, the real-time instruction response delay is reduced, the hybrid load characteristic of industrial control high-frequency real-time and low-frequency archiving is adapted, and the balance between data access efficiency and storage reliability is ensured.

The embodiment of the application is suitable for the technical field of computers, and provides a resource lock management method and device, electronic equipment and a storage medium, wherein the resource lock management method comprises the following steps: determining a hash value corresponding to a unique identifier of a to-be-locked resource; and determining a first hash bucket corresponding to the hash value in a preset hash table; wherein the preset hash table comprises a plurality of hash buckets, the plurality of hash buckets correspond to a same bidirectional linked list, and each hash bucket corresponds to a linked list interval of the bidirectional linked list; each lock node on the bidirectional linked list represents a resource lock of a to-be-locked resource; determining a lock node of the to-be-locked resource based on a linked list interval corresponding to the first hash bucket; and obtaining the resource lock of the to-be-locked resource from the lock node of the to-be-locked resource.

The present invention belongs to the field of computer storage technology, and specifically relates to a memory allocation method for a novel non-volatile memory, comprising: dividing a plurality of independent memory areas from a persistent memory heap of the non-volatile memory to ensure that each working thread is allocated to a memory area; logically dividing each memory area into a plurality of super blocks of equal size, and managing free super blocks in the form of a bidirectional linked list; in a global memory application, splitting different super blocks according to different size classes, and splitting the same super block into a plurality of memory blocks of equal size; setting a private memory pool for each working thread, searching for a super block of a corresponding size class in the private memory pool according to the memory allocation request size of the working thread, and allocating a free memory block from the super block, wherein a batch persistence mechanism is adopted to manage the memory blocks, which can reduce cache line refreshes, thereby avoiding time overhead and write wear problems.