Tuning product policy using observed evidence of customer behavior

Information

  • Patent Grant
  • 8336085
  • Patent Number
    8,336,085
  • Date Filed
    Monday, September 12, 2005
    18 years ago
  • Date Issued
    Tuesday, December 18, 2012
    11 years ago
Abstract
A computer adapted for pay-as-you go or other metered use has a policy for determined what measurements to take to detect fraud as well as steps to take when fraud is found. To optimize between good performance and sufficient tests to reduce the risk of fraud, a policy is developed based on observation of the users behavior, using data taken at the computer, data from a payment processor or both. After analysis, an updated policy is securely loaded at the computer to determine what, and how often to measure for suspected fraud.
Description
BACKGROUND

Systems for managing financial risk have taken many forms. Credit card companies routinely monitor transactions watching for fraudulent behavior. Credit limits are based on past performance with respect to spending and bill payment. Individuals and companies with good credit histories may be afforded higher credit limits and more lenient policies with respect to use of a credit line. In many of these cases, each transaction is analyzed and approved on a transaction by transaction basis. Further, in many instances the actual financial instrument is relatively inexpensive, for example, a plastic credit card may cost less than a dime. In other instances, for example, a cellular telephone system, the cellular phone may have some value but may be rendered essentially useless when access to the network is denied.


However, in the case of a pay-per-use or pay-as-you-go computer, the asset, that is the computer, has high value and may offer valuable functionality even when disconnected from a network. Analyzing, measuring, and controlling risk on such a platform presents unique challenges to risk management.


SUMMARY

Data related to operation of a pay-per-use or pay-as-you-go computer may be gathered from the computer itself and from data related to financial transactions and other credit-related information. Using this information, policies may be developed specifying how closely to monitor operation of the computer for fraudulent activity as well as setting the level of response to suspected fraudulent activity. Monitoring the operation of the computer may involve not only what measurements to take, but how often to take the measurements. Taking too many measurements may affect computer performance and lower user satisfaction with the computing experience. Under-measuring may increase the risk to an underwriter from loss due to fraudulent activity. By setting the policy based on the user's observed behavior, using either data gathered at the computer, financial transaction records, or both, a balance may be achieved.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a simplified and representative block diagram of a computer network;



FIG. 2 is a block diagram of a computer that may be connected to the network of FIG. 1;



FIG. 3 is a block diagram of a computer showing details of a secure execution environment and its relationship to other functional elements of the computer; and



FIG. 4 a flow chart depicting a method of tuning product policy based on observed user behavior.





DETAILED DESCRIPTION OF VARIOUS EMBODIMENTS

Although the following text sets forth a detailed description of numerous different embodiments, it should be understood that the legal scope of the description is defined by the words of the claims set forth at the end of this disclosure. The detailed description is to be construed as exemplary only and does not describe every possible embodiment since describing every possible embodiment would be impractical, if not impossible. Numerous alternative embodiments could be implemented, using either current technology or technology developed after the filing date of this patent, which would still fall within the scope of the claims.


It should also be understood that, unless a term is expressly defined in this patent using the sentence “As used herein, the term ‘——————’ is hereby defined to mean . . . ” or a similar sentence, there is no intent to limit the meaning of that term, either expressly or by implication, beyond its plain or ordinary meaning, and such term should not be interpreted to be limited in scope based on any statement made in any section of this patent (other than the language of the claims). To the extent that any term recited in the claims at the end of this patent is referred to in this patent in a manner consistent with a single meaning, that is done for sake of clarity only so as to not confuse the reader, and it is not intended that such claim term by limited, by implication or otherwise, to that single meaning. Finally, unless a claim element is defined by reciting the word “means” and a function without the recital of any structure, it is not intended that the scope of any claim element be interpreted based on the application of 35 U.S.C. §112, sixth paragraph.


Much of the inventive functionality and many of the inventive principles are best implemented with or in software programs or instructions and integrated circuits (ICs) such as application specific ICs. It is expected that one of ordinary skill, notwithstanding possibly significant effort and many design choices motivated by, for example, available time, current technology, and economic considerations, when guided by the concepts and principles disclosed herein will be readily capable of generating such software instructions and programs and ICs with minimal experimentation. Therefore, in the interest of brevity and minimization of any risk of obscuring the principles and concepts in accordance to the present invention, further discussion of such software and ICs, if any, will be limited to the essentials with respect to the principles and concepts of the preferred embodiments.



FIG. 1 illustrates a network 10 that may be used to implement a pay-per-use computer system. The network 10 may be the Internet, a virtual private network (VPN), or any other network that allows one or more computers, communication devices, databases, etc., to be communicatively connected to each other. The network 10 may be connected to a personal computer 12 and a computer terminal 14 via an Ethernet 16 and a router 18, and a landline 20. On the other hand, the network 10 may be wirelessly connected to a laptop computer 22 and a personal data assistant 24 via a wireless communication station 26 and a wireless link 28. Similarly, a server 30 may be connected to the network 10 using a communication link 32 and a mainframe 34 may be connected to the network 10 using another communication link 36.


In the case of a pay-per-use or pay-as-you-go model, the elements of FIG. 1 may be used to illustrate system components. Metered devices, that is, pay-per-use or pay-as-you-go hardware and/or software, may be represented by personal computer 12, laptop computer 22, personal data assistant 24, or server 30. The mainframe 34, or one or more servers 30 may represent the infrastructure side of the system, for example, clearinghouse functions, payment system functions, or provisioning system functions, etc.



