37 results about "Comparison sort" patented technology

The invention relates to a video text retrieval method based on spatial time sequence characteristics, which comprises the following steps of: performing hierarchical fine-grained comprehensive video unified representation on spatial time sequence semantic information of a video by utilizing three different types of neural networks; and constructing a video text public semantic embedding network to fit a semantic gap of cross-modal data, and training the network by using a comparison sorting loss function. The method can be used for mutual retrieval of video natural language texts, the layered feature extraction method fully excavates more discriminative complex space-time semantic information of video modal data, and the video text public semantic embedding network effectively learns public space feature representation with different modal heterogeneous data semantic feature identical distribution. The semantic association between the high-order features of the video and the natural language text is accurately measured through public space feature representation, and the retrieval precision of the video natural language text is improved.

The invention relates to the technical field of mobile communication. The invention discloses an intelligent arranging and searching method for a mobile phone contact, which comprises the following steps: firstly, establishing various arranging code tables according to different input methods of a mobile phone; secondly, converting information; and finally, carrying out comparison sort. In the invention, the name and number of the contact are stored and coded. The intelligent searching method for the mobile phone contact of the invention comprises the following steps: firstly, inputting number keys; secondly, obtaining the contact according to the codes of different input methods; thirdly, displaying the information of the contact; and finally, selecting the contact. The invention can search under the condition that the information of the contact is incomplete. The contact searching method of the invention is convenient and quick.

The invention belongs to the field of service recommendation based on geographical locations. The method is characterized in that multiple type points can be returned through a one-time request according to user requirements to form combined recommendation. The method sequentially includes the following steps that 1, a scanning line is used for conducting scanning from right to left, and visible points of all the points are found and connected in the scanning process to form a visible net of the whole network; 2, by means of a recursive concept, a 2-isomerous point group is constructed from the simplest single-point structure, and in this way, (N-1)-isomerous point groups can be obtained sequentially. In order to reduce unnecessary matching, the L layer near point concept is provided, and namely only some point groups close to the current point are taken into consideration during matching; GN-1 is obtained in the step and comprises the (N-1)-isomerous point groups; 3, based on the previous bedding, alternative N-isomerous point groups are formed in the step, the first K optimal combinations are kept always through comparison sorting to obtain a final set B including the K optimal combinations, and the set B is returned to a user.

To provide an embedded information / alteration detection apparatus as well as an embedded information / alteration detection method, and a computer-readable record medium storing an embedded information / alteration detection program therein, which can embed and read out information without any change in the “significance” and “quality” of represented data. In an embedded information apparatus, a plurality of structural data are sorted on the basis of a first rule, a message digest is calculated for a sorted result, and the sorted result is further sorted on the basis of a second rule that is different from the first rule by using a calculated result as a key. In an information alteration detection apparatus, a plurality of structural data are sorted on the basis of a first rule, a message digest is calculated for a sorted result, and the sorted result is further sorted on the basis of a second rule by using a calculated result as a key. The sorted result, and the data before being sorted on the basis of the first rule are compared. If they agree, the absence of any alteration is decided, and if they do not agree, the presence of any alteration is decided.

The invention discloses a comprehensive guiding method for electric vehicle leasing. According to the technical scheme, the method solves the problems in the prior art and comprises the following steps that a vehicle borrowing step: a user uploads current account number data, a starting point and a destination, a server provides an electric vehicle meeting the requirements of the user according tothe states of all current idle vehicles, and the user obtains the use right of the electric vehicle; A matching step: the server matches at least one similar comparison driver conforming to the driving level of the user according to the account data of the user; A comparison step: carrying out score comparison according to the comprehensive driving data between the comparison driver and the user,and giving a comprehensive sequence of the comparison driver and the user according to a comprehensive score comparison result; And a settlement step: carrying out data adjustment on all comparison drivers and users participating in the comprehensive comparison sorting according to the ranking sequence, and giving corresponding driving suggestions according to the difference between the driving data of the users and the comparison drivers.

Embodiments of the present invention provide a method, computer program product and system for increasing sorting efficiency by utilizing a determined crossover point. Initially, a set of data, containing a number of tuples, to be sorted is received. A determination is made as to the number of radix sort iterations to perform based on the number of tuples of the received data. A countdown timer is set based on the determined number of radix sort iterations. Radix sorts iterations are performed recursively. After each iteration, the countdown timer is decreased. Upon the countdown timer reaching zero, one or more comparison sorts is performed on the remainder of the set of data not sorted by the radix sorting.

