60results about How to "Avoid overhead" patented technology

The invention discloses a key value storage system indexing method oriented to an NVM-NVMe SSD (Non-Volatile Memory-Non-Volatile Memory Express Solid State Disk) hybrid architecture, which comprises the following steps of: constructing a heterogeneous storage architecture taking cold and hot data perception as a core driving mechanism, coordinating and managing two types of storage media, namely a non-volatile memory NVM and a solid state disk NVMe SSD, and realizing efficient identification, layered writing and dynamic migration of cold and hot data. According to the method, the characteristics of low delay, durability and byte addressing of the NVM are utilized, the frequency and I / O overhead of Flush and Compaction operations are reduced in a data write-in path, meanwhile, the problem of mixed storage of cold and hot data is avoided, and therefore the overall performance and storage efficiency of a system are remarkably improved. In addition, by introducing an asynchronous migration module, the method can dynamically adapt to the change of data popularity along with time evolution, and effectively support high performance and high availability of the key value system in long-term operation.

The invention provides a channel prediction method and system based on a multi-cycle feature convolutional network. According to the method, context sensing weighted input and a dynamic multi-model pool mechanism are introduced. A terminal device obtains environmental context features in real time, dynamically calculates the weight of each time step in a historical channel state information sequence based on the features, and generates a weighted optimized input sequence. Meanwhile, the network equipment pre-trains and maintains a plurality of multi-period feature convolutional network models specific to different environments, and the network can effectively capture the complex time-varying rules in the period and during the weeks in the channel, so that the accuracy of channel state information prediction is improved. And the terminal equipment immediately selects and activates the optimal sub-model in the model pool for prediction according to the real-time context features, and locally performs increment fine adjustment. According to the invention, through management of the data input end and rapid and adaptive switching of the prediction model end, the precision of channel prediction and the adaptive capacity to environmental sudden change are effectively improved.

This invention proposes a management method for the radio resource control layer in a 5G mobile communication network, relating to the technical field of 5G wireless communication. First, network data analysis elements collect and preprocess terminal session state data and network energy efficiency data. Based on the preprocessed terminal session state data and network energy efficiency data, a deep Q-network model is used to select the optimal adjustment action for the timing threshold of the RRC inactive timer, and analysis information containing this adjustment action is generated. This information is then converted into RRC auxiliary information and sent to the radio access network via access and mobility management elements, dynamically adjusting the timing threshold of the RRC inactive timer and managing the RRC connection state. This scheme improves the energy efficiency of the access network under different network load conditions while avoiding air interface signaling overhead and service latency caused by frequent terminal reconnections, enhancing the flexibility and accuracy of terminal state migration management.

This invention discloses a method for visualizing the surface quality of machined parts based on GPU and mesh search algorithms, belonging to the field of machining technology. The method includes acquiring tool point cloud data and discretizing it to construct a three-dimensional mesh structure surrounding the point cloud; linearizing the three-dimensional mesh data into a one-dimensional array and packaging it; creating four types of structured GPU computing buffers to achieve batch data transmission; utilizing GPU shader programs to achieve parallel data access and fast local neighborhood queries; completing high-precision real-time reconstruction of fragment surface normal vectors through neighborhood search and signed projection distance calculation; and outputting realistic rendering results based on an optimized Phong lighting model. This invention leverages the advantages of GPU parallel computing to accurately reproduce complex textures, microstructures, and special curved surfaces, making it suitable for surface quality inspection, wear assessment, and process optimization of milled parts and tools.

The invention discloses a traffic dynamic shortest path distribution method and system based on a triangular fuzzy number weight, and relates to the technical field of intelligent traffic systems.Fuzzy information in a path evaluation attribute is represented through a triangular fuzzy number, a comprehensive weight is analyzed and calculated in combination with deviation maximization and a moisture value, and the decision reliability is effectively improved; a K-Means algorithm is adopted to perform dynamic path search, and through a representative vertex subset pre-calculation and increment updating strategy, the path retrieval efficiency is remarkably improved; a travel time prediction model related to departure time and real-time flow is established, and accurate response to accidental congestion is realized; and finally, outputting an optimal path scheme through a multi-objective decision-making method. Compared with a traditional algorithm, the speed is improved on a real road network data set, the path distribution accuracy is improved, meanwhile, the path safety, comfort and efficiency are effectively balanced, real-time path planning under a large-scale road network is supported, and an efficient solution is provided for intelligent traffic management.

