58results about How to "Avoid time overhead" patented technology

The invention relates to a method and a system for storing mass data of the Internet of Things (IoT). The system comprises a plurality of data receiving nodes, a master node server and a database cluster. The method comprises the following steps of: (1) carrying out preprocessing on IoT data, and putting the preprocessed data in the database cluster consisting of a master node, slave nodes and the data receiving nodes; (2) creating sample records, which take sample elements as storage units, on the master node according to the static and dynamic information of the data in the database cluster; (3) after the sample records are encapsulated, sending the encapsulated sample records to all the slave nodes by the master node so as to be subjected to fragmentation processing and/or separated storage; and (4) after the slave nodes complete storage, uploading results to the master node, and updating the data in the database cluster by the master node, thereby completing storage. According to the method and the system, the cluster is extended by fully utilizing the existing storage technologies so as to store the mass data, the IoT data are divided into lightweight data and multimedia data, and particularly, a fragmentation strategy is adopted aiming at a large-scale amount of data, so that the time expenditure caused by the extension of a storage space is avoided.

The invention discloses a cluster fault tolerance system, a device and a method. The system includes: a remote checkpoint server which is used to respond the remote checkpoint request from a faulty node and execute the checkpoint operation; a node faulty checking module which is used to monitor the operating system of a local node and the running state of an assigned process and to trigger a remote checkpoint; and a communication system checkpoint module which is used to realize the checkpoint of the communication device and support the recovery function of communication breakpoint. The invention provides localized fast fault restoration for the parallel processing cluster, has a lower overhead and good expansibility, and makes ideal availability for the cluster system with ten billions and hundred billions calculation scale.

The invention relates to a target retrieval method based on a group of randomized visual vocabularies and context semantic information. The target retrieval method includes the following steps of clustering local features of a training image library by an exact Euclidean locality sensitive hash function to obtain a group of dynamically scalable randomized visual vocabularies; selecting an inquired image, bordering an target area with a rectangular frame, extracting SIFT (scale invariant feature transform) features of the inquired image and an image database, and subjecting the SIFT features to S<2>LSH (exact Euclidean locality sensitive hashing) mapping to realize the matching between feature points and the visual vocabularies; utilizing the inquired target area and definition of peripheral vision units to calculate a retrieval score of each visual vocabulary in the inquired image and construct an target model with target context semantic information on the basis of a linguistic model; storing a feature vector of the image library to be an index document, and measuring similarity of a linguistic model of the target and a linguistic model of any image in the image library by introducing a K-L divergence to the index document and obtaining a retrieval result.

Streaming multimedia content from a content server to client, user multimedia devices (UMDs) connected to the content server through a network includes the steps of monitoring storage states, of UMDs connected to the network, for preset multimedia content, and automatically transmitting a starting block of the content to any UMD not yet storing the block. Tasks preparatory to streaming are advantageously off-loaded to the client side and distributed among UMDs, to realize reduced bandwidth and delay and to conserve on storage capacity of a UMD.

The invention provides a system and a method for improving direct memory access (DMA) efficiency of a multi-data buffer. The method comprises (1) when an application program fills data into the data buffer, relevant information of the buffer is transmitted to a network card through a host machine input/output (IO) bus and is stored in an information management module of the data buffer; (2) when detecting that data in the data buffer need to be transmitted, the information management module of the data buffer extracts addresses and lengths of the data waiting for being transmitted from the relevant information of the buffer and transmits the addresses and the lengths of the data to a DMA request queue; (3) DMA request queue organizes requests of data blocks into one or more DMA requests meeting requirements of the host machine IO bus and transmits the DMA requests to a host machine; and (4) a DMA controller of the host machine responds received DMA requests and transmits requested data to the network card through the host machine IO bus. The system and the method for improving the DMA efficiency of the multi-data buffer are based on a multi-queue DMA engine in a non-descriptor mechanism and improve utilization rate and message transmission speed of the host machine IO bus.

The invention provides a wide and narrow orthogonal pulse compensation method for pulse radar. A pair of a wide pulse and a narrow pulse which are subjected to orthogonal modulation is emitted for each pulse repeated period, and then an accepting state is switched to; the wide pulse is in the front and the narrow pulse is at the rear in the pair of the wide pulse and the narrow pulse; and in the accepting state, an echo signal of the wide pulse and an echo signal of the narrow pulse, which are overlapped in time, are separated, by means of matching filers corresponding to the wide pulse and the narrow pulse respectively. According to the wide and narrow orthogonal pulse compensation method, after the wide pulse is emitted, the narrow pulse is directly emitted, receiving time of wide pulse echo is not required to be reserved, and the time interval of each pair of the wide pulse and the narrow pulse is zero or extremely short so that precious time resources are saved and not used, and additional time expenses are avoided.