The invention relates to the technical field of electric digital data processing, and concretely relates to a data processing system capable of performing priority allocation. The system comprises a file receiving unit, a data sorting unit, a two-way merging unit and a file processing unit; the data sorting unit comprises a datamation recognition module, a data quasi-calculation module, a data comparison module, a gradual change sorting module, a data analysis module, a command receiving module, a positioning sorting module and a transmission module; and the two-path merging unit comprises a data integration module, a comparison sorting module, an optimal sorting module and a sorting command transmission module. After the data is classified and ranked into the priority sequence, the ranked priority sequence is integrated and ranked again to obtain the most priority sequence of the file, so that the calculation load of the cup is reduced, the cup operation speed is increased, and the normal operation of the cup is ensured.

The invention relates to the technical field of mobile communication. The method for sorting and storing the phone book of the handheld device of the present invention includes the steps of: firstly, establishing a code table; secondly, converting information; finally, comparing and sorting. Each user of the phone book of the present invention is converted into the size arrangement of corresponding numbers with the name storage code (Unicode); . The search method of the phonebook of the handheld device of the present invention comprises the steps of: firstly, inputting number keys; secondly, calling users; thirdly, displaying users; finally, selecting users. The search method of the present invention is convenient and fast.

The invention relates to a peak-to-average ratio detection device. The peak-to-average ratio detection device comprises a detection control module, an instantaneous power detection module, an average power calculation module, a comparison sorting module and a data processing module; the detection control module is used for receiving a detection triggering signal and a configuration signal to generate a control signal according to the detection triggering signal and the configuration signal; the instantaneous power detection module is used for detecting instantaneous power of a detection signal according to the control signal; the average power calculation module is used for calculating the average power of the instantaneous power detected by the instantaneous power detection module; the comparison sorting module is used for sorting the instantaneous power obtained in detection to obtain the instantaneous power at the target sorted position; and the data processing module is used for calculating the peak-to-average ratio of the detection signal according to the average power and the instantaneous power at the target sorted position. The peak-to-average ratio detection device can detect the signal peak-to-average ratio generated when mobile equipment runs in real time and perfects the maintainable and detectable functions of the mobile communication equipment. The invention further relates to a peak-to-average ratio detection method and mobile communication equipment.

Embodiments of the present invention provide a method, computer program product and system for increasing sorting efficiency by utilizing a determined crossover point. Initially, a set of data, containing a number of tuples, to be sorted is received. A determination is made as to the number of radix sort iterations to perform based on the number of tuples of the received data. A countdown timer is set based on the determined number of radix sort iterations. Radix sorts iterations are performed recursively. After each iteration, the countdown timer is decreased. Upon the countdown timer reaching zero, one or more comparison sorts is performed on the remainder of the set of data not sorted by the radix sorting.

The invention discloses a method and a device for identifying text-independent writing, and belongs to the field of computer vision. The method comprises: preprocessing a query wring sample to obtain edge images of the query writing sample; extracting network microstructure characteristics of the query writing sample from the edge images of the query writing sample; calculating a standard difference of the network microstructure characteristics of the query writing sample and the network microstructure characteristics of each reference writing sample; calculating characteristic intervals of the network microstructure characteristics of the query writing sample and the network microstructure characteristics of each reference writing sample through weighing the standard difference; and comparing and ordering the characteristic intervals to obtain a writer candidate list of the query writing sample. The device comprises a preprocessing module, a characteristic extracting module, a weightcalculating module, an interval calculating module and a comparing module. The method obtains a writing candidate through comparing intervals of the network microstructure characteristics, and improves accuracy and identifying property of writing identification.

The invention discloses a ranking method for word recognition, which is suitable for execution in an intelligent mobile terminal. The intelligent mobile terminal is provided with a database, and the database contains vocabulary and user IDs for learning and operating these vocabulary. The method Including the following steps: S1: count the number of user IDs, S2: determine word recognition S3: insert new words and reorder: S3‑1, word C and word A are compared and sorted separately; S3‑2, word C and word B are compared and sorted Separate comparison and sorting; S4: sorting judgment of all words; S5: repeat step S4 until all the thesauruses in the database are sorted. The present invention sorts the recognition degree of words by collecting the learning feedback data of users, and according to the data analysis, the recognition degree of the word with a large number of feedback is defaulted to be higher, and a large number of data statistics are repeated to sort to improve the word recognition degree. Accuracy of word recognition ranks.

