Pricing system for identifying prices for vehicles offered by vehicle dealerships and other entities

Information

  • Patent Grant
  • 11080734
  • Patent Number
    11,080,734
  • Date Filed
    Thursday, March 13, 2014
    10 years ago
  • Date Issued
    Tuesday, August 3, 2021
    3 years ago
Abstract
A method includes identifying, for a specified vehicle, a competitive set of other vehicles based on input from a user. The method also includes receiving from the user one or more parameters to be used in pricing the specified vehicle. The method further includes identifying a recommended price for the specified vehicle using the competitive set and the one or more parameters. The one or more parameters could include a selection or definition of multiple pricing formulas to be used to identify the recommended price. Different pricing formulas can be associated with different lengths of time that the specified vehicle is available. A first of the pricing formulas can be used to identify a first recommended price for the specified vehicle and, after a specified amount of time has elapsed, a second of the pricing formulas can be used to identify a lower second recommended price for the specified vehicle.
Description
TECHNICAL FIELD

This disclosure relates generally to pricing systems. More specifically, this disclosure relates to a pricing system for identifying prices for vehicles offered by vehicle dealerships and other entities.


BACKGROUND

Vehicle dealerships often include a large number of vehicles for sale or lease on their premises. Many times, the prices for vehicles at one dealership are determined and updated manually by comparing the dealership's prices to other dealerships' prices. This is often a lengthy and time-consuming process.


SUMMARY

This disclosure provides a pricing system for identifying prices for vehicles offered by vehicle dealerships and other entities.


In a first embodiment, a method includes identifying, for a specified vehicle, a competitive set of other vehicles based on input from a user. The method also includes receiving from the user one or more parameters to be used in pricing the specified vehicle. The method further includes identifying a recommended price for the specified vehicle using the competitive set and the one or more parameters.


In a second embodiment, a system includes at least one memory configured to store information identifying, for a specified vehicle, a competitive set of other vehicles. The system also includes at least one processing device configured to receive from a user one or more parameters to be used in pricing the specified vehicle and identify a recommended price for the specified vehicle using the competitive set and the one or more parameters.


In a third embodiment, a non-transitory computer readable medium embodies a computer program. The computer program includes computer readable program code for identifying, for a specified vehicle, a competitive set of other vehicles based on input from a user. The computer program also includes computer readable program code for receiving from the user one or more parameters to be used in pricing the specified vehicle. The computer program further includes computer readable program code for identifying a recommended price for the specified vehicle using the competitive set and the one or more parameters.


Other technical features may be readily apparent to one skilled in the art from the following figures, descriptions, and claims.





BRIEF DESCRIPTION OF THE DRAWINGS

For a more complete understanding of this disclosure, reference is now made to the following description, taken in conjunction with the accompanying drawings, in which:



FIG. 1 illustrates an example pricing system for identifying prices for vehicles offered by vehicle dealerships and other entities in accordance with this disclosure;



FIG. 2 illustrates an example device that can be used in the system of FIG. 1 in accordance with this disclosure;



FIG. 3 illustrates an example method for identifying prices for vehicles offered by vehicle dealerships and other entities in accordance with this disclosure; and



FIGS. 4 through 9 illustrate example graphical user interfaces that could be supported in the system of FIG. 1 in accordance with this disclosure.





DETAILED DESCRIPTION


FIGS. 1 through 9, discussed below, and the various embodiments used to describe the principles of the present invention in this patent document are by way of illustration only and should not be construed in any way to limit the scope of the invention. Those skilled in the art will understand that the principles of the invention may be implemented in any type of suitably arranged device or system.



FIG. 1 illustrates an example pricing system 100 for identifying prices for vehicles offered by vehicle dealerships and other entities in accordance with this disclosure. As shown in FIG. 1, the system 100 includes a network 102. The network 102 generally represents a communication network or combination of communication networks facilitating communication between different devices or systems. Each network 102 provides any suitable communication links, such as wired, wireless, or fiber optic links. In particular embodiments, the network 102 includes a combination of networks, such as the Internet, one or more cellular communication networks, and one or more wide or local area networks (which could support wired or wireless communications).


One or more consumer or end user devices 104 communicate via the network 102. The user devices 104 generally denote devices used by dealership personnel or other people to send/receive data and interact with other devices or systems. The user devices 104 include mobile devices that can communicate wirelessly with at least one of the networks 102. In this example, the user device 104 represents a smartphone, although other types of user devices (such as a personal digital assistant or tablet) could be used. Any other or additional user devices could be used in the system 100, and the system 100 can support interaction with any number of user devices.


One or more vehicle dealership servers 106 also communicate over the network 102. Each server 106 represents a computing device that can be used to provide or receive information associated with one or more vehicles offered by an associated dealership. For example, a dealership's server 106 could store and process data identifying new or used vehicles offered by the dealership, prices for those vehicles, and other information associated with those vehicles (such as make/model, mileage, trim, options, and condition of each vehicle). Any other or additional information can be provided by, maintained, or received by each server 106. Each server 106 includes any suitable structure supporting the usage of information about vehicles, such as a server computer.


One or more operator stations 108 are capable of interacting with an associated server 106. For example, an operator station 108 may allow dealership personnel to enter information about new or existing vehicles or perform other actions associated with the information maintained by the server 106. Each operator station 108 includes any suitable structure supporting interaction with a vehicle dealership server, such as a desktop computer, laptop computer, dumb terminal, or mobile device.


As shown in FIG. 1, the system 100 further includes a pricing server 110 and a database 112. The pricing server 110 analyzes information associated with a vehicle market and makes pricing recommendations to one or more dealerships or other entities. The pricing server 110 could use any suitable data and analysis techniques to identify possible prices for vehicles offered for sale or lease. The pricing server 110 includes any suitable structure supporting vehicle pricing. The database 112 includes any suitable information storage and retrieval device(s). One or more operator stations 114 are capable of interacting with the pricing server 110.


Although FIG. 1 illustrates one example of a pricing system 100 for identifying prices for vehicles offered by vehicle dealerships and other entities, various changes may be made to FIG. 1. For example, FIG. 1 is intended as an example system that could support vehicle pricing and is not intended as an architectural limitation. Also, various components in FIG. 1 could be combined, further subdivided, rearranged, or omitted and additional components could be added according to particular needs. As a particular example, the functionality of the pricing server 110 could be incorporated into one or more servers 106.



FIG. 2 illustrates an example device 200 that can be used in the system 100 of FIG. 1 in accordance with this disclosure. The device 200 could represent any of the components 104, 106, 108, 110, 114 in FIG. 1.


In this example, the device 200 includes a bus system 202. The bus system 202 supports communication between a processing unit 204, a memory 206, a persistent storage 208, a communications unit 210, an input/output (I/O) unit 212, and a display or display interface 214. Any suitable bus or buses could be used here.


The processing unit 204 processes software instructions loaded into the memory 206. The processing unit 204 may include a single processor, multiple processors, one or more multi-processor cores, or other type of processor depending on the particular implementation. As an example, the processing unit 204 may be implemented using a number of heterogeneous processor systems in which a main processor is present with secondary processors on a single chip. As another example, the processing unit 204 may be a symmetric multi-processor system containing multiple processors of the same type. Any suitable processing device(s) could be used.


The memory 206 and the persistent storage 208 are examples of storage devices 216. A storage device is any piece of hardware capable of storing information, such as data, program code, and/or other suitable information on a temporary or permanent basis. The memory 206 may be a random access memory or other volatile or non-volatile storage device(s). The persistent storage 208 may contain one or more components or devices, such as a hard drive, flash memory, optical disc, or other persistent storage device(s). A storage device may be fixed or removable, such as when a removable hard drive or USB thumb drive is used.


The communications unit 210 provides for communications with other systems or devices. For example, the communications unit 210 could include a network interface card or a wireless transceiver. The communications unit 210 may provide communications through physical or wireless communications links.


The I/O unit 212 allows for input and output of data using other components connected to or integrated within the device 200. For example, the I/O unit 212 may provide a connection for user input through a keyboard, mouse, or other input device. The I/O unit 212 may also send output to a display, printer, or other output device. The I/O unit 212 could alternatively include a keyboard, mouse, or other input or output device(s). If the device 200 includes a display 214, the display 214 provides a mechanism to visually present information to a user. In the user devices 104, the display 214 could represent a touchscreen.


Program code for an operating system, applications, or other programs may be located in the storage devices 216, which are in communication with the processing unit 204 through the bus system 202. Instructions forming the programs may be loaded into the memory 206 for processing by the processing unit 204.


Although FIG. 2 illustrates one example of a device 200 that can be used in the system 100 of FIG. 1, various changes may be made to FIG. 2. For example, FIG. 2 is simply meant to illustrate possible components in one specific implementation of a device. Each of the components 104, 106, 108, 110, 114 in FIG. 1 could be implemented in other ways, such as other ways that incorporate one or more processing units, one or more memory units storing data and instructions used/generated/collected by the processing unit(s), and one or more interfaces for communicating over the network 102.


As noted above, the pricing server 110 can be used by dealerships or other entities to help identify one or more prices for one or more vehicles. To accomplish this, the pricing server 110 supports an automated dynamic pricing tool. The tool can automatically syndicate a user's price settings for his or her own vehicle to retail listings for other vehicles at a frequency set by the user. The price for the user's vehicle at any given moment in time can be determined by formulas and conditions set by the user during the initialization of the tool or as time progresses. The same overall process can be used to automatically set prices for multiple vehicles owned or managed by the user.



FIG. 3 illustrates an example method 300 for identifying prices for vehicles offered by vehicle dealerships and other entities in accordance with this disclosure. The method 300 could be used by the pricing server 110 using information from the database 112 and optionally from one or more dealership servers 106. However, the method 300 could be used by any suitable device and using data from any suitable source(s).


As shown in FIG. 3, automated pricing for a vehicle is initiated at step 302, and the vehicle to be priced is identified at step 304. This could include, for example, a user using an end user device 104 or operator console 108 logging into the pricing server 110 and providing information about a specific vehicle. The vehicle information could include information such as the make/model, mileage, trim, options, and condition of the vehicle.


A competitive set of other vehicles is identified at step 306, and vehicles can be added to or removed from the competitive set at step 308. The “competitive set” represents the set of vehicles within the marketplace that the user wishes to price his or her vehicle against. The vehicles in the competitive set are typically vehicles that are most similar to the user's vehicle, such as in terms of make, model, options, trim level, and mileage (although other or additional factors could be used). Also, the vehicles in the competitive set are typically vehicles within a given distance of the user's intended market, where the distance could be set by the user. A competitive set could be generated manually or automatically.


