235results about How to "Reduce the number of comparisons" patented technology

The invention provides a face tracking method with classification and identification functions, which comprises the following steps: 1. a sequence to be matched of a current frame is F1, F2; a sequence to be matched of a front frame is F1,F2to Fj; 2. Fm of the current frame is taken out in sequence, and an LBP code pattern is calculated; 3. the obtained LBP code pattern is compared with an LBP code pattern of the front frame so that Fn which has the maximal matching degree with the Fm is found out; 4. whether a person is the same person or not is judged according to the matching degree and the central position distance relation; if so, face images of the same of the person are classified into the same type, if not, Fj+1 equal to Fm is added in the FL sequence; 5. the step 2 to the step 4 are repeated until the matching sequence of the current frame is traversed; and 6. the step 1 is back, and the next frame is processed. The invention adopts LBP characteristics with a rotary uniform mode to classify and identify the identity of a person, classifies the same person into one kind, solves the problem that information is lost after the person is sheltered in the traditional face tracking method, expands the function of a face tracking system and improves the application value thereof.

The invention relates to a distributed index method based on LSH (Locality Sensitive Hashing). The distributed index method comprises the following steps: firstly utilizing a clustering algorithm to cluster mass data sets; then mapping clustering centers to different computational nodes; then mapping original mass picture or video characteristic data to the computational nodes corresponding to the type so that each node can process one type; finally utilizing the method based on p-stable distribution LSH to establish data index on different nodes. In order to reduce the merging time of search results on different computational nodes and improve the quality of the search results, the invention provides two methods to select m types recently for subsequent detailed search. The invention provides a guide for automatically mapping the mass data to the different computational nodes; moreover, according to the method, the detailed comparison times during the search period of the LSH further can be effectively reduced, so that the search of the mass data is more accurate and efficient.

The invention discloses an index tree based huge database access control method, belonging to the technical field of data processing. The invention aims at combining twice retrieval for access control of data objects in the traditional access control methods into once retrieval in order to improve the efficiency of access control. The method comprises a) establishing an index tree for a database, b) establishing an authorization message set on each node of the index tree and c) after the users make access requests, sequentially retrieving the authorization message set of each node downwards layer by layer from the root node of the index tree to the node of the data objects until the determined access control results can be obtained according to the authorization message set on a certain node, wherein the set comprises the operation authority of the users towards all the data objects in the nodes and the child nodes of the nodes, and the determined access control results comprise acceptance or refuse of the access requests. The method can be used for various huge databases, in particular suitable for spatial databases.

The invention discloses an anti-spam method based on micro-content similarity. The method comprises clustering the comments that are discriminated to be the spam manually to generate a clustered spam file; and discriminating the unknown comments by using a spam discriminator according to the clustered spam file. The method for scoring the similarity of a random sample in all spam comment classes with a comment to be processed and scoring the class where the random sample with the highest similarity can obviate the similarity comparison between the spam comment to be processed and the clustered spam so as to effectively reduce the frequency for comparing the comment similarities, thereby improving the efficiency of spam discrimination and the clustered spam file maintenance to satisfy the performance requirement for massive spam discrimination on the internet.

An embodiment of the invention provides a method and a system for building indexes and a method and a system for retrieving the indexes. The method for building the indexes includes enabling an acquisition server to store acquired real data and generating index data according to storage positions of the real data; storing the index data into current buffer blocks according to a key value sequence; continuously arraying the index data in the buffer blocks into index blocks according to the key value sequence; sequentially arraying the index blocks to form index files. The index data comprise key values. The method for retrieving the indexes includes acquiring key values of target data; comparing the key values of the target data to key value ranges of the various index blocks in the index files and determining certain index blocks with the key value ranges covering the key values of the target data as target index blocks; searching the target index blocks to obtain index data with key values equal to the key values of the target data and using the index data as target index data; extracting storage positions of the target data from the target index data and reading the target data at the storage positions.

The invention provides a method for clustering optimization based on a Canopy algorithm. The method comprises the following steps of step (101) carrying out packet processing on all original data based on the Canopy algorithm in order to obtain N Canopy sets and a center of each Canopy set; and step (102) taking a number N of the Canopy sets as a divided number k constructed by a K-means clustering algorithm; taking the center of each Canopy set as a cluster center of a divided kth cluster; and adopting the K-means clustering algorithm to carry out clustering optimization processing on all original data based on the determined cluster number k and cluster center, and outputting a clustering optimization result. According to the method and the system, the Canopy clustering algorithm is used for preprocessing of the K-means clustering algorithm and is used for finding the proper k value and cluster center. The running time of the whole cluster is greatly reduced, the computational efficiency of the algorithm is improved, and the fault tolerance of the algorithm is increased.

