38 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 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 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.

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 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 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 invention relates to the technical field of software, and discloses a manufacturing industry task and resource matching method and system, and the method comprises the steps: obtaining tasks and resources, including time constraint information and resource demand information of the tasks; processing the available time of each resource, and converting the available time period of the resource into a double linked list structure formed by a plurality of time slice nodes; calculating a corresponding task priority field for each task object based on the time constraint information of the task, the resource demand information and a preset business rule, and sorting the task objects according to the task priority fields; and according to the sequence of the sorted task objects, performing resource matching processing on each task object in sequence, and generating a task and resource allocation result. The resource time slices are managed by using the double linked list, so that the query, insertion and deletion operations of the time window are very efficient, and the method is particularly suitable for a frequently and dynamically updated manufacturing environment.

The application discloses a method and device for improving the quality of job category prediction samples, comprising the following steps: S1, improving the data quality by using a double-linked list, and cleaning the data by using a clustering method; S2, sequentially using a pre-training labeling model, a vector model and a classification model to label, vector and classify the input processing, and integrating a job category tree knowledge graph into the model in advance; and S3, using a multi-task training method to reduce the model perplexity. In the method for improving the quality of job category prediction samples, the data quality is improved by using a double-linked list, the data is cleaned by using a clustering method, the data accuracy is enhanced, a large pre-training model is integrated with hierarchical features, the iteration efficiency is improved, a multi-task joiner training method is adopted to reduce the perplexity, a business database is used to train a vector model, a section vector model and a job category prediction model, the representation of the vector is enriched, and the quality of the job category prediction samples is improved.

The application relates to a memory data operation method, device and computer readable storage medium. The method comprises the following steps: when a memory data operation request is received, performing corresponding operation on a high-concurrency hash mapping corresponding to a client memory; if the corresponding operation on the high-concurrency hash mapping corresponding to the client memory is successful, acquiring a linked list lock of a bidirectional linked list corresponding to the high-concurrency hash mapping, wherein a head node of the bidirectional linked list is used for storing the latest data, and the linked list lock is used for locking the operation on the bidirectional linked list; if the linked list lock of the bidirectional linked list is successfully acquired, performing an operation corresponding to the client memory data operation request on the bidirectional linked list; and releasing the linked list lock of the bidirectional linked list after the operation corresponding to the client memory data operation request on the bidirectional linked list is completed. The technical scheme can realize the fast operation of the memory data on the client.

The invention relates to the technical field of whiteboard software handwriting storage modeling, and provides a handwriting erasing and segmenting method for solving the problem that an existing handwriting erasing and segmenting method is not perfect and accurate enough, which comprises the following steps of: dividing handwriting drawing into a mode of connecting a plurality of path graphs and a method of erasing based on 2D (two-dimensional) graph intersection calculation and difference set taking; any position of the handwriting can be accurately erased; meanwhile, the position of the path of the rest part of the erased handwriting in the linked list can be quickly positioned by adopting an adjacent calculation mode, the handwriting can be quickly segmented while being erased through the double linked list, and the segmented handwriting can be immediately dragged, zoomed and the like after being erased, so that the operation efficiency after the handwriting is erased is improved.

The invention discloses a first-in first-out data structure based on key value pair search and a processing method, relates to data processing and data storage technologies, and comprises a three-layer closed-loop architecture controlled by a hash index, an annular array and metadata. Wherein the Hash index layer is used for receiving an external key value operation request and positioning a data position in an annular array through index mapping; the annular array storage layer is used for physical storage and sequence management of data, an annular array of a continuous memory is adopted, and FIFO sequence management is achieved through a compact data unit and head and tail pointers; and the metadata control layer is used for maintaining the running state of the structure and providing parameter support for operation execution, and the metadata control layer adopts atomic variables to store core state parameters and realizes lock-free synchronization through CAS operation. The storage structure is optimized, the precursor / subsequent pointers of the double linked list are cancelled, a compact storage mode is adopted, and the memory utilization rate in a small data scene is improved.

This application discloses a notification method, apparatus, storage medium, and electronic device for target components, relating to the field of smart home technology. The notification method for target components includes: constructing a two-dimensional array based on N target events and M target components executing the N target events; sequentially initializing a doubly linked list head array for the target events corresponding to the i-th row; inserting the linked list nodes created for all target components into the doubly linked list head array according to the execution order of all target components and the target events corresponding to the i-th row; when the target events corresponding to the i-th row occur, determining the execution order of all target components corresponding to the target events corresponding to the i-th row from the doubly linked list head array according to the event name of the target events corresponding to the i-th row; and notifying all target components according to the execution order.

The application discloses an IP address management method and device. The method comprises the following steps: in response to a request of a client for applying for an IP address, determining an allocable IP address through a target bidirectional linked list corresponding to a target array, wherein the target array stores data objects of each IP address in an IP address pool, the target bidirectional linked list stores data objects of unallocated IP addresses, and the data objects comprise a host number of the IP address, an allocation state and linked list pointer information; allocating the IP address to the client, adjusting the allocation state in the corresponding data object, and unbinding the data object from the target bidirectional linked list; in response to a request of the client for returning the IP address, determining the data object of the IP address in the target array by taking the host number of the IP address as an array index; adjusting the allocation state in the data object, and adding the data object to the target bidirectional linked list. The application solves the technical problem that the allocation and recovery management of IP addresses in the related art cause large performance overhead.

The invention discloses a cache elimination method and device, equipment, a storage medium and a computer program product, and relates to the technical field of data processing.The method comprises the steps that cache data are grouped, a plurality of cache data groups are obtained, and the cache data in the cache data groups are stored in corresponding double linked lists; when it is detected that the cache space is insufficient, non-critical cache data groups are determined from the cache data groups; and determining and eliminating to-be-eliminated cache data in the target double linked list corresponding to the non-critical cache data group. The cache data can be grouped, and the to-be-eliminated data in the double linked list corresponding to the non-key cache data group is eliminated when the cache space is insufficient, so that the technical problem that the cache data cannot be effectively eliminated when large-scale data is processed by an LRU cache elimination algorithm in the prior art is solved.