System, method, and program product for recognizing and rejecting fraudulent purchase attempts in e-commerce

Information

  • Patent Grant
  • 11928685
  • Patent Number
    11,928,685
  • Date Filed
    Monday, December 20, 2021
    2 years ago
  • Date Issued
    Tuesday, March 12, 2024
    2 months ago
  • Inventors
    • Patel; Ashish A (Riverton, UT, US)
    • Chadda; Rahul (Midvale, UT, US)
    • Akella; Suresh Kumar (Midvale, UT, US)
  • Original Assignees
  • Examiners
    • Rosen; Nicholas D
    Agents
    • Clayton Howarth, P.C.
Abstract
This disclosure relates generally to a system and method for using a machine-learning system to more accurately detect fraudulent use of credit cards on an e-commerce website and block those attempts.
Description
STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH AND DEVELOPMENT

Not Applicable.


BACKGROUND

This disclosure relates generally to a system, method, and program product, for recognizing attempts to fraudulently verify credit card details and mitigating those attacks without causing unnecessary impacts to existing customers and business.


Big e-commerce companies face attacks every day in many different ways. Having a website that is open to the Internet and accepting payments over the Internet make e-commerce companies a prime target for credit card fraud. One vector of attack is based on credit card verification attacks to guess partial credit card details. This type of fraud comprises using a credit card a number of times on a website, or over multiple websites, to discover through trial-and-error details such as whether a credit card is valid, expiration date, CCV/CVV/CVV2 (card verification value) code, and other details needed to fraudulently use a credit card number, cancelling the order each time, to discover if the credit card is valid and find out specific details such as the expiration date and CCV/CVV/CVV2 number. Many websites limit the number of failed attempts that a single customer could make with a card, however many programs would not detect multiple attempts coming from different customer accounts or different IP addresses. As such, some attackers may distribute their attacks over multiple customer accounts and multiple IP addresses to avoid the software that flags a card used for multiple attempts at guessing the information. These attacks are often carried out using automated programs, so a variety of methods of detecting automated programs have evolved, but these methods can impact the customer experience, and may not prevent all distributed verification attacks. In addition, attack methods are constantly evolving, using different methods to hide a distributed verification attack from the software designed to prevent it.


What is needed is a method to mitigate against distributed credit card verification attacks spread out across different IP addresses using multiple customer accounts, while ensuring that existing regular customer traffic is not impacted. The ideal solution would be implemented by credit card companies and/or at the payment network layer, as only these groups have the ability to see multiple attempts for the same credit card that are distributed over various different web sites. However, solutions for individual companies are needed to help e-commerce companies mitigate the risk of accepting credit cards online and to help prevent distributed verification attacks from using these websites. The instant invention focuses on individual websites, being designed to prevent distributed verification attacks on a single website while ensuring that existing regular customer traffic is not impacted, and also being designed to take into account different factors and improve the outcomes over time.


The features and advantages of the disclosure will be set forth in the description that follows, and in part will be apparent from the description, or may be learned by the practice of the disclosure without undue experimentation. The features and advantages of the disclosure may be realized and obtained by means of the instruments and combinations particularly pointed out herein.


SUMMARY OF THE DISCLOSURE

A purpose of the instant disclosure is to prevent distributed verification attacks on credit cards from using an e-commerce website to obtain details about a credit card, while ensuring that regular customer traffic on the e-commerce website is not impacted. The goal is to prevent malicious users from placing orders, even if those attacks are coming from multiple different IP addresses and multiple customer accounts. Traditional fraud detection systems look at the number of orders per customer account, thus allowing those using multiple accounts to get around them. The system allows an automated method to be put into the website that can correlate IP addresses, customer identifications, and other data points that allows or denies access and employs machine learning protocols to continuously improve the system while not impacting genuine orders from customers.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a chart showing the general system of an e-commerce website with the location of the instant invention as a filtering service.



FIG. 2 is a diagram showing the machine learning feedback process of the fraud detection system.





DETAILED DESCRIPTION

For the purposes of promoting an understanding of the principles in accordance with this disclosure, reference will now be made to illustrative embodiments of the invention. It will nevertheless be understood that no limitation of the scope of the disclosure is thereby intended. Any alterations and further modifications of the inventive features illustrated herein, and any additional applications of the principles of the disclosure as illustrated herein, which would normally occur to one skilled in the relevant art and having possession of this disclosure, are to be considered within the scope of the disclosure claimed.


Before the devices, systems, processes, and methods will be disclosed and described, it is to be understood that this disclosure is not limited to the particular configurations, process steps, and materials disclosed herein, as such configurations, process steps, and materials may vary somewhat. It is also to be understood that the terminology employed herein is used for the purpose of describing particular illustrative embodiments only and is not intended to be limiting since the scope of the disclosure will be limited only by the appended claims and equivalents thereof.


In describing and claiming the subject matter of the disclosure, the following terminology will be used in accordance with the definitions set out below.


It must be noted that, as used in this specification and the appended claims, the singular forms “a”, “an”, and “the” include plural referents unless the context clearly dictates otherwise.


As used herein, the terms “comprising,” “including,” “containing,” “characterized by,” “having” and grammatical equivalents thereof are inclusive or open-ended terms that do not exclude additional, unrecited elements or method steps.


As used herein, a “bot” (short for “robot”) is an automated program that runs over the Internet. As is known in the art, some bots run automatically, while others only execute commands when they receive specific input. See https://techterms.com/definition/bot. As used herein, “artificial intelligence” or “AI” is the ability of a computer to act like a human being and/or a program designed to do so. See https://techterms.com/definition/artificial_intelligence.


The following computer systems and elements refer to systems used in the ideal embodiment of the invention described below. The invention described below is not limited to the use of the specific elements below, but as will be apparent to those skilled in the art, any similar program or platform which is equivalent may be used to effect the invention described. Nevertheless, in the interest of disclosing the preferred embodiment, specific systems will be disclosed.


As used herein, “Amazon RDS” refers to Amazon Relational Database Service, a platform used to set up, operate, and scale a relational database in the cloud. It provides cost-efficient and resizable capacity while automating time-consuming administration tasks such as hardware provisioning, database setup, patching and backups (Amazon Relational Database Service (RDS), 2018).


As used herein, “Redis” refers to an open source (BSD licensed), in-memory data structure store, used as a database, cache and message broker that has built-in replication, Lua scripting, LRU eviction, transactions and different levels of on-disk persistence, and provides high availability and automatic partitioning. (Redis, 2018)


As used herein, “Amazon ElastiCache” refers to Amazon ElastiCache for Redis, a fast, in-memory data store built an open source Redis that provides sub-millisecond latency to power internet-scale real-time applications. (Amazon ElastiCache for Redis, 2018)


As used herein, “Apache Hadoop” refers to the Apache Hadoop software library, a framework that allows for the distributed processing of large data sets across clusters of computers using simple programming models (Apache Hadoop, 2018).


As used herein, “Apache Kafka” refers to a distributed streaming platform used for building realtime streaming data pipelines that reliably get data between systems or applications and transform or react to the streams of data (Apache Kafka, 2018).


As used herein “storm cluster” refers to a cluster created using Apache Storm.


A system, method, and program product for detecting and preventing distributed verification attacks from using an e-commerce website is presented. The system prevents malicious users from placing orders on the website while allowing normal customer traffic to be unaffected. The system improves upon existing systems by detecting and preventing malicious users from using the website even when those malicious users utilize several different IP addresses and spread their use across several different customer accounts. It does this by creating an automated system that is built into an e-commerce website that correlates orders by IP address, customer ID, and other data points to allow or deny an order made on an e-commerce website. The method described is used to implement the solution in any number of websites that allow a customer to make a purchase via credit card.


One illustrative embodiment of the current invention creates an application designed to include detection of credit card verification attacks even though they may be coming in from a distributed range of IP addresses and are spread out over multiple customer accounts for an e-commerce website; identify patterns of attacks to be able to track new attempts as the attackers evolve their tactics in response to the mitigation strategies the company implements; not impact existing customer traffic; build out logic in the software application (website) to ensure only malicious users are blocked and genuine traffic is allowed without any issues; and monitor and tune the application logic over time to evolve with the changing tactics of those attempting fraud.


A system for preventing distributed verification attacks comprises a non-transitory computer readable medium containing instructions that can be integrated into an existing e-commerce website. The system may comprise a series of instructions in a non-transitory computer-readable medium. The set of instructions contained in the computer readable medium require any request to purchase from the website to be verified as not fraudulent. The instructions to complete this verification process may be stored in a computer readable medium in the form of an independent, named application, which is stored in the computer readable medium and which is run any time a user attempts to check out. In one embodiment this named fraud filtering application is called FraudFilteringService. In one embodiment this application may generate either a “blocked” or “not-blocked” response whenever it is called in response to an attempt to make a purchase. The system only allows an attempt to make a purchase if a “not-blocked” response is generated, showing that the purchaser is verified.


The independent application, FraudFilteringService, determines whether the request to make a purchase is blocked or not by using certain logic and criteria to determine whether a check-out request is likely to be fraudulent and therefore should be blocked. The logic the application uses to make this determination may include a number of factors, each of which may have a different weight. For example, this logic can include a determination based on Customer account ID, IP address, transaction amount, shipping address, products in carts, browser user agent, browser language settings, HTTP referrer, the total time spent on the website, the Frequency of the visit, the Ratio of successful orders to attempts, or the number of pages visited on the website before checkout. These factors can have different weights assigned to them and can be updated and modified through a machine learning program.