The invention provides a hash-based method for searching a CAM (central address memory). The CAM has a data storage function and a high-speed data content searching function and also supports multiple instructions such as reading, writing and searching. However, the most important function of the CAM is the high-speed data content searching function, and the searching function is based on other functions of the CAM. Therefore, the core of the design of a CAM functional model is the design of a high-speed searching engine. The searching engine can maintain a sheet and receive external input data. The input data and each item in the sheet are completely compared (accurate) or partially compared (Don'tcare function) through a certain search algorithm in the searching engine, and then comparison results are output. The rapid CAM content search can be achieved via a hash function. When a request is searched through the CAM, hash calculation is carried out for data to be searched to obtain a hashkey, a first address of a CAM table item data linked list is obtained via access to a hash entry table according to the hashkey (as a hash entry table address), the access to the CAM data table item linked list is completed, the data to be searched and items in the CAM data linked list are compared one by one, and finally CAM search results are returned.

The invention discloses a face recognition method, and the method comprises the following steps: obtaining a face image of a to-be-recognized person, inputting the face image into a target network model, and obtaining a target group category label and feature data of a face; reading face image feature data with a target group category label and marked personnel identity information from a database; and comparing the feature data with the face image feature data, and determining identity information of the to-be-identified person according to a comparison result. According to the method, the comparison frequency can be reduced, the comparison time is shortened, and the face recognition efficiency is further improved. The invention further discloses a face recognition device and equipment and a readable storage medium which have corresponding technical effects.

The invention relates to a device for detecting gene fusion of circulating tumor DNA (deoxyribonucleic acid) samples. The device comprises a sequencing data acquisition module, a comparison module, a re-comparison module, a real fusion breakpoint judgment module and an output module. The device for detecting the gene fusion of the circulating tumor DNA samples has the advantages of high detection speed and stability and low resource requirement.

The invention discloses a method and a device for rapidly positioning water color abnormity based a remote sensing image, and belongs to the field of water pollution monitoring. The method comprises the following steps: obtaining the remote sensing image, and extracting a water area part; calculating the normalized water index of the water area, and performing mean calculation by using a mean operator; comparing the mean-calculated normalized water index distribution image with a water color abnormality judgment threshold to obtain a water color abnormity window distribution image; performingmask operation on the normalized water index distribution image by using the water color abnormity window distribution image to obtain a preliminarily-determined water color abnormity area distribution image; and comparing each pixel of the preliminarily-determined water color abnormity area distribution image with the water color abnormity judgment threshold to obtain a water color abnormity area. Scale conversion is performed by using the mean operator, so the comparison frequency is reduced, the processing time is greatly shortened, the speed and the accuracy of water color abnormity detection are improved, and a technical support is provided for the environmental emergency management department.

The invention discloses a successive-approximation analog-to-digital converter and a quantitative method based on an adaptive prediction interval thereof, and belongs to the technical field of analog-to-digital conversion. In the invention, a DAC module comprises two redundant capacitances; the quantitative method comprises the steps of switching a first redundant capacitance according to a firstcomparison result before the redundant capacitance is switched and obtaining a switched second comparison result; judging whether to continue quantification or to switch the second redundant capacitance according to a comparison of the first comparison result and the second comparison result and obtaining a switched third comparison result; and then judging whether to adjust a prediction intervalor to directly start the quantification from a highest digit according to a comparison of the second comparison result and the third comparison result. According to the successive-approximation analog-to-digital converter and the quantitative method based on the adaptive prediction interval thereof, a sampling point in a window size range of the prediction interval can be guaranteed to be predicted correctly; and through the correct prediction, the comparison times and the switching times of a capacitance switch in the DAC module can be greatly reduced.

The invention relates to an index read-write method based on compression merging and asynchronization updating. The method includes the steps that indexes are used for generating index cache files according to storage region serial numbers; incomplete index cache files or writing index cache files are filtered and removed; when the total number of the index cache files meets the asynchronization updating initiation condition, data of storage regions corresponding to the same storage region serial numbers in all the index cache files are read respectively, and the data are merged and sorted; data of storage regions corresponding to the current storage region serial numbers in an index database are read and decompressed; the data are merged, sorted and compressed, the executed data are covered and updated to the storage regions corresponding to the current storage region serial numbers in the index database, and metadata are updated; whether the ends of files of the index cache files are read is judged, if yes, the process is completed, if not, the storage region serial numbers are added with one, and the process is executed continuously. Compared with the prior art, the index read-write method based on compression merging and asynchronization updating has the advantages of being efficient, asynchronous, capable of reducing the data size for reading a magnetic disk every time and reducing the index comparison frequency and the like.

The system thereof comprises: a web server connected to the client side; a database connected to the server, a broadcast device connected to the database for use in saving the number information provided by the task request of group-sending message into the zone mapping table of memory. The method includes the following steps: the broadcast device gets the numbers provided by the task request of group-sending message from database and saves them into memory; according to the parent zone information, extracting the number section information of each zone corresponding to parent zone from database; after comparing the number information to the number section information of each zone corresponding to the parent zone, the number information is saved into the zone mapping table and then is sent to the short message center.

The invention discloses an adaptive quantized analog-to-digital converter. A comparing unit compares an analog input signal with a feedback reference signal, and outputs comparative results to M shifting registers and a division accumulation unit; the shifting registers store the comparative results from the comparing unit in a clock sequence, and output M parallel-by-bit data to an adaptive quantized arithmetic unit; the adaptive quantized arithmetic unit determines an initial quantized value according to the M parallel-by-bit data output by the M shifting registers, and outputs the initial quantized value to the division accumulation unit; the division accumulation unit divides the initial quantized value by 2 from the first comparison to M comparison by the comparing unit, and outputs a result obtained by accumulation or decreasing to the input end of a digital-to-analog converting unit and the output end of the analog-to-digital converter; and the digital-to-analog converting unit performs digital-to-analog conversion on the output result of the division accumulation unit and outputs to the negative input end of the comparing unit.

The invention discloses a Tibetan language thesis copying detection method and a Tibetan language thesis copying detection system based on Tibetan language sentence levels. The Tibetan language thesis copying detection method includes: subjecting Tibetan language text characters to code conversion and noise removal preprocessing; segmenting a text into text blocks according to sentences through boundary identification of Tibetan language sentences and establishing a temporary table of segmented text blocks; extracting and computing text features from a sentence-document inverted index table and the temporary table according to the number of the sentences to obtain sentence similarity; establishing an adjacency list in accordance with the sentence similarity, computing text block similarity and detecting copying of two Tibetan language theses according to a text block similarity value. The Tibetan language thesis copying detection system comprises a Tibetan language thesis copying detection device and a database, wherein the Tibetan language thesis copying detection device is connected to a client terminal server through the Internet, and the database is connected to the server and used for storing Tibetan language theses. The Tibetan language thesis copying detection device comprises a preprocessing module for code conversion and noise removal of the text characters, a temporary table module for constructing the segmented text blocks, an extracting module for constructing sentence text features and a copying detection module for detecting whether the theses have similar copied data or not.

The invention discloses a multi-dimensional distance clustering anomaly detection method and system based on a time sequence, and belongs to the technical field of aviation safety. The multi-dimensional distance clustering anomaly detection method based on the time sequence comprises the following steps: step 1, preprocessing a trajectory data set, the preprocessing comprising cleaning and re-integration; 2, calculating the multi-dimensional similarity between the tracks; 3, for the multi-dimensional Hausdorff distance, constructing an inter-track similarity matrix; 4, carrying out a hierarchical clustering algorithm of the multi-dimensional hausdorff distance; selecting a hierarchical clustering algorithm in machine learning to perform hierarchical clustering based on the similarity matrix; and step 5, detecting the anomaly detection effect of the algorithm, constructing a track with anomalies in speed, direction, longitude and latitude, clustering the abnormal track with a normal track through the hierarchical clustering algorithm, and evaluating the clustering algorithm by selecting a correct rate, a precision rate, a recall rate and an F1 value.

The invention solves the problem of rapid query and matching of corresponding point objects in mass two-dimension point data according to two-dimension coordinate values, and provides a method for rapidly matching coordinates of mass two-dimension point data. In the method, firstly, all the two-dimension point data are subject to composite structure organization: first, calculating an envelop rectangle where the mass two-dimension points are, then, disassembling the envelop rectangle into regularly-arranged small rectangle grids according to a fixed length and width, then according to the space coordinate positions, respectively distributing all the two-dimension point data into the small rectangle grids. On that basis, a rule of point data object sorting according to the two-dimension coordinate values is set. Based on the rule, the two-dimension point-set data objects distributed in each grid are organized using a binary tree structure. On the basis of the above structure's successful establishment, the rapid query and matching of the two-dimension coordinate points can be realized, and the whole matching retrieval process can be made independent of the data bulk.

The invention relates to a flow table rapid searching method and system under a high-concurrency network environment. The method comprises the steps of: 1) counting the flow entering a network interface, setting a buffering window of a buffering area according to the counted current flow state; 2) according to the size of the set buffering window, utilizing quintuple information to group arrived data packets; 3) according to a preset scheduling strategy, scheduling each cached group, and successively sending each group to a connection management module; and 4) extracting the quintuple information of each group by the connection management module, carrying out flow table searching, finding corresponding flow table items, and using the data packets in the groups to update the information of the flow table items. The flow table rapid searching method and system are mainly suitable for a high speed network flow processing system of a backbone link, the access cost of the connection management module under the high speed network environment is optimized, and the access efficiency of the flow table is improved.

