195results about How to "Fewer searches" patented technology

The invention relates to a CDN and a scheduling method based on the content in the network. In the CDN, a GCM and an LCM are arranged to take charge of the uniform maintenance and management of the content distribution information and the content distribution strategy in the whole network. When the content required to access by a user is not hit on a POP node, the LCM of the POP node searches other stored POP nodes or OCS with the content and the proxy service is provided for the user.

The invention relates to a method for restoring power supply of a power distribution network containing a distributed power source. The method is based on heuristic rules, performs dynamic island partition on the distributed power source, utilizes a connection switch to guarantee a power supply restoration scheme of the power distribution network to be adaptive to output changes of the distributed power source and continuous power supply of important users, and enables the intelligent power distribution network to operate safely, reliably and economically. Power supply restoration of the power distribution network comprises the steps that the power failure range of the power distribution network is determined by fault location information and an operating state of the power distribution network before the fault happens; and the distributed power source in the fault area is matched with the connection switch connected with the fault area, corresponding section switches are actuated, and radial operation of the power distribution network except for the distributed power source is ensured. The distributed power source is fully utilized to improve reliability of the power supply of the power distribution network, searching space is greatly reduced, and optimum strategy searching time is shortened. Therefore, the method is suitable for power supply restoration real-time operation of the power distribution network containing the distributed power source.

The invention discloses an edge computing task allocation method based on deep Monte Carlo tree search, and aims to support optimization of resource allocation by an edge server. And the edge server takes the state of a mobile edge computing system as input, the edge server resource scheduling module outputs an optimal resource allocation scheme through a deep reinforcement learning algorithm, andthe mobile equipment terminal unloads the task according to the optimal resource allocation scheme and executes the task together with the edge server. The deep reinforcement learning algorithm is completed by mutual cooperation of DNN, MCTS and LSTM, and compared with greedy search and DQN algorithms, the algorithm provided by the invention is greatly improved in the aspects of optimizing service time delay and optimizing service energy consumption of the mobile terminal.

A technique efficiently searches a hash table containing a plurality of “ranges.” In contrast with previous implementations, the technique performs fewer searches to locate one or more ranges stored in the hash table. To that end, the hash table is constructed so each hash-table entry is associated with a different linked list, and each linked-list entry stores, inter alia, “signature” information and at least one pair of values defining a range associated with the signature. The technique modifies the signature based on the results of one or more preliminary range checks. As a result, the signature's associated ranges are more evenly distributed among the hash table's linked lists. Thus, the linked lists are on average shorter in length, thereby enabling faster and more efficient range searches. According to an illustrative embodiment, the technique is applied to flow-based processing implemented in an intermediate network node, such as a router.

The invention discloses a frequency searching method for a community, wherein the method preferentially carries out community frequency search in a frequency table which contains a serviced community and the adjacent community information which are resided in a user facility, next adaptive community frequency search is accelerated after opening machine or leaving off a service area, therefore the adaptive community frequency can be effectively searched, the time that a user facility is connected to the network is shortened, searching times of the community frequency are reduced, therefore the purpose of electricity saving is achieved.

The invention provides an RFID (Radio Frequency Identification Device) mutual authentication method based on a secret key and a cache mechanism, which mainly solves the problems in the prior art that illegal reading, position tracking, eavesdropping, camouflage cajoling and unsafe resetting can not be resisted simultaneously. The achieving steps are as follows: a reader-writer and a tag adopt typical inquire response mechanism, the tag generates two authentication information values, namely beta is equal to hash (rl and Pr0), and sends the authentication information values to the reader-writer, the reader-writer compares received information value with self-computed information value, if the comparison results are same, returning authentication information hash (k' Pr0 and Prl') is sent to the tag through authentication. If the comparison results are different, the information is sent to back-end data base, authentication judgment is conducted by the back-end data base, the returning authentication information hash (k'' Pr0 and Prl'') is sent to the tag, after the tag receives the returning authentication information, authentication is carried out on the reader-writer by comparing the tag with self-computed value hash (k Pr0 and Prl), if the tag and the self-computed value hash (k Pr0 Prl) are same, the authentication is passed. The RFID (Radio Frequency Identification Device) mutual authentication method has the advantages of high safety performance and high execution efficiency, and can be applied to the RFID application context with limited resources and high safety requirements.