FIG. 2 illustrates a computing device in the form of a computer 110 that may be connected to the network 10 and used to implement one or more components of the dynamic software provisioning system. Components of the computer 110 may include, but are not limited to, a processing unit 120, a system memory 130, and a system bus 121 that couples various system components including the system memory 130 to the processing unit 120. The system bus 121 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus also known as Mezzanine bus.


The processing unit 120 may also include a secure execution environment 125. In another embodiment, the secure execution environment 125 may be a standalone component, as shown by the dashed lines of FIG. 2. The secure execution environment 125 and its interaction with the processing unit 120, or equivalent devices, is discussed in more detail below with respect to FIG. 3 and FIG. 4.


The computer 110 typically includes a variety of computer readable media. Computer readable media can be any available media that can be accessed by computer 110 and includes both volatile and nonvolatile media, removable and non-removable media. By way of example, and not limitation, computer readable media may comprise computer storage media and communication media. Computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can accessed by computer 110. Communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, radio frequency, infrared and other wireless media. Combinations of the any of the above should also be included within the scope of computer readable media.


The system memory 130 includes computer storage media in the form of volatile and/or nonvolatile memory such as read only memory (ROM) 131 and random access memory (RAM) 132. A basic input/output system 133 (BIOS), containing the basic routines that help to transfer information between elements within computer 110, such as during start-up, is typically stored in ROM 131. RAM 132 typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by processing unit 120. By way of example, and not limitation, FIG. 2 illustrates operating system 134, application programs 135, other program modules 136, and program data 137.


The computer 110 may also include other removable/non-removable, volatile/nonvolatile computer storage media. By way of example only, FIG. 2 illustrates a hard disk drive 140 that reads from or writes to non-removable, nonvolatile magnetic media, a magnetic disk drive 151 that reads from or writes to a removable, nonvolatile magnetic disk 152, and an optical disk drive 155 that reads from or writes to a removable, nonvolatile optical disk 156 such as a CD ROM or other optical media. Other removable/non-removable, volatile/nonvolatile computer storage media that can be used in the exemplary operating environment include, but are not limited to, magnetic tape cassettes, flash memory cards, digital versatile disks, digital video tape, solid state RAM, solid state ROM, and the like. The hard disk drive 141 is typically connected to the system bus 121 through a non-removable memory interface such as interface 140, and magnetic disk drive 151 and optical disk drive 155 are typically connected to the system bus 121 by a removable memory interface, such as interface 150.


The drives and their associated computer storage media discussed above and illustrated in FIG. 2, provide storage of computer readable instructions, data structures, program modules and other data for the computer 110. In FIG. 2, for example, hard disk drive 141 is illustrated as storing operating system 144, application programs 145, other program modules 146, and program data 147. Note that these components can either be the same as or different from operating system 134, application programs 135, other program modules 136, and program data 137. Operating system 144, application programs 145, other program modules 146, and program data 147 are given different numbers here to illustrate that, at a minimum, they are different copies. A user may enter commands and information into the computer 20 through input devices such as a keyboard 162 and pointing device 161, commonly referred to as a mouse, trackball or touch pad. Another input device may be a camera for sending images over the Internet, known as a web cam 163. Other input devices (not shown) may include a microphone, joystick, game pad, satellite dish, scanner, or the like. These and other input devices are often connected to the processing unit 120 through a user input interface 160 that is coupled to the system bus, but may be connected by other interface and bus structures, such as a parallel port, game port or a universal serial bus (USB). A monitor 191 or other type of display device is also connected to the system bus 121 via an interface, such as a video interface 190. In addition to the monitor, computers may also include other peripheral output devices such as speakers 197 and printer 196, which may be connected through an output peripheral interface 195.


The computer 110 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 180. The remote computer 180 may be a personal computer, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to the computer 110, although only a memory storage device 181 has been illustrated in FIG. 2. The logical connections depicted in FIG. 2 include a local area network (LAN) 171 and a wide area network (WAN) 173, but may also include other networks. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets and the Internet.


When used in a LAN networking environment, the computer 110 is connected to the LAN 171 through a network interface or adapter 170. When used in a WAN networking environment, the computer 110 typically includes a modem 172 or other means for establishing communications over the WAN 173, such as the Internet. The modem 172, which may be internal or external, may be connected to the system bus 121 via the user input interface 160, or other appropriate mechanism. In a networked environment, program modules depicted relative to the computer 110, or portions thereof, may be stored in the remote memory storage device. By way of example, and not limitation, FIG. 2 illustrates remote application programs 185 as residing on memory device 181. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used.



FIG. 3 is a block diagram of a secure execution environment 302, the same as, or similar to, the secure execution environment 125 of FIG. 2. The secure execution environment 302 include a secure memory 304. Secure memory 304 may be used to store data, executable programs, cryptographic keys, or other information in a secure, tamper-resistant manner. Specifically, the secure memory 304 may store policy information 306, history data 308 corresponding to previous measurements and/or sanction activity, and a hardware identifier 310 used to identify the computer 110.


