45 results about "Pareto local search" patented technology

An Internet search engine ranks search results based on popularity with mobile-device users. Geo-position data from cell phones and other mobile devices are collected into a device geo-position database. The geo-position data is compared to locations of businesses in a business database. When a mobile device's geo-position moves inside a business location, a traffic counter for that business location in the business database is updated. When an Internet user performs a local search, the result set is sorted based on a rank that is at least partially determined by the traffic counters. The popularity-ranked search results indicate which businesses received the most mobile-device visits, an indication of the business's overall popularity. The popularity ranking may be adjusted for business size by dividing the traffic counter by the square footage of the business and sorting the result set based on the mobile-device visits, or repeat visits, per square foot.

An information retrieval system and method employing spatially selective features. A geo-coded database stores advertiser records which include location information. Received search requests are matched with database records based on location information in the search requests and the record location information. In this manner, a user can search for information on a local basis and receive only the most relevant local search results.

A system may identify a first document associated with a geographic location within a geographical area and identify a second document associated with a geographic location outside the geographical area. The system may also assign a first score to the first document based on a first scoring function and assign a second score to the second document based on a second scoring function.

An implicit links enhancement system and method for search engines that generates implicit links obtained from mining user access logs to facilitate enhanced local searching of web sites and intranets. The implicit links search enhancement system and method includes extracting implicit links by mining users' access patterns and then using a modified link analysis algorithm to re-rank search results obtained from traditional search engines. More specifically, the implicit links search enhancement method includes extracting implicit links from a user access log, generating an implicit links graph from the extracted implicit links, and computing page rankings using the implicit links graph. The implicit links are extracted from the log using a two-item sequential pattern mining technique. Search results obtained from a search engine are re-ranked based on an implicit links analysis performed using an updated implicit links graph, a modified re-ranking formula, and at least one re-ranking technique.

Video or media content is transferred to a local video or media server by a system administrator or central content programmer. Client data processing modules, i.e., client machines, are configured to query for local content associated with a particular file and stream names. The local search replaces the original stream name with a stream name associated with a local area network. The modified configuration file of the client machines provisionally substitutes a local stream name for the original stream name linked to the central media server. If a local query script searching for selected content locally, results in an error response indicating the requested content is unavailable locally, then the provisional stream name is deleted and replaced with the original stream name. The original stream request for selected content, which was made to the central media or video server is accordingly implemented as a fallback.

A system receives yellow page data, map provider data, and document data in response to a local search query, and geocodes the data to assign a geographic identifier and to match at least one address associated with the local search query. The system also indexes the geocoded data to determine business information and location information associated with the local search query. The system further provides local search results and a map based on the indexed data.

An efficient large scale search system for video and multi-media content using a distributed database and search, and tiered search servers is described. Selected content is stored at the distributed local database and tier1 search server(s). Content matching frequent queries, and frequent unidentified queries are cached at various levels in the search system. Content is classified using feature descriptors and geographical aspects, at feature level and in time segments. Queries not identified at clients and tier1 search server(s) are queried against tier2 or lower search server(s). Search servers use classification and geographical partitioning to reduce search cost. Methods for content tracking and local content searching are executed on clients. The client performs local search, monitoring and / or tracking of the query content with the reference content and local search with a database of reference fingerprints. This shifts the content search workload from central servers to the distributed monitoring clients.

Computer-implemented methods and systems for processing user entered query data to improve results of a search of pages using a local search database are provided, when searching the internet. The method includes receiving the user entered query data and parsing each word of the query data and examining each word to determine if the word is associated with one of a business name, a city name or a state name. The examining uses probabilistic dictionaries to determine a likelihood that the word is one of the business name, the city name or the state name. Then, associating the words that were determined to be: (i) the business name with a business name tag to create one or more tagged business terms; (ii) the city name with a city name tag to create one or more tagged city terms; and (iii) the state name with a state name tag to create one or more tagged state terms. The method further includes normalizing each of the tagged business terms, the tagged city terms and the tagged state terms. The normalizing includes boosting information if found in the local search database and determining proximity between selected ones of the tagged business, city or state terms. Then, generating an optimized internal search query that incorporates constraints and ranking based on at least the boosting information and the determined proximity between the selected tagged business, city or state terms. The optimized internal search query is applied to the internet to enable search results to be produced and displayed to the user in response to the entered query data.