The invention discloses a pulse pairing method based on substring search, which can more quickly handle the situations of larger received pulses and less target radiation source pulses, and reduce false peak influences formed by a cross term, and belongs to the technical field of signal processing. The method comprises the following steps: firstly, performing pulse pre-sorting on a pulse sequence received by a master station, so as to obtain a pulse time interval sequence PRI1 of the master station, and quantifying; determining a time range of a corresponding secondary station, and obtaining a pulse time interval sequence PRI2 of the secondary station; constructing n suffixes of the sequence PRI1 and the sequence PRI2 for dictionary comparison sorting; screening two adjacent suffixes respectively belonging to the mater station and the secondary station and taking the maximum common prefix of the two adjacent suffixes; obtaining corresponding pulse trains, respectively used as a master station substring and a secondary station substring, of the maximum common prefix in the master station and the secondary station; performing joint operation on the master station substring and the secondary station substring, and then re-ordering according to an average time difference value, so as to obtain a pulse pairing result.

The invention provides an ordering method and device of mixed fields. The ordering method and device of the mixed fields is characterized by comprising the following steps that all characters in the mixed fields are converted into Unicode values; the Unicode values of the converted fields are compared and ordered, and if the Unicode values of two fields are completely the same, the Unicode values of all Chinese characters in initial Chinese character fields are compared one by one and are ordered. The ordering method and device of the mixed fields can effectively avoid the situation that the code values after conversion of the Chinese characters and letters are the same and the ordering problem caused by errors of code values of homophone Chinese characters and multiple Chinese characters due to the fact that complete spelling letters are the same, reduces ordering errors and improves retrieval efficiency.

The invention provides a data preprocessing sequencing circuit of a touch screen controller, which relates to the field of data preprocessing sequencing circuits. The data preprocessing sequencing circuit comprises a clock generating module, a register module and a data comparison module group, wherein the clock generating module generates required clock signals, the register module can be used to temporally store input data and input data needing sequencing to the data comparison module group, and the data comparison module group performs sequencing processing to the received data and outputs the data which are sequenced. The invention overcomes shortages that a common sequencing circuit is relatively large in occupation area, and can complete data comparison sequencing operation just byusing a D trigger, a one-out-of-two data selector, a data comparator and a coincidence gate, thereby largely reducing the area of controllers, and saving cost.

The invention belongs to the field of service recommendation based on geographic location, and is characterized in that multiple types of points can be returned through one request according to user requirements to form a combined recommendation. It contains the following steps in sequence: Step 1: First, use a scan line to scan from right to left, and during the scanning process, find the visible points of each point and connect them to form a visible network of the entire network. Step 2: Using the idea of ​​recursion, construct 2-isomeric dots from the simplest single-dot structure, so that (N-1)-isomeric dots can be obtained in turn. In order to reduce unnecessary matching, the concept of L-layer adjacent points is proposed, that is, only some point groups close to the current point are considered when matching. Get G at this step N‑1 , which contains (N-1)-isomeric groups. The third step: With the previous foreshadowing, in this step, an alternative N-heterogeneous point group is formed. Through comparison and sorting, only the top K optimal combinations are always retained, and the final set B is obtained, including the optimal combination. K combinations are returned to the user.

An adjacent sample comparison processor (201) compares power values of adjacent samples of a delay profile created according to a reception signal over-sampled and detects whether the power value is increasing or decreasing. If the comparison result is identical to the increase / decrease information on the power values between adjacent samples at the previous time, a comparison result storage processor (204) adds 1. If the comparison result is different, the comparison result storage processor (204) performs a reset and newly sets 1. When the count of the comparison result storage processor (204) has become identical to the over-sampling number, a slope judgment processor (205) controls a path selection section (207) so as to select a corresponding sample as a path. The path selection section (207) selects a relative maximum sample as a path candidate and also selects the sample instructed by the slope judgment processor (205) as a path. Thus, it is possible to reduce the calculation amount when selecting a path, assure a path selection, and reduce the reception data error ratio.

Embodiments of the present invention provide a method, computer program product and system for increasing sorting efficiency by utilizing a determined crossover point. Initially, a set of data, containing a number of tuples, to be sorted is received. A determination is made as to the number of radix sort iterations to perform based on the number of tuples of the received data. A countdown timer is set based on the determined number of radix sort iterations. Radix sorts iterations are performed recursively. After each iteration, the countdown timer is decreased. Upon the countdown timer reaching zero, one or more comparison sorts is performed on the remainder of the set of data not sorted by the radix sorting.