The secure execution environment 302 may include a measurement circuit 312 and a sanction circuit 314. The measurement circuit 312 may be used to gather data about the operation of the computer 110, particularly as it relates to conformance to the policy 306. The sanction circuit 314 may be invoked when it is determined that the computer 110 is not operating in conformance to the policy 306. The nature and severity of sanctions may be determined by the policy 306. The measurement circuit 312 and the sanction circuit 314 may also be implemented in software and executed by the processing unit 120.



FIG. 4, a flow chart of a method of tuning product policy, is discussed and described. A data collection policy may be determined at block 402. The data collection policy pertains to those measurements that will be used for tuning the policy and in turn setting operational measurements for measuring compliance to an operating policy. The data collection policy may be a default or a policy initially installed prior to delivery to the end-user.


Measurements may then be taken at block 404 to collect data at the computer according to the data collection policy of block 402. The data collected, for use in determining a risk factor, may include component verification, metering activity, clock verification, previous enforcement action, provisioning packet activity, and application usage. Component verification may include measurements to ensure that certain elements of the computer are present and operating properly, for example peripheral units may be bound to the computer 110 as part of a package. Data collected with respect to metering activity may analyze patterns of metering and duration of metering to determine if they fall within normal or historical usage patterns and if they match other measurements such as application usage. A history of provisioning packet receipt may also be used to determine risk. For example, application usage should not greatly exceed metering, nor should metering greatly exceed value corresponding to provisioning packet downloads.


The collected data may be analyzed locally and results sent to a server, such as server 30 of FIG. 1, at block 406. Alternatively, the raw data may be sent to a server at block 406 with the analysis done at the server.


The data collection policy at block 402 may also specify data to be collected by the server 30 at block 408. Data collected at the server may include commercially available credit data, local data corresponding to payment history, history data about previous sanctions, customer service data such as contact with a support center, and the like.


The data collected both at the computer 110 and at the server may be merged, if both are used, at block 410 and further analyzed to determine a risk factor. The risk factor may then be used to set a risk policy. In one embodiment, the risk factor directly corresponds to a policy, while in another embodiment the risk factor may be used to select from predetermined policies. The policy, or a policy identifier, may be sent to the computer 110 at block 412. The policy may be coded as an XML schema. The policy may be signed or signed and encrypted so that fraudulent policies are not accepted by the computer 110.


In one embodiment, the risk factor or related data may be programmatically exposed, for example, using an application program interface, for sharing with other entities. In some target markets, the risk factor or related data may be the only financial history or record of responsibility available for a user. The risk factor generated by use of the computer 110 may be a valuable first step in developing a recognition of fiscal responsibility and provide a standardized way of quantifying such information. Making such data available, especially programmatically, may be a valuable side effect of the measurements and calculation of risk factor.


When the policy has been verified and installed the computer 110 may resume operation using the updated policy. As discussed above, the policy may include setting criteria for measuring compliance with the policy and may include collection of data corresponding to a periodic signal from the operating system, e.g. an operating system heartbeat. The operating system heartbeat may be a regular signal, in some embodiments, a signed signal, indicating that an approved, valid version of the operating system is running. Other measurements may include some of those taken previously, as well as others, depending on the policy, such as verification of designated files or components, monitoring a system clock for tampering, verification of standard operating modes, frequency and type of memory access, and continued comparison of time between provisioning cycles and metered usage. Measurements may be taken and data stored by the secure execution environment 125.


The measurement data may be analyzed to determine compliance with the policy at block 416. If the measurement data indicates compliance with the policy the yes branch from block 416 may be taken to block 414 and in more measurement data may be collected.


When an analysis of the measurement data at block 416 indicates noncompliance with the policy, the no branch may be taken and a sanction imposed at block 418. Depending on the settings of the policy, a range of sanctions may be imposed, as discussed above, ranging from a warning to disabling the computer 110.


Although the forgoing text sets forth a detailed description of numerous different embodiments of the invention, it should be understood that the scope of the invention is defined by the words of the claims set forth at the end of this patent. The detailed description is to be construed as exemplary only and does not describe every possibly embodiment of the invention because describing every possible embodiment would be impractical, if not impossible. Numerous alternative embodiments could be implemented, using either current technology or technology developed after the filing date of this patent, which would still fall within the scope of the claims defining the invention.


Thus, many modifications and variations may be made in the techniques and structures described and illustrated herein without departing from the spirit and scope of the present invention. Accordingly, it should be understood that the methods and apparatus described herein are illustrative only and are not limiting upon the scope of the invention.