A manual competitive set can be defined by the user. For example, the user could manually select the particular vehicles from the marketplace to be included in the competitive set. In some embodiments, the pricing server 110 can use market filters to identify matching vehicles for the user. Example market filters could include filters identifying whether new vehicles entering the marketplace have certain features (such as leather seats, specified colors, navigation packages, or trim levels) or are within a specified distance of the user's vehicle. Other filters can include dealership, drivetrain, transmission, mileage, pricing, CPO (Certified Pre-Owned) unit, and other options. The user can view the filtered results (or all results without filtering) and manually add vehicles to or remove vehicles from the competitive set. If a new vehicle enters the market after creation of the competitive set, the user may be required to add manually the new vehicle to the competitive set. New vehicles entering the market can be automatically tagged as new by the pricing server 110 based on the last day a vehicle was added to the competitive set. As vehicles sell in the market, the vehicles could be dropped automatically from the competitive set.


A competitive set can also be generated automatically, such as by the pricing server 110. The pricing server 110 can use the market filters defined by the user to locate suitable vehicles for the set. The pricing server 110 can save the user's market filters and monitor the market on a daily (or other) basis for vehicles that satisfy the criteria. Vehicles that match the criteria can be added automatically to the competitive set, and users need not manually add vehicles to the competitive set.


A combination of approaches can also be used. For example, a user may manually create a competitive set, and new vehicles entering the marketplace can be automatically added to the competitive set if those new vehicles satisfy the user's market filters.


Once the competitive set is defined (in any manner), vehicles can be added to or removed from the competitive set in any suitable manner. Note that this could occur at any time, and (depending on the implementation) vehicles could be added to or removed automatically from the competitive set. Also note that a vehicle can be discarded from a competitive set once a maximum age is reached, and the maximum age could be set by the user.


Information defining how to price the user's vehicle is received at step 310. For example, to price the user's vehicle against the vehicles in the competitive set, the user creates or selects a set of formulas to guide pricing over time. In some embodiments, there are four main metrics in each formula set:

    • Time/Age Bracket of Formula Metric (based on vehicle aging);
    • Pricing Guide: Median Price of Competitive Set or Initial Listing Price (ignore market price);
    • Percentage/Multiplier of Pricing Guide; and
    • Profit Protection.


The Time/Age Bracket parameter defines a formula for calculating how the user's vehicle is priced against vehicles in the competitive set based on the length of time that the user's vehicle is on the market. Multiple formula sets can be defined, where different formula sets have different Time/Age Bracket formulas. For example, the formulas can be set in a manner so that there is a continuous pricing strategy that accounts for constant vehicle aging. As a particular example, “Formula 1” can be used for vehicles on the market from zero to X days, “Formula 2” can be used for vehicles on the market from X+1 to Y days, and “Formula 3” can be used for vehicles on the market from Y+1 to Z days.


The Pricing Guide parameter defines which price(s) for the vehicles in the competitive set is/are used to price the user's vehicle. In some embodiments, the options are to use the median price of the vehicles in the competitive set or the initial listing prices of the vehicles in the competitive set. Other options could also be available, such as the average price of the vehicles in the competitive set. The use of median price can help to filter out potential outlier prices or vehicles with extenuating circumstances (which might prevent them from having an optimal market pricing). This could occur, for example, when a vehicle in the competitive set is a salvage unit or has a bloated price from an uninformed dealer. The use of initial listing price allows a user to use prices selected by other dealers, which thereby allows the user to implement a pricing strategy without the variability that a fluctuating median price metric might offer.


The Percentage/Multiplier of Pricing Guide parameter defines how much higher or lower the user wants his or her vehicle's price to be based upon the selected Pricing Guide parameter. For example, the median price could be modified up or down by a specified percentage or dollar amount, or the initial listing price could be modified up or down by a specified percentage or dollar amount.


The Profit Protection parameter allows the user to identify a price floor so that the vehicle's price does not fall below a certain level (at least without user approval). This helps to ensure that the pricing for a vehicle, or a fleet of vehicles, is not automatically adjusted below the point where adequate profit can be obtained. For example, when applied to the competitive set, a situation may arise where the user's selected pricing guide and percentage/multiplier modifier tentatively indicate that the vehicle should be at a price point below a profitable level as defined by the profit protection barrier. The barrier can then be used to keep the price at the minimum level dictated by the barrier.


These parameters can be established by a user for a vehicle in any suitable manner. For example, the user could interact with the pricing server 110 via an operator station 108 or a user device 104.


Once the parameters are set, a current price for the vehicle is determined at step 312. This could include, for example, the pricing server 110 using the competitive set and the pricing formulas to identify the current price for a vehicle based on the length of time that the vehicle has been on the market. The price is provided to the user for approval at step 314. If the price is not approved, the process can return to an earlier step (such as step 306, 308, or 310) to modify the competitive set or the pricing formulas.


For a vehicle offered online, an approved price can be displayed to online customers. For a vehicle offered at a physical location, the user or other personnel could update a price tag on the vehicle with the approved price. If the vehicle includes an electronic price tag, the electronic price tag can be updated to display the new price. Prices from the pricing server 110 could be used in any other suitable manner. For instance, the user could access a listing of the user's vehicles (including the newly-priced vehicle) to view pricing reports or other information about the vehicles.


A decision can be made whether to update the vehicle price at step 316. This could include, for example, the pricing server 110 determining whether to update the vehicle price based on changes to the competitive set, such as new vehicles entering the competitive set or other vehicles leaving the competitive set. This could also include the pricing server 110 determining that at least one price for at least one vehicle in the competitive set has changed. As described below, the change in price of a vehicle in the competitive set could be automatically used, or a user could be asked to approve a change in price before the updated price is used. This could further include the pricing server 110 determining that one pricing formula defined or selected by the user has expired and another pricing formula is to be used. If so, the vehicle price is updated at step 318.


The frequency at which a vehicle price is updated can be configured by the user. In particular embodiments, the frequency of price syndication can be set by the user in three different ways:

    • Daily Updates: prices are syndicated daily, such as midnight every night;
    • Inventory Age: a price change is triggered on a specific day of the vehicle's age, such as the 15th or 30th day; and
    • Day of Week: prices are syndicated only on certain days of the week set by the user (such as only on Wednesdays and Fridays).


Note that the parameters described above are for illustration only, and other or additional parameters could also be used to price a vehicle. For instance, once an initial price is determined using the parameters described above, the initial price could be modified based on market trend and tendency analysis or other analyses desired by the user. This allows the user to account for external market forces, such as auction activity, gas prices, and organic online demand.


Although FIG. 3 illustrates one example of a method 300 for identifying prices for vehicles offered by vehicle dealerships and other entities, various changes may be made to FIG. 3. For example, while shown as a series of steps, various steps in FIG. 3 could overlap, occur in parallel, occur in a different order, or occur any number of times.



FIGS. 4 through 9 illustrate example graphical user interfaces that could be supported in the system 100 of FIG. 1 in accordance with this disclosure. The graphical user interfaces could be used, for example, by the pricing server 110 to obtain information from a user in order to price a vehicle.



FIG. 4 illustrates an example graphical user interface 400 that allows a user to define the parameters to be used by the pricing server 110 to price a vehicle. As shown in FIG. 4, the interface 400 includes a formula definition area 402 and a formula group area 404. The formula definition area 402 allows the user to create a new formula to be used, such as by specifying a name/description of the formula, the time/age bracket for the formula, a change to the pricing guide (assumed to be median here), and a profit protection parameter. The interface 400 allows the user to define the change to the percentage/multiplier parameter as a percentage or dollar amount.


The formula group area 404 shows the user a group of predefined formulas (such as formulas predefined by the user, by another user, or by an administrator). The group of predefined formulas collectively defines how a vehicle can be priced using different formulas over time, where use of each formula begins at a different age of the vehicle (meaning a different amount of time that the vehicle has been on the market).



FIG. 5 illustrates an example graphical user interface 500 showing a user all of the vehicles for which the pricing server 110 is identifying prices for that user. The interface 500 includes a legend and summary area 502 identifying the meanings of different icons used in the interface 500 and a summary of the estimated gross profit and average profit per vehicle based on current vehicle pricings. The interface 500 also includes a vehicle listing area 504, which identifies each vehicle for which the pricing server 110 is identifying prices for the user. For each vehicle, various information is provided, such as the make, model, VIN, trim, mileage, and age on market. The vehicle listing area 504 also displays various pricing information, such as current list price, the new price calculated by the pricing server 110, and the parameters used by the pricing server 110.


Note that while some vehicles' prices may have a negative profit and therefore result in a loss if sold, the prices for all vehicles in the list result in a profit for the user. The estimated gross and average profits shown in the legend and summary area 502 could be based on the calculated “SmartPrice” prices, which are the prices calculated by the pricing server 110.


Tabs 506 in the interface 500 are provided for viewing other information related to the pricing server 110. For example, other tabs 506 can be used to view new prices from the pricing server 110 that are awaiting approval, prices from the pricing server 110 that are overdue for approval, prices that have been approved or rejected today or during other time periods, and a calendar to view upcoming scheduled price changes.



FIG. 6 illustrates an example graphical user interface 600 showing information related to the pricing of a specific vehicle. In this case, the vehicle is the second vehicle from the list of FIG. 5. A top portion 602 of this interface 600 shows the specific vehicle information. A bottom portion 604 of this interface 600 includes filters 606 and a list 608 of vehicles currently satisfying the filters 606. The vehicles in the list 608 can be used to define the competitive set for the vehicle identified at the top of the interface 600. For example, the user can select which vehicles in the list 608 are to be included in the competitive set, and the user can optionally enter one or more price changes to be applied to one or more vehicles in the competitive set.


A middle portion 610 of this interface 600 includes a section 612 identifying the vehicles in the competitive set and the median price of the vehicles in the competitive set. The middle portion 610 of this interface 600 also includes a section 614 containing information from other sources (namely NADA and KELLEY BLUE BOOK in this example).



FIG. 7 illustrates an example graphical user interface 700 showing a “Market IQ” for a type of vehicle. This type of interface 700 can be useful in allowing a user to compare a proposed price for a vehicle from the pricing server 110 to other vehicles on the market. This type of interface 700 could be useful in helping the user review other vehicles on the market and determine whether to accept or reject a proposed price from the pricing server 110.



FIG. 8 illustrates an example graphical user interface 800 that allows a user to control the creation or modification of a competitive set. The graphical user interface 800 can include much of the same information shown in FIG. 6 (although in a different format). However, as described above, a competitive set can be defined manually by a user or automatically based on input from the user. The graphical user interface 800 here allows the user to control the mode of defining the competitive set.


