Abstract: 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.

Abstract: 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.

Abstract: 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—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.

Abstract: 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.

Abstract: 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.

Abstract: 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—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.

Abstract: 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.

Abstract: 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.

Abstract: In embodiments, a schema or map of bays for a venue is created; the schema may include dimensions, aisles, and the names of the POGs found in the venue. Within the schema, adjacent POGs and connected bays are determined. “POG configurations” for a POG (isolated or contiguous segments of a given POG within a venue) are determined. Each set of POG configurations for a POG in a venue is a “layout” of the POG. Layouts are compared across venues and a graphical user interface gets and displays information so that a POG and adjacent POGs can be compared across venues for a merchant.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A form of symbolic logic gate, referred to as don't.sub.-- care logic, provides a construct that does not have a technology primitive correspondent, and that is useful for carrying valuable additional information to logic synthesis and/or logic optimization processes. Thus, a logic optimization process may proceed more effectively when presented with such don't.sub.-- care information because, e.g. overlapping combinational logic is simplified (but not always eliminated) and dependency (i.e. shared combinational logic) is resolved between the data input and the enable input. The don't.sub.-- care gate is readily generalized, such that it can be applied for any technology primitives that have an enable line input, where there is potential shared combinational logic between the data input (or any inputs) and the enable input. Such category may include technology primitives, such as a latch, a D.sub.-- flip.sub.-- flop, and a tri-state element.