The application discloses a composite data transmission method and related device, and relates to the technical field of computers, and the method comprises the following steps: if it is judged that the data transmission from a device end to a host end is one-way transmission, the device end collects original audio and video data, carries out algorithm processing and classification; the original audio and video data is encapsulated and transmitted to the host end, the first composite data is received, and the first composite data is analyzed; the first analysis data is written into a target virtual drive, the first analysis data is integrated, a target instruction is generated, and the target instruction is transmitted to the device end; if it is judged that the data transmission is not one-way transmission, the host end packs the original audio and video data, transmits the second composite data to a computing box; the second composite data is analyzed, the second analysis data is processed by calling an algorithm library, the second analysis data is packed, and the second analysis data is returned to the host end; the packed data is analyzed, and the packed data is transmitted to a target application. The application provides high-quality original audio and video data transmission.

The invention relates to the technical field of distributed computing and micro-service architecture, in particular to a micro-service leader election method and system based on distributed coordination, and the method comprises the steps: deploying a plurality of micro-service copies in a container environment, and carrying out the routing request through a load balancing server, all micro-service copies share a distributed coordination storage instance as a coordination center, and on this basis, the micro-service leader election method comprises the following steps: S1, all micro-service copies attempt to acquire a distributed lock through a distributed lock acquisition command of the coordination center at the same time; s2, successfully obtaining a micro-service copy of the distributed lock as a Leader copy, and taking other micro-service copies as Follower copies; and S3, the Leader copy renews the lock every fixed interval, and the free count is updated. According to the method, distributed coordination storage is used as a coordination mechanism, and it is ensured that only one micro-service copy provides service for the outside in a specific scene.

The invention relates to the field of industrial internet-of-things data transmission, in particular to an industrial internet-of-things data secure transmission method, system, device and medium, and the method comprises the steps: pre-registering client information at a server, and generating a client unique identifier; the client generates a client key according to the public key obtained from the server and the unique identifier of the client, and registers the key to the server; the client uses the registered key to initiate security authentication to the server, and after the authentication is passed, the server generates or negotiates with the client to generate a session key for data encryption transmission, and distributes the session key to the client; the client and the server encrypt or decrypt interaction data by using the session key; according to the method, the data transmission security of the industrial Internet of Things can be ensured, the real-time performance, the reliability and the usability are considered, and the method is particularly suitable for industrial control, monitoring and cooperative processing scenes with relatively high requirements on the security and the real-time performance, and has relatively high practical value and popularization prospect.

The application discloses a humanoid robot whole-body control reinforcement learning method and system based on parallel computing, and the method comprises the following steps: constructing a CasADi expression of a computing joint connecting rod space inertia tensor; constructing a CasADi symbolic expression of a center of mass position and a center of mass momentum; converting the expression and the symbolic expression into a CUDA kernel and compiling into an executable file; when a training environment is initialized, importing the CUDA kernel of the CasADi expression and the symbolic expression and opening up a GPU memory space; after the mass and the center of mass domain of the connecting rod are randomized, calling the CasADi expression to perform parallel computation on the joint space inertia tensor of each environment; after each simulation step, calling the CasADi symbolic expression to perform parallel computation on the center of mass position and the center of mass momentum of each environment; combining the center of mass position and the center of mass momentum to calculate a reward function; introducing the reward function into reinforcement learning training to obtain a robot whole-body control strategy, and the application improves the utilization rate of the GPU.