As shown in FIG. 8, a top portion 802 of this interface 800 shows the specific vehicle information. Controls 804 allow a user to control whether the pricing server 110 identifies a competitive set in a manual mode or in an automatic mode. In the manual mode, the competitive set can be defined solely based on input from the user, where the user adds vehicles to or removes vehicles from the competitive set. In the automatic mode, the competitive set can be defined by the pricing server 110 based on market filters, where the pricing server 110 adds vehicles to or removes vehicles from the competitive set.


A middle portion 806 of this interface 800 includes a summary of the current market filters being used to automatically generate a competitive set and the price identified by the pricing server 110 using that competitive set. The middle portion 806 of this interface 800 also includes information from other sources (namely NADA and BLACK BOOK in this example).


A bottom portion 808 of this interface 800 includes various filters and keyword searching tools used to define the competitive set for the vehicle identified at the top of the interface 800. Also, a list 810 identifies the vehicles that currently satisfy the filters and keywords and that form the competitive set. In the automatic mode, as new vehicles are added to or dropped from the marketplace, the competitive set is dynamically updated, such as on a daily or other basis.



FIG. 9 illustrates an example graphical user interface 900 that allows a user to control whether price changes for vehicles in a competitive set are acceptable. As noted above, a change in the price of a vehicle in a competitive set can be used to update the price of a specified vehicle as determined by the pricing server 110. In an automatic mode, a change in the price of one or more vehicles in a competitive set can be used to automatically update a specified vehicle's price. In a manual mode, a change in the price of one or more vehicles in a competitive set can be used to update a specified vehicle's price if a price change is approved by a user. The graphical user interface 900 here allows the user to approve changes in vehicle prices.


As shown in FIG. 9, the interface 900 includes a list 902 of vehicles having price changes, where the vehicles in the list 902 are used in one or more competitive sets. For each vehicle in the list 902, there is a control 904 (in this case a drop-down menu) that allows the user to approve or reject the price change. An approved price change can be used to update the price of one or more vehicles, while a rejected price change is not. Controls 906 allow the user to approve or reject all price changes in the list 902. A tab 908 here is added to allow the user to access the list of pending approvals for vehicle price changes.


Color codings can be used in various ones of these interfaces to differentiate different prices, lengths on market, profits, and distances from the user's market. For example, in FIG. 5, green can be used to identify positive profit values, while red can be used to identify negative profit values or losses. In FIGS. 6 and 7, yellow, green, and red can be used to respectively identify lower, medium, and higher prices or lengths on market or distances.


Although FIGS. 4 through 9 illustrate examples of graphical user interfaces 400-900 that could be supported by the pricing server 110 of FIG. 1, various changes may be made to FIGS. 4 through 9. For example, while certain input/output mechanisms are shown here (such as text boxes, checkboxes, and lists), any other suitable input/output mechanisms could be used to provide information to a user or receive information from a user. Also, the content and arrangement of information in these figures are for illustration only. The content and arrangement can be altered according to particular needs. In addition, while often shown or described as involving the purchase or sale of an automobile, any transactions involving any vehicles could be supported by the pricing server 110. Other examples could include motorcycles, boats, recreational vehicles, trucks, or any other suitable vehicles.


In some embodiments, various functions described above are implemented or supported by a computer program that is formed from computer readable program code and that is embodied in a computer readable medium. The phrase “computer readable program code” includes any type of computer code, including source code, object code, and executable code. The phrase “computer readable medium” includes any type of medium capable of being accessed by a computer, such as read only memory (ROM), random access memory (RAM), a hard disk drive, a compact disc (CD), a digital video disc (DVD), or any other type of memory. A “non-transitory” computer readable medium excludes wired, wireless, optical, or other communication links that transport transitory electrical or other signals. A non-transitory computer readable medium includes media where data can be permanently stored and media where data can be stored and later overwritten, such as a rewritable optical disc or an erasable memory device.


It may be advantageous to set forth definitions of certain words and phrases used throughout this patent document. The terms “application” and “program” refer to one or more computer programs, software components, sets of instructions, procedures, functions, objects, classes, instances, related data, or a portion thereof adapted for implementation in a suitable computer code (including source code, object code, or executable code). The terms “include” and “comprise,” as well as derivatives thereof, mean inclusion without limitation. The term “or” is inclusive, meaning and/or. The phrase “associated with,” as well as derivatives thereof, may mean to include, be included within, interconnect with, contain, be contained within, connect to or with, couple to or with, be communicable with, cooperate with, interleave, juxtapose, be proximate to, be bound to or with, have, have a property of, have a relationship to or with, or the like. The phrase “at least one of,” when used with a list of items, means that different combinations of one or more of the listed items may be used, and only one item in the list may be needed. For example, “at least one of: A, B, and C” includes any of the following combinations: A, B, C, A and B, A and C, B and C, and A and B and C.


While this disclosure has described certain embodiments and generally associated methods, alterations and permutations of these embodiments and methods will be apparent to those skilled in the art. Accordingly, the above description of example embodiments does not define or constrain this disclosure. Other changes, substitutions, and alterations are also possible without departing from the spirit and scope of this disclosure, as defined by the following claims.

Claims
  • 1. A method comprising: displaying, in a graphical user interface, options for a user to select a manual mode or an automatic mode to generate a competitive set of vehicles for a specified vehicle;the user selecting either the manual mode or the automatic mode;in the manual mode, generating the competitive set of vehicles for the specified vehicle by a pricing server receiving user input to add and remove vehicles to the competitive set;in the automatic mode, generating the competitive set of vehicles for a specified vehicle, by, the pricing server providing market filters defined by the user, the market filters including, a features filter,a distance filter establishing a distance of an intended market, anda pricing filter,wherein the pricing server receives vehicle information from a plurality of vehicle dealership servers in communication with the pricing server and includes vehicles that satisfy the market filters;the pricing server receiving from the user, via a user device, one or more parameters to be used in pricing the specified vehicle;executing computer readable instructions stored by the pricing server, the computer-readable instructions configured to instruct a processor of the pricing server to determine a median price of the vehicles of the competitive set;the pricing server identifying, via the pricing server, a recommended price for the specified vehicle using a set of formulas, each formula of the set of formulas taking into consideration: a time parameter corresponding to a length of time that the vehicle is on the market,a pricing guide parameter based on the determined median price of the other vehicles of the competitive set,a modifier parameter corresponding to how much higher or lower than the pricing guide parameter to set the recommended price, anda profit protection parameter to prevent the recommended price from dropping below a predetermined price floor;in the automatic mode, the pricing server monitoring additional vehicle information received from the plurality of vehicle dealership servers,the pricing server automatically adding vehicles to the competitive set that satisfy the market filters, andthe pricing server automatically removing sold vehicles from the competitive set as vehicles are sold;in the manual mode, updating the competitive set by the user manually adding vehicles to and removing vehicles from the competitive set;the pricing server receiving price changes for one or more vehicles in the competitive set;displaying, via a graphical user interface, a list of the one or more vehicles in the competitive set with received price changes, wherein the list includes proposed price changes for each vehicle in the list;displaying, via a graphical user interface, a first control option for each vehicle in the list to allow the user to approve or reject each price change;the pricing server approving or rejecting a price change in response to user operation of the first control option;displaying, via a graphical user interface, a second control option for the user to approve or reject price changes for all vehicles in the list;the pricing server approving or rejecting price changes in response to user operation of the second control option;the pricing server updating the recommended price for the specified vehicle at predefined intervals based on changes to the competitive set and the one or more parameters; andupdating, via a network, a graphical user interface with the recommended price for the specified vehicle.
  • 2. The method of claim 1, wherein each formula of the set of formulas is associated with a different length of time that the specified vehicle is available, and wherein the recommended price is identified using a formula of the set of formulas that is associated with a length of time that the specified vehicle has been available.
  • 3. The method of claim 1, wherein identifying the recommended price comprises: using a first one of the set of formulas to identify a first recommended price for the specified vehicle; andafter a specified amount of time has elapsed, using a second one of the set of formulas to identify a lower second recommended price for the specified vehicle.
  • 4. The method of claim 1, wherein each formula of the set of formulas defines a continuous pricing strategy that accounts for constant vehicle aging.
  • 5. The method of claim 1, wherein receiving the one or more parameters comprises receiving a selection or definition of at least one formula of the set of formulas to be used to identify the recommended price.
  • 6. The method of claim 1, wherein the modifier parameter comprises one of: a specified amount or a specified percentage.
  • 7. A system comprising: a user device configured to display a graphical user interface including options for a user to select a manual mode or an automatic mode to generate a competitive set of vehicles for a specified vehicle;a pricing server in electrical communication with the user device to receive, from the user device, selection of the manual mode or the automatic mode;in the manual mode, the pricing server configured to generate the competitive set of vehicles based on user input to add and remove vehicles to the competitive set;in the automatic mode, the pricing server configured to generate the competitive set of vehicles by user of market filters including, a features filter,a distance filter establishing a distance of an intended market, anda pricing filter,wherein the pricing server receives vehicle information from a plurality of vehicle dealership servers in communication with the pricing server and includes vehicles that satisfy the market filters in the competitive set;wherein the pricing server is further configured to: receive from the user device, one or more parameters to be used in pricing the specified vehicle,identify a recommended price for the specified vehicle using a set of formulas, each formula of the set of formulas taking into consideration the one or more parameters comprising: a time parameter corresponding to a length of time that the specified vehicle is on the market,a pricing guide parameter based on a median price of the other vehicles of the competitive set,a modifier parameter corresponding to how much higher or lower than the pricing guide parameter to set the recommended price, anda profit protection parameter to prevent the recommended price from dropping below a predetermined floor,in the automatic mode, monitor additional vehicle information received from the plurality of vehicle dealership servers,automatically add vehicles to the competitive set that satisfy the market filters, andautomatically remove sold vehicles from the competitive set as vehicles are sold,in the manual mode, update the competitive set by receiving user input to add and remove vehicles to the competitive set, andreceive price changes for one or more vehicles in the competitive set;wherein the user device is further configured to: display, via the graphical user interface, a list of the one or more vehicles in the competitive set with received price changes, wherein the list includes proposed price changes for each vehicle in the list,display, via the graphical user interface, a first control option for each vehicle in the list to allow the user to approve or reject each price change, anddisplay, via the graphical user interface, a second control option for the user to approve or reject price changes for all vehicles in the list;wherein the pricing server is further configured to update the recommended price for the specified vehicle at predefined intervals based on the changes to the competitive set and the one or more parameters; andwherein the user device is further configured to update the graphical user interface with the recommended price for the specific vehicle.
  • 8. The system of claim 7, wherein each formula of the plurality of formulas is associated with a different length of time that the specified vehicle is available, and wherein the recommended price is identified using a formula of the set of formulas that is associated with a length of time that the specified vehicle has been available.
  • 9. The system of claim 7, wherein the at least one processing device is configured to: use a first one of the set of formulas to identify a first recommended price for the specified vehicle; andafter a specified amount of time has elapsed, use a second one of the set of formulas to identify a lower second recommended price for the specified vehicle.
  • 10. The system of claim 7, wherein each formula of the set of formulas defines a continuous pricing strategy that accounts for constant vehicle aging.
  • 11. The system of claim 7, wherein the at least one processing device is further configured to receive a selection or definition of at least one formula of the set of pricing formulas to be used to identify the recommended price.
  • 12. A non-transitory computer readable medium embodying a computer program, the computer program comprising computer readable program code for: displaying, in a graphical user interface, options for a user to select a manual mode or an automatic mode to generate a competitive set of vehicles;the user selecting either the manual mode or the automatic mode;in the manual mode, generating the competitive set of vehicles for a specified vehicle by a pricing server receiving user input to add and remove vehicles to the competitive set;in the automatic mode, generating the competitive set of vehicles for a specified vehicle by: the pricing server automatically generating the competitive set of vehicles based on market filters defined by the user, the market filters including, a features filter,a distance filter establishing a distance of an intended market, anda pricing filter,wherein the pricing server receives vehicle information from a plurality of vehicle dealership servers in communication with the pricing server and includes vehicles that satisfy the market filters;the pricing server receiving from a user, via a user device, one or more parameters to be used in pricing the specified vehicle;the pricing server identifying, via the pricing server, a recommended price for the specified vehicle using a set of formulas, each formula of the set of formulas taking into consideration: a time parameter corresponding to a length of time that the vehicle is on the market,a pricing guide parameter based on a median price of the other vehicles of the competitive set,a modifier parameter corresponding to how much higher or lower than the pricing guide parameter to set the recommended price, anda profit protection parameter to prevent the recommended price from dropping below a predetermined price floor;in the automatic mode, the pricing server monitoring additional vehicle information received from the plurality of vehicle dealership servers,the pricing server automatically adding vehicles to the competitive set that satisfy the market filters, andthe pricing server automatically removing sold vehicles from the competitive set as vehicles are sold;in the manual mode, updating the competitive set by the user manually adding vehicles to and removing vehicles from to the competitive set;the pricing server receiving price changes for one or more vehicles in the competitive set;displaying, via a graphical user interface, a list of the one or more vehicles in the competitive set with received price changes, wherein the list includes proposed price changes for each vehicle in the list;displaying, via a graphical user interface, a first control option for each vehicle in the list to allow the user to approve or reject each price change;the pricing server approving or rejecting a price change in response to user operation of the first control option;displaying, via a graphical user interface, a second control option for the user to approve or reject price changes for all vehicles in the list;the pricing server approving or rejecting price changes in response to user operation of the second control option;the pricing server updating the recommended price for the specified vehicle at predefined intervals based on changes to the competitive set and the one or more parameters; andupdating, via a network, a graphical user interface with the recommended price for the specified vehicle.
  • 13. The computer readable medium of claim 12, wherein each formula of the set of formulas is associated with a different length of time that the specified vehicle is available, and wherein the recommended price is identified using a formula of the set of formulas that is associated with a length of time that the specified vehicle has been available.
  • 14. The computer readable medium of claim 12, wherein the computer readable program code for identifying the recommended price comprises computer readable program code for: using a first one of the set of formulas to identify a first recommended price for the specified vehicle; andafter a specified amount of time has elapsed, using a second one of the set of formulas to identify a lower second recommended price for the specified vehicle.
  • 15. The computer readable medium of claim 12, wherein the computer readable program code for receiving the one or more parameters comprises computer readable program code for receiving a selection or definition of at least one formula of the set of formulas to be used to identify the recommended price.