As seen in FIG. 1, the request to purchase originates in the customer's browser 101 and is sent from the customer's browser to the website 102 in part and in part is through the API-Gateway 103 of the system. In one embodiment, customer traffic is directed to an e-commerce website and is rendered by the website application 102. Subsequent calls to the website can be handled by the API-Gateway application 103, which routes requests to the required back end API interface. For example, the first request to load the checkout page goes to the website 102. However, once the page is loaded, subsequent calls, such as filling in a billing or shipping address go to the API-Gateway app 103 to be routed to the proper API interface (such as the Shipping API interface, or the AddressAPI interface) (not shown). Users of the website (whether legitimate customers or attackers), however, access only the API-Gateway application 103 and the website application 102. These are the points in the system that are connected to the filtering service 104. In addition to the filtering service 104, a cache 105 and database 106 are established.


In one illustrative embodiment the filtering service 104 takes the form of an application called “FraudFilteringService.” This application is created as a RESTful webservice to check the validity of requests coming in from the e-commerce website and the API gateway for checkout. The business logic for the accepting or rejecting the checkout request resides in this application. The filtering service evaluates if the incoming request should be blocked or not based on the data points coming in, the current business logic, and the data written previously by this application in the database. To cut down the number of calls to the database and make the solution performant, short-term caching mechanisms are implemented. This ensures that the requests are near-real-time while making sure the solution is performant.


In one illustrative embodiment, a new programming cluster is created based on Apache Kafka or a similar program to ingest the checkout requests from the website and API-Gateway, and also the final fraud decision taken for the respective checkout request. This information is stored and used in later machine-learning systems to improve the quality of the system.


In one embodiment, when a user wants to complete a purchase on an e-commerce website, the instructions in the computer readable media cause a request to be sent to the Filtering Service 104. This service sends a request to a memory data structure cache 105, which has a time to live of 2 minutes, for example. If data are not found in the cache 105, a further call is made to the database 106, and the data are then stored in the cache 105 for two minutes, for example. The cache 105 is established using a fast, in-memory data store that can provide sub-millisecond latency able to power Internet-scale real-time applications, such as Amazon ElastiCache or similar systems. The database 106 is set up as a relational database in the cloud, which can be done using Amazon RDS or a similar program.


The filtering service incorporates logic for preventing access to the website by users deemed to be performing distributed verification attacks. The system can incorporate a number of relevant criteria when analyzing a request. Some of the criteria that can help the system determine whether a distributed verification attack is taking place include the number of previous attempts to check out, the customer account ID that is checking out, the IP address from which the check out takes place, transaction amount, shipping address, what products are in the carts, the browser user agent, the browser language settings, the HTTP referrer, the total time spent on the website, the frequency of the visits to the website, the ratio of successful orders to attempts, and the number of pages visited before checkout on the website. These are examples; additional factors could be imagined that might be useful, such as credit card number or other factors. The filtering service analyzes the factors, as noted below, and then responds to the request with a “blocked” or “not-blocked” response based on the logic and the various factors that are indicative of possible fraud.


In one embodiment of the invention, when the filtering service determines that a request should be blocked, it may respond with an HTTP code 400 response (Bad Request). Another embodiment allows the filtering service to respond with an HTTP code 503 response (Internal Server Error).


Each of the relevant criteria may be given a different weight by the filtering service 104, or even no weight at all. For example, in one embodiment of the system, the system may consider only the number of previous attempts to check out, based on either the customer or the credit card number. However, another embodiment might incorporate the customer account ID and the IP address from which the purchase takes place, with appropriate weight given to each factor. The system may also incorporate machine learning processes to change the weight of each factor. As such, it will be understood that in a particular system, the specific weight given to each factor may vary with both time and with the specific website using the program. This enables the program to better respond to fraud and tailor the approach to the specific needs of the particular website on which it is being used.



FIG. 2 shows an embodiment of the system in an e-commerce environment, including a machine-learning program that adjusts the weight of each factor to determine whether to block a particular request. In this embodiment, a check-out request is made by a customer, which goes through the website and the website's API gateway 201 and 202. At the time of the request, the system calls a Checkout Action Aggregator service 203. This service is responsible for fetching aggregated data in context to the existing checkout request by referring to the available historical data stored in the database 204. The data collected are used to enrich the request data.


At the same time, the Fraud filtering service is called 205, which obtains necessary features from a Feature Store 206 for machine learning and a predicted probability score for checkout is obtained using a Model Store 207. The Fraud filtering service 205 then uses the information to create a response from the request parameters, features used, and the allowed or blocked decision, which is stored in fraud-decision-topic 209. In one illustrative embodiment the filtering service publishes the exact request parameters, features used, and response provided to fraud-decision-topic. In one embodiment, fraud-decision-topic is a Kafka topic created using Apache Kafka or similar system. Meanwhile, request logs from Website/API-gateway are channeled through the checkout requests 208 and create a log entry 210 on another Kafka topic, checkout-request-topic, which obtains request logs from the website and API gateway 201 and 202. This log entry 210 on checkout-request-topic is correlated with a log entry on fraud-decision-topic 211 using a unique UUID (universally unique identifier) generated for every request 212. Joining the logs gives the entire context of the checkout request, as well as the features used and decision taken for the checkout request.


The logs are then cleaned for invalid data, imputed for missing data, and normalized where needed. This is done using a framework that can perform fast distributed computing and allows programs to load data and query the data repeatedly, such as Apache Spark or a similar platform. These data can be used for training a machine learning model, which can be evaluated to ensure that it is performing accurately. When the model is above a threshold accuracy, it is stored in object storage and is used in the Model Store 207 for future predictions and decisions, and is then further refined by the continuing process.


In one embodiment, access logs from the website and API-Gateway are channeled through an Apache Kafka cluster are sent to a Storm cluster and the output is fed back to the Filtering Service and written to the database. This information is leveraged for all subsequent attempts and this will be the basis for the initial Machine Learning algorithm. Based on how the malicious traffic changes, the logic in the Storm cluster will be updated. A whitefish section can be provided to whitefish any customer ID in case they are wrongfully blocked.


In addition to recording and analyzing traffic patterns over time, as well as recording blocks by the fraud filtering service, the system uses machine learning logic to update and refine the fraud filtering service. In addition to the blocks made, manual corrections for given situations can be included in the machine learning process. For example, another point in the service creates a “whitefish” in the fraud filtering service to allow access by any customers who are wrongfully blocked and allows those users to make purchases on the website. The machine-learning elements of the system can be used to update and refine the systems for blocking distributed verification attacks as attackers incorporate different methods to conceal distributed verification attacks from detection software. The whitefish can be added to manually when it is determined that an order was blocked by mistake and can be used in the machine-learning process to train the system and to improve the accuracy of the filtering service 205.


In one illustrative embodiment, machine learning applications ensure that traffic patterns are recorded and analyzed over time to make the FraudFilteringService more accurate. In addition, the Checkout Action Aggregator service is responsible for fetching the aggregated data in context to the existing checkout request by referring to the available historical data.


In one illustrative embodiment, the system is implemented using AWS-EC2 cloud service and the following resources on the AWS cloud:

    • EBS Volumes for Customer Data: 4 SSD volumes with storage of 300 GB per volume, operating at 900 IOPS and having baseline throughput of 160 MBs/sec.
    • Application Servers: 2 instances running Linux on m5d.2xlarge
    • Web Servers: 2 instances running Linux on m5d.2xlarge
    • Database Servers: 2 instances running Linux on m5d.2xlarge


      In this embodiment, each of the above m5d.2xlarge servers will have the following configuration: 8 vCPUs, 32 GiB Memory, 1×300 NVMe SSD drive with an I/O of up to 10 Gbps. In one illustrative embodiment, the setup includes 10 Elastic IPs per month and will have incoming data transfer limit of 20 GB/week coming in and outgoing data transfer limit of 20 GB/month. The data are backed up and stored to help with future machine learning projects.


In one illustrative embodiment, the e-commerce website and the API-Gateway run on Java. In this embodiment, the FraudFilteringService program also runs on Java and connects to the machine learning components. The preferred embodiment uses Amazon RDS as the backend relational database to store all the data from the various transactions. The cache is implemented using Amazon ElastiCache for Redis instance. The Cache may have a time to live of 2 minutes, for example, to cut down on the database calls. This time to live may be adjusted upward or downward as may be better suited for the operation of the system in a certain environment. For example, a cache with a time to live of 5 minutes, 4 minutes, 3 minutes, or one minute, or another selected time, may be instituted. Or a cache with longer or shorter term time to live may be instituted. The cache ensures that the application remains performant even when a new call is introduced for each checkout request from the e-commerce website.

