70 results about "Doubly linked list" patented technology

The invention relates to a matrix double linked list compression storage computing device which comprises a definition module used for defining a plurality of register variables to represent double linked list compression storage of a matrix; the matrix data element processing module is used for deleting, inserting and / or covering matrix data elements in the Jacobian matrix; the matrix operation module is used for executing multiplication calculation of the Jacobian matrix and the column vector when the Jacobian matrix is a sparse matrix; and the matrix block resource allocation calculation module is used for calculating a product result component based on the matrix blocks of the Jacobian matrix when the Jacobian matrix is a non-sparse matrix, and the product result component is a result obtained by dividing a product result of the Jacobian matrix and the column vector according to row blocks. According to the method, the matrix operation speed during load flow calculation can be increased, consumption of storage resources on a chip is reduced, and the matrix calculation efficiency and the resource utilization rate are improved.

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.

The invention provides an implementation method for detecting an uneven road section of a vehicle. The implementation method comprises the following steps of: acquiring acceleration and angular velocity data of the vehicle in real time by using an IMU (Inertial Measurement Unit) module; low-pass filtering processing is carried out on the collected three-axis acceleration and three-axis angular velocity data, Kalman filtering processing is carried out after high-frequency noise is removed, six-axis fusion algorithm processing is carried out on the processed acceleration and velocity values, and the real dynamic state of the vehicle is obtained; a double linked list is adopted to store the processed data, the linked list structure comprises a double linked list with the size of N and is used for storing data of ACCz, and an annular buffer area is adopted to manage a memory, so that when the buffer area reaches the maximum size N, new data can cover old data; and performing data analysis according to the processed ACCz data so as to detect an uneven road section. The method can effectively judge and recognize the flatness degree of the road section where the vehicle is located, has the advantages of being high in real-time performance and anti-interference performance, and is suitable for various vehicles and road condition scenes.

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 draft incremental backup method and device, and the method comprises the steps: responding to an initial material selection operation of a user in an editor, constructing and initializing a double linked list, and storing the selected initial material to an initial state node of the double linked list; responding to a draft backup operation of a user, determining a current node of the double linked list according to a current pointer of the double linked list, comparing the draft with node contents stored from the initial state node to the current node, and determining incremental data of the draft; constructing a new node, storing the incremental data to the new node, storing the new node as a next node of the current node of the double linked list, and pointing the current pointer to the new node; and responding to draft revocation operation or redo operation of the user, determining a current node of the double linked list according to a current pointer of the double linked list, obtaining node content of a previous node or a next node of the current node, and returning the node content to the editor so that the editor can operate according to the node content.

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.

This application discloses a Web-end video playback method and apparatus, and a computer device. The method includes: obtaining to-be-played FLV-format video data; decapsulating the FLV-format video data by using a preset WebAssembly bytecode to obtain effective video data, and storing the effective video data into a preset doubly linked list; encapsulating the effective video data in the doubly linked list using the WebAssembly bytecode to obtain FMP4-format video data; and loading, through media source extensions, the FMP4-format video data to a Web-end video player for playback. This application further provides a computer-readable storage medium. In this application, different video data is decapsulated and encapsulated using the WebAssembly bytecode, and then new-format video data is loaded through media source extensions. This reduces occupation of processing resources in a Web-end video data processing process and improves processing efficiency.

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 invention discloses a data optimization method for a memory database storage engine, an electronic device and a storage medium, and belongs to the technical field of database management. The technical problem to be solved by the invention is how to effectively reduce the amount of data stored in the memory and improve the performance of the database. The technical scheme adopted is as follows: The method is specifically as follows: Insert increment: an ART tree-based memory storage engine changes the original SQL Update to a direct insert increment operation; KV data insertion: the storage engine queries the row data to be modified, and modifies the corresponding column according to the incremental operation, and reinserts it after merging; if there is no snapshot, the old KV data is deleted; for the Update Returning syntax, the storage engine returns the full Value; it is determined whether the Put syntax insertion is a write-intent deletion: if so, the write intent of the Key corresponding to the linked list head node is directly deleted; if not, the bidirectional linked list storing the Key is searched, and other versions in the linked list are deleted to complete the insertion.

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.