The invention provides a clothing picture search method and a clothing picture search device, wherein the search method particularly includes the steps: extracting corresponding clothing body local features according to received clothing pictures; performing match query for the clothing body local features in a picture database according to the clothing body local features of clothing pictures, wherein model dressing pictures and the corresponding clothing body local features are stored in the picture database; and returning the model dressing pictures obtained by means of match query to a user. By the aid of the method and the device, dressing effects of clothing products can be provided for the user, and search efficiency is improved.

The invention discloses a device and a method for information search sequencing to improve the efficiency of a user in obtaining the target search result so as to reduce the expenditure of associated equipment in a search engine and improve the system performance. The information search sequencing device comprises a determination unit for determining a correlation parameter value of each search document with respect to the search content according to the search content submitted by the user; a predetermination unit for predetermining the user and organizational structure recommended click weight of each search document with respect to the search content; and a sequencing unit for determining the sequencing parameter value of each search document according to the correlation parameter value of each search document and the user and organizational structure recommended click weight, and for returning search results sequenced according to the sequencing parameter value of the search document. The invention further discloses an information search device and a method for improving the accuracy of search results.

The invention relates to the technical field of robots, and more particularly relates to a mobile robot planning method based on visibility graph guidance. A planning guidance area is established by using a visibility graph method to limit the expansion of a rapid random expansion tree (RTT), a generation shape of a random tree is constrained by establishing a vehicle kinematic model, meanwhile the generation of the random tree is accelerated by using a 8 nearest neighbor node search method, after the random tree is obtained, a path conforming to a mobile robot motion law is obtained by calculation, and finally, the path is optimized to improve the quality of the path. In the traditional fast random expansion tree planning algorithm, the planned path cannot meet the kinematic constraints of a wheeled robot, and meanwhile, as the structure of the random tree becomes larger, the generation efficiency of the random tree is low. Therefore, kinematic modeling is performed on an unmanned vehicle, and then the random tree conforming to the kinematic model of the unmanned vehicle is obtained within a short time in combination with the 8 nearest neighbor node search method, and an optimal path from a starting point to an end point is obtained through path optimization.

The invention discloses a PCNN automatic segmentation method for a microscopic image of a traditional Chinese medicine. The PCNN automatic segmentation method comprises the steps of respectively establishing a CNN automatic binary image dividing algorithm which utilizes cross entropy segmentation criteria; establishing a traditional Chinese medicine microscopic image PCNN multi-value image automatic segmentation algorithm which utilizes maximizing mutual information as a segmentation object and utilizes mutual information entropy difference as a classification criteria, designing a vector pulse coupling neural network model, and realizing automatic segmentation on the microscopic color image of the traditional Chinese medicine through utilizing an index entropy criterion as a segmentation criteria; and establishing a traditional Chinese medicine microscopic image dividing algorithm in a multichannel or three-dimensional PCNN through utilizing a fuzzy index entropy as an optimized segmentation criterion. The PCNN automatic segmentation method has advantages of further improving objectivity, accuracy, repeatability and intelligent degree in quality evaluation of the traditional Chinese medicine, and providing a new approach for modernization of testing and analysis of the traditional Chinese medicine.

A data store has a data array for storing data values and a tag array for storing tag values for tracking which data values are stored in the data array. The associativity of the data array is greater than the associativity of the tag array. This means that fewer tag entries need to be accessed on each data access than in a conventional data store, reducing power consumption.

