506results about How to "Avoid searching" patented technology

Disclosed is a system, method, and program for performing a join operation on a multi-column table and at least two satellite tables having a join condition. Each satellite table is comprised of multiple rows and at least one join column. Each multi-column table is comprised of multiple rows and at least one column corresponding to the join column in each satellite table. A join operation is performed on the rows of the satellite tables to generate a first join result comprising concatenations of the rows of the satellite tables. Less than all the concatenated rows in the first join result that satisfy the join condition are then selected. The selected concatenated rows in the first join result are then joined to the multi-column table.

A method and an apparatus that optimize operations for a key among a collection of key indexed data structures using meta data describing properties of the key with respect to the collection of data structures are described. The meta data may correspond to a cache dynamically updated to indicate invariants which are true for the key in a current state of the collection of data structures. Expensive calculations to search through the collection of data structures for the key may be avoided. For example, costly lookup operations over a collection of data structures may not be required at all if a key is known to always (or to never) reference certain specific values, or for these values to have certain meta-properties, in any of the collection of data structure globally throughout a system at a current state.

The invention provides a searching and shopping method based on a handheld terminal. The searching and shopping method comprises the steps of firstly establishing commodity picture index files in a visual feature database by extracting commodity pictures and commodity information of shopping websites and classifying image feature attribute values of the commodity pictures and memorizing the index files on a server; then searching similar commodities in confirmed or selected commodity category and commodity picture index files through the server according to uploaded commodity pictures and image feature attribute values; and finally recommending the searched commodity pictures and commodity information to users according to searching results of the similar commodities. Due to the fact that the image feature attribute values of the commodity pictures are combined, required commodities are accurately searched during retrieval, meanwhile manual retrieval or searching based on visual features is avoided, and the convenience and the accuracy of searching and shopping are improved under the condition that the appearances of the required commodities are known.

Embodiments of systems and methods disclosed herein provide solutions for predicting vehicle invoice pricing, trim, and options by starting from scratch (raw data), transforming the raw data into actionable data, and comprehensively exploring all possible option combinations that can match a vehicle's Manufacturer Suggested Retail Price (MSRP). Embodiments implement algorithms that determine the trim of a vehicle and intelligently analyze all possible option combinations that would result in a target MSRP while avoid searching unnecessary vehicle configurations. The algorithms can be used to predict the trim, invoice, and options of a vehicle based on the vehicle's VIN and MSRP.

An embodiment of the invention provides a data update method for a Key-Value storage system via distributed key values. Through replication of nodes requiring update, father nodes, ancestor nodes, and root nodes to a buffer layer of the Key-Value storage system, modification of key values and contents of the nodes requiring update, the father nodes, and the ancestor nodes, and modification of the contents of the root nodes, the nodes are made different from original nodes in the storage layer. The method is characterized in that, the nodes requiring update, the father nodes, and the ancestor nodes are first stored in the storage layer, and then the root nodes are stored in a key value pair system. Since the nodes requiring update in the buffer layer are stored in the storage layer prior to storage of the root nodes in the buffer layer in the storage layer, reading operation in the storage process of the nodes requiring update does not enable reading of the nodes requiring update, thereby preventing reading of dirty data. The invention also provides a corresponding method for reading index nodes and a server.

The invention discloses a searching shopping method based on pictures. The method includes the steps that first, a user uploads a goods picture needing to be searched for to a server from a terminal, the uploaded goods picture is subjected to feature classification on the server side, a picture feature value is extracted, and searching is conducted in a goods picture index file through the obtained picture feature value; then the searched goods picture and goods information are recommended to the user by the server according to the research results of similar goods. By combining the picture feature value of the goods picture, the needed goods can be searched for more accurately in the searching process, meanwhile, further manual retrieval or searching based on visual features is avoided, and the searching shopping convenience and accuracy are improved under the condition that the appearance of the needed goods is known. Moreover, an existing hand-held terminal generally has a photographing function, when the user sees the goods which he or she pays close attention to in a market or other places, the user can take a picture and send the picture to the server, and accordingly the goods picture and the goods information can be searched for accurately and conveniently for shopping.

The invention belongs to the technical field of electromagnetic tracking, and particularly discloses an electromagnetic tracking system and method based on rapid determination of a vector rotation angle of maximum magnetic induction intensity. The electromagnetic tracking system disclosed by the invention consists of a three-axis magnetic-field sensor device, magnetic-field source devices, a controllable constant-current source device and a control processing display device; the controllable constant-current source device stimulates three coils which are wound on a magnetic core made of soft magnetic ferrite material and are mutually orthometric, and the central points of the coils are overlapped, so that one magnetic-field source device is formed; the three-axis magnetic-field sensor device is used for detecting the magnetic induction intensity of the magnetic-field source devices, and the control processing display device can control the controllable constant-current source device to stimulate the coils and can perform positioning calculation according to the magnetic induction intensity detected by the three-axis magnetic-field sensor device. Due to the adoption of the electromagnetic tracking system disclosed by the invention, positioning can be realized by only stimulating the three coils once, the searching process is avoided, the real-time performance is significantly improved, the stability is high, the calculating complexity is low, and the electromagnetic tracking system can be applied to the navigation of minimally invasive surgery and other fields, such as virtual (enhancing) reality, and three-dimension ultrasonic imaging.

The invention discloses a target tracking method based on triple twin hash network learning, and relates to the technical field of computer vision, target tracking and deep learning. According to themethod, firstly, a triple twin hash network is constructed, and the network is composed of a data input layer, a convolution feature extraction layer and a hash coding layer. In the initial training process of the network, a training data set and a random gradient descent back propagation algorithm are used for training the triple twinning Hash network, and after training is completed, the initialcapacity of target positioning can be obtained through the network. In the tracking process, firstly, an input image passes through a triple twin region recommendation network to obtain correspondingcandidate frames, then the candidate frames are input into a triple twin Hash network to be subjected to forward processing, the similarity between each candidate frame and a query sample is calculated, the candidate frame with the highest similarity is selected as a tracking target object, and therefore target tracking is achieved.

The invention provides a trans-camera target tracking method and a trans-camera target tracking device on the basis of dynamic path trees. The trans-camera target tracking method includes carrying out single-camera target tracking on specified targets in the visual angle range of each optional camera in each preliminarily constructed camera network until the specified targets leave the visual angle range of the current camera; acquiring currently required-to-be-searched camera lists according to target search region switching algorithms; detecting objects for video data of all cameras in the camera lists and screening suspicious objects by the aid of visual similarity matching algorithms; processing the suspicious objects according to dynamic path tree models and inferring movement tracks of the specified targets. The similarity of the visual appearance of the suspicious objects and the visual appearance of the specified targets is higher than preset thresholds. The trans-camera target tracking method and the trans-camera target tracking device have the advantages that accurate trans-camera target tracking can be carried out under the condition of the possibly minimum computational resource expenditure, and paths can be accurately predicted.

A method and an apparatus that generate tracer data randomly and infrequently for origins and destinations of values created during runtime of a compiled code of a source code is described. A tracer graph may be updated to record the origins and destinations of the values during the runtime. The compiled code may be optimized to reduce processing resources between the origins and the destinations of the values according to the tracer graph. The optimized compiled code may be executed for at least a portion of the source code.

A method and an apparatus that modify pointer values pointing to typed data with type information are described. The type information can be automatically checked against the typed data leveraging hardware based safety check mechanisms when performing memory access operations to the typed data via the modified pointer values. As a result, hardware built in logic can be used for a broad class of programming language safety check when executing software codes using modified pointers that are subject to the safety check without executing compare and branch instructions in the software codes.