This invention provides a method and system for updating a synchronous forwarding table in a 5G private network device based on UDP, belonging to the field of communication technology. The method includes: a central processing module generating synchronous forwarding table update information and encapsulating it into UDP packets, which are then sent to a message processing module. This information includes a slice identifier, a forwarding table identifier (SEID), PDR rule content, QER rule content, FAR rule content, and a QER rule quantity field. Upon receiving the data, the message processing module determines the valid QER rule content based on the QER rule quantity field, updates the forwarding table according to the synchronous forwarding table update information, stores the updated forwarding table in a hardware forwarding table storage area bound to the slice identifier, and performs packet forwarding processing according to the FAR rule content. This invention achieves efficient, reliable, and multi-slice isolation-compliant synchronous forwarding table updates between the central processing module and the message processing module.

The application discloses a kind of image recognition method and system under complex illumination environment, the method includes: obtaining the image to be identified needing to carry out image recognition, the illumination influence area is obtained by analyzing the image to be identified, and the illumination influence area is divided into a plurality of grid units according to pre-set rule by grid division;Respectively, randomly select pixel points from illumination influence area and non-illumination influence area, and obtain corresponding pixel block based on pre-set window size;The similarity weight between the pixel block of illumination influence area and non-illumination influence area is calculated respectively, to denoise the image to be identified, and the denoising identification image is input into pre-set image recognition model to obtain corresponding image recognition result.The application solves the problem of low image recognition efficiency in the prior art under complex illumination environment.

The application discloses a configuration warehousing method and device for knowledge collection, equipment and a storage medium. The method comprises the following steps: acquiring source knowledge data sent by an external system; reading a pre-configured mapping rule, wherein the mapping rule comprises a field mapping operation type configured for a standard field in a knowledge management platform, and the field mapping operation type comprises a selection type, a text type and a label type; performing a field mapping operation on the source knowledge data according to the mapping rule, obtaining target knowledge data and storing the target knowledge data into a standardized knowledge base. The pre-configured mapping rule is used to replace customized code development, when a new external system is accessed or a field definition is changed, only the mapping rule configuration needs to be modified, and code rewriting and deployment are not needed, so that the period of accessing heterogeneous knowledge into the standardized knowledge base is shortened.

The invention discloses a distributed lease management method and system, a storage medium and electronic equipment, relates to the technical field of storage management, is used for a client layer, and comprises the steps that under the condition that a file operation request is received, a lease request is sent to a node layer, and the lease request is used for indicating a target lease of a target file corresponding to the file operation request; after a target lease sent by a node layer is received, the target file is accessed in a storage system according to the target lease, the node layer corresponds to at least one client layer, and under the condition that the target lease conflicts with a reference node layer, the node layer accesses a cluster layer, and under the condition that the node layer receives an authorization instruction sent by the cluster layer, the target file is accessed in the storage system according to the authorization instruction. And the node layer sends the target lease. The technical problem that a distributed file system in the related technology is low in resource utilization rate is solved, and the technical effect of improving the resource utilization rate of the file system is achieved.

The application relates to the technical field of small catheter production, and particularly discloses a small catheter automatic packaging device and process for a tunnel, which comprises a blanking mechanism, which is used for carrying small catheters and controlling the conveying of the small catheters; a transfer mechanism, which comprises a loading rack arranged at a blanking end of the blanking mechanism and a conveying assembly arranged on the loading rack, and the conveying assembly is used for conveying the small catheters falling into the loading rack; and a packaging mechanism arranged at an output end of the transfer mechanism, which is used for packaging the small catheters removed from the loading rack. The blanking mechanism, the transfer mechanism and the packaging mechanism are arranged, so that the whole process automation from small catheter receiving, temporary storage, conveying and packaging is realized. The blanking mechanism releases the small catheters in an orderly manner, the transfer mechanism receives and conveys the whole batch of small catheters, and finally the packaging mechanism completes the packaging work, the three mechanisms work cooperatively, a continuous automatic processing flow is formed, and the production efficiency is improved.