The invention discloses a quick calculation method of a satellite access forecast. The quick calculation method comprises the following steps: (1) applying a Lagrange polynomial interpolation method, adopting Chebyshev nodes, i.e. adopting the points of unequal spaces to carry out interpolation on an orbit forecast result of the satellite in one day, and calculating the satellite orbit through the satellite according to the Lagrange polynomial; and (2) adopting a method that the point of intersection of a curve descending branch of an angle of pitch and a coordinate axis is firstly found and a time window is then judged, searching the point of intersection of the curve descending branch of the angle of pitch and the coordinate axis through a large step size, and adopting a variable step size to search and calculate a visible time window. The method aims at an autonomous mission planning platform carried by a satellite in the future and is suitable for a satellite platform with low dominant frequency and small memory. A Lagrange difference value way is adopted to realize on-board quick orbit calculation, a quick calculation method, combining variable-step size searching and linear fitting, for the visible time window of the satellite to the target is designed, and an efficient quick calculation method of the satellite access forecast is provided.

The present invention discloses a 2D near field synthetic aperture radar image reconstruction method based on compressed sensing. A synthetic aperture radar probe is employed to perform random undersampling of a detected target at a 2D measurement grid area, and collection data being far smaller than the quantity of sampling points of the 2D measurement grid area is obtained, so that efficiency ofdata collection can be greatly improved. When a compressed sensing imaging model is established, an l1 norm and a TV operator are employed as a penalty function to allow a reconstructed image to havemore sensitive prior information. The compressed sensing imaging model is subjected to image reconstruction by employing an improved conjugate gradient descent method, an iteration descent directionis estimated by employing a step size in search calculated by employing a predicted line search method and a gradient calculated by applying the compressed sensing model approximated by a smooth function, and therefore, a radar image with a size being the same as the 2D measurement grid area is effectively reconstructed in high quality.

The invention discloses a posterior probability tag collision solution for an RFID system. The RFID system of the method consists of one reader and a plurality of tags in the coverage of the reader. The reader sends a frame length querying command, and then executes the corresponding operation when the tags receive the command. The label has five states: an initial state, a preparation state, an ID transmission state, a data processing state and a silent state. The state change of the tags is executed through a counter according to a current time slot state, and the reader adjusts the frame length according to the states of the former three time slots in each frame, thereby avoiding the excessive time slots and collision time slots in the frame time slot, avoiding the collision between the large-scale tags, and reducing the impact on the recognition efficiency from a capturing effect. The method can effectively solve a problem of multi-tag collision in the RFID communication system when being used for the collision between a plurality of RFID tags, and improves the recognition rate of a system for the tags.

The invention provides a video coding method, comprising the following steps: determining coding mode of each macro block in a video first frame; setting a prediction model; and analyzing the coding mode of each macro block in the prediction model; if the first condition is satisfied, determining the coding mode of the current macro block; if the first condition is not satisfied, sequentially searching other interframe coding modes and judging whether the second condition is satisfied; if the second condition is satisfied, determining the coding mode of the current macro block; and if the second condition is not satisfied and the coding mode of each macro block in the prediction model does not include an intra-frame mode, searching the intra-frame mode to determine the coding mode of the current macro block. The video coding method can improve coding efficiency.

The invention discloses a voice searching method, a voice searching device and terminal equipment and belongs to the field of an intelligent terminal. The method comprises steps that a voice request initiated by a user is received, and the voice request is analyzed to acquire searching keywords; a first searching request containing the searching keywords is initiated at searching interfaces of various types of applications pre-mounted in the intelligent terminal; first searching results for responding to the first searching request are received, and the first searching results are integrated and displayed according to categories. According to the method, the searching results of the different categories in various aspects in different fields are acquired through one-time voice searching, a user can be prevented from searching multiple times, searching frequency is reduced, the searching time is saved, moreover, the searching results are integrated and displayed according to the categories, the searching results can be more clearly displayed, the user is convenient to know about the searching results, and required searching results can be rapidly and conveniently found.

The invention provides a method and device for acquiring image search results with a contract effect. The method include: using preset seed words to mine keyword templates from search logs; determining more than one ambiguous words required in search from the search logs by the aid of the keyword templates; determining demanded words relevant to the ambiguous words; combining each demanded word relevant to matched words with the matched words into search words to perform image search when keywords inputted by an user are matched with the ambiguous words, acquiring search results of various images relevant to the matched words and displaying the search results of the various images in contrast. By the method, comprehensive image search results can be acquired according to search requirements of the user.