High-precision local search is performed on the Internet. A map image-rendering software provider embeds spatial keys into maps, which are then provided to producers of Internet content such as map providers. For example, a homeowner may post a message on a web bulletin board advertising his house for sale, and including a map showing the location of the house. When a search engine's web crawler encounters a page having a spatial key embedded in an image, the spatial key is indexed with the other content on the page. Because the spatial key identifies a small geographic area, indexing the content with the spatial key allows search queries to be limited by area and still provide useful results. Thus, a user of a search engine searching for “house for sale” in a specific area will be directed to web pages that meet the geographic and content search terms.

The invention discloses an aircraft landing space distribution method based on a robustness distribution model. The method herein includes the following steps: firstly, designing a robustness aircraftparking distribution model that meets requirements of an actual airport on the basis of the survey on the distribution requirements of aircraft parking spaces in the airport, so that the model fullyconsiders the operation efficiency of the airport and the satisfaction level of passengers, and also meet the conditions of relevant restraints in distributing aircraft parking spaces; And then basedon the established robustness aircraft parking distribution model, using a two-stage Pareto local search method to distribute aircraft parking spaces, specifically in the first stage, generating an initial population that has excellent resolution by using weighted summation and local search algorithm; and in the second stage, conducting neighbor search on each resolution in the initial populationby using the Pareto local search method. The method can generate a group of Pareto optimal solutions that meet requirements of airport management workers, and provides multiple excellent resolution plans for airport scheduling workers to schedule flights.

In a tool for use by network planners in designing metropolitan IP aggregation networks, several optimization methods are integrated into a tool. A k-means algorithm is used to choose access packet switch locations. A dual-k-means algorithm is used to choose the backbone switch locations. Each access packet switch is dual homed to two backbone packet switches using two diverse paths. The diverse path configuration is found using a maxflow-mincost algorithm on a modified fiber map topology. The link topology connecting the backbone packet switches to each other is designed using a heuristic that creates a skeleton network topology and then adds express links one by one, testing each link to assure reduced overall network cost. The resulting network topology is then improved upon by local search.

Techniques are provided for generating query results in response to a query that specifies a location, the query results comprising business entities located around the location that are spatially relevant and socially and / or activity relevant to the query. Web data is crawled and processed using natural language techniques to derive activity information for business entities. Query results are also generated in response to a query that specifies a location and an itinerary, the query results providing possible itineraries at or near the specified location.

A method and system for searching for local information on a self-contained network of computers using natural words (keywords) that are native or familiar to a geographic location or searcher. The method and system do not employ prior or predetermined personal information about a searcher to perform the search. Rather, they utilize only the location, which is entered with the search. Accordingly, more relevant search results are returned based upon the predefined categorization of the local information and its relationship with a searcher's natural words and the natural words' relationship to the geographic location, all of which are predefined by authors of the local information who are uniquely familiar with such things as local slang, trade, profession and industry terms, local terms, acronyms, colloquialisms, and the like.

Systems and methods are disclosed for improving search results returned to a user from one or more domains, utilizing query features learned locally on the user's device. One or more domains can inform a computing device of one or more features related to a search query upon which to the computing device can apply local learning. A local search system can include a local database, a local search history and feedback history database, and a local learning system to identify features about query terms. The features can be learned from the user's interaction with both local search results and remote search results, without sending the user interaction information or other user identification information to a remote search engine. A locally learned feature can be used to extend a query, bias a query term, or filter query results.

A method for finding the optimal schedule and route to visit all constrained and unconstrained nodes of a graph only once while respecting the associated time windows and system constraints. The constrained nodes are first grouped in clusters based on their time windows and system constraints. Then, unconstrained nodes are optimally assigned to the clusters by using a greedy heuristic. Subsequently, enumeration is used to solve the TDTSPTW by cluster. Once all clusters are solved, the paths are joined and a local search heuristic is used to improve the solution. The result of the method is an ordered set of nodes to be visited with their associated start times.

A system provides of data islands of a federated environment storing scalable data used to efficiently search for data and / or other objects across the federated environment and access details of any objects while minimizing the data replicated across all of the data islands. The scalable data may be replicated across all of the data islands and allow a local search for any object across the federated environment. The scalable data may be a subset of data and / or configured meta data that stores a limited subset of data that enables the local search, at each data island, for objects stored in the federated environment.