The application relates to a message forwarding method and device, computer equipment, a readable storage medium and a program product, and relates to the field of message processing. The method comprises the following steps: when a first object sends a request message to a second object, source address information of the request message is acquired; the source address information is subjected to hash processing to obtain a first hash value of the source address information; a first memory core matched with the first hash value is screened out from a plurality of first candidate memory cores used for message processing of the request message; the request message is subjected to message processing through the first memory core to obtain a first target message, and the first target message is forwarded to the second object. The method can improve the message forwarding efficiency.

This invention discloses a weighted consensus method for blockchain in a dynamic heterogeneous 6G environment. The method includes the following steps: constructing a multi-dimensional node weight dynamic evaluation model, and performing a comprehensive capability evaluation of nodes based on the model to calculate their consensus weights; constructing a set of consensus nodes entitled to participate in weighted voting and a set of candidate nodes that only participate in verification to accumulate reputation, managing the candidate node set and the consensus node set based on the accumulated behavioral reputation value of the nodes to obtain a real-time updated consensus node set; and executing proposals, weighted voting, and final confirmation based on the node consensus weights and the real-time updated consensus node set to obtain a weighted consensus result for the blockchain. This invention can optimize the allocation of consensus weights, reduce consensus reconfiguration overhead, and maintain efficient weighted consensus in a 6G dynamic heterogeneous environment by constructing a multi-dimensional node weight dynamic evaluation model.

This invention discloses a method for fusing congestion events from different batches based on single-batch fused congestion data. The method includes: extracting a historical congestion data table corresponding to the selected city code from a historical database; if the historical congestion data table is empty, storing the current batch of congestion data in the historical database, and setting the initial ID of the fused congestion event and the ID of the previous batch of congestion events as the event IDs corresponding to the current batch of congestion data; if the historical congestion data table is not empty, matching the original congestion event IDs in the current batch of congestion data with the associated event IDs in the historical congestion data table, assigning values ​​to the initial ID of the fused congestion event and the ID of the previous batch of congestion events based on the matching results, and storing them in the historical database. This invention optimizes the data tracking problem caused by changes in event IDs, ensuring that the same event can be correctly matched in different batches of data, and enhancing the consistency of traffic analysis.

This invention relates to the field of computer technology and provides a method and apparatus for cross-function vector register collaborative allocation for RISC-V vector extensions. The method includes: performing cross-function data flow analysis on the program to identify active vector registers and construct an active information set; establishing LMUL constraint propagation relationships based on this and determining the target LMUL configuration; performing collaborative vector register allocation between the caller and callee based on the active information set and the target LMUL configuration, and establishing a register mapping relationship; performing overflow optimization based on vector characteristics for vector data that cannot be retained; and collaboratively maintaining the vector execution context at function call boundaries. This invention can reduce register reallocation and overflow overhead during cross-function calls, reduce memory access pressure, and improve RISC-V vector register resource utilization and program execution efficiency.

The invention discloses a cross-network storage domain data updating method based on a sparse matrix and a storage system, and relates to the field of distributed storage, the method is applied to the distributed storage system adopting erasure codes, and in the method, when a data block needs to be updated, the data block is updated locally based on a Lasso regression algorithm at a storage node; decomposing the update increment into a sparse linear combination and a residual vector of other data blocks in the node; only transmitting the obtained sparse coefficient vector and the residual vector to a target node storing a corresponding verification block; and the target node uses the pre-cached same-node data and combines the generated matrix to calculate the verification update quantity and complete the update. According to the method, the updating flow is reduced to a constant level from the traditional O (m), the calculation localization is realized, and the system throughput and the expandability in a high-frequency updating scene are remarkably improved on the premise of maintaining the fault-tolerant capability of the erasure code.

A multi-level key-value cache reuse acceleration system for long-context reasoning in RAG scenarios includes: a document retrieval module, a pre-filling task queue module, a multi-level key-value cache module, and a cache management engine. This invention achieves a significantly accelerated system by reducing TTFT and pre-filling overhead without sacrificing model accuracy or modifying the model structure through prefix tree cache management, hierarchical transfer-computation overlap, and asynchronous prefetching. It significantly reduces the first-term delay (TTFT) in the pre-filling stage.