The invention relates to wireless communication systems, and provides an algorithm for reducing the peak-to-average power ratio (PAPR) of an FBMC-OQAM system. The algorithm is characterized in that classified subsequences are re-grouped on the basis of subsequence classification of the traditional PTS, so that a double-layer subsequence classification structure is formed, and layered searching is carried out for rapid searching. Firstly, each data block in the FBMC-OQAM system is divided into V subsequences according to the same method adopted by the PTS, the V subsequences are grouped into D groups, and each group comprises V / D subsequences; secondly, the layered searching is carried out according to different layers, a bottom algorithm aims to reduce the PAPR of the current data block, and a top algorithm aims to handle mutual effects between the adjacent data blocks, so that the overall signal PAPR of the FBMC-OQAM system is reduced. The algorithm provided by the invention has the advantages that due to the adoption of the layered searching method, the searching sequence length in each layer is relatively small, so that searching times are reduced to a certain extent, and signal distortion is avoided.

The invention discloses a signal acquisition method of a GPS receiver, and the method comprises the following steps: Step 1: searching order of Doppler frequency shift is set; Step 2: the GPS receiver receives an intermediate frequency digital signal, and rough acquisition is carried out on the signal, thus obtaining rough Doppler frequency shift and a C / A code phase; and Step 3: fine acquisition is carried out on the signal after the rough acquisition, thus obtaining fine Doppler frequency shift; in the method, through the rough acquisition of the intermediate frequency digital signal and according to motion characteristics of a carrier, frequencies which are more likely to occur in the Doppler frequency shift are firstly searched, and the order-jump search of the Doppler frequency shift reduces the Doppler frequency shift search times, reduces the search calculation and enhances the acquisition speed; and the fine acquisition of the intermediate frequency digital signal shortens the Doppler frequency shift search step size, and the fine Doppler frequency shift obtained by adopting conic fitting has the advantages of high speed, high precision, accurate acquisition results, easy operation and insensitivity to jump of navigation data bits.

The present invention relates to an adaptive focusing method. A focusing depth method and a de-focusing depth method are combined for adaptive focusing. An adaptive focusing process is divided into two phases: rough focusing and fine focusing. In the rough focusing process, a current de-focusing amount of a target object is calculated firstly by means of the de-focusing depth method, the de-focusing amount serves as a reference basis to design a search step size, the search process lasts until an estimated de-focusing amount is smaller than a preset threshold, and the rough focusing process is ended. Then, the focusing depth method is adopted to enter the fine focusing process. Large-step-size search is adopted in an algorithm firstly, thereby greatly reducing the search count and improving the focusing efficiency. Moreover, a large-step-size search policy can also avoid influence of a local peak value of an evaluation function. In addition, an area close to a focusing position is focused by means of a high-precision focusing depth method, thereby ensuring the precision of the algorithm.

The invention discloses a video foreground object coding method by taking boundary detection as motion estimation reference, and belongs to the technical field of video coding technology. The method comprises the following steps of: (1) dividing continuously acquired video into a reference frame and a predictive frame, and dividing the reference frame and the predictive frame into a plurality of macroblocks in fixed size; (2) respectively performing foreground extraction on the reference frame and the predictive frame; (3) for the reference frame, adopting a static image compression algorithmand coding outline information of the video; and (4) for the predictive frame, determining a search starting point through boundary detection, pre-searching from the search starting point and stopping searching in dual time to obtain a motion vector of a corresponding macroblock, and coding the outline information, the motion vector and the residual error of the video. On the basis of performing foreground extraction on each image frame of the video, the video compression is carried out in real time, the coding contents required by the image frames can be effectively reduced, the coding speedis improved, the compression ratio is improved, the search frequency is reduced, and the coding efficiency is effectively improved.