The invention discloses an index structure based on a dictionary tree, a data query optimization method and a main memory manager, and belongs to the field of data storage. The index structure is composed of containers, wherein the containers store T nodes and S nodes; complete keys are divided into partial keys; the T nodes store the front m / 2 bits of the partial keys, and the S nodes store the rear m / 2 bits of the partial keys; and the partial keys passing through a certain node path from the root node of the dictionary tree are connected to form the complete keys. And the index structure ismore compact, so that the main memory space utilization rate is improved. The T node is directly skipped to a subsequent brother node by using a skipping relay, so that the comparison frequency is reduced, and the search performance is improved; a T node skip list is used for skipping a T node to an S node, a container skip list is used for skipping the S node to the T node, and the S node directly skips to the nearest target, so that a large number of unnecessary entries are skipped, and the searching performance is improved; and the index structure and the main memory address are completelydecoupled by a pointer P which is analyzed by the main memory manager and contains each hierarchical structure ID.

The invention discloses a scan chain failure diagnosis method and a system thereof. The method comprises the following steps: a candidate scan unit assembling is made up of scan units in the scan chain of a chip to be tested, and a candidate pair to be tested is selected in the assembling; according to the failure types, a corresponding fixation type failure diagnosis device is established for the candidate pair to be tested; diagnosis vectors are generated for the candidate pair to be tested by utilizing the device, and are stored in the diagnosis vector assembling for processing scan chain failure diagnosis to the chip to be tested. The method also comprises the following steps: all the diagnosis vectors in the diagnosis vector assembling are loaded to the chip to be tested one by one to get failure responses; and according to the failure responses, the scan chain failure diagnosis for the chip to be tested is processed. The failure scan chain is diagnosed in the circumstances without any spending of area and routing by adopting the method, and the traditional scan chain diagnosis flow is not changed, thereby the logic diagnosis cost is reduced.