Claims
  • 1. A system for detecting and preventing distributed verification attacks on an e-commerce website having an API gateway for checkout, comprising: an e-commerce computer configured for connecting to a purchaser computer through the Internet;a non-transitory computer readable medium containing a series of fraud-detection instructions that cause a website to: run a fraud detection webservice checking the validity of requests coming in from the e-commerce website and the API gateway;wherein for each request coming in from the e-commerce website and the API gateway, the fraud detection webservice compares data about the user to a series of factors relevant to whether the purchase attempt is fraudulent and records the factors used to determine whether an attempt is fraudulent;a server connected to the Internet, wherein the server contains programming directing the system to execute the fraud-detection instructions each time a user attempts to make a purchase; andat least one machine learning algorithm for training the fraud detection system and adjusting the factors used to determine whether a distributed verification attack is taking place.
  • 2. The system of claim 1 wherein the factors used to determine whether a purchase attempt is fraudulent include information on a number of previous attempts made.
  • 3. The system of claim 1 wherein the factors used to determine whether a purchase attempt is fraudulent include a Customer account ID.
  • 4. The system of claim 1 wherein the factors used to determine whether a purchase attempt is fraudulent include an IP address.
  • 5. The system of claim 1 wherein the factors used to determine whether a purchase attempt is fraudulent include an amount of the transaction.
  • 6. The system of claim 1 wherein the factors used to determine whether a purchase attempt is fraudulent include a shipping address.
  • 7. The system of claim 1 wherein the factors used to determine whether a purchase attempt is fraudulent include products in carts.
  • 8. The system of claim 1 wherein the factors used to determine whether a purchase attempt is fraudulent include a Browser user agent.
  • 9. The system of claim 1 wherein the factors used to determine whether a purchase attempt is fraudulent include Browser language settings.
  • 10. The system of claim 1 wherein the factors used to determine whether a purchase attempt is fraudulent include an HTTP referrer.
  • 11. The system of claim 1 wherein the factors used to determine whether a purchase attempt is fraudulent include total time spent on the website.
  • 12. The system of claim 1 wherein the factors used to determine whether a purchase attempt is fraudulent include frequency of visits to the website.
  • 13. The system of claim 1 wherein the factors used to determine whether a purchase attempt is fraudulent include a ratio of successful orders to attempted orders.
  • 14. The system of claim 1 wherein the factors used to determine whether a purchase attempt is fraudulent include a number of pages visited by the user before checkout.
  • 15. The system of claim 1 also comprising a Checkout Action Aggregator that obtains data in context to an existing checkout request by referring to available historical data.
  • 16. A method of detecting and preventing distributed verification attacks on an e-commerce website comprising a fraud filtering program, comprising: storing available historical data about customers and their purchases in a historical database;comparing data stored in the historical database about a user attempting to complete a purchase on a website to a series of factors relevant to whether the purchase attempt is fraudulent;using the data stored and the factors relevant to whether the purchase attempt is fraudulent to determine whether the purchase attempt is fraudulent;recording the factors used to determine whether an attempt is fraudulent;causing the website to execute the fraud filtering program each time a user attempts to make a purchase;preventing the purchase from being completed if the attempt is deemed to be fraudulent;sending the information on the factors used to determine whether an attempt is fraudulent to at least one machine learning algorithm to train the fraud filtering program and adjust the weights of factors used to determine whether an attempt is fraudulent;using the recorded factors to train a system through machine-learning to better stop fraudulent attempts to use credit cards; andincorporating the newly trained system into the fraud filtering program and adjusting the weight of the factors to determine whether an attempt is fraudulent in consequence of a distributed verification attack taking place.
  • 17. The method of claim 16 wherein the factors used to determine whether a purchase attempt is fraudulent include information on a number of previous attempts made.
  • 18. The method of claim 16 wherein the factors used to determine whether a purchase attempt is fraudulent include a Customer account ID.
  • 19. The method of claim 16 wherein the factors used to determine whether a purchase attempt is fraudulent include an IP address.
  • 20. The method of claim 16 wherein the factors used to determine whether a purchase attempt is fraudulent include an amount of the transaction, a shipping address, products in carts, a Browser user agent, Browser language settings, an HTTP referrer, total time spent on the website, frequency of visits to the website, a ratio of successful orders to attempted orders, or the number of pages visited by the user before checkout.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No. 16/859,302, filed Apr. 27, 2020, now U.S. Pat. No. 11,205,179, which claims the benefit of U.S. Provisional Application No. 62/838,989, filed Apr. 26, 2019, both of which are hereby incorporated by reference herein in their entireties, including but not limited to those portions that specifically appear hereinafter, the incorporation by reference being made with the following exception: In the event that any portion of the above-referenced applications is inconsistent with this application, this application supersedes said above-referenced application.