The invention discloses a method for actively finding a malicious code control end, which comprises the following steps of: scanning host information, namely finding a host computer in an on-line state of which the operating system is Windows and which is provided with open ports in an IP address range needing to be scanned and determining at least one open ports of the host computer; and scanning control end information, namely establishing network connection with the open ports of the host computer, simulating a network behavior of a controlled end host computer corresponding to the known type of the malicious code control end, sending data to the host computer, analyzing the received return data, and if the data meets the characteristic of the known type of the malicious code control end, indicating that the type of the malicious code control end exists in the host computer. The method can effectively identify the malicious code control end, is suitable for large-scale scanning of the host computer in the Internet and has great practical significance for guaranteeing information security. Correspondingly, the invention also provides a device for actively finding the malicious code control end.

The invention relates to a spatial acceleration structure for a virtual three-dimensional scene of an animated film and a creation and update method thereof, which belong to the technical field of three-dimensional animated film rendering. The conventional spatial acceleration structures, such as KD-tree, BVH, uniform lattices and the like, and the creation and update method thereof have the main problem that each frame is required to recreate the spatial acceleration structure to further cause high maintenance overhead in the spatial acceleration structure. Through the spatial acceleration structure and the creation and update method thereof provided by the invention, geometric objects of the virtual three-dimensional scene of the animated film are divided into static geometric objects and dynamic geometric objects, and the spatial acceleration structures for primitives of the objects are created respectively and are linked through pointers, so each frame only needs to update the changed acceleration structures for the primitives of the dynamic geometric objects, which reduces the maintenance overhead in the spatial acceleration structures by 60 to 80 percent. The spatial acceleration structure and the creation and update method thereof are mainly applied in the field of the three-dimensional animated film rendering.

The invention provides a data storage method. According to the method, a key of a key-value pair is converted into a hash value from an object, converting the value of the key-value pair from the object into instance data, the data structure of the key and the value is improved; an object head of the key and the value, alignment filling and other parts are removed, storage space occupied by the object head and the alignment filling is saved; therefore, the storage overhead of the object in the key value pair is reduced, the function of compressing and storing the key value pair is realized, the key value storage efficiency is improved, the probability of problems such as memory recovery triggered by overlarge memory space is reduced, and the performance of the storage system is improved.

The invention discloses an application program updating method and device, computer equipment and a storage medium. The method comprises the following steps of: receiving a module operation request sent by a client; obtaining a module identifier and current version information contained in the request, acquiring the latest version information corresponding to the module identifier; comparing the current version information with the current version information; when the comparison result is inconsistent, determining that the parameters are inconsistent; sending a historical operation information acquisition request to the client, receiving historical operation information sent by the client, and analyzing the historical operation information; obtaining an update decision result, when the updating judgment result is that updating is needed; obtaining an update file corresponding to the module identifier and sending the update file to the client; according to the technical scheme, whetherthe application program is updated or not is intelligently judged according to the analysis of the historical operation records, so that the updating of the application program is targeted, meanwhile, the module needing to be updated currently is adopted for updating, the additional time cost caused by updating the whole application program is avoided, and the updating efficiency is improved.

The embodiment of the invention provides an inter-process communication method and device, relates to the technical field of computers, and aims to realize reading of a message in the case that a receiving end does not need to enter or exit a kernel space, avoid the time expenditure for the receiving end to enter or exit the kernel space, save the response time of the message and meanwhile reduce the disturbance of cache of the receiving end. The method specifically comprises the following steps: establishing a communication channel between the transmitting end and the receiving end; entering the kernel space and writing a channel number and a first parameter of the communication channel into the kernel space; acquiring a shared page table of the receiving end according to the channel number of the communication channel; mapping the physical address of a memory page of the message to a continuous idle page table entry of the shared page table of the receiving end to obtain a new virtual address of the message; storing the new virtual address of the message and the first parameter in a message notification region of the receiving end so as to read the message by the receiving end according to the new virtual address. The method and the device are applied to inter-process communication.

The invention discloses an agricultural machinery repeated operation area judgement method based on space analysis, and belongs to the technical field of agricultural machinery. The method includes the following steps that A, plot recognition is carried out according to information acquired by the agricultural machinery in the driving process; B, the boundary of a plot is recognized, and the areaof the plot is calculated; C, repeated operation is judged; wherein in the step C, C1, longitude and latitude positions of coordinates of the center point of the plot are encoded through Geohash encoding based on a dichotomy approximation principle, and C2, repeated operation calculation is carried out. By the adoption of a plot encoding mode, the screening range is narrowed, the operand of distance conversion between the longitude and latitude is reduced, and the purpose of rapidly and accurately calculating the repeated operation area is achieved.

The invention discloses a rapid Kalman online detection filtering method based on parameter dynamic adjustment. The method comprises the following steps: placing a to-be-detected object in the same detection environment for pre-sampling to obtain a plurality of groups of noisy data, and calculating a filtering data target value, a filtering data measurement variance and a Kalman gain lower limit threshold value based on the noisy data; calculating an initial estimation value of the filtering data and an initial estimation variance value of the filtering data in the online detection process ofthe detection object; wherein the initial estimation variance is determined according to an interval to which an error between an initial estimation value and a target value belongs; and performing Kalman filtering correction recursion operation based on the initial estimation value and the initial estimation variance value until the filtering data converges to obtain filtering data of online detection of the detection object. According to the method, the problems of high iteration frequency and low convergence speed caused by the fact that an initial estimation value cannot be adjusted in a traditional Kalman filtering method are solved, and the timeliness of filtering detection is improved.