Claims
  • 1. A method of determining and enforcing a risk policy on a pay-per-use device, the method comprising: collecting and storing operational data at the pay-per-use device, wherein the operational data indicates a metered measurement of usage by a user of the pay-per-use device based on user input by the user to the pay-per-use device, wherein the pay-per-use device includes a processor, memory, and an input and/or output device, and the processor of the pay-per-use device is configured to collect and store the operational data and to perform a local analysis of the operational data;collecting and storing user financial data reflecting at least one of payment history or credit data associated with the user;determining a risk factor based on the operational data and the user financial data, the risk factor being associated with the user;setting the risk policy based on the determined risk factor, the risk policy being determined from a plurality of available risk policies, the risk policy including measurement criteria for collecting measurement data by the pay-per-use device to assess compliance with the risk policy when monitoring subsequent activity at the pay-per-use device, wherein the risk policy includes sanctions for non-compliance with the risk policy; andcollecting the measurement data during the subsequent activity at the pay-per-use device to determine compliance with the risk policy, wherein the collecting of the measurement data is performed according to the measurement criteria, and the collecting of the measurement data is accomplished at a tamper resistant secure component using the processor of the pay-per-use device to determine compliance with the risk policy,wherein the measurement criteria for collecting the measurement data at the pay-per-use device are based on both the operational data collected at the pay-per-use device and the user financial data.
  • 2. The method of claim 1, further comprising: analyzing the measurement data at the tamper resistant secure component to determine compliance with the risk policy; andimposing one or more of the sanctions on the pay-per-use device when the tamper resistant secure component determines non-compliance with the risk policy.
  • 3. The method of claim 1, wherein the user financial data is collected at a server separate from the pay-per-use device.
  • 4. The method of claim 1, wherein collecting the data comprises collecting the operational data at the pay-per-use device and reporting the operational data to a server separate from the pay-per-use device.
  • 5. The method of claim 1, wherein the financial data reflects the payment history including at least a frequency of payments by the user.
  • 6. The method of claim 1, wherein the operational data reflects at least one of a component verification, a clock verification, a previous enforcement action, a provisioning packet activity, and an application usage.
  • 7. The method of claim 6, further comprising programmatically exposing the risk factor for use by an external entity.
  • 8. The method of claim 1, wherein the measurement criteria specify that the measurement data includes at least one of an operating system heartbeat, a verification of designated files, a verification of a system clock, an operating mode, a frequency of memory access, or a time between provisioning cycles.
  • 9. The method of claim 1, wherein the measurement criteria specify that the measurement data includes: an operating system heartbeat,a verification of designated files,a verification of a system clock,an operating mode,a frequency of memory access, anda time between provisioning cycles.
  • 10. The method of claim 1, wherein the measurement criteria specify how often the measurement data are collected at the pay-per-use device.
  • 11. The method according to claim 1, wherein the measurement criteria specify particular measurements that are taken at the pay-per-use device to collect the measurement data.
  • 12. The method according to claim 1, wherein the plurality of available risk policies include different measurement criteria that are associated with different payment histories than the payment history associated with the user.
  • 13. The method according to claim 1, wherein the plurality of available risk policies include different measurement criteria that are associated with different credit data than the credit data associated with the user.
  • 14. The method according to claim 1, the risk factor being further based on customer service data reflecting previous contact by the user with a support center.
  • 15. The method according to claim 1, wherein the measurement criteria specify an operating system heartbeat comprising a signed signal indicating that an approved, valid version of an operating system is executing on the pay-per-use device.
  • 16. The method according to claim 1, wherein setting the risk policy comprises replacing another risk policy that is installed on the pay-per-use device prior to delivery of the pay-per-use device to the user.
  • 17. The method according to claim 1 wherein the measurement data identify whether a peripheral unit of the pay-per-use device is present and operating properly.
  • 18. The method according to claim 1, wherein the tamper resistant secure component comprises a secure memory.
  • 19. The method according to claim 1, wherein collecting the measurement data further comprises analyzing whether the measurement data fall within normal or historical usage patterns.
  • 20. The method according to claim 19, further comprising sending the measurement data to a server that analyzes whether the measurement data fall within normal or historical usage patterns.
Parent Case Info

This application is a continuation-in-part of U.S. patent application Ser. No. 11/152,214, filed Jun. 14, 2005, which is a continuation-in-part of U.S. patent application Ser. No. 11/022,493, filed Dec. 22, 2004, which is a continuation-in-part of U.S. patent application Ser. No. 11/006,837, filed Dec. 8, 2004, which is a continuation-in-part of U.S. patent application Ser. No. 10/989,122, filed Nov. 15, 2004.