The invention relates to a multi-thread collaborative execution method based on a double linked list, and belongs to the technical field of computers. The method comprises the following steps: constructing a data structure based on business scene requirements; the data structure is a double linked list; when the node state corresponding to the first node in the data structure is successful and the execution condition corresponding to the second node is satisfied, executing the thread corresponding to the second node, and switching the node state of the third node into monitoring; and when the node states of all the nodes in the data structure are successful, stopping executing the threads in the data structure. According to the multi-thread collaborative execution method based on the double linked list, accurate thread concurrency control can be achieved by combining the double linked list and the node state, all the threads can be automatically triggered according to the specified conditions and sequence, the complexity and the coding difficulty of a thread concurrency control scene are simplified, and the thread concurrency control efficiency is improved. The method can be used in scenes requiring multi-thread cooperative work.

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.

The invention discloses a signal-based WeChat applet state management method and system, and the method comprises the following steps: obtaining a signal of a double linked list data structure realized based on a TypeScript language, simplifying the declaration of a signal attribute through a decorator, converting the signal attribute into a responsive signal, and transmitting the responsive signal to a server; the method comprises the following steps: designing an Effect class of a double linked list according to a response type signal to perform signal collection and automatic tracking operation, performing batch processing on the response type signal through a batch updating mechanism to obtain a batch processing signal, when a dependent signal changes, notifying the Effect class to respond to the batch processing signal after the batch processing, and when the batch processing signal is updated, notifying the Effect class to respond to the batch processing signal after the batch processing. And automatically triggering to re-calculate batch processing signals, calling an Effect class to capture signal changes and notify page rendering updating based on a signal management framework and applet integrated response, and solving the problem that a simple dependency tracking mechanism is adopted in the implementation process of an existing signal model, so that the implementation efficiency is greatly improved. And a complex dependency relationship cannot be efficiently managed.

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.

The present invention belongs to the field of edge computing technology of marine Internet of Things, and discloses a wave data edge intelligent computing method and system for marine Internet of Things. The acquired acceleration sensor data at a certain time interval is stored in the memory in the form of a data structure of a bidirectional linked list; multiple processes are created to be executed in parallel during the entire running time of the first process; for a single process, the acceleration sensor data at the time interval stored in the bidirectional linked list is read, and the corresponding effective wave height, average wave period and wave direction are obtained through reasoning and calculation by a trained deep learning neural network model, and then data transmission is performed: the generated wave height, wave period and wave direction are sent to the edge side device at a transmission frequency of 4Hz for wireless communication through multi-process concurrent execution calculation and control signal transmission mechanism. The present invention controls multi-threaded concurrent calculation through a semaphore transmission mechanism to achieve data transmission at a frequency of 4Hz.

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 a marketing activity execution method and device, equipment and a storage medium, which are applied to the field of software development, and the method comprises the steps: constructing a multi-way tree comprising a root node layer, an event node layer and an event condition node layer; constructing a double linked list containing marketing event condition nodes based on the event condition logic relationship of the marketing activities; traversing in the multi-way tree based on the reported event, and matching from the event condition nodes to obtain a target event condition node; and determining the double linked list containing the target event condition node as a target double linked list, performing traversal trigger verification on a forward node and a backward node of the target event condition node in the target double linked list, and executing a marketing activity of the target double linked list based on a trigger verification result. According to the method and the system, the marketing activities are decoupled from each business platform, so that the unified configuration, management and maintenance of the marketing activities are realized, and the problems of high platform development cost, long period and difficulty in management and maintenance caused by tight coupling of the marketing activities and business systems are avoided.

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 invention provides a communication method and device for a client application and a trusted application, a terminal and a medium, and relates to the technical field of communication. The method is applied to a TEE agent module of which a terminal is deployed in a rich execution environment (REE), and comprises the following steps: in response to a target access request sent by a target client application for a target trusted application, obtaining first double linked list information corresponding to a target channel, updating the first double linked list information according to information carried in the target access request to obtain second double linked list information; wherein the target channel is a channel between the target client application and the target trusted application; and refusing to use the target channel under the condition that the second double linked list information meets the preset limitation strategy. According to the invention, the effective utilization rate of TEE resources is improved, and the stability of a trusted execution environment TEE is improved.

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.