The invention provides a target object fast ranging method based on binocular vision, comprising the following steps: (1) performing camera calibration; (2) acquiring images and detecting a target object; (3) calculating a search area; (4) selecting a start position of searching; (5) extracting grayscale features of the central region of the target object; (6) calculating a matched degree threshold; (7) performing searching for matching; and (8) calculating the parallax and the distance. According to the position of the target object in one picture, the method quickly searches for the matchedtarget object in another picture, which reduces the computational complexity and effectively improves the ranging speed.

The invention discloses a millimeter-wave system channel estimation method low in complexity. The method includes the following steps: firstly, a receiving end uses a first-order codebook to estimatea pair of azimuths AOA and AOD, and then establishes a set on the basis of the defined quantization precision estimated the second time and the number of quantization angles estimated the second time;secondly, the receiving end uses the set obtained in the first step and also a second-order codebook to conduct azimuth estimation at the second-order precision; and thirdly, the receiving end utilizes a least square method to estimate fading of channels corresponding to the azimuths, and determines whether channel estimation is carried out according to a result. Through utilization of sparsity of a millimeter-wave system channel and redundancy of a sparse dictionary in a compression sensing technology, a channel estimation process is quantified through angles to be decomposed into two-complexity channel estimation processes. According to the method, the number of searching of the sparse dictionary is reduced, the millimeter-wave system channel estimation efficiency is increased, and thechannel estimation complexity of channel estimation is reduced effectively while the estimation precision is guaranteed.

The invention relates to the field of machining and detection, in particular to an in-machine roundness detection method. The in-machine roundness detection method involves a base, a first rotating shaft, a second rotating shaft, a circular hoop, a clamping buckle, a first half ring and a second half ring, wherein the first half ring is arranged on the circular hoop through the first rotating shaft; the second half ring is connected with the first half ring through the clamping buckle; the circular hoop is arranged on the base through the second rotating shaft; supporting legs are arranged on the lower end surfaces of the circular hoop and the first half ring. According to the in-machine roundness detection method, a three-dimensional measurement point, acquired by a three-coordinate measurer, on a cylinder is projected to a plane, and a circle center of a circle with the minimum area is searched by an iteration method, so that the calculated amount of searching is greatly simplified; an initial value of the circle center is determined by the least square method according to the projected measurement point, so that the search process under a determined attitude is quicker; by the selection of a center moving direction and a center moving step length, the number of searching times is reduced, and the searching precision is improved.

The invention belongs to the technical field of mobile communication, and particularly relates to a QR decomposition detection method under a novel system combined with spatial modulation and quasi-orthogonal space time block codes. The QR decomposition detection method comprises the steps that first, antenna combined modes are selected and traversed, and an equivalent channel submatrix corresponding to an activated antenna combined index is obtained; QR decomposition is conducted on the equivalent channel sub matrix, so that an upper triangular matrix R is obtained; afterwards, the last sign is demodulated, judgment is made by using a maximum-likelihood criterion, and when other signs are detected, interference of the detected signs is sequentially subtracted. Due to the fact that each antenna combined mode corresponds to a set of solution vectors, the Euclidean distance between received signals is calculated respectively, the solution vector corresponding to the minimum value serves as an optimal detection sending signal, the corresponding sending combination is an activated sending antenna combination. Through QR decomposition, the searching frequency can be reduced, the detection complexity of a receiver is lowered, and excellent detection performance can be achieved under the low complexity condition.

The invention discloses a top-down control information receiving method, device, and a storage medium, which belong to the field of communication. The method comprises the steps that a terminal receives BWP configuration information sent by a receiving net device; the terminal determines a target BWP positioned at unlicensed frequency based on the BWP configuration information, and the target BWPincludes sub-bands in the number of m; the terminal respectively monitors a target sequence on the sub-bands in the number of m; after the target sequence is monitored, the terminal monitors the top-down control information on all or part of the sub-bands in the number of m. The invention is advantageous in that after the target sequence is monitored, the terminal monitors the DCI on all or part of the sub-bands in the number of m, the searching times and searching consumption of the terminal at PDCCH can be effectively reduced, and unnecessary power and electric power consumption by the terminal can be prevented.