US Referenced Citations (677)
Number Name Date Kind
3573747 Adams et al. Apr 1971 A
3581072 Nymeyer May 1971 A
4412287 Braddock, III Oct 1983 A
4674044 Kalmus et al. Jun 1987 A
4677552 Sibley, Jr. Jun 1987 A
4789928 Fujisaki Dec 1988 A
4799156 Shavit et al. Jan 1989 A
4808987 Takeda et al. Feb 1989 A
4823265 Nelson Apr 1989 A
4854516 Yamada Aug 1989 A
4903201 Wagner Feb 1990 A
RE33316 Katsuta et al. Aug 1990 E
5027110 Chang et al. Jun 1991 A
5053956 Donald et al. Oct 1991 A
5063507 Lindsey et al. Nov 1991 A
5077665 Silverman et al. Dec 1991 A
5101353 Lupien et al. Mar 1992 A
5136501 Silverman et al. Aug 1992 A
5168446 Wiseman Dec 1992 A
5205200 Wright Apr 1993 A
5243515 Lee Sep 1993 A
5258908 Hartheimer et al. Nov 1993 A
5280422 Moe et al. Jan 1994 A
5297031 Gutterman et al. Mar 1994 A
5297032 Trojan et al. Mar 1994 A
5301350 Rogan et al. Apr 1994 A
5305200 Hartheimer et al. Apr 1994 A
5325297 Bird et al. Jun 1994 A
5329589 Fraser et al. Jul 1994 A
5347632 Filepp et al. Sep 1994 A
5375055 Togher et al. Dec 1994 A
5377354 Scannell et al. Dec 1994 A
5394324 Clearwater Feb 1995 A
5407433 Loomas Apr 1995 A
5411483 Loomas et al. May 1995 A
5426281 Abecassis Jun 1995 A
5485510 Colbert Jan 1996 A
5493677 Balogh et al. Feb 1996 A
5553145 Micali Sep 1996 A
5557728 Garrett et al. Sep 1996 A
5579471 Barber et al. Nov 1996 A
5596994 Bro Jan 1997 A
5598557 Doner et al. Jan 1997 A
5621790 Grossman et al. Apr 1997 A
5640569 Miller et al. Jun 1997 A
5657389 Houvener Aug 1997 A
5664111 Nahan et al. Sep 1997 A
5664115 Fraser Sep 1997 A
5689652 Lupien et al. Nov 1997 A
5694546 Reisman Dec 1997 A
5706457 Dwyer et al. Jan 1998 A
5710889 Clark et al. Jan 1998 A
5715314 Payne et al. Feb 1998 A
5715402 Popolo Feb 1998 A
5717989 Tozzoli et al. Feb 1998 A
5721908 Lagarde et al. Feb 1998 A
5722418 Bro Mar 1998 A
5727165 Ordish et al. Mar 1998 A
5737599 Rowe et al. Apr 1998 A
5760917 Sheridan Jun 1998 A
5761496 Hattori Jun 1998 A
5761655 Hoffman Jun 1998 A
5761662 Dasan Jun 1998 A
5771291 Newton et al. Jun 1998 A
5771380 Tanaka et al. Jun 1998 A
5778367 Wesinger, Jr. et al. Jul 1998 A
5790790 Smith et al. Aug 1998 A
5794216 Brown Aug 1998 A
5794219 Brown Aug 1998 A
5796395 de Hond Aug 1998 A
5799285 Klingman Aug 1998 A
5803500 Mossberg Sep 1998 A
5818914 Fujisaki Oct 1998 A
5826244 Huberman Oct 1998 A
5835896 Fisher et al. Nov 1998 A
5845265 Woolston Dec 1998 A
5845266 Lupien et al. Dec 1998 A
5850442 Muftic Dec 1998 A
5870754 Dimitrova et al. Feb 1999 A
5872848 Romney et al. Feb 1999 A
5873069 Reuhl et al. Feb 1999 A
5873080 Coden et al. Feb 1999 A
5884056 Steele Mar 1999 A
5890138 Godin et al. Mar 1999 A
5890175 Wong et al. Mar 1999 A
5905975 Ausubel May 1999 A
5907547 Foladare May 1999 A
5913215 Rubinstein et al. Jun 1999 A
5922074 Richard et al. Jul 1999 A
5924072 Havens Jul 1999 A
5926794 Fethe Jul 1999 A
5948040 DeLorme et al. Sep 1999 A
5948061 Merriman et al. Sep 1999 A
5956640 Eaton et al. Sep 1999 A
5970490 Morgenstern Oct 1999 A
5974396 Anderson et al. Oct 1999 A
5974412 Hazlehurst et al. Oct 1999 A
5986662 Argiro et al. Nov 1999 A
5987446 Corey et al. Nov 1999 A
5991739 Cupps et al. Nov 1999 A
5999915 Nahan et al. Dec 1999 A
6012053 Pant et al. Jan 2000 A
6029141 Bezos et al. Feb 2000 A
6035288 Solomon Mar 2000 A
6035402 Vaeth et al. Mar 2000 A
6044363 Mori et al. Mar 2000 A
6045447 Yoshizawa et al. Apr 2000 A
6047264 Fisher et al. Apr 2000 A
6049797 Guha et al. Apr 2000 A
6055518 Franklin et al. Apr 2000 A
6058379 Odom et al. May 2000 A
6058417 Hess et al. May 2000 A
6058428 Wang et al. May 2000 A
6061448 Smith et al. May 2000 A
6065041 Lum et al. May 2000 A
6070125 Murphy et al. May 2000 A
6073117 Oyanagi et al. Jun 2000 A
6078914 Redfern Jun 2000 A
6085176 Woolston Jul 2000 A
6104815 Alcorn et al. Aug 2000 A
6119137 Smith et al. Sep 2000 A
6128649 Smith et al. Oct 2000 A
6141010 Hoyle Oct 2000 A
6167382 Sparks Dec 2000 A
6178408 Copple et al. Jan 2001 B1
6185558 Bowman et al. Feb 2001 B1
6192407 Smith et al. Feb 2001 B1
6199077 Inala et al. Mar 2001 B1
6202051 Woolston Mar 2001 B1
6202061 Khosla et al. Mar 2001 B1
6226412 Schwab May 2001 B1
6243691 Fisher et al. Jun 2001 B1
6269238 Iggulden Jul 2001 B1
6271840 Finseth et al. Aug 2001 B1
6275820 Navin-Chandra et al. Aug 2001 B1
6275829 Angiulo et al. Aug 2001 B1
6356879 Aggarwal et al. Mar 2002 B2
6356905 Gershman et al. Mar 2002 B1
6356908 Brown et al. Mar 2002 B1
6366899 Kernz Apr 2002 B1
6370527 Singhal Apr 2002 B1
6373933 Sarkki et al. Apr 2002 B1
6374260 Hoffert et al. Apr 2002 B1
6381510 Amidhozour et al. Apr 2002 B1
6415270 Rackson et al. Jul 2002 B1
6415320 Hess et al. Jul 2002 B1
6434556 Levin et al. Aug 2002 B1
6452609 Katinsky et al. Sep 2002 B1
6456307 Bates et al. Sep 2002 B1
6460020 Pool et al. Oct 2002 B1
6466917 Goyal et al. Oct 2002 B1
6484149 Jammes et al. Nov 2002 B1
6489968 Ortega et al. Dec 2002 B1
6522955 Colborn Feb 2003 B1
6523037 Monahan et al. Feb 2003 B1
6601061 Holt et al. Jul 2003 B1
6604107 Wang Aug 2003 B1
6625764 Dawson Sep 2003 B1
6643696 Davis et al. Nov 2003 B2
6661431 Stuart et al. Dec 2003 B1
6665838 Brown et al. Dec 2003 B1
6675178 Chinchar et al. Jan 2004 B1
6694436 Audebert Feb 2004 B1
6701310 Sugiura et al. Mar 2004 B1
6718536 Dupaquis Apr 2004 B2
6725268 Jackel et al. Apr 2004 B1
6728704 Mao et al. Apr 2004 B2
6732161 Hess et al. May 2004 B1
6732162 Wood et al. May 2004 B1
6785689 Daniel et al. Aug 2004 B1
6801909 Delgado et al. Oct 2004 B2
6856963 Hurwitz Feb 2005 B1
6889054 Himmel et al. May 2005 B2
6907401 Vittal et al. Jun 2005 B1
6912505 Linden et al. Jun 2005 B2
6925307 Mamdani et al. Aug 2005 B1
6978273 Bonneau et al. Dec 2005 B1
7043450 Velez et al. May 2006 B2
7069242 Sheth et al. Jun 2006 B1
7076453 Jammes et al. Jul 2006 B2
7076504 Handel et al. Jul 2006 B1
7080030 Eglen et al. Jul 2006 B2
7099891 Harris et al. Aug 2006 B2
7100111 McElfresh et al. Aug 2006 B2
7100195 Underwood Aug 2006 B1
7117207 Kerschberg et al. Oct 2006 B1
7127416 Tenorio Oct 2006 B1
7165091 Lunenfeld Jan 2007 B2
7167910 Farnham et al. Jan 2007 B2
7216115 Walters et al. May 2007 B1
7240016 Sturgis et al. Jul 2007 B1
7254547 Beck et al. Aug 2007 B1
7305614 Chen et al. Dec 2007 B2
7318037 Solari Jan 2008 B2
7324966 Scheer Jan 2008 B2
7340249 Moran et al. Mar 2008 B2
7349668 Ilan et al. Mar 2008 B2
7353188 Yim et al. Apr 2008 B2
7366755 Cuomo et al. Apr 2008 B1
7379890 Myr et al. May 2008 B2
7380217 Gvelesiani May 2008 B2
7383320 Silberstein et al. Jun 2008 B1
7401025 Lokitz Jul 2008 B1
7447646 Agarwal et al. Nov 2008 B1
7451476 Banks et al. Nov 2008 B1
7454464 Puthenkulam et al. Nov 2008 B2
7457730 Degnan Nov 2008 B2
7493521 Li et al. Feb 2009 B1
7496525 Mitchell Feb 2009 B1
7496527 Silverstein et al. Feb 2009 B2
7496582 Farnham et al. Feb 2009 B2
7516094 Perskowski Apr 2009 B2
7539696 Greener et al. May 2009 B1
7546625 Kamangar Jun 2009 B1
7552067 Nephew et al. Jun 2009 B2
7565615 Ebert Jul 2009 B2
7606743 Orzell et al. Oct 2009 B2
7610212 Klett et al. Oct 2009 B2
7653573 Hayes, Jr. Jan 2010 B2
7676484 Fagin Mar 2010 B2
7834883 Adams Nov 2010 B2
7904348 Johnson et al. Mar 2011 B2
7904349 Hart et al. Mar 2011 B1
7912748 Rosenberg et al. Mar 2011 B1
7921031 Crysel et al. Apr 2011 B2
7933818 Kumar et al. Apr 2011 B1
7941751 Ebert May 2011 B2
7979340 MacDonald Korth et al. Jul 2011 B2
7983950 De Vita Jul 2011 B2
7983963 Byrne et al. Jul 2011 B2
7991800 Lawrence et al. Aug 2011 B2
8086643 Tenorio Dec 2011 B1
8095523 Brave et al. Jan 2012 B2
8112303 Eglen et al. Feb 2012 B2
8140989 Cohen et al. Mar 2012 B2
8166155 Rachmeler et al. Apr 2012 B1
8204799 Murray et al. Jun 2012 B1
8214264 Kasavin et al. Jul 2012 B2
8214804 Robertson Jul 2012 B2
8260852 Cselle Sep 2012 B1
8265991 Leffert Sep 2012 B1
8312056 Peng et al. Nov 2012 B1
8326662 Byrne et al. Dec 2012 B1
8359245 Ballaro et al. Jan 2013 B1
8370269 MacDonald-Korth et al. Feb 2013 B2
8370435 Bonefas et al. Feb 2013 B1
8386493 Muni et al. Feb 2013 B2
8392356 Stoner et al. Mar 2013 B2
8452691 MacDonald Korth et al. May 2013 B2
8473316 Panzitta et al. Jun 2013 B1
8494912 Fraser et al. Jul 2013 B2
8498906 Zmolek Jul 2013 B2
8545265 Sakamoto et al. Oct 2013 B2
8566170 Joseph et al. Oct 2013 B1
8577740 Murray et al. Nov 2013 B1
8583480 Byrne Nov 2013 B2
8584149 Crucs Nov 2013 B2
8630960 Gross Jan 2014 B2
8676632 Watson et al. Mar 2014 B1
8693494 Fiatal Apr 2014 B2
8719075 MacDonald Korth et al. May 2014 B2
8793650 Hilerio et al. Jul 2014 B2
8817033 Hur et al. Aug 2014 B2
9047341 Pan Jun 2015 B2
9047642 Byrne et al. Jun 2015 B2
9123069 Haynes et al. Sep 2015 B1
9201558 Dingman et al. Dec 2015 B1
9292361 Chitilian et al. Mar 2016 B1
9418365 Groarke et al. Aug 2016 B2
9430114 Dingman et al. Aug 2016 B1
9448692 Mierau et al. Sep 2016 B1
9483788 Martin Nov 2016 B2
9489681 Barous Nov 2016 B2
9727891 Mezzacca Aug 2017 B2
9741080 Byrne Aug 2017 B1
9747622 Johnson et al. Aug 2017 B1
9805425 MacDonald-Korth et al. Oct 2017 B2
9928752 Byrne et al. Mar 2018 B2
9940659 Behbahani et al. Apr 2018 B1
9954879 Sadaghiani et al. Apr 2018 B1
10013500 McClintock et al. Jul 2018 B1
10074118 Johnson et al. Sep 2018 B1
10102287 Martin Oct 2018 B2
10210518 Alnajem Feb 2019 B2
10217147 Shivaswamy et al. Feb 2019 B2
10269081 Byrne Apr 2019 B1
10423997 MacDonald Korth et al. Sep 2019 B2
10534845 Noursalehi et al. Jan 2020 B2
10769219 Martin Sep 2020 B1
10810654 Robertson et al. Oct 2020 B1
10853891 MacDonald-Korth et al. Dec 2020 B2
10872350 Hu et al. Dec 2020 B1
10896451 Johnson et al. Jan 2021 B1
10929890 Knab et al. Feb 2021 B2
10949876 Johnson et al. Mar 2021 B2
10970463 Noursalehi et al. Apr 2021 B2
10970742 Knijnik et al. Apr 2021 B1
10970769 Iqbal Apr 2021 B2
10977654 Kumar et al. Apr 2021 B2
11023947 Bosley et al. Jun 2021 B1
11061977 Raskar Jul 2021 B1
11062316 Bizarro et al. Jul 2021 B2
11176598 D'Souza et al. Nov 2021 B2
11205179 Patel et al. Dec 2021 B1
11315145 Knijnik et al. Apr 2022 B1
11463578 De Sanctis et al. Oct 2022 B1
11475484 Knab et al. Oct 2022 B1
11514493 Cook et al. Nov 2022 B1
11526653 Noursalehi et al. Dec 2022 B1
11593811 Hanis Feb 2023 B2
11631124 Robertson et al. Apr 2023 B1
11676192 Moore et al. Jun 2023 B1
11694228 Hu et al. Jul 2023 B1
11734368 Campbell et al. Aug 2023 B1
20010002471 Ooish May 2001 A1
20010014868 Herz et al. Aug 2001 A1
20010034667 Petersen Oct 2001 A1
20010034668 Whitworth Oct 2001 A1
20010044751 Pugliese, III et al. Nov 2001 A1
20010047290 Petras et al. Nov 2001 A1
20010047308 Kaminsky et al. Nov 2001 A1
20010051996 Cooper et al. Dec 2001 A1
20020002513 Chiasson Jan 2002 A1
20020007321 Burton Jan 2002 A1
20020007356 Rice et al. Jan 2002 A1
20020013721 Dabbiere et al. Jan 2002 A1
20020019763 Linden et al. Feb 2002 A1
20020022995 Miller et al. Feb 2002 A1
20020023059 Bari et al. Feb 2002 A1
20020026390 Ulenas et al. Feb 2002 A1
20020029187 Meehan et al. Mar 2002 A1
20020038312 Donner et al. Mar 2002 A1
20020040352 McCormick Apr 2002 A1
20020042738 Srinivasan et al. Apr 2002 A1
20020049622 Lettich et al. Apr 2002 A1
20020056044 Andersson May 2002 A1
20020065774 Young et al. May 2002 A1
20020082932 Chinnappan et al. Jun 2002 A1
20020099578 Eicher, Jr. et al. Jul 2002 A1
20020099579 Stowell et al. Jul 2002 A1
20020099602 Moskowitz et al. Jul 2002 A1
20020107718 Morrill et al. Aug 2002 A1
20020107853 Hofmann et al. Aug 2002 A1
20020111826 Potter et al. Aug 2002 A1
20020120537 Morea et al. Aug 2002 A1
20020120609 Lang et al. Aug 2002 A1
20020123957 Notarius et al. Sep 2002 A1
20020124100 Adams Sep 2002 A1
20020129282 Hopkins Sep 2002 A1
20020133502 Rosenthal et al. Sep 2002 A1
20020138399 Hayes et al. Sep 2002 A1
20020147625 Kolke, Jr. Oct 2002 A1
20020156802 Takayama et al. Oct 2002 A1
20020161648 Mason et al. Oct 2002 A1
20020161664 Shaya et al. Oct 2002 A1
20020188777 Kraft et al. Dec 2002 A1
20020194049 Boyd Dec 2002 A1
20020194357 Harris et al. Dec 2002 A1
20020198784 Shaak et al. Dec 2002 A1
20020198882 Linden et al. Dec 2002 A1
20030004855 Dutta et al. Jan 2003 A1
20030005046 Kavanagh et al. Jan 2003 A1
20030007464 Balani Jan 2003 A1
20030009362 Cifani et al. Jan 2003 A1
20030009392 Perkowski Jan 2003 A1
20030014400 Siegel Jan 2003 A1
20030028451 Ananian Feb 2003 A1
20030028605 Millett et al. Feb 2003 A1
20030032409 Hutcheson et al. Feb 2003 A1
20030035138 Schilling Feb 2003 A1
20030036914 Fitzpatrick et al. Feb 2003 A1
20030040970 Miller Feb 2003 A1
20030041008 Grey et al. Feb 2003 A1
20030046149 Wong Mar 2003 A1
20030069740 Zeidman Apr 2003 A1
20030069790 Kane Apr 2003 A1
20030069825 Hoffman et al. Apr 2003 A1
20030083961 Bezos et al. May 2003 A1
20030088467 Culver May 2003 A1
20030088511 Karboulonis et al. May 2003 A1
20030093331 Childs et al. May 2003 A1
20030097352 Gutta et al. May 2003 A1
20030105682 Dicker et al. Jun 2003 A1
20030110100 Wirth, Jr. Jun 2003 A1
20030119492 Timmins et al. Jun 2003 A1
20030131095 Kumhyr et al. Jul 2003 A1
20030139969 Scroggie et al. Jul 2003 A1
20030140007 Kramer et al. Jul 2003 A1
20030140121 Adams Jul 2003 A1
20030158792 Perkowski Aug 2003 A1
20030163340 Fitzpatrick et al. Aug 2003 A1
20030167213 Jammes et al. Sep 2003 A1
20030167222 Mehrotra et al. Sep 2003 A1
20030177103 Ivanov et al. Sep 2003 A1
20030187745 Hobday et al. Oct 2003 A1
20030200156 Roseman et al. Oct 2003 A1
20030204449 Kotas et al. Oct 2003 A1
20030217002 Enborg Nov 2003 A1
20030220835 Barnes, Jr. Nov 2003 A1
20040006509 Mannik et al. Jan 2004 A1
20040015416 Foster et al. Jan 2004 A1
20040029567 Timmins et al. Feb 2004 A1
20040041836 Zaner et al. Mar 2004 A1
20040044563 Stein Mar 2004 A1
20040055017 Delpuch et al. Mar 2004 A1
20040058710 Timmins et al. Mar 2004 A1
20040068697 Harik et al. Apr 2004 A1
20040073476 Donahue et al. Apr 2004 A1
20040078388 Melman Apr 2004 A1
20040093311 Chew et al. May 2004 A1
20040107136 Nemirofsky et al. Jun 2004 A1
20040117242 Conrad et al. Jun 2004 A1
20040122083 Pettit et al. Jun 2004 A1
20040122681 Ruvolo et al. Jun 2004 A1
20040122735 Meshkin Jun 2004 A1
20040122855 Ruvolo et al. Jun 2004 A1
20040128183 Challey et al. Jul 2004 A1
20040128283 Wang et al. Jul 2004 A1
20040128320 Grove et al. Jul 2004 A1
20040143731 Audebert et al. Jul 2004 A1
20040148232 Fushimi et al. Jul 2004 A1
20040172323 Stamm Sep 2004 A1
20040172379 Mott et al. Sep 2004 A1
20040174979 Hutton et al. Sep 2004 A1
20040186766 Fellenstein et al. Sep 2004 A1
20040199496 Liu et al. Oct 2004 A1
20040199905 Fagin et al. Oct 2004 A1
20040204989 Dicker et al. Oct 2004 A1
20040204991 Monahan et al. Oct 2004 A1
20040230989 Macey et al. Nov 2004 A1
20040240642 Crandell et al. Dec 2004 A1
20040249727 Cook, Jr. et al. Dec 2004 A1
20040267717 Slackman Dec 2004 A1
20050010925 Khawand et al. Jan 2005 A1
20050021666 Dinnage et al. Jan 2005 A1
20050038733 Foster et al. Feb 2005 A1
20050044254 Smith Feb 2005 A1
20050055306 Miller et al. Mar 2005 A1
20050060664 Rogers Mar 2005 A1
20050097204 Horowitz et al. May 2005 A1
20050114229 Ackley et al. May 2005 A1
20050120311 Thrall Jun 2005 A1
20050131837 Sanctis et al. Jun 2005 A1
20050144064 Calabria et al. Jun 2005 A1
20050144074 Fredregill et al. Jun 2005 A1
20050193333 Ebert Sep 2005 A1
20050197846 Pezaris et al. Sep 2005 A1
20050197950 Moya et al. Sep 2005 A1
20050198031 Pezaris et al. Sep 2005 A1
20050202390 Allen et al. Sep 2005 A1
20050203888 Woosley et al. Sep 2005 A1
20050216300 Appelman et al. Sep 2005 A1
20050240474 Li Oct 2005 A1
20050262067 Lee et al. Nov 2005 A1
20050273378 MacDonald-Korth et al. Dec 2005 A1
20050278231 Teeter Dec 2005 A1
20060009994 Hogg et al. Jan 2006 A1
20060010105 Sarakkai et al. Jan 2006 A1
20060015498 Sarmiento et al. Jan 2006 A1
20060031240 Eyal et al. Feb 2006 A1
20060041638 Whittaker et al. Feb 2006 A1
20060048093 Jain et al. Mar 2006 A1
20060058048 Kapoor et al. Mar 2006 A1
20060069623 MacDonald Korth et al. Mar 2006 A1
20060085251 Greene Apr 2006 A1
20060173817 Chowdhury et al. Aug 2006 A1
20060206386 Walker et al. Sep 2006 A1
20060206479 Mason Sep 2006 A1
20060212358 Walker et al. Sep 2006 A1
20060218049 Walker et al. Sep 2006 A1
20060224470 Garcia Ruano et al. Oct 2006 A1
20060230035 Bailey et al. Oct 2006 A1
20060235752 Kavanagh et al. Oct 2006 A1
20060253476 Roth et al. Nov 2006 A1
20060259360 Flinn et al. Nov 2006 A1
20060271671 Hansen Nov 2006 A1
20060282304 Bedard et al. Dec 2006 A1
20070005424 Arauz Jan 2007 A1
20070027760 Collins et al. Feb 2007 A1
20070027814 Touriniemi Feb 2007 A1
20070055568 Osborne Mar 2007 A1
20070073641 Perry et al. Mar 2007 A1
20070077025 Mino Apr 2007 A1
20070078726 MacDonald Korth et al. Apr 2007 A1
20070078849 Slothouber Apr 2007 A1
20070083437 Hamor Apr 2007 A1
20070094597 Rostom Apr 2007 A1
20070100803 Cava May 2007 A1
20070130090 Staib et al. Jun 2007 A1
20070160345 Sakai et al. Jul 2007 A1
20070162379 Skinner Jul 2007 A1
20070174108 Monster Jul 2007 A1
20070192168 Van Luchene Aug 2007 A1
20070192181 Asdourian Aug 2007 A1
20070206606 Coleman et al. Sep 2007 A1
20070214048 Chan et al. Sep 2007 A1
20070226679 Jayamohan et al. Sep 2007 A1
20070233565 Herzog et al. Oct 2007 A1
20070239534 Liu et al. Oct 2007 A1
20070245013 Saraswathy et al. Oct 2007 A1
20070260520 Jha et al. Nov 2007 A1
20070282666 Afeyan et al. Dec 2007 A1
20070288298 Gutierrez et al. Dec 2007 A1
20070299743 Staib et al. Dec 2007 A1
20080010678 Burdette et al. Jan 2008 A1
20080015938 Haddad et al. Jan 2008 A1
20080021763 Merchant Jan 2008 A1
20080052152 Yufik Feb 2008 A1
20080071640 Nguyen Mar 2008 A1
20080082394 Floyd et al. Apr 2008 A1
20080103893 Nagarajan et al. May 2008 A1
20080120342 Reed et al. May 2008 A1
20080126205 Evans et al. May 2008 A1
20080126476 Nicholas et al. May 2008 A1
20080133305 Yates et al. Jun 2008 A1
20080133349 Nazer et al. Jun 2008 A1
20080140765 Kelaita et al. Jun 2008 A1
20080162574 Gilbert Jul 2008 A1
20080195476 Marchese et al. Aug 2008 A1
20080201218 Broder et al. Aug 2008 A1
20080215456 West et al. Sep 2008 A1
20080281714 Kluth Nov 2008 A1
20080288338 Wiseman et al. Nov 2008 A1
20080294536 Taylor et al. Nov 2008 A1
20080300909 Rikhtverchik et al. Dec 2008 A1
20080301009 Plaster et al. Dec 2008 A1
20080305869 Konforty et al. Dec 2008 A1
20080313010 Jepson et al. Dec 2008 A1
20080320012 Loving et al. Dec 2008 A1
20090006190 Lucash et al. Jan 2009 A1
20090006315 Mukherjea et al. Jan 2009 A1
20090030755 Altberg et al. Jan 2009 A1
20090030775 Vieri Jan 2009 A1
20090037355 Brave et al. Feb 2009 A1
20090106080 Carrier et al. Apr 2009 A1
20090106127 Purdy et al. Apr 2009 A1
20090110181 Koenig et al. Apr 2009 A1
20090119167 Kendall et al. May 2009 A1
20090157537 Miller Jun 2009 A1
20090164323 Byrne Jun 2009 A1
20090164442 Shani et al. Jun 2009 A1
20090182589 Kendall et al. Jul 2009 A1
20090204848 Kube et al. Aug 2009 A1
20090222337 Sergiades Sep 2009 A1
20090222348 Ransom et al. Sep 2009 A1
20090222737 Liesche et al. Sep 2009 A1
20090228918 Rolff et al. Sep 2009 A1
20090234722 Evevsky Sep 2009 A1
20090240582 Sheldon-Neal et al. Sep 2009 A1
20090276284 Yost Nov 2009 A1
20090276305 Clopp Nov 2009 A1
20090292677 Kim Nov 2009 A1
20090293019 Raffel et al. Nov 2009 A1
20090313173 Singh et al. Dec 2009 A1
20100042684 Broms et al. Feb 2010 A1
20100070448 Omoigui Mar 2010 A1
20100076816 Phillips Mar 2010 A1
20100076851 Jewell, Jr. Mar 2010 A1
20100094673 Lobo et al. Apr 2010 A1
20100107123 Sareen et al. Apr 2010 A1
20100145831 Esfandiari et al. Jun 2010 A1
20100146413 Yu Jun 2010 A1
20100174754 B'Far et al. Jul 2010 A1
20100228617 Ransom et al. Sep 2010 A1
20100274821 Bernstein et al. Oct 2010 A1
20110010656 Mokotov Jan 2011 A1
20110035276 Ghosh et al. Feb 2011 A1
20110055054 Glasson Mar 2011 A1
20110060621 Weller et al. Mar 2011 A1
20110103699 Ke et al. May 2011 A1
20110131253 Peukert et al. Jun 2011 A1
20110137973 Wei et al. Jun 2011 A1
20110145226 Gollapudi et al. Jun 2011 A1
20110153383 Bhattacharjya et al. Jun 2011 A1
20110153663 Koren et al. Jun 2011 A1
20110173076 Eggleston et al. Jul 2011 A1
20110191319 Nie Aug 2011 A1
20110196802 Ellis et al. Aug 2011 A1
20110225050 Varghese Sep 2011 A1
20110231226 Golden Sep 2011 A1
20110231383 Smyth et al. Sep 2011 A1
20110258049 Ramer et al. Oct 2011 A1
20110258212 Lu et al. Oct 2011 A1
20110271204 Jones et al. Nov 2011 A1
20110276513 Erhart et al. Nov 2011 A1
20110289068 Teevan et al. Nov 2011 A1
20120005187 Chavanne Jan 2012 A1
20120030067 Pothukuchi et al. Feb 2012 A1
20120084135 Nissan et al. Apr 2012 A1
20120089454 Chen Apr 2012 A1
20120123899 Wiesner May 2012 A1
20120158480 Sundaram Jun 2012 A1
20120158715 Maghoul et al. Jun 2012 A1
20120164619 Meer Jun 2012 A1
20120166299 Heinstein et al. Jun 2012 A1
20120203723 Huang et al. Aug 2012 A1
20120231424 Calman et al. Sep 2012 A1
20120233312 Ramakumar et al. Sep 2012 A1
20120239504 Curlander et al. Sep 2012 A1
20120253985 Maron Oct 2012 A1
20120271702 MacLachlan et al. Oct 2012 A1
20120278388 Kleinbart et al. Nov 2012 A1
20120284336 Schmidt et al. Nov 2012 A1
20120296697 Kumar Nov 2012 A1
20120323674 Simmons et al. Dec 2012 A1
20120323725 Johnston et al. Dec 2012 A1
20130031470 Daly, Jr. et al. Jan 2013 A1
20130073392 Allen et al. Mar 2013 A1
20130080200 Connolly et al. Mar 2013 A1
20130080426 Chen et al. Mar 2013 A1
20130085893 Bhardwaj et al. Apr 2013 A1
20130144870 Gupta et al. Jun 2013 A1
20130145254 Masuko et al. Jun 2013 A1
20130151331 Avner et al. Jun 2013 A1
20130151388 Falkenborg et al. Jun 2013 A1
20130173408 Lindblom Jul 2013 A1
20130185164 Pottjegort Jul 2013 A1
20130191409 Zeng et al. Jul 2013 A1
20130246300 Fischer et al. Sep 2013 A1
20130254059 Teo Sep 2013 A1
20130268561 Christie et al. Oct 2013 A1
20140019298 Suchet et al. Jan 2014 A1
20140019313 Hu Jan 2014 A1
20140019542 Rao et al. Jan 2014 A1
20140025509 Reisz et al. Jan 2014 A1
20140032544 Mathieu et al. Jan 2014 A1
20140095273 Tang et al. Apr 2014 A1
20140114680 Mills et al. Apr 2014 A1
20140114755 Mezzacca Apr 2014 A1
20140136290 Schiestl et al. May 2014 A1
20140149390 Chen et al. May 2014 A1
20140172652 Pobbathi et al. Jun 2014 A1
20140180758 Agarwal et al. Jun 2014 A1
20140200959 Sarb et al. Jul 2014 A1
20140259056 Grusd Sep 2014 A1
20140278880 Lemphers et al. Sep 2014 A1
20140279191 Agarwal et al. Sep 2014 A1
20140289005 Laing et al. Sep 2014 A1
20140310094 Shapira et al. Oct 2014 A1
20140330818 Raina et al. Nov 2014 A1
20140337090 Tavares Nov 2014 A1
20140372415 Fernandez-Ruiz Dec 2014 A1
20150019958 Ying et al. Jan 2015 A1
20150032507 Narasimhan et al. Jan 2015 A1
20150088695 Lorbiecki et al. Mar 2015 A1
20150088968 Wei et al. Mar 2015 A1
20150089524 Cremonesi et al. Mar 2015 A1
20150106181 Kluth Apr 2015 A1
20150142543 Lellouche May 2015 A1
20150142771 Bhagat et al. May 2015 A1
20150286742 Zhang et al. Oct 2015 A1
20150287066 Wortley et al. Oct 2015 A1
20160071105 Groarke et al. Mar 2016 A1
20160098488 Battle et al. Apr 2016 A1
20170076324 Waldron Mar 2017 A1
20170228375 Yang et al. Aug 2017 A1
20170235788 Borisyuk et al. Aug 2017 A1
20170300911 Alnajem Oct 2017 A1
20170344622 Islam et al. Nov 2017 A1
20170358000 Jain et al. Dec 2017 A1
20180033064 Varley Feb 2018 A1
20180167412 Barrett et al. Jun 2018 A1
20190043106 Talmor et al. Feb 2019 A1
20190066111 Bizarro et al. Feb 2019 A1
20190130904 Homma et al. May 2019 A1
20190197550 Sharma Jun 2019 A1
20190295087 Jia Sep 2019 A1
20190295088 Jia et al. Sep 2019 A1
20190295089 Jia Sep 2019 A1
20190325868 Lecue et al. Oct 2019 A1
20200005310 Kumar et al. Jan 2020 A1
20200065357 Noursalehi et al. Feb 2020 A1
20200184540 D'Souza et al. Jun 2020 A1
20200218766 Yaseen et al. Jul 2020 A1
20200250675 Hanis et al. Aug 2020 A1
20200293587 Ayers et al. Sep 2020 A1
20200410552 Stohlman Dec 2020 A1
Foreign Referenced Citations (27)
Number Date Country
2253543 Mar 1997 CA
2347812 May 2000 CA
0636993 Apr 1999 EP
0807891 May 2000 EP
1241603 Sep 2002 EP
2397400 Jul 2004 GB
2424098 Sep 2006 GB
2001283083 Dec 2001 JP
2002318935 Oct 2002 JP
2007021920 Feb 2007 JP
2009505238 Feb 2009 JP
WO1997017663 May 1997 WO
WO1998032289 Jul 1998 WO
WO1998047082 Oct 1998 WO
WO1998049641 Nov 1998 WO
WO1999059283 Nov 1999 WO
WO2000025218 May 2000 WO
WO20000068851 Nov 2000 WO
WO2001009803 Feb 2001 WO
WO2001082135 Nov 2001 WO
WO2001097099 Dec 2001 WO
WO2002037234 May 2002 WO
WO2003094080 Nov 2003 WO
WO2007021920 Feb 2007 WO
WO2012093410 Jul 2012 WO
WO2015116038 Aug 2015 WO
WO2015176071 Nov 2015 WO
Non-Patent Literature Citations (124)
Entry
Berger et al., “Random Multiple Access Communication and Group Testing,” IEEE, 1984. (Year: 1984).
Rose, “Vendors strive to undo Adobe lock-hold,” Computer Reseller News, Feb. 5, 1996, n 669, p. 71 (7). (Year: 1996).
Anon., “ID.me to Host SXSW Panel How Digital Identity is Enabling Access to the VA on Mar. 12,” ICT Monitor Worldwide [Amman] Mar. 3, 2017. (Year: 2017).
2roam, Inc., multiple archived pages of www.2roam.com retrieved via Internet Archive Wayback Machine on Jun. 10, 2008.
Alt et al., “Bibliography on Electronic Commerce,” Electronic Markets—The International Journal, Oct. 1993, 5 pages, vol. 3, No. 3.
Alt et al., “Computer Integrated Logistics,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 1, No. 3.
Anonymous, Image manipulation (image-editing software and image-manipulation systems)(Seybold Special Report, Part II), Seybold Report on Publishing Systems, May 15, 1995, pS35(9), vol. 24, No. 18.
auctionwatch.com, multiple pages—including search results for “expedition,” printed Apr. 21, 2011.
auctiva.com, multiple pages, undated but website copyright date is “1999-2000.”
Ball et al., “Supply chain infrastructures: system integration and information sharing,” ACM SIGMOD Record, 2002, vol. 31, No. 1, pp. 61-66.
Braganza, “IS Resarch at Cranfield—A Look at the Future,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Brecht et al., “The IM 2000 Research Programme,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Business Wire business/technology editors, “Sellers Flock to OutletZoo.com as New Automatic Price Drop Method Moves Excess Inventory Online,” Business Wire, Oct. 25, 1999.
Business Wire business editors/high-tech writers, “PictureWorks Technology, Inc. Expands in Real Estate Market with Adoption of Rimfire on Realtor.com,” Business Wire, Nov. 8, 1999.
Business Wire business editors/high-tech writers, “PictureWorks Technology, Inc. Shows Strong Revenue Growth in Internet Imaging Business,” Business Wire, Nov. 10, 1999.
Business Wire business editors/high-tech writers, “2Roam Partners with Pumatech to Delivery Wireless Alerts,” Business Wire, Dec. 18, 2000.
Business Wire business editors/high-tech writers, “2Roam Takes eHow's How-to Solutions Wireless: With 2Roam, the Web's One-Stop Source for getting Things Done is on More Wireless Devices, with Ability to Purchase Its Products from Anywhere,” Business Wire, Oct. 2, 2000.
Business Wire business editors/high-tech writers, “2Roam Drives Hertz to the Wireless Web: Number One Car Rental Company to Provide Customers Wireless Access from Any Device,” Business Wire, Aug. 7, 2001.
buy.com, www.buy.com homepage, printed Oct. 13, 2004.
Chen et al., “Detecting Web Page Structure for Adaptive Viewing on Small Form Factor Devices,” ACM, May 20-24, 2003.
Chen, M. (2007). Knowledge assisted data management and retrieval in multimedia database systems (Order No. 3268643).
Y.K. Choi and S. K. Kim, “An auxillary reccomendation system for repetitively purchasing items in E-commerce,” 2014 International Conference on Big Data and Smart Computing (BIGCOMP), Bangkok, 2014, pp. 96-98. (Year 2014).
Clemons et al., “Evaluating the prospects for alternative electronic securities markets,” Proceedings of the twelfth international conference on information systems, New York, New York, United States, pp. 53-64, 1991.
Fan, J., Keim, F.A., Gao, Y., Luo, H. and Li, Z. (2009). JustClick: Personalized Image Recommendation via Exploratory Search from Large-Scale Flickr Images. Feb. 2009. IEEE Transactions on Circuits and Systems for Video Technology, 19(2), pp. 2730288. (Year: 2009).
friendster.com, homepage and “more info” pages, printed Apr. 29, 2004.
Google News archive search for “2Roam marketing” performed over the date range 2000-2003.
Google News archive search for “2Roam SMS” performed over the date range 2000-2008.
Grabowski et al., “Mobile-enabled grid middleware and/or grid gateways,” GridLab—A Grid Application Toolkit and Testbed, Work Package 12—Access for Mobile Users, Jun. 3, 2003.
Graham, “The Emergence of Linked Fish Markets in Europe,” Electronic Markets—The International Journal, Jul. 1993, 4 pages, vol. 8, No. 2.
Halperin, “Toward a Process Handbook for Organizational Coordination Processes,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Hess et al., “Computerized Loan Origination Systems: An Industry Case Study of the Electronic Markets Hypothesis,” MIS Quarterly, Sep. 1994, pp. 251-275.
IBM, “Anyonymous Delivery of Goods in Electronic Commerce,” IBM Technical Disclosure Bulletin, Mar. 1996, pp. 363-366, vol. 39, No. 3.
IBM, “Personal Optimized Decision/Transaction Program,” IBM Technical Disclosure Bulletin, Jan. 1995, pp. 83-84, vol. 38, No. 1.
Icrossing, “Icrossing Search Synergy: Natural & Paid Search Symbiosis,” Mar. 2007.
IEEE 100—The Authoritative Dictionary of IEEE Standard Terms, Seventh Edition, 2000. Entire book cited; table of contents, source list, and terms beginning with A included. ISBN 0-7381-2601-2a.
Ives et al., “Editor's Comments—MISQ Central: Creating a New Intellectual Infrastructure,” MIS Quarterly, Sep. 1994, p. xxxv.
Joshi, “Information visibility and its effect on supply chain dynamics,” Ph.D. dissertation, Massachusetts Institute of Technology, 2000 (fig. 4.5; p. 45).
Klein, “Information Logistics,” Electronic Markets—The International Journal, Oct. 1993, pp. 11-12, vol. 3, No. 3.
Klein, “Introduction to Electronic Auctions,” Electronic Markets—The International Journal, Dec. 1997, 4 pages, vol. 7, No. 4.
Kubicek, “The Organization Gap,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
S. Kulkarni, A. M. Sankpal, R.R. Mudholkar and Kirankumari, “Recommendation engine: Matching individual/group profiles for better shopping experience,” 2013 15th International Conference on Advanced Computing Technologies (ICACT), Rajampet, 2013, pp. 1-6. (Year: 2013).
Kuula, “Telematic Services in Finland,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Lalonde, “The EDI World Institute: An International Approach,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Lee et al., “Intelligent Electronic Trading for Commodity Exchanges,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
Lee et al., “Electronic Brokerage and Electronic Auction: The Impact of IT on Market Structures,” Proceedings of the. 29th Annual Hawaii International Conference on System Sciences, 1996, pp. 397-406.
Lee, “Aucnet: Electronic Intermediary for Used-Car Transactions,” Electronic Market—The International Journal, Dec. 1997, pp. 24-28, vol. 7, No. 4.
T.Y. Lee, S. Li and R. Wei, “Needs-Centric Searching and Ranking Based on Customer Reviews,” 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services, Washington, DC, 2008, pp. 128-135. (Year: 2008).
Levy, Michael, and Dhruv Grewal. “Supply chain management in a networked economy.” Journal Retailing 76.4 (2000): 415-429.
Live365 press release, “Live365 to Offer Opt-In Advertising on Its Website,” Oct. 15, 2004.
London Business School, “Overture and Google: Internet Pay-Per-Click (PPC) Advertising Options,” Mar. 2003.
M2 Presswire, “Palm, Inc.: Palm unveils new web browser optimised for handhelds; HTML browser offers high-speed web-browsing option,” Mar. 13, 2002.
Malone et al., “Electronic Markets and Electronic Hierarchies,” Communications of the ACM, Jun. 1987, pp. 484-497, vol. 30, No. 6.
Mansell et al., “Electronic Trading Networks: The Route to Competitive Advantage?” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Mardesich, “Onsale takes auction gavel electronic,” Computer Reseller News, Jul. 8, 1996, pp. 2, 32.
Marteau, “Shop with One Click, Anywhere, Anytime,” Information Management and Consulting, 2000, pp. 44-46, vol. 15, No. 4.
Massimb et al., “Electronic Trading, Market Structure and Liquidity,” Financial Analysts Journal, Jan.-Feb. 1994, pp. 39-49.
McGinnity, “Build Your Weapon,” PC Magazine, Apr. 24, 2011, printed from www.pcmag.com/print_article2?0, 1217, a%253D3955,00.asp.
Meade, “Visual 360: a performance appraisal system that's 'fun,” HR Magazine, 44, 7, 118(3), Jul. 1999.
“Mediappraise: Mediappraise Receives National Award for Web-Based Technology That Enables Companies to Solve Thorny HR Problem,” Dec. 14, 1998.
Medvinsky et al., “Electronic Currency for the Internet,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
metails.com, www.metails.com homepage, printed Oct. 13, 2004.
Microsoft Computer Dictionary, Fifth Edition, front matter and p. 33.
Microsoft Computer Dictionary, Fifth Edition, front matter, back matter, and pp. 479, 486.
Neches, “Fast—A Research Project in Electronic Commerce,” Electronic Markets—The International Journal, Oct. 1993, 4 pages, vol. 3., No. 3.
Neisser, “Which is better for Social Media Monitoring: TweetDeck or SproutSocial” Mar. 17, 2011, Social Media Examiner, https://www.socialmediaexaminer.com/which-is-better-for-social-media-monitoring-tweetdeck-or-sproutsocial/.
Neo, “The implementation of an electronic market for pig trading in Singapore,” Journal of Strategic Information Systems, Dec. 1992, pp. 278-288, vol. 1, No. 5.
O'Mahony, “An X.500-based Product Catalogue,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
“Onsale: Onsale Brings Thrill of Auctions and Bargain Hunting Online: Unique Internet retail services debuts with week-long charity auction for The Computer Museum in Boston,” May 24, 1995, printed from www.dialogweb.com/cgi/dwclient?dwcommand,DWEBPRINT%20810-489267.
“Onsale joins fray as online shopping pcks up speed: Internet Booms,” Comptuer Reseller News, Jun. 5, 1995.
Palm, Inc., PalmTM Web Pro Handbook, copyright 2002-2003.
Post et al., “Application of Auctions as a Pricing Mechanism for the Interchange of Electric Power,” IEEE Transactions of Power Systems, Aug. 1995, pp. 1580-1584, vol. 10, No. 3.
Preist et al., “Adaptive agents in a persistent shout double auction,” International Conference on Information and Computation, Proceedings of the first international conference on information and computation economies, Oct. 25-28, 1998, Charleston, United States, pp. 11-18.
Qualcomm, “Brew Developer Support,” printed from web.archive.org/web/20020209194207/http://www.qualcomm.com/brew/developer/support/kb/52.html on Aug. 30, 2007.
RCR Wireless News, “Lockheed Martin to use 2Roam's technology for wireless platform,” RCR Wireless News, Sep. 10, 2001.
Reck, “Formally Specifying an Automated Trade Execution System,” J. Systems Software, 1993, pp. 245-252, vol. 21.
Reck, “Trading-Process Characteristics of Electronic Auctions,” Electronic Markets—The International Journal, Dec. 1997, pp. 17-23, vol. 7, No. 4.
repcheck.com, www.repcheck.com homepage, printed from web.archive.org/web/20020330183132/http://repcheck.com on Sep. 5, 2009.
Resnick et al., “Reputation Systems,” Communications of the ACM, Dec. 2000, pp. 45-48, vol. 43, No. 12.
Rockoff et al., “Design of an Internet-based system for remote Dutch auctions,” Internet Research: Electronic Networking Applications and Policy, 1995, pp. 10-16, vol. 5, No. 4.
Rodriguez, Camille, HootSuite vs. social Oomph vs. Tweekdeck, Jan. 4, 2012, http://polkadotimpressions.com/2012/01/04/hootsuite-vs-social-oopmphvs.tweetdeck/ (Year: 2012).
Ross, David Frederick, Frederick S. Weston, and W. Stephen. Introduction to supply chain management technologies. CRC Press, 2010.
Rysavy, “Mobile-commerce ASPs do the legwork,” Network Computing, Jan. 22, 2001, p. 71, 6 pgs., vol. 12, No. 2.
Saunders, “AdFlight to Offer WAP Ads,” Oct. 17, 2000, printed from clickz.com/487531/print.
Schaffer, Neil, The Top 20 Twitter clients—HootSuite, TweetDeck and More, Jan. 31, 2012, https://maximizesocialbusinss.com/top-20-twitter-clients-2012-9175/ (Year: 2012).
Schmid, “Electronic Markets,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
Schwankert, “Matsushita Taps 2Roam for Wireless Solutions,” www.internetnews.com/bus-news.article.php/674811, Feb. 2, 2001.
Sen, “Inventory and Pricing Models for Perishable Products,” Doctor of Philosophy Dissertation—University of Southern California, Aug. 2000.
Siegmann, “Nowhere to go but up,” PC Week, Oct. 23, 1995, 3 pages, vol. 12, No. 42.
Telephony Staff, “Air-ASP,” Telephony Online, Oct. 2, 2000, 3 pages.
Teo, “Organizational Factors of Success in Using EDIS: A Survey of Tradenet Participants,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
Tjostheim et al., “A case study of an on-line auction for the World Wide Web,” printed from www.nr.no/gem/elcom/puplikasjoner/enter98e.html on Jun. 10, 1990, 10 pages.
Turban, “Auctions and Bidding on the Internet: An Assessment,” Electronic Markets—The International Journal, Dec. 1997, 5 pages, vol. 7, No. 4.
ubid.com, “How do I Updated my Address, Phone, Credit Card, Password, etc.?” printed from web.archive.org/web/20010208113903/www.ubid.com/help/topic13asp on Aug. 30, 2007.
ubid.com, “How do I track my shipment?” printed from web.archive.org/web/20010331032659/www.ubid.com/help/topic27.asp on Aug. 30, 2007.
ubid.com, “Can I track all of my bids from My Page?” printed from web.archive.org/web/20010208114049/www.ubid.com/help/topic14.asp on Aug. 30, 2007.
Van Heck et al., “Experiences with Electronic Auctions in the Dutch Flower Industry,” Electronic Markets—The International Journal, Dec. 1997, 6 pages, vol. 7, No. 4.
Verizon Wireless, “Verizon Wireless Customers Get It NowSM; Get Games, Get Pix, Get Ring Tones and Get Going in Full Color,” press release to Prnewswire, Sep. 23, 2002.
Warbelow et al., “Aucnet: TV Auction Network System,” Harvard Business School 9-190-001, Jul. 19, 1989, Rev. Apr. 12, 1996, pp. 1-15.
Weber, “How Financial Markets are Going On-line,” Electronic Markets—The International Journal, Oct. 1993, 2 pages, vol. 3, No. 3.
Wireless Internet, “DailyShopper Selects 2Roam to Enable Mobile Customers to Retrieve Nearby Sales and Promotions Information,” Wireless Internet, Apr. 2001.
Wireless Week, “Verizon Wireless Gets Going on BREW Agenda,” Wireless Week, Sep. 23, 2002.
xchanger.net, webpage printed from www.auctiva.com/showcases/as_4sale.asp?uid=exchanger, undated but at least as early as Oct. 12, 2000.
Yu et al., “Distributed Reputation Management for Electronic Commerce,” Computational Intelligence, 2002, pp. 535-549, vol. 18, No. 4.
Zetmeir, Auction Incentive Marketing, print of all pages of website found at home.earthlink.net/˜bidpointz/ made Oct. 8, 2004.
Zimmermann, “Integration of Financial Services: The TeleCounter,” Electronic Markets—The International Journal, Oct. 1993, 1 page, vol. 3, No. 3.
Zwass, “Electronic Commerce: Structures and Issues,” International Journal of Electronic Commerce, Fall 1996, pp. 3-23, vol. 1, No. 1.
Message Passing from Wikipedia, archived May 6, 2016, retrieved from https://en.wikipedia.org/wiki/message_passing, 4 pages.
Di et al., “A New Implementation for Ontology Mapping Based enterprise Semantic Interoperation,” by Xiaofeng Di and Yushun Fan, Applied Mechanics and Materials, vols. 16-19 (2009), pp. 644-648 (Year:2009).
Nicolle et a., “XML Integration and Toolkit for B2B Applications,” by Christophe Nicolle, Kokou Yetongnon, and Jean-Claude Simon, Journal of Database Management, Oct.-Dec. 2003 (Year: 2003).
V. Aksakalli, Optimizing direct response in Internet display advertising, Elsevier, vol. 11, Issue 3, May-Jun. 2012, pp. 229-240. (Year: 2012).
Gallagher et al. A framework for targeting banner advertising on the internet. IEEE, pp. 265-274 (Year: 1997).
Alex, Neil, “Optimizing Search Results in Elasticsearch with Scoring and Boosting”, Mar. 18, 2015, Qbox.io, accessed at [https://qbox.io/blog/optimizing-search-results-in-elasticsearch0with-scoring-and-boosting] (year: 2015).
Hybrid algorithms for recommending new items. Cremonesi et al., ResearchGate, Google, (year:2011).
Dubinsky, B., “Uncovering accounts payable fraud by using ‘fuzzy matching logic’: Part 1,” Business Credit 110.3:6 (4), National Association of Credit Management, Mar. 2008, (Year: 2008).
Dubinsky, B., “Uncovering accounts payable fraud by using ‘fuzzy matching logic’: Part 2,” Business Credit 110.4: 64 (3), National Association of Credit Management, Apr. 2008 (Year:2008).
Qureshi et al. “Taxonomy based Data Marts,” by Asiya Abdus Salam Qureshi and Syed Muhammad Khalid Jamal, International Journal of Computer Applications (0975-8887), vol. 60, No. 13, Dec. 2012 (Year: 2012).
Haibin Liu, Vlado Keselj, “Combined mining of Web server logs and web contents for classifying user navigation patterns and predicting users' future requests,” Data & Knowledge Engineering, vol. 61, Issue 2, 2007, pp. 304-330 (Year: 2007).
Sumathi et al., “Automatic Recommendation of Web Pages in Web Usage Mining,” International Journal on Computer Science and Engineering, vol. 02, No. 09, 2010 (Year: 2010).
Harrington, Caitlin “The Future of Shopping” Wired 26. 12:30. Conde Nast Publications Inc. (Dec. 2018).
Clarke, “Research Programme in Supra-organizational Systems,” Electronic Markets—The International Journal, Oct. 1, 1993, 2 pages, vol. 3, No. 3.
Gunthorpe et al., “Portfolio Composition and the Investment Horizon,” Financial Analysts Journal, Jan.-Feb. 1994, pp. 51.
Craver, Thom, Inside Bing's Spell Checker, Jan. 4, 2013, searchenginewatch.com, accessed at [https://www.searchenginewatch.com/2013/01/04/inside-beings-spell-checker/] (Year: 2013).
Business Wire [New York] “Data Warehousing Leader Acta Inc. Extends Award-Winning Technology to E-Commerce” Sep. 14, 1999 (Year:1999).
Gong et al., IEEE Computer Society 3pgs. (Year: 2008) “A collaborative Recommender Combining Item Rating Similarity and Item Attribute Similarity”.
Provisional Applications (1)
Number Date Country
62838989 Apr 2019 US
Continuations (1)
Number Date Country
Parent 16859302 Apr 2020 US
Child 17556601 US