CROSS-REFERENCE TO RELATED APPLICATION AND PRIORITY CLAIM

This application claims priority under 35 U.S.C. § 119(e) to U.S. Provisional Patent Application No. 61/798,025 filed on Mar. 15, 2013. This provisional patent application is hereby incorporated by reference in its entirety.

US Referenced Citations (485)
Number Name Date Kind
3792445 Bucks et al. Feb 1974 A
4258421 Juhasz et al. Mar 1981 A
4992940 Dworkin Feb 1991 A
5003476 Abe Mar 1991 A
5034889 Abe Jul 1991 A
5058044 Stewart et al. Oct 1991 A
5421015 Khoyi et al. May 1995 A
5442553 Parrillo Aug 1995 A
5452446 Johnson Sep 1995 A
5521815 Rose, Jr. May 1996 A
5649186 Ferguson Jul 1997 A
5694595 Jacobs et al. Dec 1997 A
5729452 Smith et al. Mar 1998 A
5787177 Leppek Jul 1998 A
5790785 Klug et al. Aug 1998 A
5835712 DuFresne Nov 1998 A
5845299 Arora et al. Dec 1998 A
5862346 Kley et al. Jan 1999 A
5911145 Arora et al. Jun 1999 A
5956720 Fernandez et al. Sep 1999 A
5974149 Leppek Oct 1999 A
5974418 Blinn et al. Oct 1999 A
5974428 Gerard et al. Oct 1999 A
5978776 Seretti et al. Nov 1999 A
5987506 Carter et al. Nov 1999 A
6003635 Bantz et al. Dec 1999 A
6006201 Berent et al. Dec 1999 A
6009410 LeMole et al. Dec 1999 A
6018748 Smith Jan 2000 A
6021416 Dauerer et al. Feb 2000 A
6021426 Douglis et al. Feb 2000 A
6026433 D'Arlach et al. Feb 2000 A
6041310 Green et al. Mar 2000 A
6041344 Bodamer et al. Mar 2000 A
6055541 Solecki et al. Apr 2000 A
6061698 Chadha et al. May 2000 A
6067559 Allard et al. May 2000 A
6070164 Vagnozzi May 2000 A
6134532 Lazarus et al. Oct 2000 A
6151609 Truong Nov 2000 A
6178432 Cook et al. Jan 2001 B1
6181994 Colson et al. Jan 2001 B1
6185614 Cuomo et al. Feb 2001 B1
6189104 Leppek Feb 2001 B1
6216129 Eldering Apr 2001 B1
6219667 Lu et al. Apr 2001 B1
6236994 Swartz et al. May 2001 B1
6240365 Bunn May 2001 B1
6263268 Nathanson Jul 2001 B1
6285932 De Belledeuille et al. Sep 2001 B1
6289382 Bowman-Amuah Sep 2001 B1
6295061 Park et al. Sep 2001 B1
6330499 Chou et al. Dec 2001 B1
6343302 Graham Jan 2002 B1
6353824 Boguraev et al. Mar 2002 B1
6356822 Diaz et al. Mar 2002 B1
6374241 Lamburt et al. Apr 2002 B1
6397226 Sage May 2002 B1
6397336 Leppek May 2002 B2
6401103 Ho et al. Jun 2002 B1
6421733 Tso et al. Jul 2002 B1
6473849 Keller et al. Oct 2002 B1
6496855 Hunt et al. Dec 2002 B1
6505106 Lawrence et al. Jan 2003 B1
6505205 Kothuri et al. Jan 2003 B1
6519617 Wanderski et al. Feb 2003 B1
6535879 Behera Mar 2003 B1
6539370 Chang et al. Mar 2003 B1
6546216 Mizoguchi et al. Apr 2003 B2
6553373 Boguraev et al. Apr 2003 B2
6556904 Larson et al. Apr 2003 B1
6564216 Waters May 2003 B2
6571253 Thompson et al. May 2003 B1
6581061 Graham Jun 2003 B2
6583794 Wattenberg Jun 2003 B1
6594664 Estrada et al. Jul 2003 B1
6606525 Muthuswamy et al. Aug 2003 B1
6629148 Ahmed et al. Sep 2003 B1
6643663 Dabney et al. Nov 2003 B1
6654726 Hanzek Nov 2003 B1
6678706 Fishel Jan 2004 B1
6697825 Underwood et al. Feb 2004 B1
6701232 Yamaki Mar 2004 B2
6721747 Lipkin Apr 2004 B2
6728685 Ahluwalia Apr 2004 B1
6738750 Stone et al. May 2004 B2
6744735 Nakaguro Jun 2004 B1
6748305 Klausner et al. Jun 2004 B1
6785864 Te et al. Aug 2004 B1
6795819 Wheeler et al. Sep 2004 B2
6823258 Ukai et al. Nov 2004 B2
6823359 Heidingsfeld Nov 2004 B1
6826594 Pettersen Nov 2004 B1
6847988 Toyouchi et al. Jan 2005 B2
6850823 Eun et al. Feb 2005 B2
6871216 Miller et al. Mar 2005 B2
6901430 Smith Mar 2005 B1
6894601 Grunden et al. May 2005 B1
6917941 Wight et al. Jul 2005 B2
6922674 Nelson Jul 2005 B1
6941203 Chen Sep 2005 B2
6944677 Zhao Sep 2005 B1
6954731 Montague et al. Oct 2005 B1
6963854 Boyd Nov 2005 B1
6965806 Eryurek et al. Nov 2005 B2
6965968 Touboul Nov 2005 B1
6978273 Bonneau et al. Dec 2005 B1
6981028 Rawat et al. Dec 2005 B1
6990629 Heaney et al. Jan 2006 B1
6993421 Pillar Jan 2006 B2
7000184 Matveyenko et al. Feb 2006 B2
7003476 Samra et al. Feb 2006 B1
7028072 Kliger et al. Apr 2006 B1
7031554 Iwane Apr 2006 B2
7039704 Davis et al. May 2006 B2
7047318 Svedloff May 2006 B1
7062343 Ogushi et al. Jun 2006 B2
7062506 Taylor et al. Jun 2006 B2
7072943 Landesmann Jul 2006 B2
7092803 Kapolka et al. Aug 2006 B2
7107268 Zawadzki et al. Sep 2006 B1
7124116 Huyler Oct 2006 B2
7152207 Underwood et al. Dec 2006 B1
7155491 Schultz et al. Dec 2006 B1
7171418 Blessin Jan 2007 B2
7184866 Squires et al. Feb 2007 B2
7197764 Cichowlas Mar 2007 B2
7219234 Ashland et al. May 2007 B1
7240125 Fleming Jul 2007 B2
7246263 Skingle Jul 2007 B2
7281029 Rawat Oct 2007 B2
7287000 Boyd Oct 2007 B2
7322007 Schowtka et al. Jan 2008 B2
7386786 Davis et al. Jun 2008 B2
7401289 Lachhwani et al. Jul 2008 B2
7406429 Salonen Jul 2008 B2
7433891 Haber et al. Oct 2008 B2
7457693 Olsen et al. Nov 2008 B2
7477968 Lowrey Jan 2009 B1
7480551 Lowrey et al. Jan 2009 B1
7496543 Bamford et al. Feb 2009 B1
7502672 Kolls Mar 2009 B1
7536641 Rosenstein et al. May 2009 B2
7548985 Guigui Jun 2009 B2
7587504 Adams et al. Sep 2009 B2
7590476 Shumate Sep 2009 B2
7593925 Cadiz et al. Sep 2009 B2
7593999 Nathanson Sep 2009 B2
7613627 Doyle et al. Nov 2009 B2
7620484 Chen Nov 2009 B1
7624342 Matveyenko et al. Nov 2009 B2
7657594 Banga et al. Feb 2010 B2
7664667 Ruppelt et al. Feb 2010 B1
7739007 Logsdon Jun 2010 B2
7747680 Ravikumar et al. Jun 2010 B2
7778841 Bayer et al. Aug 2010 B1
7801945 Geddes et al. Sep 2010 B1
7818380 Tamura et al. Oct 2010 B2
7861309 Spearman et al. Dec 2010 B2
7865409 Monaghan Jan 2011 B1
7870253 Muilenburg et al. Jan 2011 B2
7899701 Odom Mar 2011 B1
7908051 Oesterling Mar 2011 B2
7979506 Cole Jul 2011 B2
8010423 Bodin et al. Aug 2011 B2
8019501 Breed Sep 2011 B2
8036788 Breed Oct 2011 B2
8051159 Muilenburg et al. Nov 2011 B2
8055544 Ullman et al. Nov 2011 B2
8060274 Boss et al. Nov 2011 B2
8095403 Price Jan 2012 B2
8099308 Uyeki Jan 2012 B2
8135804 Uyeki Mar 2012 B2
8145379 Schwinke Mar 2012 B2
8190322 Lin et al. May 2012 B2
8209259 Graham, Jr. et al. Jun 2012 B2
8212667 Petite et al. Jul 2012 B2
8271473 Berg Sep 2012 B2
8271547 Taylor et al. Sep 2012 B2
8275717 Ullman et al. Sep 2012 B2
8285439 Hodges Oct 2012 B2
8296007 Swaminathan et al. Oct 2012 B2
8311905 Campbell et al. Nov 2012 B1
8355950 Colson Jan 2013 B2
8407664 Moosmann et al. Mar 2013 B2
8428815 Van Engelshoven et al. Apr 2013 B2
8438310 Muilenburg et al. May 2013 B2
8521654 Ford et al. Aug 2013 B2
8538894 Ullman et al. Sep 2013 B2
8645193 Swinson Feb 2014 B2
8676638 Blair et al. Mar 2014 B1
8725341 Ogasawara May 2014 B2
8745641 Coker Jun 2014 B1
8849689 Jagannathan et al. Sep 2014 B1
8886389 Edwards et al. Nov 2014 B2
8924071 Stanek et al. Dec 2014 B2
8954222 Costantino Feb 2015 B2
8996230 Lorenz et al. Mar 2015 B2
8996235 Singh et al. Mar 2015 B2
9014908 Chen et al. Apr 2015 B2
9015059 Sims et al. Apr 2015 B2
9026304 Olsen, III et al. May 2015 B2
9047722 Kurnik et al. Jun 2015 B2
9165413 Jones et al. Oct 2015 B2
9183681 Fish Nov 2015 B2
9325650 Yalavarty et al. Apr 2016 B2
9349223 Palmer May 2016 B1
9384597 Koch et al. Jul 2016 B2
9577866 Rogers et al. Feb 2017 B2
9596287 Rybak et al. Mar 2017 B2
9619945 Adderly et al. Apr 2017 B2
9659495 Modica et al. May 2017 B2
9706008 Rajan et al. Jul 2017 B2
9715665 Schondorf et al. Jul 2017 B2
9754304 Taira Sep 2017 B2
9778045 Bang Oct 2017 B2
9836714 Lander et al. Dec 2017 B2
10032139 Adderly et al. Jul 2018 B2
10083411 Kinsey et al. Sep 2018 B2
10229394 Davis et al. Mar 2019 B1
10475256 Chowdhury et al. Nov 2019 B2
20010005831 Lewin et al. Jun 2001 A1
20010014868 Herz et al. Aug 2001 A1
20010037332 Miller et al. Nov 2001 A1
20010039594 Park et al. Nov 2001 A1
20010054049 Maeda et al. Dec 2001 A1
20020023111 Arora et al. Feb 2002 A1
20020024537 Jones et al. Feb 2002 A1
20020026359 Long et al. Feb 2002 A1
20020032626 DeWolf et al. Mar 2002 A1
20020032701 Gao et al. Mar 2002 A1
20020042738 Srinivasan et al. Apr 2002 A1
20020046245 Hillar et al. Apr 2002 A1
20020049831 Platner et al. Apr 2002 A1
20020052778 Murphy et al. May 2002 A1
20020059260 Jas May 2002 A1
20020065698 Schick et al. May 2002 A1
20020065739 Florance et al. May 2002 A1
20020069110 Sonnenberg Jun 2002 A1
20020073080 Lipkin Jun 2002 A1
20020082978 Ghouri et al. Jun 2002 A1
20020091755 Narin Jul 2002 A1
20020107739 Schlee Aug 2002 A1
20020111727 Vanstory et al. Aug 2002 A1
20020111844 Vanstory et al. Aug 2002 A1
20020116418 Lachhwani et al. Aug 2002 A1
20020123359 Wei et al. Sep 2002 A1
20020124053 Adams et al. Sep 2002 A1
20020128728 Murakami et al. Sep 2002 A1
20020129054 Ferguson et al. Sep 2002 A1
20020133273 Lowrey et al. Sep 2002 A1
20020138331 Hosea et al. Sep 2002 A1
20020143646 Boyden et al. Oct 2002 A1
20020154146 Rodriquez et al. Oct 2002 A1
20020169851 Weathersby et al. Nov 2002 A1
20020173885 Lowrey et al. Nov 2002 A1
20020196273 Krause Dec 2002 A1
20020198761 Ryan et al. Dec 2002 A1
20020198878 Baxter et al. Dec 2002 A1
20030014443 Bernstein et al. Jan 2003 A1
20030023632 Ries et al. Jan 2003 A1
20030033378 Needham et al. Feb 2003 A1
20030036832 Kokes et al. Feb 2003 A1
20030036964 Boyden et al. Feb 2003 A1
20030037263 Kamat et al. Feb 2003 A1
20030046179 Anabtawi et al. Mar 2003 A1
20030051022 Sogabe et al. Mar 2003 A1
20030055666 Roddy et al. Mar 2003 A1
20030061263 Riddle Mar 2003 A1
20030065532 Takaoka Apr 2003 A1
20030065583 Takaoka Apr 2003 A1
20030069785 Lohse Apr 2003 A1
20030069790 Kane Apr 2003 A1
20030074392 Campbell et al. Apr 2003 A1
20030095038 Dix May 2003 A1
20030101262 Godwin May 2003 A1
20030115292 Griffin et al. Jun 2003 A1
20030120502 Robb et al. Jun 2003 A1
20030145310 Thames et al. Jul 2003 A1
20030177050 Crampton et al. Sep 2003 A1
20030177175 Worley et al. Sep 2003 A1
20030225853 Wang et al. Dec 2003 A1
20030229623 Chang et al. Dec 2003 A1
20030233246 Snapp et al. Dec 2003 A1
20040012631 Skorski Jan 2004 A1
20040039646 Hacker Feb 2004 A1
20040041818 White et al. Mar 2004 A1
20040073546 Forster et al. Apr 2004 A1
20040073564 Haber et al. Apr 2004 A1
20040088228 Mercer et al. May 2004 A1
20040093243 Bodin et al. May 2004 A1
20040117046 Colle et al. Jun 2004 A1
20040122735 Meshkin et al. Jun 2004 A1
20040128320 Grove et al. Jul 2004 A1
20040139203 Graham, Jr. et al. Jul 2004 A1
20040148342 Cotte Jul 2004 A1
20040156020 Edwards Aug 2004 A1
20040163047 Nagahara et al. Aug 2004 A1
20040181464 Vanker et al. Sep 2004 A1
20040199413 Hauser et al. Oct 2004 A1
20040220863 Porter et al. Nov 2004 A1
20040225664 Casement Nov 2004 A1
20040230897 Latzel Nov 2004 A1
20040255233 Croney et al. Dec 2004 A1
20040267263 May Dec 2004 A1
20040268225 Walsh et al. Dec 2004 A1
20040268232 Tunning Dec 2004 A1
20050015491 Koeppel Jan 2005 A1
20050021197 Zimmerman et al. Jan 2005 A1
20050027611 Wharton Feb 2005 A1
20050065804 Worsham et al. Mar 2005 A1
20050096963 Myr May 2005 A1
20050108112 Ellenson May 2005 A1
20050114270 Hind et al. May 2005 A1
20050114764 Gudenkauf et al. May 2005 A1
20050108637 Sahota et al. Jun 2005 A1
20050149398 McKay Jul 2005 A1
20050171836 Leacy Aug 2005 A1
20050176482 Raisinghani et al. Aug 2005 A1
20050187834 Painter et al. Aug 2005 A1
20050228736 Norman et al. Oct 2005 A1
20050267774 Merritt Dec 2005 A1
20050268282 Laird Dec 2005 A1
20050289020 Bruns et al. Dec 2005 A1
20050289599 Matsuura et al. Dec 2005 A1
20060031811 Ernst et al. Feb 2006 A1
20060059253 Goodman et al. Mar 2006 A1
20060064637 Rechterman et al. Mar 2006 A1
20060123330 Horiuchi et al. Jun 2006 A1
20060129423 Sheinson Jun 2006 A1
20060129982 Doyle Jun 2006 A1
20060136105 Larson Jun 2006 A1
20060161841 Horiuchi et al. Jul 2006 A1
20060200751 Underwood et al. Sep 2006 A1
20060248442 Rosenstein et al. Nov 2006 A1
20060259350 Ryan Nov 2006 A1
20060265355 Taylor Nov 2006 A1
20060271844 Suklikar Nov 2006 A1
20060277588 Harrington et al. Dec 2006 A1
20070005446 Fusz Jan 2007 A1
20070016486 Stone et al. Jan 2007 A1
20070027754 Collins et al. Feb 2007 A1
20070033087 Combs et al. Feb 2007 A1
20070033520 Kimzey et al. Feb 2007 A1
20070053513 Hoffberg Mar 2007 A1
20070100519 Engel May 2007 A1
20070150368 Arora et al. Jun 2007 A1
20070209011 Padmanabhuni et al. Sep 2007 A1
20070226540 Konieczny Sep 2007 A1
20070250229 Wu Oct 2007 A1
20070250327 Hedy Oct 2007 A1
20070250840 Coker et al. Oct 2007 A1
20070271154 Broudy et al. Nov 2007 A1
20070271330 Mattox et al. Nov 2007 A1
20070271389 Joshi et al. Nov 2007 A1
20070282711 Ullman et al. Dec 2007 A1
20070282712 Ullman et al. Dec 2007 A1
20070282713 Ullman et al. Dec 2007 A1
20070288413 Mizuno et al. Dec 2007 A1
20070294192 Tellefsen Dec 2007 A1
20080010561 Bay et al. Jan 2008 A1
20080015929 Koeppel et al. Jan 2008 A1
20080027827 Eglen Jan 2008 A1
20080119983 Inbarajan et al. May 2008 A1
20080172632 Stambaugh Jul 2008 A1
20080189143 Wurster Aug 2008 A1
20080195435 Bentley Aug 2008 A1
20080195932 Oikawa et al. Aug 2008 A1
20080201163 Barker Aug 2008 A1
20080255925 Vailaya Oct 2008 A1
20090012887 Taub et al. Jan 2009 A1
20090024918 Silverbrook et al. Jan 2009 A1
20090043780 Hentrich, Jr. et al. Feb 2009 A1
20090070435 Abhyanker Mar 2009 A1
20090089134 Uyeki Apr 2009 A1
20090106036 Tamura et al. Apr 2009 A1
20090112687 Blair et al. Apr 2009 A1
20090182232 Zhang et al. Jul 2009 A1
20090187513 Noy Jul 2009 A1
20090187939 Lajoie Jul 2009 A1
20090204454 Lagudi Aug 2009 A1
20090222532 Finlaw Sep 2009 A1
20090265607 Raz et al. Oct 2009 A1
20090313035 Esser Dec 2009 A1
20100023393 Costy et al. Jan 2010 A1
20100070343 Taira Mar 2010 A1
20100082778 Muilenburg et al. Apr 2010 A1
20100082780 Muilenburg et al. Apr 2010 A1
20100088158 Pollack Apr 2010 A1
20100100259 Geiter Apr 2010 A1
20100100506 Marot Apr 2010 A1
20100235219 Merrick et al. Sep 2010 A1
20100235231 Jewer Sep 2010 A1
20100293030 Wu Nov 2010 A1
20100312608 Shan et al. Dec 2010 A1
20100318408 Sankaran Dec 2010 A1
20100324777 Tominaga et al. Dec 2010 A1
20110010432 Uyeki Jan 2011 A1
20110015989 Tidwell et al. Jan 2011 A1
20110022525 Swinson Jan 2011 A1
20110082804 Swinson Apr 2011 A1
20110145053 Hashim-Waris Jun 2011 A1
20110145064 Anderson et al. Jun 2011 A1
20110161167 Jallapuram Jun 2011 A1
20110191264 Inghelbrecht Aug 2011 A1
20110196762 DuPont Aug 2011 A1
20110224864 Gellatly et al. Sep 2011 A1
20110231055 Knight et al. Sep 2011 A1
20110288937 Manoogian, III Nov 2011 A1
20110307411 Bolivar Dec 2011 A1
20120066010 Williams et al. Mar 2012 A1
20120089474 Xiao et al. Apr 2012 A1
20120095804 Calabrese et al. Apr 2012 A1
20120101891 Collier Apr 2012 A1
20120116868 Chin et al. May 2012 A1
20120158211 Chen et al. Jun 2012 A1
20120209714 Douglas et al. Aug 2012 A1
20120221125 Bell Aug 2012 A1
20120268294 Michaelis et al. Oct 2012 A1
20120278886 Luna Nov 2012 A1
20120284113 Pollak Nov 2012 A1
20120316981 Hoover Dec 2012 A1
20130046432 Edwards et al. Feb 2013 A1
20130080196 Schroeder et al. Mar 2013 A1
20130080305 Virag et al. Mar 2013 A1
20130151334 Berkhin et al. Jun 2013 A1
20130204484 Ricci Aug 2013 A1
20130325541 Capriotti et al. Dec 2013 A1
20130332023 Bertosa et al. Dec 2013 A1
20140026037 Garb et al. Jan 2014 A1
20140052327 Hosein et al. Feb 2014 A1
20140088866 Knapp et al. Mar 2014 A1
20140094992 Lambert et al. Apr 2014 A1
20140136278 Carvalho May 2014 A1
20140229391 East et al. Aug 2014 A1
20140244110 Tharaldson et al. Aug 2014 A1
20140277906 Lowrey et al. Sep 2014 A1
20140278805 Thompson Sep 2014 A1
20140316825 Van Dijk et al. Oct 2014 A1
20140324275 Stanek et al. Oct 2014 A1
20140337163 Whisnant Nov 2014 A1
20140379530 Kim et al. Dec 2014 A1
20150057875 McGinnis et al. Feb 2015 A1
20150066781 Johnson et al. Mar 2015 A1
20150066933 Kolodziej et al. Mar 2015 A1
20150100199 Kurnik et al. Apr 2015 A1
20150142256 Jones May 2015 A1
20150227894 Mapes, Jr. et al. Aug 2015 A1
20150268059 Borghesani et al. Sep 2015 A1
20150278886 Fusz Oct 2015 A1
20150286979 Ming et al. Oct 2015 A1
20160004516 Ivanov et al. Jan 2016 A1
20160071054 Kakarala Mar 2016 A1
20160092944 Taylor et al. Mar 2016 A1
20160132935 Shen et al. May 2016 A1
20160140609 Demir May 2016 A1
20160140620 Pinkowish et al. May 2016 A1
20160140622 Wang et al. May 2016 A1
20160148439 Akselrod et al. May 2016 A1
20160180358 Battista Jun 2016 A1
20160180378 Toshida et al. Jun 2016 A1
20160180418 Jaeger Jun 2016 A1
20160267503 Zakai-Or et al. Sep 2016 A1
20160275533 Smith et al. Sep 2016 A1
20160307174 Marcelle et al. Oct 2016 A1
20160357599 Glatfelter Dec 2016 A1
20170039785 Richter et al. Feb 2017 A1
20170053460 Hauser et al. Feb 2017 A1
20170064038 Chen Mar 2017 A1
20170124525 Johnson et al. May 2017 A1
20170262894 Kirti et al. Sep 2017 A1
20170293894 Taliwal et al. Oct 2017 A1
20170308844 Kelley Oct 2017 A1
20170308864 Kelley Oct 2017 A1
20170308865 Kelley Oct 2017 A1
20170316459 Strauss et al. Nov 2017 A1
20170337573 Toprak Nov 2017 A1
20170352054 Ma et al. Dec 2017 A1
20180225710 Kar et al. Aug 2018 A1
20180232749 Moore, Jr. et al. Aug 2018 A1
20180285901 Zackrone Oct 2018 A1
20180285925 Zackrone Oct 2018 A1
20190297162 Amar et al. Sep 2019 A1
20190334884 Ross et al. Oct 2019 A1
20200038363 Kim Feb 2020 A1
Foreign Referenced Citations (2)
Number Date Country
2494350 May 2004 CA
0461888 Mar 1995 EP
Non-Patent Literature Citations (167)
Entry
Johns et al., Competitive Intelligence in Service Marketing, Aug. 3. 2010, Emerald Group Publishing Limited, vol. 28, p. 551-570 (Year: 2010).
“NetFormx Offers Advanced Network Discovery Software”. PR Newswire. Mar. 15, 1999. Retrieved from http://www.highbeam.com/doc/1G1-54102907.html>.
Aloisio, Giovanni et al., “Web-based access to the Grid using the Grid Resource Broker portal,” Google 2002, pp. 1145-1160.
Anonymous, “Software ready for prime time.” Automotive News. Detroit, Nov. 5, 2001. vol. 76, Issue 5996, p. 28.
Chadwick, D. W., “Understanding X.500—The Directory.” Available at <http://sec.cs.kent.ac.uk/x500book/>. 1996. Entire work cited.
Chen, Deren, “Business to Business Standard and Supply Chain System Framework in Virtual Enterprises,” Computer Supported Cooperative Work in Design, The Sixth International Conference on, 2001; Publication Year: 2001, pp. 472-476.
CNY Business Journal, “Frank La Voila named Southern Tier Small-Business Person of 1999”. Jun. 11, 1999. 2 pgs.
Dallas Morning News, “I know someone who knows Kevin Bacon”. Oct. 27, 1998. 4 pgs.
Davis, Peter T. et al., “Sams Teach Yourself Microsoft Windows NT Server 4 in 21 Days,” Sams® Publishing, © 1999. ISBN: 0-672-31555-6, 15 pgs., printed Dec. 21, 2008.
Derfler, Frank J. et al., “How Networks Work: Millennium Edition,” Que, A Division of Macmillan Computer Publishing, © 2000. ISBN: 0-7897-2445-6, 9 pgs.
Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and mailed from the USPTO dated Jul. 6, 2011, 26 pgs.
Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and mailed from the USPTO dated Mar. 3, 2010, 24 pgs.
Final Office Action for U.S. Appl. No. 10/350,810, filed Jan. 24, 2003, and mailed from the USPTO dated Apr. 5, 2005, 12 pgs.
Final Office Action for U.S. Appl. No. 10/350,810, filed Jan. 24, 2003, and mailed from the USPTO dated May 18, 2006, 15 pgs.
Final Office Action for U.S. Appl. No. 10/350,810, filed Jan. 24, 2003, and mailed from the USPTO dated Nov. 14, 2007, 13 pgs.
Final Office Action for U.S. Appl. No. 10/351,465, filed Jan. 24, 2003, and mailed from the USPTO dated May 5, 2005, 8 pgs.
Final Office Action for U.S. Appl. No. 10/665,899, filed Sep. 18, 2003, and mailed from the USPTO dated Feb. 24, 2010, 22 pgs.
Final Office Action for U.S. Appl. No. 10/665,899, filed Sep. 18, 2003, and mailed from the USPTO dated Jul. 7, 2008, 11 pgs.
Final Office Action for U.S. Appl. No. 10/665,899, filed Sep. 18, 2003, and mailed from the USPTO dated Mar. 8, 2011, 21 pgs.
Final Office Action for U.S. Appl. No. 10/665,899, filed Sep. 18, 2003, and mailed from the USPTO dated May 11, 2009, 14 pgs.
Final Office Action for U.S. Appl. No. 11/149,909, filed Jun. 10, 2005, and mailed from the USPTO dated Feb. 4, 2009, 14 pgs.
Final Office Action for U.S. Appl. No. 11/442,821, filed May 30, 2006, and mailed from the USPTO dated Apr. 7, 2009, 19 pgs.
Final Office Action for U.S. Appl. No. 11/442,821, filed May 30, 2006, and mailed from the USPTO dated May 21, 2010, 28 pgs.
Final Office Action for U.S. Appl. No. 11/442,821, filed May 30, 2006, and mailed from the USPTO dated Nov. 29, 2011, 26 pgs.
Final Office Action for U.S. Appl. No. 11/446,011, filed Jun. 2, 2006, and mailed from the USPTO dated Jun. 8, 2010, 12 pgs.
Final Office Action for U.S. Appl. No. 11/524,602, filed Sep. 21, 2006, and mailed from the USPTO dated Jul. 27, 2010, 13 pgs.
Final Office Action for U.S. Appl. No. 11/524,602, filed Sep. 21, 2006, and mailed from the USPTO dated Jun. 26, 2012, 11 pgs.
Final Office Action for U.S. Appl. No. 11/525,009, filed Sep. 21, 2006, and mailed from the USPTO dated Aug. 3, 2010, 16 pgs.
Final Office Action for U.S. Appl. No. 12/243,852, filed Oct. 1, 2008, and mailed from the USPTO dated Oct. 24, 2011, 13 pgs.
Final Office Action for U.S. Appl. No. 12/243,861, filed Oct. 1, 2008, and mailed from theUSPTO dated Jun. 22, 2011, 5 pgs.
Final Office Action for U.S. Appl. No. 13/025,019, filed Feb. 10, 2011, and mailed from the USPTO dated Aug. 28, 2015, 25 pgs.
Final Office Action for U.S. Appl. No. 13/025,019, filed Feb. 10, 2011, and mailed from the USPTO dated Jul. 13, 2018, 11 pgs.
Final Office Action for U.S. Appl. No. 13/025,019, filed Feb. 10, 2011, and mailed from the USPTO dated Sep. 12, 2013, 13 pgs.
Final Office Action for U.S. Appl. No. 13/025,019, filed Feb. 20, 2011 and mailed from the USPTO dated Dec. 20, 2016, 16 pgs.
Final Office Action for U.S. Appl. No. 14/208,042, filed Mar. 13, 2014, and mailed from the USPTO dated Dec. 6, 2016, 26 pgs.
Final Office Action for U.S. Appl. No. 15/602,999, filed May 23, 2017, and mailed from the USPTO dated Nov. 21, 2018,
Final Office Action dated Sep. 21, 2018 in U.S. Appl. No. 15/134,820.
Hogue et al., “Thresher: Automating the Unwrapping of Semantic Content from the World Wide Web,” ACM 2005, pp. 86-95.
Housel, Barron C. et al., “WebExpress: A client/intercept based system for optimizing Web browsing in a wireless environment,” Google 1998, pp. 419-431.
http://web.archive.org/web/20010718130244/http://chromedata.com/maing2/about/index.asp, 1 pg.
http://web.archive.org/web/20050305055408/http://www.dealerclick.com/, 1 pg.
http://web.archive.org/web/20050528073821/http://www.kbb.com/, 1 pg.
http://web.archive.org/web/20050531000823/http://www.carfax.com/, 1 pg.
IBM Tivoli Access Manager Base Administration Guide, Version 5.1. 2003, International Business Machines Corporation. Entire book enclosed and cited. 402 pgs.
Interconnection. (2003). In Roget's II The New Thesaurus. Boston, MA: Houghton Mifflin. Retrieved Jul. 16, 2009, from http://www.credoreference.com/entry/hmrogets/interconnection, 1 pg.
Internet Archive Wayback Machine, archive of LDAP Browser.com—FAQ. Archived Dec. 11, 2000. Available at <http://web.archive.org/web/200012110152/http://www.ldapbrowser.com/faq/faq.php3?sID=fe4ae66f023d86909f35e974f3a1ce>.
Internet Archive Wayback Machine, archive of LDAP Browser.com—Product Info. Archived Dec. 11, 2000. Available at <http://web.archive.org/web/200012110541/http://www.ldapbrowser.com/prodinfo/prodinfo.php3?sID=fe4ae66f2fo23d86909f35e974f3a1ce>.
Internet Archive: Audio Archive, http://www.archive.org/audio/audio-searchresults.php?search=@start=0&limit=100&sort=ad, printed May 12, 2004, 12 pgs.
Internet Archive: Democracy Now, http://www.archive.org/audio/collection.php?collection=democracy_now, printed May 12, 2004, 2 pgs.
Java 2 Platform, Enterprise Edition (J2EE) Overview, printed Mar. 6, 2010, 3 pgs.
Java version history—Wikipedia, the free encyclopedia, printed Mar. 6, 2010, 9 pgs.
Michener, J.R., et al., “Managing System and Active-Content Integrity,” Computer; vol. 33, Issue: 7; Publication Year: 2000, pp. 108-110.
Milic-Frayling, Natasa, et al., “SmartView: Enhanced Document Viewer for Mobile Devices,” Google Nov. 15, 2002, 11 pgs.
Non-Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and mailed from the USPTO dated Dec. 26, 2008, 13 pgs.
Non-Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and mailed from the USPTO dated Feb. 6, 2006, 11 pgs.
Non-Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and mailed from the USPTO dated Jul. 22, 2009, 22 pgs.
Non-Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and mailed from the USPTO dated Jun. 29, 2006, 11 pgs.
Non-Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and mailed from the USPTO dated Mar. 12, 2007, 10 pgs.
Non-Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and mailed from the USPTO dated May 29, 2008, 10 pgs.
Non-Final Office Action for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and mailed from the USPTO dated Nov. 1, 2010, 19 pgs.
Non-Final Office Action for U.S. Appl. No. 10/350,796, filed Jan. 24, 2003 and mailed from the USPTO dated May 19, 2005, 7 pgs.
Non-Final Office Action for U.S. Appl. No. 10/350,810, filed Jan. 24, 2003, and mailed from the USPTO dated Apr. 17, 2007, 12 pgs.
Non-Final Office Action for U.S. Appl. No. 10/350,810, filed Jan. 24, 2003, and mailed from the USPTO dated Dec. 9, 2005, 14 pgs.
Non-Final Office Action for U.S. Appl. No. 10/350,810, filed Jan. 24,2003, and mailed from the USPTO dated Sep. 22, 2004, 10 pgs.
Non-Final Office Action for U.S. Appl. No. 10/351,465, filed Jan. 24, 2003, and mailed from the USPTO dated Jul. 27, 2004, 9 pgs.
Non-final Office Action for U.S. Appl. No. 10/351,606, filed Jan. 24, 2003 and mailed from the USPTO dated Dec. 19, 2005, 7 pgs.
Non-final Office Action for U.S. Appl. No. 10/351,606, filed Jan. 24, 2003 and mailed from the USPTO dated May 17, 2004, 5 pgs.
Non-Final Office Action for U.S. Appl. No. 10/665,899, filed Sep. 18, 2003, and mailed from the USPTO dated Aug. 30, 2010, 23 pgs.
Non-Final Office Action for U.S. Appl. No. 10/665,899, filed Sep. 18, 2003, and mailed from the USPTO dated Nov. 13, 2008, 11 pgs.
Non-Final Office Action for U.S. Appl. No. 10/665,899, filed Sep. 18, 2003, and mailed from the USPTO dated Sep. 14, 2009, 14 pgs.
Non-Final Office Action for U.S. Appl. No. 10/665,899, filed Sep. 18, 2003, and mailed from the USPTO dated Sep. 17, 2007, 11 pgs.
Non-Final Office Action for U.S. Appl. No. 11/149,909, filed Jun. 10, 2005, and mailed from the USPTO dated May 13, 2008, 14 pgs.
Non-Final Office Action for U.S. Appl. No. 11/149,909, filed Jun. 10, 2005, and mailed from the USPTO dated May 6, 2009, 6 pgs.
Non-Final Office Action for U.S. Appl. No. 11/414,939, filed May 1, 2006, and mailed from the USPTO dated Jul. 19, 2010, 7 pgs.
Non-Final Office Action for U.S. Appl. No. 11/414,939, filed May 1, 2006, and mailed from the USPTO dated Mar. 9, 2010, 11 pgs.
Non-Final Office Action for U.S. Appl. No. 11/442,821, filed May 30, 2006, and mailed from the USPTO dated Jun. 1, 2011, 23 pgs.
Non-Final Office Action for U.S. Appl. No. 11/442,821, filed May 30, 2006, and mailed from the USPTO dated Nov. 12, 2009, 19 pgs.
Non-Final Office Action for U.S. Appl. No. 11/442,821, filed May 30, 2006, and mailed from the USPTO dated Sep. 3, 2008, 14 pgs.
Non-Final Office Action for U.S. Appl. No. 11/446,011, filed Jun. 2, 2006, and mailed from the USPTO dated Mar. 1, 2011, 15 pgs.
Non-Final Office Action for U.S. Appl. No. 11/446,011, filed Jun. 2, 2006, and mailed from the USPTO dated Nov. 27, 2009, 14 pgs.
Non-Final Office Action for U.S. Appl. No. 11/524,602, filed Sep. 21, 2006, and mailed from the USPTO dated Dec. 11, 2009, 20 pgs.
Non-Final Office Action for U.S. Appl. No. 11/524,602, filed Sep. 21, 2006, and mailed from the USPTO dated Nov. 14, 2011, 19 pgs.
Non-Final Office Action for U.S. Appl. No. 11/525,009, filed Sep. 21, 2006, and mailed from the USPTO dated Aug. 10, 2011, 18 pgs.
Non-Final Office Action for U.S. Appl. No. 11/525,009, filed Sep. 21, 2006, and mailed from the USPTO dated Dec. 16, 2009, 20 pgs.
Non-Final Office Action for U.S. Appl. No. 12/243,852, filed Oct. 1, 2008, and mailed from the USPTO dated Jan. 16, 2013, 5 pgs.
Non-Final Office Action for U.S. Appl. No. 12/243,852, filed Oct. 1, 2008, and mailed from the USPTO dated Mar. 17, 2011, 8 pgs.
Non-Final Office Action for U.S. Appl. No. 12/243,855, filed Oct. 1, 2008, and mailed from the USPTO dated Oct. 14, 2010, 6 pgs
Non-Final Office Action for U.S. Appl. No. 12/243,861, filed Oct. 1, 2008, and mailed from the USPTO dated Nov. 8, 2010, 8 pgs.
Non-Final Office Action for U.S. Appl. No. 13/025,019, filed Feb. 10, 2011, and mailed from the USPTO dated Apr. 22, 2016, 16 pgs.
Non-Final Office Action for U.S. Appl. No. 13/025,019, filed Feb. 10, 2011, and mailed from the USPTO dated Apr. 5, 2013, 15 pgs.
Non-Final Office Action for U.S. Appl. No. 13/025,019, filed Feb. 10, 2011, and mailed from the USPTO dated Oct. 6, 2017, 17 pgs.
Non-Final Office Action for U.S. Appl. No. 13/025,019, filed Feb. 10, 2011, and mailed from the USPTO dated Sep. 18, 2014, 15 pgs.
Non-Final Office Action for U.S. Appl. No. 15/134,820, filed Apr. 21, 2016, and mailed from the USPTO dated Feb. 23, 2018.
Non-Final Office Action for U.S. Appl. No. 15/602,999, filed May 23, 2017, and mailed from the USPTO dated May 3, 2018.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 10/350,795, filed Jan. 24, 2003, and mailed from the USPTO dated May 7, 2012, 15 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 10/350,796, filed Jan. 24, 2003 and mailed from the USPTO dated Feb. 1, 2006, 5 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 10/350,810, filed Jan. 24, 2003, and mailed from the USPTO dated Apr. 14, 2008, 6 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 10/351,465, filed Jan. 24, 2003, and mailed from the USPTO dated Sep. 21, 2005, 4 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 10/351,606, filed Jan. 24, 2003, and mailed from the USPTO dated Apr. 4, 2006, 12 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 11/149,909, filed Jun. 10, 2005, and mailed from the USPTO dated Sep. 16, 2009, 7 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 11/414,939, filed May 1, 2006, and mailed from the USPTO dated Nov. 2, 2010, pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 11/442,821, filed May 30, 2006, and mailed from the USPTO dated Jul. 30, 2012, 6 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 11/446,011, filed Jun. 2, 2006, and mailed from the USPTO dated Aug. 9, 2011, 10 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 11/524,602, filed Sep. 21, 2006, and mailed from the USPTO dated Aug. 6, 2013, 22 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 11/525,009, filed Sep. 21, 2006, and mailed from the USPTO dated Jul. 23, 2012, 19 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 12/243,852, filed Oct. 1, 2008, and mailed from the USPTO dated Feb. 27, 2013, 6 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 12/243,855, filed Oct. 1, 2008, and mailed from the USPTO dated Nov. 22, 2010, 8 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 12/243,855, filed Oct. 1, 2008, and mailed from the USPTO dated Oct. 28, 2010, 5 pgs.
Notice of Allowance and Fee(s) Due for U.S. Appl. No. 12/243,861, filed Oct. 1, 2008, and mailed from the USPTO dated Sep. 6, 2011, 10 pgs.
Notice of Non-compliant Amendment dated Dec. 12, 2006 in U.S. Appl. No. 10/350,810.
Permissions in the Java™ 2 SDK, printed Mar. 6, 2010, 45 pgs.
Restriction Requirement for U.S. Appl. No. 12/243,852, filed Oct. 1, 2008, and mailed from the USPTO dated Dec. 7, 2010.
Strebe, Matthew et al. MCSE: NT Server 4 Study Guide, Third Edition. 2000, SYBEX Inc. Front matter, pp. 284-293, and 308-347 are included. Entire book cited, 36 pgs.
Supplemental Notice of Allowability for U.S. Appl. No. 12/243,852, filed Oct. 1, 2008, and mailed from the USPTO dated Mar. 19, 2013, 3 pgs.
Trademark Electronic Search System record for U.S. Appl. No. 76375405, Word Mark “NITRA”.
Lee, Adam J. et al., “Searching for Open Windows and Unlocked Doors: Port Scanning in Large-Scale Commodity Clusters,” Cluster Computing and the Grid, 2005. CCGrid 2005. IEEE International Symposium on vol. 1; Publication Year: 2005 pp. 146-151 vol. 1.
Advisory Action for U.S. Appl. No. 15/602,999, filed May 23, 2017, and mailed from the USPTO dated Jan. 31, 2019, 3 pgs.
Non-Final Office Action for U.S. Appl. No. 15/134,779, filed Apr. 21, 2016, and mailed from the USPTO dated Jan. 30, 2019, 26 pgs.
Non-Final Office Action received in U.S. Appl. No. 15/134,793, filed Apr. 21, 2016, mailed by United States Patent and Trademark Office dated Jan. 30, 2019, 26 pgs.
“An Appointment with Destiny—The Time for Web-Enabled Scheduling has Arrived”, Link Fall, 2007, 2 pages.
“How a Solution found a Problem of Scheduling Service Appointments”, Automotive News, 2016, 4 pages.
“Service Advisor”, Automotive Dealership Institute, 2007, 26 pages.
“XTime.com Web Pages”, Jan. 8, 2015, 1 page.
“XTimes Newsletter”, vol. 7, 2013, 4 pages.
U.S. Appl. No. 15/134,820, Notice of Allowance, dated Jan. 28, 2019, 7 pages.
Croswell, “Service Shop Optimiztion”, Modern Tire Retailer, May 21, 2013, 7 pages.
Emmanuel, “Basics to Creating an Appointment System for Automotive Service Customers”, Automotiveservicemanagement.com, 2006, 9 pages.
“Openbay Announces First-of-its-Kind Connected Car Repair Service”, openbay.com, Mar. 31, 2015, 14 pages.
U.S. Appl. No. 13/025,019 , Notice of Allowance, dated Sep. 26, 2019, 9 pages.
U.S. Appl. No. 15/134,779 , Final Office Action, dated Feb. 27, 2020, 18 pages.
U.S. Appl. No. 15/134,779 , Advisory Action, dated Jul. 29, 2019, 6 pages.
U.S. Appl. No. 15/134,779 , Final Office Action, dated May 17, 2019, 25 pages.
U.S. Appl. No. 15/134,779 , Non-Final Office Action, dated Nov. 19, 2019, 27 pages.
U.S. Appl. No. 15/134,793 , Advisory Action, dated Jul. 29, 2019, 6 pages.
U.S. Appl. No. 15/134,793 , Final Office Action, dated Mar. 27, 2020, 22 pages.
U.S. Appl. No. 15/134,793 , Final Office Action, dated May 13, 2019, 26 pages.
U.S. Appl. No. 15/134,793 , Non-Final Office Action, dated Nov. 19, 2019, 31 pages.
U.S. Appl. No. 15/478,042 , Final Office Action, dated Mar. 19, 2020, 35 pages.
U.S. Appl. No. 15/478,042 , Non-Final Office Action, dated Oct. 10, 2019, 26 pages.
U.S. Appl. No. 15/478,048 , Final Office Action, dated Apr. 9, 2020, 42 pages.
U.S. Appl. No. 15/478,048 , Non-Final Office Action, dated Sep. 30, 2019, 30 pages.
U.S. Appl. No. 15/602,999 , Notice of Allowance, dated Apr. 18, 2019, 6 pages.
U.S. Appl. No. 16/041,552 , Non-Final Office Action, dated Dec. 27, 2019, 13 pages.
U.S. Appl. No. 16/041,552 , Final Office Action, dated May 29, 2020, 18 pages.
Chatterjee, Pallab , et al., “On-board diagnostics not just for racing anymore”, EDN.com, May 6, 2013, 7 pages.
Drawbaugh, Ben , “Automatic Link Review: an expensive way to learn better driving habits”, Endgadget.com, Nov. 26, 2013, 14 pages.
Jenkins, Will , “Real-time vehicle performance monitoring with data intergrity”, A Thesis Submitted to the Faculty of Mississippi State University, Oct. 2006, 57 pages.
Lavrinc, Damon , “First Android-powered infotainment system coming to 2012 Saab 9-3”, Autoblog.com, Mar. 2, 2011, 8 pages.
Needham, Charlie , “Google Now Taking Appointments for Auto Repair Shops”, Autoshopsolutions.com, Aug. 25, 2015, 6 pages.
openbay.com Web Pages , Openbay.com, retrieved from archive.org May 14, 2019, Apr. 2015, 6 pages.
openbay.com Web Pages , Openbay.com, retrieved from archive.org on May 14, 2019, Feb. 2014, 2 pages.
openbay.com Web Pages , Openbay.com, retrieved from archive.org, May 14, 2019, Mar. 2015, 11 pages.
Phelan, Mark , “Smart phone app aims to automate car repairs”, Detroit Free Press Auto Critic, Mar. 31, 2015, 2 pages.
Pubnub Staff , “Streaming Vehicle Data in Realtime with Automatic (Pt 1)”, Pubnub.com, Aug. 17, 2015, 13 pages.
Warren, Tamara , “This Device Determines What Ails Your Car and Finds a Repair Shop—Automatically”, CarAndDriver.com, Apr. 8, 2015, 7 pages.
You, Song , et al., “Overview of Remote Diagnosis and Maintenance for Automotive Systems”, 2005 SAE World Congress, Apr. 11-14, 2015, 10 pages.
U.S. Appl. No. 15/478,048, et al., Non-Final Office Action ,dated Mar. 8, 2021 ,69 pages.
U.S. Appl. No. 15/478,042 , Non-Final Office Action, dated Aug. 4, 2020, 42 pages.
U.S. Appl. No. 15/134,793 , Notice of Allowance, dated Nov. 2, 2020, 13 pages.
U.S. Appl. No. 15/134,779 , Notice of Allowance, dated Sep. 9, 2020, 12 pages.
U.S. Appl. No. 16/041,552 , Non-Final Office Action, dated Sep. 17, 2020, 16 pages.
U.S. Appl. No. 15/478,042, et al., Final Office Action, dated May 5, 2021, 38 pages.
U.S. Appl. No. 16/041,552, et al., Final Office Action, dated Apr. 27, 2021, 23 pages.
U.S. Appl. No. 16/951,833, et al., Non-Final Office Action, dated Feb. 4, 2021, 10 pages.
Clemens Grelck, et al.,“A Multithread Compiler Backend for High-Level Array Programming”, 2003.
Open Bank Project, et al., https://www.openbankproject.com/, retrieved Nov. 23, 2020, 10 pages.
Standards for Technology in Auto, et al., https://www.starstandard.org/, retrieved Nov. 23, 2020, 4 pages.
Related Publications (1)
Number Date Country
20140278805 A1 Sep 2014 US
Provisional Applications (1)
Number Date Country
61798025 Mar 2013 US