The invention provides a hybrid field signal source positioning method based on a symmetrical nested array. The hybrid field signal source positioning method comprises the following steps that an antenna array is set, wherein the antenna array is the symmetrical nested array; a far-field signal DOA is estimated to obtain an estimation value of the far-field signal DOA; the near field component isseparated from the far field component; a fourth-order cumulant virtual difference array of a near-field signal is calculated; an estimation value of the near-field signal DOA is obtained by using spectral peak search; and according to the near-field signal DOA estimation value, the near-field signal distance is estimated to obtain a near-field signal distance estimation value. The hybrid field signal source positioning method uses mixed-order statistics, and compared with a second-order statistic algorithm, the hybrid field signal source positioning method solves the problems of Gaussian noise interference and reduction of degree of freedom by half; the symmetric nested array and the fourth-order cumulant virtual differential array are used for improving the estimation accuracy of far-field DOA, near-field DOA and a near-field distance; oblique projection technology is utilized to separate the far-field and near-field components, and thus, it is not necessary to distinguish the far-field signal from the near-field signal according to distance parameters; and therefore, the number of search is reduced, and the computational complexity of the algorithm is further reduced.

The invention discloses a face real time detecting method based on video and device thereof, belonging to the field of multimedia. In the invention, a video image frame is divided into a full detection frame and a predetermined frame; the type of the current input video image frame is judged according to the frame interval between the current input video image frame and the former full detection frame; and a corresponding detection way is adopted. As video sequence has predictable characteristics in a time-space domain, parts of the video image frame are detected by searching different regions by different step lengths, so that the method can efficiently reduce the searching time in the detecting process, avoid the shortage that the general algorithm based on AdaBoost cascade algorithm searches all the regions by fixed step length, greatly reduce the calculating complexity in the detecting process and guarantee the accuracy of the detection.

The invention discloses an IRA (Irregular Repeat-Accumulate) codes open set blind recognition method, which realizes the recognition of the code length, the codeword starting point and the code rate, the sparse reconstruction of a check matrix and restoration of an interleaving permutation relation in the absence of any prior knowledge, and aims to solve the problems that the prior art cannot accurately recognize the IRA codes with arbitrary code length and bit rate under a bit error condition, and the recognition speed is slow. The method comprises the following steps: firstly, constructing an analysis matrix according to the estimated code length and the codeword starting point, and solving a dual vector by using a Gauss column elimination method and a statistical decision criterion and other methods to realize the recognition of the code length; secondly, using the dual vector to eliminate the bit errors, iterating the above operations and obtaining multiple groups of dual vectors and further analyzing the codeword starting point; thirdly, realizing the sparse reconstruction of the check matrix of the IRA codes by an obtained effective check vector; and finally, according to the coding structure features of the IRA codes, analyzing the interleaving permutation relation, and finishing the overall recognition of the IRA codes. Through theoretical analysis and simulation verification, the IRA codes open set blind recognition method provided by the invention has lower computation complexity and excellent fault-tolerance performance.

The invention discloses a self-adaptive fast-matching binocular ranging method. The method comprises the following steps that firstly, a binocular camera is used for acquiring a binocular image of a target to be detected; secondly, a template image and a search image are captured from the binocular image in a self-adaptive mode; then the template image is quickly matched in the search image by a layered screening strategy to obtain the pixel-level matching coordinates; and then the pixel points in the region surrounding the pixel-level matching coordinate are used as fitting points, secondarycurved surface fitting is carried out on the fitting points, the maximum value of the curve fitting function is worked out so as to obtain sub-pixel-level matching coordinates corresponding to the pixel-level matching coordinates; and finally a parallax is obtained according to the sub-pixel level matching coordinates and the template image coordinates, then the distance of the target to be measured is worked out according to a triangulation method, and ranging is completed. According to the method, the template image is extracted in a self-adaptive mode, the search image boundary is limited and search range range is optimized, the layered screening strategy is adopted for improving the searching efficiency and the like, so that the image matching precision is improved, and then the ranging precision is improved.