The invention discloses an unmanned edge device cluster anti-interference collaborative obstacle avoidance system and method based on identity verification and secret state interaction, and introduces dynamic structure homomorphic encryption DSHE and a lightweight identity-based encryption mechanism to solve the problems that encryption and decryption delay is high and the system is easily attacked by man-in-the-middle in the prior art. A lightweight encryption microchip LCMC is deployed in the system, and a dynamic structure homomorphic encryption DSHE arithmetic unit, an identity management unit and a decision arbitration unit DAU are integrated; the proxy auxiliary square operation protocol realizes relative measurement calculation of a ciphertext domain space through a pre-calculation lookup table; the identity preprocessor maps the identity label into an evaluation key and realizes ciphertext identity binding; according to the layered noise management strategy, operation is divided into three layers to implement differential control; a single-node top-speed self-decision mechanism triggers a special decryption accelerator DDA, hardware interruption is generated to directly take over an edge control unit, and the end-to-end obstacle avoidance response delay is less than 3 milliseconds.

This invention provides a shared memory management method, apparatus, electronic device, and storage medium, relating to the field of mobile application development technology. The method includes: when shared memory expansion is possible, determining the actual expansion memory based on the relationship between the target memory and the maximum preset memory, and expanding the shared memory according to the actual expansion memory. The target memory is the size of the shared memory after expansion according to preset rules. The actual expansion memory is used as the expanded shared memory, and listeners on the mobile webpage and native application are notified to update memory usage statistics. This invention can reduce or even avoid the overhead of string serialization and deserialization. Expanding shared memory when expansion is possible ensures the stability of data transmission between the native application and the mobile webpage. It reduces CPU utilization and improves CPU operating speed and data processing efficiency.

The application provides a wavelength granularity task segmentation scheduling method and system for large-scale graph computation, comprising: obtaining a user-submitted graph computation task and network topology information, establishing a system architecture, and completing system initialization; performing feature analysis on the graph computation task; applying a multi-level graph segmentation algorithm to divide the graph data into multiple subgraph units; analyzing the available wavelength resource state in the optical network, establishing a mapping relationship between the subgraph communication demand and the wavelength resource; configuring an optical cross-connect device to establish a dedicated wavelength channel, and distributing the subgraph task to the corresponding computing node; and performing data exchange between the subgraphs through the dedicated wavelength channel, while performing parallel computation within the subgraphs. The application combines graph segmentation and wavelength resource allocation, realizes the collaborative optimization of the computation task and the communication resource, solves the performance bottleneck problem caused by the separation of computation and communication in the traditional distributed graph computation, and significantly improves the efficiency and scalability of large-scale graph computation.

This invention discloses an anonymous dynamic authentication and key negotiation method based on certificateless signatures. This method is based on a system model operating in an edge intelligent IoT environment, consisting of four entities: intelligent nodes, a key generation center, edge nodes, and a trusted authority. The method comprises five stages: system initialization performed by the key generation center; pseudo-identities assigned to system entities and public-private key pairs generated through entity registration involving intelligent nodes, edge nodes, and the trusted authority; mutual authentication and key negotiation between intelligent nodes and edge nodes; batch authentication; and encryption transmission of intelligent IoT data using a symmetric encryption algorithm based on the negotiated session key. This invention, based on a certificateless signature mechanism, avoids the complexity of certificate management and key escrow, while eliminating high-overhead operations such as bilinear pairing and exponential operations, effectively reducing the computational burden on resource-constrained terminals.

The application discloses a service function chain arrangement and scheduling method and device and medium. The method adopts a security reinforcement learning method framework, allocates a series of security reinforcement learning agents to each service function chain, and the agents are simultaneously guided by a reward function and a constraint function for optimization. Each agent can control the service function deployment position, transmission path, processing bandwidth and transmission bandwidth of each data packet according to the specific service quality requirement of the service function chain corresponding to the business and the local network state observed at the moment. The constraint-oriented optimization mechanism of the method can improve the network bandwidth resource utilization rate, meet the deterministic end-to-end delay and jitter performance requirements, and provide a certain and efficient network service for the delay-sensitive business in the industrial scene.