The invention discloses a method and system for solving a distributable task scheduling model. The hybrid timing constraint distributable task scheduling model is built and solved with a genetic algorithm. According to the method and system, the releasing time of processors is sufficiently considered in the distributable task scheduling model, and the method and system are more reasonable and more effective; the running time of the genetic algorithm for solving the model is much shorter than the time of an exhaustive algorithm, and the optimal solution of the model can be more efficiently and more accurately solved.

The present invention discloses a method for rapid cooperation expression of face classification. The method comprises: obtaining a plurality of face images of all the measured personnel, and combining a training sample set and a test sample set; projecting the training sampling set into a PCA subspace, and obtaining the feature face set of the sample set; performing common linear expression of the test samples through adoption of the feature faces and an intra-class variable dictionary; initializing dictionary coefficients through the 12 paradigm iterative computations in a dictionary space, and subsequently performing second introduction of 11 paradigm to complete the accurate optimization of the coefficients; projecting reconstructed test samples PCA coefficients and dimensionality reduction samples to an LDA subspace, and respectively obtaining LDA coefficients of the reconstructed test samples and the training samples; and selecting the category having the minimum reconstruction errors with the test samples as the final candidate category of face test samples. The method for rapid cooperation expression of face classification effectively rejects the information redundancy between the training samples and the test samples, improves the face identification precision, greatly reduces the time expenditure of a traditional expression optimization method and has good universality and the robustness.

The invention discloses a whole network flow measurement method and system in a data center network and a packet loss detection method. The system comprises a collector used for supporting to capture all flows flowing through a switch, and the collector comprises a data packet analysis module, a buffer module and a counting table module; the data packet analysis module is used for analyzing quintuple information and data packet size information of a received data packet; the buffer module is used for establishing and maintaining a buffer space to buffer the traffic information and maintaining the traffic information in the buffer space; the buffer module updates the traffic information in an incremental operation mode; the counting table module is used for establishing and maintaining a counting table to store the flow information and maintaining the flow information in the counting table; and when the cache space of the cache module is not spare, the traffic information in the cache space is compressed and then is updated or added to the corresponding position of the counting table. The real-time performance, the accuracy and the comprehensiveness of the flow information can be ensured, and diversified network measurement requirements are supported.

The invention discloses a compression storage and calculation method for high-dimensional interpolation. The compression storage and calculation method comprises the following steps: recursively constructing a deep storage tree of an interpolation independent variable according to the interpolation independent variable of each dimension of an interpolation table for searching an interpolation interval of each dimension, constructing a dynamic interpolation binary tree according to the interpolation independent variable, converting an interpolation calculation process into graph operation on the tree, and finally obtaining a result. The storage tree structure of the multi-dimensional interpolation table greatly compresses the storage overhead of repeated data; and the establishment of the dynamic interpolation binary tree unifies the interpolation process of a linear interpolation space and a nonlinear interpolation space, simplifies the calculation, and is helpful for chip-level implementation to greatly improve the efficiency of high-dimensional interpolation calculation. A tree type and binary search method is combined, so that the time expenditure of performing linear sequentialsearch on interpolation coordinate vectors in a traditional method is avoided, and the search efficiency is improved from a linear level to an exponential level. Along with the increase of the orderof magnitudes of problem dimensions, the advantages are more obvious.

The invention discloses a prefabricated body development method, device and equipment and a medium. The method comprises the following steps: obtaining each art resource on which a target preform depends; judging the availability state of each art resource according to a corresponding preset standard; when the target art resources in the abnormal state exist, abnormity elimination is conducted onthe target art resources; and when all the art resources are in a normal state, all the art resources are optimized and combined to generate a target prefabricated body. According to the method, the time cost caused by repeatedly executing the processing and verification process of the art resources is relatively avoided, so that the overall efficiency of the prefabricated body in the developmentprocess can be relatively ensured. In addition, the invention further provides a prefabricated body development device and equipment and a medium, and the beneficial effects are the same as those mentioned above.

The present invention relates to an optimization method for formalized modeling. In a critical and real-time flight control system that has strict requirements on time, single use of a formalized modeling design method causes time cost brought by partial intermediate redundant codes generated in a modeling process and requirements of a hard real-time task system cannot be met. According to the scheme adopted by the present invention, by introducing a formalized modeling tool and a bridging technological method of a general library, an architecture design of a system is completed by means of a formalized modeling method at an early period and calculation analysis is performed on performances, such as time cost, of each module in the system; and for the module that has relatively large time cost or not good performance, an existing general library is bridged by using a self-adaptive adaptation layer, so that cooperative work of the formalized modeling method and the general library is implemented, and performance optimization is performed on formalized modeling.