US Referenced Citations (393)
Number Name Date Kind
4558176 Arnold et al. Dec 1985 A
4620150 Germer et al. Oct 1986 A
4750034 Lem Jun 1988 A
4817094 Lebizay et al. Mar 1989 A
4855730 Venners et al. Aug 1989 A
4855922 Huddleston et al. Aug 1989 A
4857999 Welsh Aug 1989 A
4910692 Outram Mar 1990 A
4959774 Davis Sep 1990 A
4967273 Greenberg Oct 1990 A
5001752 Fischer Mar 1991 A
5012514 Renton Apr 1991 A
5249184 Woest et al. Sep 1993 A
5269019 Peterson et al. Dec 1993 A
5274368 Breeden et al. Dec 1993 A
5301268 Takeda Apr 1994 A
5355161 Bird et al. Oct 1994 A
5369262 Dvorkis et al. Nov 1994 A
5406630 Piosenka et al. Apr 1995 A
5414861 Horning May 1995 A
5437040 Campbell Jul 1995 A
5442704 Holtey Aug 1995 A
5448045 Clark Sep 1995 A
5459867 Adams et al. Oct 1995 A
5473692 Davis Dec 1995 A
5490216 Richardson, III Feb 1996 A
5500897 Hartman, Jr. Mar 1996 A
5513319 Finch et al. Apr 1996 A
5522040 Hofsass et al. May 1996 A
5530846 Strong Jun 1996 A
5552776 Wade et al. Sep 1996 A
5563799 Brehmer et al. Oct 1996 A
5568552 Davis Oct 1996 A
5586291 Lasker et al. Dec 1996 A
5671412 Christiano Sep 1997 A
5710706 Markl et al. Jan 1998 A
5715403 Stefik Feb 1998 A
5724425 Chang et al. Mar 1998 A
5745879 Wyman Apr 1998 A
5754763 Bereiter May 1998 A
5758068 Brandt et al. May 1998 A
5763832 Anselm Jun 1998 A
5768382 Schneier et al. Jun 1998 A
5771354 Crawford Jun 1998 A
5774870 Storey Jun 1998 A
5793839 Farris et al. Aug 1998 A
5802592 Chess Sep 1998 A
5825883 Archibald et al. Oct 1998 A
5841865 Sudia Nov 1998 A
5844986 Davis Dec 1998 A
5845065 Conte et al. Dec 1998 A
5875236 Jankowitz et al. Feb 1999 A
5883670 Sporer et al. Mar 1999 A
5892906 Chou et al. Apr 1999 A
5925127 Ahmad Jul 1999 A
5948061 Merriman Sep 1999 A
5953502 Helbig Sep 1999 A
5956408 Arnold Sep 1999 A
5983238 Becker et al. Nov 1999 A
5994710 Knee et al. Nov 1999 A
6021438 Duvvoori et al. Feb 2000 A
6026293 Osborn Feb 2000 A
6049789 Frison et al. Apr 2000 A
6061794 Angelo et al. May 2000 A
6078909 Knutson Jun 2000 A
6101606 Diersch et al. Aug 2000 A
6119229 Martinez et al. Sep 2000 A
6147773 Taylor Nov 2000 A
6148417 Da Silva Nov 2000 A
6158657 Hall, III et al. Dec 2000 A
6185678 Arbaugh et al. Feb 2001 B1
6188995 Garst et al. Feb 2001 B1
6189146 Misra et al. Feb 2001 B1
6192392 Ginter Feb 2001 B1
6219652 Carter et al. Apr 2001 B1
6223291 Puhl Apr 2001 B1
6226747 Larsson et al. May 2001 B1
6230185 Salas et al. May 2001 B1
6233600 Salas et al. May 2001 B1
6233685 Smith May 2001 B1
6243439 Arai et al. Jun 2001 B1
6253224 Brice, Jr. et al. Jun 2001 B1
6263431 Lovelace et al. Jul 2001 B1
6272469 Koritzinsky et al. Aug 2001 B1
6279111 Jensenworth et al. Aug 2001 B1
6279156 Amberg et al. Aug 2001 B1
6286051 Becker et al. Sep 2001 B1
6289319 Lockwood Sep 2001 B1
6295577 Anderson et al. Sep 2001 B1
6303924 Adan et al. Oct 2001 B1
6314408 Salas et al. Nov 2001 B1
6314409 Schneck et al. Nov 2001 B2
6321335 Chu Nov 2001 B1
6327652 England et al. Dec 2001 B1
6330670 England et al. Dec 2001 B1
6334189 Granger et al. Dec 2001 B1
6345294 O'Toole et al. Feb 2002 B1
6363488 Ginter et al. Mar 2002 B1
6367017 Gray Apr 2002 B1
6373047 Adan et al. Apr 2002 B1
6385727 Cassagnol et al. May 2002 B1
6405923 Seysen Jun 2002 B1
6408170 Schmidt et al. Jun 2002 B1
6411941 Mullor et al. Jun 2002 B1
6424714 Wasilewski et al. Jul 2002 B1
6441813 Ishibashi Aug 2002 B1
6442529 Krishan et al. Aug 2002 B1
6442690 Howard, Jr. et al. Aug 2002 B1
6460140 Schoch et al. Oct 2002 B1
6463534 Geiger et al. Oct 2002 B1
6496858 Frailong et al. Dec 2002 B1
6567793 Hicks et al. May 2003 B1
6571216 Garg et al. May 2003 B1
6585158 Norskog Jul 2003 B2
6587684 Hsu et al. Jul 2003 B1
6609201 Folmsbee Aug 2003 B1
6625729 Angelo Sep 2003 B1
6631478 Wang et al. Oct 2003 B1
6664948 Crane et al. Dec 2003 B2
6671803 Pasieka Dec 2003 B1
6678828 Pham et al. Jan 2004 B1
6690556 Smola et al. Feb 2004 B2
6694000 Ung et al. Feb 2004 B2
6704873 Underwood Mar 2004 B1
6708176 Strunk et al. Mar 2004 B2
6711263 Nordenstam et al. Mar 2004 B1
6716652 Ortlieb et al. Apr 2004 B1
6738810 Kramer et al. May 2004 B1
6763458 Watanabe Jul 2004 B1
6765470 Shinzaki Jul 2004 B2
6791157 Casto et al. Sep 2004 B1
6816809 Circenis Nov 2004 B2
6816900 Vogel et al. Nov 2004 B1
6834352 Shin Dec 2004 B2
6839841 Medvinsky et al. Jan 2005 B1
6844871 Hinckley et al. Jan 2005 B1
6847942 Land et al. Jan 2005 B1
6851051 Bolle et al. Feb 2005 B1
6868433 Philyaw Mar 2005 B1
6871283 Zurko et al. Mar 2005 B1
6920567 Doherty et al. Jul 2005 B1
6934692 Duncan Aug 2005 B1
6934942 Chilimbi Aug 2005 B1
6954728 Kusumoto et al. Oct 2005 B1
6957186 Guheen et al. Oct 2005 B1
6976162 Ellison et al. Dec 2005 B1
6983050 Yacobi et al. Jan 2006 B1
6986042 Griffin Jan 2006 B2
6990174 Eskelinen Jan 2006 B2
6993648 Goodman et al. Jan 2006 B2
7000100 Lacombe et al. Feb 2006 B2
7000829 Harris et al. Feb 2006 B1
7013384 Challener et al. Mar 2006 B2
7028149 Grawrock et al. Apr 2006 B2
7052530 Edlund et al. May 2006 B2
7054468 Yang May 2006 B2
7069442 Sutton, II et al. Jun 2006 B2
7069595 Cognigni et al. Jun 2006 B2
7076652 Ginter et al. Jul 2006 B2
7096469 Kubala et al. Aug 2006 B1
7097357 Johnson et al. Aug 2006 B2
7103574 Peinado et al. Sep 2006 B1
7113912 Stefik Sep 2006 B2
7117183 Blair et al. Oct 2006 B2
7121460 Parsons et al. Oct 2006 B1
7127579 Zimmer Oct 2006 B2
7130951 Christie et al. Oct 2006 B1
7143297 Buchheit et al. Nov 2006 B2
7162645 Iguchi et al. Jan 2007 B2
7171539 Mansell et al. Jan 2007 B2
7174457 England et al. Feb 2007 B1
7207039 Komarla et al. Apr 2007 B2
7234144 Wilt et al. Jun 2007 B2
7236455 Proudler et al. Jun 2007 B1
7266569 Cutter et al. Sep 2007 B2
7299358 Chateau et al. Nov 2007 B2
7353402 Bourne et al. Apr 2008 B2
7356709 Gunyakti et al. Apr 2008 B2
7359807 Frank et al. Apr 2008 B2
7360253 Frank et al. Apr 2008 B2
7392429 Westerinen et al. Jun 2008 B2
7395245 Okamoto et al. Jul 2008 B2
7395452 Nicholson et al. Jul 2008 B2
7406446 Frank et al. Jul 2008 B2
7421413 Frank et al. Sep 2008 B2
7441121 Cutter, Jr. et al. Oct 2008 B2
7441246 Auerbach et al. Oct 2008 B2
7461249 Pearson et al. Dec 2008 B1
7464103 Siu et al. Dec 2008 B2
7490356 Lieblich et al. Feb 2009 B2
7493487 Phillips et al. Feb 2009 B2
7494277 Setala Feb 2009 B2
7519816 Phillips et al. Apr 2009 B2
7539863 Phillips May 2009 B2
7540024 Phillips et al. May 2009 B2
7549060 Bourne et al. Jun 2009 B2
7562220 Frank et al. Jul 2009 B2
7565325 Lenard Jul 2009 B2
7568096 Evans Jul 2009 B2
7596784 Abrams Sep 2009 B2
7610631 Frank et al. Oct 2009 B2
7644239 Westerinen et al. Jan 2010 B2
7669056 Frank Feb 2010 B2
7694153 Ahdout et al. Apr 2010 B2
7770205 Frank Aug 2010 B2
7814532 Cromer et al. Oct 2010 B2
7877607 Circenis Jan 2011 B2
7669056 Frank et al. Feb 2011 C1
7891007 Waxman et al. Feb 2011 B2
7958029 Bobich et al. Jun 2011 B1
7979721 Westerinen et al. Jul 2011 B2
20010034711 Tashenberg Oct 2001 A1
20010056413 Suzuki et al. Dec 2001 A1
20010056539 Pavlin et al. Dec 2001 A1
20020002597 Morrell, Jr. Jan 2002 A1
20020007310 Long Jan 2002 A1
20020023212 Proudler Feb 2002 A1
20020046098 Maggio Apr 2002 A1
20020055906 Katz et al. May 2002 A1
20020091569 Kitaura et al. Jul 2002 A1
20020107701 Batty et al. Aug 2002 A1
20020111916 Coronna et al. Aug 2002 A1
20020112171 Ginter et al. Aug 2002 A1
20020123964 Kramer et al. Sep 2002 A1
20020124212 Nitschke et al. Sep 2002 A1
20020129359 Lichner Sep 2002 A1
20020138549 Urien Sep 2002 A1
20020141451 Gates et al. Oct 2002 A1
20020144131 Spacey Oct 2002 A1
20020147601 Fagan Oct 2002 A1
20020147782 Dimitrova et al. Oct 2002 A1
20020147912 Shmueli et al. Oct 2002 A1
20020178071 Walker et al. Nov 2002 A1
20020184482 Lacombe et al. Dec 2002 A1
20020184508 Bialick et al. Dec 2002 A1
20020193101 McAlinden Dec 2002 A1
20020194132 Pearson et al. Dec 2002 A1
20030005135 Inoue et al. Jan 2003 A1
20030014323 Scheer Jan 2003 A1
20030027549 Kiel et al. Feb 2003 A1
20030028454 Ooho et al. Feb 2003 A1
20030035409 Wang et al. Feb 2003 A1
20030037246 Goodman et al. Feb 2003 A1
20030040960 Eckmann Feb 2003 A1
20030046026 Levy et al. Mar 2003 A1
20030048473 Rosen Mar 2003 A1
20030056107 Cammack et al. Mar 2003 A1
20030084104 Salem et al. May 2003 A1
20030084278 Cromer et al. May 2003 A1
20030084285 Cromer et al. May 2003 A1
20030084337 Simionescu et al. May 2003 A1
20030084352 Schwartz et al. May 2003 A1
20030088500 Shinohara et al. May 2003 A1
20030093694 Medvinsky et al. May 2003 A1
20030097596 Muratov et al. May 2003 A1
20030110388 Pavlin et al. Jun 2003 A1
20030115458 Song Jun 2003 A1
20030126519 Odorcic Jul 2003 A1
20030131252 Barton Jul 2003 A1
20030135380 Lehr et al. Jul 2003 A1
20030149671 Yamamoto et al. Aug 2003 A1
20030156572 Hui et al. Aug 2003 A1
20030156719 Cronce Aug 2003 A1
20030163383 Engelhart Aug 2003 A1
20030163712 LaMothe et al. Aug 2003 A1
20030172376 Coffin, III et al. Sep 2003 A1
20030185395 Lee et al. Oct 2003 A1
20030188165 Sutton et al. Oct 2003 A1
20030196102 McCarroll Oct 2003 A1
20030196106 Erfani et al. Oct 2003 A1
20030208338 Challener et al. Nov 2003 A1
20030208573 Harrison et al. Nov 2003 A1
20030229702 Hensbergen et al. Dec 2003 A1
20040001088 Stancil et al. Jan 2004 A1
20040003190 Childs et al. Jan 2004 A1
20040003288 Wiseman et al. Jan 2004 A1
20040010440 Lenard et al. Jan 2004 A1
20040019456 Cirenis Jan 2004 A1
20040023636 Gurel et al. Feb 2004 A1
20040030912 Merkle, Jr. et al. Feb 2004 A1
20040034816 Richard Feb 2004 A1
20040039916 Aldis et al. Feb 2004 A1
20040039924 Baldwin et al. Feb 2004 A1
20040039960 Kassayan Feb 2004 A1
20040044629 Rhodes et al. Mar 2004 A1
20040054907 Chateau et al. Mar 2004 A1
20040054908 Circenis et al. Mar 2004 A1
20040054909 Serkowski et al. Mar 2004 A1
20040059937 Nakano Mar 2004 A1
20040064707 McCann et al. Apr 2004 A1
20040067746 Johnson Apr 2004 A1
20040073670 Chack et al. Apr 2004 A1
20040088548 Smetters et al. May 2004 A1
20040093371 Burrows et al. May 2004 A1
20040093508 Foerstner et al. May 2004 A1
20040107359 Kawano et al. Jun 2004 A1
20040107368 Colvin Jun 2004 A1
20040123127 Teicher et al. Jun 2004 A1
20040125755 Roberts Jul 2004 A1
20040128251 Adam et al. Jul 2004 A1
20040133794 Kocher et al. Jul 2004 A1
20040139027 Molaro Jul 2004 A1
20040193919 Dabbish et al. Sep 2004 A1
20040199769 Proudler Oct 2004 A1
20040205357 Kuo et al. Oct 2004 A1
20040220858 Maggio Nov 2004 A1
20040225894 Colvin Nov 2004 A1
20040255000 Simionescu et al. Dec 2004 A1
20040268120 Mirtal et al. Dec 2004 A1
20050015343 Nagai et al. Jan 2005 A1
20050021944 Craft et al. Jan 2005 A1
20050028000 Bulusu et al. Feb 2005 A1
20050033747 Wittkotter Feb 2005 A1
20050039013 Bajikar et al. Feb 2005 A1
20050044197 Lai Feb 2005 A1
20050050355 Graunke Mar 2005 A1
20050060388 Tatsumi et al. Mar 2005 A1
20050065880 Amato et al. Mar 2005 A1
20050080701 Tunney et al. Apr 2005 A1
20050091104 Abraham Apr 2005 A1
20050097204 Horowitz et al. May 2005 A1
20050102181 Scroggie et al. May 2005 A1
20050108547 Sakai May 2005 A1
20050108564 Freeman et al. May 2005 A1
20050120251 Fukumori Jun 2005 A1
20050125673 Cheng et al. Jun 2005 A1
20050129296 Setala Jun 2005 A1
20050132150 Jewell et al. Jun 2005 A1
20050138370 Goud et al. Jun 2005 A1
20050138389 Catherman et al. Jun 2005 A1
20050138423 Ranganathan Jun 2005 A1
20050141717 Cromer et al. Jun 2005 A1
20050144099 Deb et al. Jun 2005 A1
20050166051 Buer Jul 2005 A1
20050182921 Duncan Aug 2005 A1
20050182940 Sutton Aug 2005 A1
20050188843 Edlund et al. Sep 2005 A1
20050203801 Morgenstern et al. Sep 2005 A1
20050213761 Walmsley et al. Sep 2005 A1
20050216577 Durham et al. Sep 2005 A1
20050221766 Brizek et al. Oct 2005 A1
20050235141 Ibrahim et al. Oct 2005 A1
20050240533 Cutter et al. Oct 2005 A1
20050246521 Bade et al. Nov 2005 A1
20050246525 Bade et al. Nov 2005 A1
20050246552 Bade et al. Nov 2005 A1
20050257073 Bade Nov 2005 A1
20050275866 Corlett Dec 2005 A1
20050278519 Luebke et al. Dec 2005 A1
20050279827 Mascavage et al. Dec 2005 A1
20050286476 Crosswy et al. Dec 2005 A1
20050289177 Hohmann, II et al. Dec 2005 A1
20050289343 Tahan Dec 2005 A1
20060010326 Bade et al. Jan 2006 A1
20060015717 Liu et al. Jan 2006 A1
20060015718 Liu et al. Jan 2006 A1
20060015732 Liu Jan 2006 A1
20060020784 Jonker et al. Jan 2006 A1
20060026418 Bade Feb 2006 A1
20060026419 Arndt et al. Feb 2006 A1
20060026422 Bade et al. Feb 2006 A1
20060055506 Nicolas Mar 2006 A1
20060072748 Buer Apr 2006 A1
20060072762 Buer Apr 2006 A1
20060074600 Sastry et al. Apr 2006 A1
20060075014 Tharappel et al. Apr 2006 A1
20060075223 Bade et al. Apr 2006 A1
20060085634 Jain et al. Apr 2006 A1
20060085637 Pinkas Apr 2006 A1
20060085844 Buer et al. Apr 2006 A1
20060089917 Strom et al. Apr 2006 A1
20060090084 Buer Apr 2006 A1
20060100010 Gatto et al. May 2006 A1
20060106845 Frank et al. May 2006 A1
20060106920 Steeb et al. May 2006 A1
20060107306 Thirumalai et al. May 2006 A1
20060107328 Frank et al. May 2006 A1
20060107335 Frank et al. May 2006 A1
20060112267 Zimmer et al. May 2006 A1
20060117177 Buer Jun 2006 A1
20060129824 Hoff et al. Jun 2006 A1
20060130130 Kablotsky Jun 2006 A1
20060143431 Rothman Jun 2006 A1
20060165005 Frank et al. Jul 2006 A1
20060168664 Frank et al. Jul 2006 A1
20060206618 Zimmer et al. Sep 2006 A1
20060213997 Frank et al. Sep 2006 A1
20060282319 Maggio Dec 2006 A1
20060282899 Raciborski Dec 2006 A1
20070033102 Frank et al. Feb 2007 A1
20070280422 Setala Dec 2007 A1
20090070454 McKinnon et al. Mar 2009 A1
20120137127 Jain May 2012 A1
Foreign Referenced Citations (73)
Number Date Country
1531673 Sep 2004 CN
0635790 Jan 1995 EP
0843449 May 1998 EP
1061465 Dec 2000 EP
1085396 Mar 2001 EP
1387237 Feb 2004 EP
1429224 Jun 2004 EP
1223722 Aug 2004 EP
1460514 Sep 2004 EP
1233337 Aug 2005 EP
2359969 Sep 2001 GB
2378780 Feb 2003 GB
H0535461 Feb 1993 JP
H0635718 Feb 1994 JP
H07036559 Feb 1995 JP
H07141153 Jun 1995 JP
H086729 Jan 1996 JP
2001526550 May 1997 JP
H09185504 Jul 1997 JP
H9251494 Sep 1997 JP
2000293369 Oct 2000 JP
2001051742 Feb 2001 JP
2003510684 Mar 2001 JP
2001101033 Apr 2001 JP
2003510713 Apr 2001 JP
2001184472 Jul 2001 JP
2001312325 Nov 2001 JP
2001331229 Nov 2001 JP
2001338233 Dec 2001 JP
2002108478 Apr 2002 JP
2002108870 Apr 2002 JP
2002374327 Dec 2002 JP
2003507785 Feb 2003 JP
2003140761 May 2003 JP
2003140762 May 2003 JP
2003157335 May 2003 JP
2003208314 Jul 2003 JP
2003248522 Sep 2003 JP
2003296487 Oct 2003 JP
2002182562 Jan 2004 JP
2004062561 Feb 2004 JP
2004118327 Apr 2004 JP
2004164491 Jun 2004 JP
2004295846 Oct 2004 JP
2004304755 Oct 2004 JP
2007525774 Sep 2007 JP
H08-054952 Feb 2011 JP
2001-805 Jan 2001 KR
20010000805 Jan 2001 KR
2002-37453 May 2002 KR
20020037453 May 2002 KR
2005-8439 Jan 2005 KR
20050008439 Jan 2005 KR
2005-21782 Mar 2005 KR
20050021782 Mar 2005 KR
WO-9721162 Jun 1997 WO
WO-9811478 Mar 1998 WO
WO-0054126 Sep 2000 WO
WO-0135293 May 2001 WO
WO-0145012 Jun 2001 WO
WO-0163512 Aug 2001 WO
WO-0177795 Oct 2001 WO
WO-0193461 Dec 2001 WO
WO-0208969 Jan 2002 WO
WO-02056155 Jul 2002 WO
WO-02103495 Dec 2002 WO
WO-03009115 Jan 2003 WO
WO-03030434 Apr 2003 WO
WO-03073688 Sep 2003 WO
WO-03107585 Dec 2003 WO
WO-03107588 Dec 2003 WO
WO-2004092886 Oct 2004 WO
WO-2007032974 Mar 2007 WO
Related Publications (1)
Number Date Country
20060107306 A1 May 2006 US
Continuation in Parts (4)
Number Date Country
Parent 11152214 Jun 2005 US
Child 11224635 US
Parent 11022493 Dec 2004 US
Child 11152214 US
Parent 11006837 Dec 2004 US
Child 11022493 US
Parent 10989122 Nov 2004 US
Child 11006837 US