According to the double-main-control-chip communication interface and method based on the extended SPI bus, the WCTRL control signal and the RCTRL control signal are added on the basis of the standard SPI bus, data communication between the double main control chips is achieved through the two control signals, and the double-main-control-chip communication interface is achieved by arranging a storage buffer area in an FPGA or a CPLD. The two main control chips read and write data to the storage buffer area through the extended SPI bus, and data interaction between the two main control chips is achieved. According to the communication interface and the method, stable and reliable transmission of small data volume and medium-low rate data between the two main control chips can be realized, and lightweight data interaction of the double main control chips can be completed with extremely low software overhead on the basis of not occupying a main communication network.

The application discloses a hidden terminal identification method and device based on multi-dimensional network feature analysis, equipment and storage medium, relates to the technical field of communication, and the method comprises the steps of collecting network state data of a plurality of associated terminals based on the network access equipment; using a preset sliding time window to analyze the network state data, identifying at least one potential victim terminal from the plurality of associated terminals; according to the network state data, performing network conflict correlation analysis on the potential victim terminal, and determining at least one potential interference terminal from the plurality of associated terminals; using the adjacent network access equipment to perform network monitoring on the potential victim terminal and the potential interference terminal to verify whether the potential victim terminal and the potential interference terminal are hidden terminals. The application improves the accuracy of hidden terminal identification through the above scheme, and avoids the huge protocol overhead of the RTS / CTS mechanism of the associated terminal.

This invention relates to the field of motion detection technology, and discloses a primary motion detector based on a PN junction channel, its fabrication method, and a sensor. The primary motion detector includes a first phototransistor and a second phototransistor. The first phototransistor is configured to operate under a source-drain forward bias, and its photocurrent decay process during turn-off has a first fast decay time constant and a first slow decay time constant. The second phototransistor is configured to operate under a source-drain reverse bias, and its photocurrent during turn-off has a second fast decay time constant and a second slow decay time constant, wherein the first fast decay time constant is greater than the second fast decay time constant. When a light pulse moves along the direction from the first phototransistor to the second phototransistor, a directional current pulse can be detected at the output of the primary motion detector. This invention achieves high-efficiency and low-power discrimination of the direction of light signals.

The application provides a mass data Top-kskyline group query method, including stage one, applying a verification theorem of G-skyline to scan data points in a pre-sequencing table in sequence until all data points are scanned, and a candidate point set containing all candidate points and child sets of skyline points is obtained; stage two, candidate groups are generated from the candidate point set, and judgment of enumeration rounds is completed by a left part theorem, a right part theorem and an approximate theorem; scores of the candidate groups are calculated, and a Top-k score threshold is maintained; child G-skyline groups of Top-k candidate groups are generated, and a final result is obtained by updating the Top-k candidate groups. The pre-sequencing table is used as an index structure, and only once construction can be applied to all attribute combination scenes. Early termination is realized by using pre-sequencing, and the data scale that needs to be scanned for screening candidate points is reduced. Based on three calculation theorems of the left part theorem, the right part theorem and the approximate theorem, an efficient calculation method is provided, the upper bound of G-skyline group scores is reduced, and the number of generated G-skyline groups and the calculation amount are greatly reduced.

The present disclosure relates to a database-based data processing method, device, medium and electronic equipment, the method comprising: receiving a query request task to be executed, and determining a plurality of coroutine tasks corresponding to the query request task, the coroutine tasks being initially added to a global task queue shared by a plurality of threads, and then being distributed from the global task queue to a local task queue of a corresponding thread; in each thread, determining a target coroutine task to be executed according to time information of each coroutine task in the local task queue of the thread; interrupting the target coroutine task and adding the target coroutine task to the global task queue when the target coroutine task is not executed and the target coroutine task is after the current time slice of the execution of the thread; determining a new target coroutine task of the thread according to the global task queue and the local task queue of the thread, and executing the new target coroutine task in the next time slice.