Embodiments described herein are directed to providing local search engines over large databases. In one scenario, a computing system receives as inputs data records stored in a database. The computing parses the data records into file pairs that each include a keyword file and record ID file and merges file pairs into a keyword file and record ID file, where the keyword file includes keywords in sorted order, and where the record ID file includes a list of record IDs for keywords in the keyword file. The computing system further creates an offset file which stores offset values for starting addresses of record ID lists in the record ID file, and generates an index of keywords by assigning unique identifiers to keywords in the keyword file. The computing system also provides a query interface that allows the database's data records to be searched using the generated index of keywords.

A system and method for performing a search of multiple WEB sites for a desired product or service, wherein the searches are performed using the commands, protocols and native search engine of each WEB site to thereby perform the search as rapidly as possible, wherein the user does not need any knowledge of the interface to each of the WEB sites to be searched, wherein the searches can be performed automatically at a user-selectable interval, wherein the user is automatically notified whenever a desired product or service is found, and wherein subsequent updates of matching products and services are provided in incremental updates only showing additional items posted to a particular WEB site.

Identifying search results from a local and remote search of communications in parallel may be provided. In some examples, an application, such as a communication application, may facilitate an exchange of the communications with a server. A request may be received to perform a search within the exchanged communications. A connection to a server may be verified. A remote search request may be submitted within remotely stored communications based on the received request to the server. The local search may be initiated within locally stored communications. Search results may be displayed througha communication interface. The search results are based on the remote search request and the local search.

Methods and apparatus provide for a local search indexer to allow for an optimized search within a web server that returns accurate search results while maintaining independent control as to defining search patterns, search prioritization, and updated content available for search. Specifically, the local search indexer organizes content according to a hierarchical directory structure at a web server. The hierarchical directory structure includes at least one directory level that provides at least one directory for storing the content. The local search indexer builds a search index associated with the directory and stores the search index at the web server. The search index is populated with indexed content based on an update of the content stored in the directory. The local search indexer employs a search engine, at the web server, to process search queries against the indexed content to provide a search result that includes the update of the content.

The invention provides a flexible job shop scheduling method and system based on a hybrid evolutionary algorithm, and the method comprises the steps: constructing a multi-time-constrained flexible job shop scheduling model based on setting time and processing time, and setting constraint conditions; carrying out segmented integer coding and decoding operation on a machine selection part and a process arrangement part for workpiece processing; performing initialization processing on the population of the hybrid evolutionary algorithm to obtain a parent population; performing crossover operation and mutation operation on the parent population based on the neighborhood to obtain a first population, and performing local search on the parent population based on the neighborhood to obtain a second population; performing elite retention operation on the first population and the second population to obtain an elite population; and when the hybrid evolutionary algorithm meets an iteration termination condition, solving the flexible job shop scheduling model according to the elite population, and scheduling the flexible job shop. The scheduling problem is solved by adopting an intelligent algorithm, so that the workshop can be helped to find an optimal scheduling mode, and the production efficiency is effectively improved.

The invention relates to a large-scale contact list, which belongs to the technical field of contact lists. The respective contact information of clients is uploaded, all the provided information is stored in one or more servers, and the provided information can be downloaded by direct Web search or according to need and then searched locally when a client needs to be contacted. For the contacted party, the information of the other party is directly displayed on a communication device in the process of communication, so the telephone number does not need to be manually entered. Users only need to change respective information on the servers via client ends. In the large-scale contact list, exchanging contact information between people is changed into uploading or publishing respective contact information, and the contact information of all users can be completely or partially searched or published according to the permission of related rules or legal provisions. The large-scale contact list can be conveniently used by people, moreover, the inconvenience caused by the loss of contact lists can be prevented, the optimal contact methods of people in work can be enriched, people can better contact one another, and the living standard of people can be increased.

The invention discloses a vehicle-unmanned aerial vehicle multi-target cooperative path planning method. The method comprises the following steps: acquiring a set of all client points and the number of unmanned aerial vehicles; generating an initial population, a set PF and a probability parameter; starting iterative optimization: in each iteration, generating a filial generation population based on a genetic operator, and combining the filial generation population with a parent population; combining repeated solutions in the population by using a disturbance strategy; executing non-dominated sorting; updating the Pareto frontier, performing Pareto local search on the solution in the PF, and replacing the Pareto frontier with the searched PF; executing crowding degree calculation and a squeezing strategy; selecting a proper solution to enter a next generation population; carrying out iteration until a final Pareto front is returned; and sending the path planning scheme to the vehicle and the unmanned aerial vehicle. Experimental results prove that the method has performance superiority and parameter sensitivity. A method for searching an optimal compromise scheme is provided for decision making of logistics enterprises.