The invention relates to the field of computer data transmission and discloses a method for increasing the read-write speed of spatial big data files. The method for increasing the read-write speed of spatial big data files comprises a zero-copy step, a file buffering step and a digest checking step and particularly comprises the steps of when a read-write access is performed on a spatial big data file, obtaining a message digest of the spatial big data file through the digest checking step and comparing the message digest of the spatial big data file with a message digest of a file in a cache system; if the spatial big data file has the same copy in the cache system, updating cache hit information of the copy, updating the weight W of the copy, adjusting the link position of the copy in a sequential linked list according to the weight W of the updated copy, and transmitting the copy through the zero-copy step; if the spatial big data file does not have the same copy in the cache system, creating the copy of the spatial big data file in the cache system, updating the weight W of the copy, and transmitting the copy through the zero-copy step. The method for increasing the read-write speed of spatial big data files has the advantages of overcoming data read-write bottlenecks and being beneficial to increasing data read-write speed on the whole.

The invention discloses a comparing method and a device for RNC (Radio Network Controller) configuration data in order to solve the problem of low efficiency in the comparing method of the background technology. The method comprises the following steps of: building a reference tree and an updating tree according to the RNC configuration data; determining the configuration data with the same service types in the updating tree and the reference tree; carrying out the one-way comparison between nodes of the configuration data in the updating tree and the nodes of the configuration data in the reference tree, and extracting the configuration data with different nodes; and carrying out the one-way comparison between fields of the configuration data in the updating tree and fields of the configuration data in the reference tree in the configuration data with the same nodes, and extracting the configuration data with the same nodes and different fields. The method disclosed by the invention stores the RNC configuration data needing to be compared in an RNC configuration data tree model built by the cumulative accumulation to quickly select the RNC configuration data with the same service type for comparison, and carries out the one-way comparison for the nodes and the fields to improve the comparison efficiency.

