Other

Point Inside, Inc.

Deep Web, LLC

Compaq Information Technologies Group, L.p.

Michael Z Moricz

Jonathan Alan Croy

Joshua Logan Marti

Mohandas Kannan

Louis M Monier

John R Kasha, Jr

Renat Bekbolatov

Hua Zheng

Keane Watterson

Jean-Claude Michelou

A transaction based location assignment system creates a complete and more accurate location assignment database for all products available in a store. Transaction data from checkout stands (point of sale terminals) spread around a department store, and the location of each of those checkout stands during POS transactions, is used to create a most probable location of items available in the store. Memory matrixes are built comprising product purchase or transaction information from the checkout stands, and the location of each of the checkout stands, and weighting based on other factors, provide for a best fit match to determine the most probable location within the store of all items within the store. The transaction based location system has the capability to work both for items having a single location in the store, as well as for items available from multiple physical locations in the store.

Transaction based location assignment system and method

A computer system and set of routines with access to venue maps, merchandizing plans, and store catalogs for a merchant attempts to assign locations to items in the store catalog based on the merchandizing plan and map; when a location cannot be assigned to an item in a venue, a proxy location is determined based on categories associated with the item, a number of merchandising plans across the venues in which the item occurs, and/or clusters of items. An error is also determined in relation to the assigned location. The assigned location and error are output, for example, to guide people to the items.

Location assignment system and method

A location assignment system and method assigns and stores a location to each item in a retail system product line, across one or more store venues, that otherwise do not include location information, e.g., is not included in planogram data. Specific rules and algorithms assign a location for each product by inferring a location of each product lacking location information from other items that do have a location, and assigning the location of a most popularly sold item in a weighted grouping of given attributes of the item. Thus, given a complete catalog of every product sold in a given retail store system (which often runs in the tens of thousands or even hundreds of thousands of individual products&#x2014;up to 40% of more of which have no location information within a planogram), the location assignment system assigns a location to every product sold.

A computer system and set of routines with access to a map, a merchandizing plan, and a store catalog performs spatial matching of items to assign locations to the items; when spatial matching cannot be performed, group matching is attempted based on categories associated with the items. If group matching cannot be performed, the location of a department or of a store is assigned to the corresponding item. An error is also determined in relation to the assigned location. The assigned location and error are output, for example, to guide people to the items.

Methods, apparatuses, and articles for receiving a search request associated with a transportation service from a client device, the search request including a plurality of search criteria, are described herein. Additionally, the methods, apparatuses, and articles further return to the client device an answer page having a plurality of answers potentially associated with the transportation service, the plurality of answers identifying a plurality of information locations having information potentially associated with at least a one of the plurality of search criteria, where at least one of the answers includes at least one input field of a query answer page for entry of at least one feature of the transportation service, the query answer page to be dynamically generated by one of the information locations in response to a query.

Accessing deep web information using a search engine

Accessing deep web information associated with transportation services using a search engine

Methods, apparatuses, and articles for receiving a search request associated with a hospitality service from a client device, the search request including a plurality of search criteria, are described herein. Additionally, the methods, apparatuses, and articles further return to the client device an answer page having a plurality of answers potentially associated with the hospitality service, the plurality of answers identifying a plurality of information locations having information potentially associated with at least a one of the plurality of search criteria, where at least one of the answers includes at least one input field of a query answer page for entry of at least one feature of the hospitality service, the query answer page to be dynamically generated by one of the information locations in response to a query.

Accessing deep web information associated with hospitality services using a search engine

Associated query parameters of queries of query answer web pages of a plurality of websites corresponding to a set of search criteria are identified and reconciled. Proxy web page specifications comprising the queries and their associated query parameters are created, and submitted for processing by a search engine to create a plurality of indices to effectively index the dynamic query answer web pages. For associated query parameters to be posted to the websites, the associated query parameters for pre-filling the forms are pre-stored at a proxy server, and the corresponding queries included in the indices, modified to address the proxy servers. During operation, on receipt of the search criteria from a client, the search engine returns a search answer web page including the indices that effectively indexes the dynamic query answer web pages. In alternate embodiment, the effective indices may be automatically selected

A dynamic search result refinement for refining a general search query into a more specific search query. For a general search query, a user is presented with a list of more specific queries. The entries in the list selected from a log-file of queries according to the index frequency of each query. The user can choose a new query from the list of more specific queries and run a database search. The user also has the option to be presented with a list of even more specific queries based on the chosen query and to have a database search run with one of these queries.

Growing community of inventors

Sunnyvale, CA, United States of America

Michael Z Moricz