The embodiment of the invention discloses a consensus establishment method based on a lot drawing mechanism, devices and a readable storage medium, and relates to the field of information processing.The method, the devices and the medium are used to reduce time consuming of consensus algorithms in the lot drawing mechanism. The method of the embodiment of the invention includes: acquiring first data, which are broadcast by an accounting node of an end-position block in a block chain, by a current node; using a local private key to carry out signature on a hash value of the first data to obtain second data; carrying out hash operation on the second data to obtain a local candidate hash value; then determining a broadcast moment, which corresponds to the local candidate hash value, according to the first algorithm; then broadcasting the local candidate hash value to the block chain at the broadcast moment corresponding to the local candidate hash value, determining alternate hash valuesaccording to an order of time when foreign candidate hash values are received; and selecting a target hash value from the local candidate hash value and the alternate hash values, wherein a node corresponding to the target hash value is an accounting node of a to-access block.

The present invention discloses a method and device for upload comparison. The method comprises: generating a hashed value for each data item in a first system and generating a first mapping relation table according to the hashed value and the mapping relation between the corresponding data items; generating a hashed value for each data item of a second system and generating a second mapping relation table according to the hashed value of the second system and the mapping relation between the corresponding data items; and, comparing the first mapping relation table with the second mapping relation table and generating an executing message according to the comparative result. Through the technical proposal, the flows for the upload processing and the upload comparison are unified and simplified, the number of the upload comparison can be reduced, and the efficiency of the upload comparison is improved.

The invention relates to an image processing method and device, electronic equipment and a storage medium, and the method comprises the steps: carrying out the feature extraction of a to-be-processedimage, and obtaining a first feature of the to-be-processed image; according to the first feature and class center features of a plurality of reference image classes in a feature library, determiningan image class of the to-be-processed image; and under the condition that the image category of the to-be-processed image is a first category in the plurality of reference image categories, updating acategory center feature of the first category according to the first feature and a plurality of pieces of feature information of the first category in the feature library. According to the embodimentof the invention, the image retrieval speed and accuracy can be improved.

The invention discloses a microblog topic detection method based on an improved Single-pass clustering algorithm. The method includes microblog text content collection, text preprocessing, text vectormodel establishment based on LDA (Latent Dirichlet Allocation), text clustering based on the improved Single-pass clustering algorithm, and result evaluation. The improved Single-pass clustering algorithm includes: adding a time parameter, calculating clustering center points for category data, and inputting the data in a batch manner. According to the method and the algorithm, identity of topicsis guaranteed through adding the time parameter; the new data are compared with the clustering center points through calculating the clustering center points for the category data, thus reducing of frequency of comparing the new data with each piece of data is facilitated, and efficiency of calculation is improved; and newly input clustering center points are compared with the center points afterclustering through inputting the data in the batch manner, namely firstly clustering the data and then inputting the same, operation efficiency is improved, and operation space is saved.

The invention provides a rapid comparison method of versions of remote files, comprising the following steps: 10) generating the newest uniform version information files on a service end according to the newest programs; and reserving previous uniform version information files of the service end on a client; 20) downloading the uniform version information files of the service end by the client; 30) comparing the uniform version information files downloaded by the client with local uniform version information files one by one; if the comparison result is consistent, continually carrying out the next program; otherwise, notifying the client to download and update a local program and then comparing the next program until all the programs are compared; and 40) requesting to download the program to be updated by the client, and covering and replacing the previous program by the downloaded program; and generating the uniform version information files of the client according to the downloaded and updated local programs. According to the rapid comparison method provided by the invention, the operation load of the service end can be reduced, so as to realize rapid comparison between the programs of the client and the service end.

The invention provides a quick target association method based on the clustering analysis. The quick rapid target association method aims at reducing the unnecessary times of comparison between target positions and attributes, and improving the timeliness of target association on the premise that the association result is not affected. According to the scheme, the method comprises the steps: firstly, constructing a structural body array for storing information of two sub-source targets to be associated at the same time, and marking sub-source serial numbers, information addresses and association status; secondly, utilizing quick position coordinate sorting method and a quick attribute clustering method for conducting recursion quick sorting and quick clustering on the targets to be associated in the structural body array according to position components and attribute information on the basis of the set priority level relation, and constructing a spatial index tree; under the support of the spatial index tree, adopting a density-based clustering algorithm to conduct recursion clustering on the two targets which are measured by sub-sources, are adjacent in position and are the same in attribution; after the sum of sub-sequence targets is smaller than the preset value or when unused attribute information does not exist, converting into a one-by-one comparison association method to complete target association judgment.