Methods and systems for associating fees with transmissions of illusory identification characteristics are provided.
In one aspect, a method includes but is not limited to associating one or more fees with a transmission of one or more illusory identification characteristics associated with one or more first users to one or more second users; and charging the one or more fees to one or more user accounts. In addition to the foregoing, other method aspects are described in the claims, drawings, and text forming a part of the present disclosure.
In one or more various aspects, related systems include but are not limited to circuitry and/or programming for effecting the herein-referenced method aspects; the circuitry and/or programming can be virtually any combination of hardware, software, and/or firmware configured to effect the herein-referenced method aspects depending upon the design choices of the system designer.
In one aspect, a system includes but is not limited to means for associating one or more fees with a transmission of one or more illusory identification characteristics associated with one or more first users to one or more second users; and means for charging the one or more fees to one or more user accounts. In addition to the foregoing, other system aspects are described in the claims, drawings, and text forming a part of the present disclosure.
In addition to the foregoing, various other method and/or system and/or program product aspects are set forth and described in the teachings such as text (e.g., claims and/or detailed description) and/or drawings of the present disclosure.
The foregoing is a summary and thus may contain simplifications, generalizations, inclusions, and/or omissions of detail; consequently, those skilled in the art will appreciate that the summary is illustrative only and is NOT intended to be in any way limiting. Other aspects, features, and advantages of the devices and/or processes and/or other subject matter described herein will become apparent in the teachings set forth herein.
In the following detailed description, reference is made to the accompanying drawings, which form a part hereof. In the drawings, similar symbols typically identify similar components, unless context dictates otherwise. The illustrative embodiments described in the detailed description, drawings, and claims are not meant to be limiting. Other embodiments may be utilized, and other changes may be made, without departing from the spirit or scope of the subject matter presented here.
Although the first user 101A and second user 101B may be shown/described herein as a single illustrated figure, those skilled in the art will appreciate that the first user 101A and second user 101B may be representative of a human user, a robotic user (e.g., computational entity), and/or substantially any combination thereof (e.g., a user may be assisted by one or more robotic agents). The first user 101A and/or the second user 101B may include, but are not limited to, a voicemail service, a text messaging service, a web-based application service, and the like.
The carrier/service provider server 100 may be an integrated or distributed server system associated with one or more communications networks. Numerous types of communications networks 113 may be used. Examples of communications networks may include, but are not limited to, a voice over internet protocol (VoIP) network (e.g. networks maintained by Vonage®, Verizon®, Sprint®), a cellular network (e.g. networks maintained by Verizon®, Sprint®, AT&T®, T-Mobile®), a text messaging network (e.g. an SMS system in GSM), and an e-mail system (e.g. an IMAP, POP3, SMTP, and/or HTTP e-mail server), and the like.
The carrier/service provider server 100 may include a communications data transceiver module 102. Numerous types of communications data transceiver modules 102 may be used. Examples of communications data transceiver modules 102 may include, but are not limited to, a cellular transceiver, a satellite transceiver and a network portal (e.g. a modem linked to an internet service provider).
The carrier/service provider server 100 may include a processor 103. Numerous types of processors 103 may be used (e.g. general purpose processors such those marketed by Intel® and AMD, application specific integrated circuits, and the like). For example, the processor 103 may include, but is not limited to, one or more logic blocks capable of performing one or more computational functions, such as user-ID management logic 103-1, user-authentication logic 103-2, call modification logic 103-3, billing logic 103-4 and/or system access logic 103-5.
The carrier/service provider server 100 may include a memory 104. Numerous types of memory 104 may be used (e.g. RAM, ROM, flash memory, and the like). The memory 104 may include, but is not limited to, a user-ID database 105 including user-ID data for one or more users (e.g. user A data 105A associated with the first user 101A and user B data 105B associated with the second user 101B). A user-ID database item for a user may include one or more fields including user identity data. For example, the user A data 105A may include non-illusory ID data 105-1A, one or more illusory ID data (e.g. illusory ID data 105-2A, 105-2A′, 105-2A″, etc.), and/or user identity authentication data 105-3A. The user B data 105B may include non-illusory ID data 105-1B, one or more illusory ID data (e.g. illusory ID data 105-2B, 105-2B′, 105-2B″, etc.), and/or user ID authentication data 105-3B.
The user A data 105A and/or the user B data 105B may include data representing various identification characteristics of one or more users (e.g. first user 101A and/or second user 101B). The identification characteristics of the one or more users may include, but are not limited to, user names, identification numbers, telephone numbers (and/or area codes, international codes, and the like), images, voice prints, locations, ages, sex, gender, physical trait, and the like. Such identification characteristics may be illusory (e.g. the identification characteristic includes one or more fictitious elements with respect to attributes of first user 101A or second user 101B) or non-illusory (e.g. the identification characteristic accurately reflects attributes of the first user 101A or second user 101B).
The first user 101A and the second user 101B may communicate using user communications device 106A and user communications device 106B, respectively. Numerous communications devices may be used. For example, the user communications device 106A and user communications device 106B may include, but are not limited to, a cell phone, satellite phone, Blackberry®, landline phone, a VoIP enabled device and/or computing device (e.g. a desktop or laptop computer). The user communications device 106A and user communications device 106B may include a sensor module 106-1 (e.g. sensor module 106-1A and sensor module 106-1B respectively). Numerous sensor modules may be used. For example, the sensor module 106-1A and/or sensor module 106-1B may include, but is not limited to, one or more of an image capture device (e.g. a digital camera), a microphone, a global positioning system (GPS) receiver, an electromagnetic radiation receiver and/or a biometric sensor (e.g. a voice recognition sensor, a retinal scanner and/or a fingerprint scanner).
The user communications device 106A and user communications device 106B may include a communications module 106-2 (e.g. communications module 106-2A and communications module 106-2B respectively). Numerous communications modules may be used. For example, the communications module 106-2A and/or the communications module 106-2B may include, but are not limited to, one or more of a cellular transceiver, a Bluetooth transceiver, a Wi-Fi transceiver, a satellite transceiver and a network port (e.g. a modem).
The user communications device 106A and user communications device 106B may include a user interface 106-3 (e.g. user interface 106-3A and user interface 106-3B, respectively). Numerous user interfaces may be used. For example, the user interface 106-3A and/or user interface 106-3B may include one or more of a display screen, a touch screen, a keypad, a speaker system and a microphone.
The communications data transceiver module 102 of the carrier/service provider server 100 may transmit financial data 111 to a financial entity 112. Numerous types of financial data 111 may be transmitted. The financial data 111 may include financial transactions (e.g. funds transfers), financial reports (e.g. account statements), financial requests (e.g. credit checks), and the like. Numerous types of financial entities 112 may receive the transmitted financial data 111. The financial entity 112 may include banking systems, credit systems, online payment systems (e.g. PayPal®), bill processing systems, and the like. The financial entity 112 including a user account 112-1 database may be maintained as a component of the carrier/service provider server 100 or as an independent third-party service.
The communications data transceiver module 102 of the carrier/service provider server 100 may transmit financial data 111 to a communications network 113. Numerous types of financial data 111 may be transmitted. The financial data 111 may include financial transactions (e.g. funds transfers), financial reports (e.g. account statements), financial requests (e.g. credit checks), and the like. Numerous types of communications networks 113 may receive the transmitted financial data 111. Networks may include an internet network, an intranet network, and the like. The communications network 113 may include one or more web-servers employing account access programs to provide a user access to financial data 111 regarding at least one user account 112-1.
After a start operation, the operational flow 200 moves to an operation 210. Operation 210 depicts associating one or more fees with a transmission of one or more illusory identification characteristics associated with one or more first users to one or more second users. For example, as shown in
Operation 220 depicts charging the one or more fees to one or more user accounts. For example, as shown in
The operation 302 illustrates associating one or more fees with one or more transmissions of one or more illusory user names associated with the one or more first users to the one or more second users. For example, as shown in
The operation 304 illustrates associating one or more fees with one or more transmissions of one or more illusory user identification numbers associated with the one or more first users to the one or more second users. For example, as shown in
The operation 306 illustrates associating one or more fees with one or more transmissions of one or more illusory telephone numbers associated with the one or more first users to the one or more second users. For example, as shown in
The operation 308 illustrates associating one or more fees with one or more transmissions of one or more illusory area codes associated with the one or more first users to the one or more second users. For example, as shown in
The operation 310 illustrates associating one or more fees with one or more transmissions of one or more illusory voice signatures associated with the one or more first users to the one or more second users. For example, as shown in
The operation 402 illustrates charging the one or more fees to one or more prepaid accounts. For example, as shown in
The operation 404 illustrates charging the one or more fees to one or more banking accounts. For example, as shown in
The operation 406 illustrates charging the one or more fees to one or more credit accounts. For example, as shown in
The operation 408 illustrates charging the one or more fees to one or more subscription accounts. For example, as shown in
The operation 410 illustrates charging the one or more fees to one or more financial accounts at one or more rate structures. For example, as shown in
The operation 530 illustrates posting one or more billing statements to one or more electronic addresses. For example, as shown in
The operation 532 illustrates posting one or more billing statements to one or more selectively accessible electronic addresses. For example, as shown in
The operation 630 illustrates transmitting one or more billing statements to at least one of the one or more first users and the one or more second users. For example, as shown in
The operation 632 illustrates transmitting one or more billing statements to at least one of the one or more first users and the one or more second users according to the one or more illusory user identification characteristics associated with the one or more first users. For example, as shown in
The operation 634 illustrates transmitting one or more billing statements including the one or more illusory user identification characteristics associated with the one or more first users to at least one of the one or more first users and the one or more second users. For example, as shown in
The operation 636 illustrates transmitting one or more billing statements including one or more non-illusory user identification characteristics associated with the one or more first users to at least one of the one or more first users and the one or more second users. For example, as shown in
Operation 730 depicts receiving one or more requests from the one or more first users to associate one or more illusory user identification characteristics with the one or more first users. For example, as shown in
The operation 732 illustrates receiving one or more requests from one or more first users having one or more known identities to associate one or more illusory identification characteristics with the one or more first users. For example, as shown in
The operation 734 illustrates receiving one or more requests from the one or more first users to associate one or more illusory user names with the one or more first users. For example, as shown in
The operation 736 illustrates receiving one or more requests from the one or more first users to associate one or more illusory telephone numbers with the one or more first users. For example, as shown in
Operation 738 illustrates receiving one or more requests from one or more first users having one or more known identities to substitute one or more communications data associated with the one or more first users having one or more known identities with one or more illusory communications data. For example, as shown in
Operation 830 depicts transmitting one or more illusory identification characteristics associated with the one or more first users to the one or more second users. For example, as shown in
The operation 832 illustrates transmitting one or more signals including one or more illusory user identification characteristics associated with the one or more first users to the one or more second users. For example, as shown in
The operation 834 illustrates transmitting one or more illusory identification characteristics associated with the one or more first users to the one or more second users via one or more user interfaces associated with the one or more illusory identification characteristics associated with the one or more first users. For example, as shown in
The operation 836 illustrates transmitting one or more illusory identification characteristics associated with the one or more first users to the one or more second users according to one or more illusory identification characteristic usage parameters. For example, as shown in
The operation 838 illustrates transmitting one or more illusory identification characteristics associated with the one or more first users to the one or more second users in one or more context dependent manners. For example, as shown in
The computing device 1002 includes computer-executable instructions 1010 that when executed on the computing device 1002 cause the computing device 1002 to associate one or more fees with a transmission of one or more illusory identification characteristics associated with a first user to a second user; and charge the one or more fees to one or more user accounts. As referenced above and as shown in
In
The device 1004 may include, for example, a personal digital assistant (PDA), a personal entertainment device, a mobile phone, a laptop computer, a tablet personal computer, a networked computer, a computing system comprised of a cluster of processors, a computing system comprised of a cluster of servers, a workstation computer, or a desktop computer. In another example embodiment, the computing device 1002 is operable to communicate with the device 1004 associated with the user 101 to receive information about the input from the user 101 for performing data access and data processing and presenting an output of the user-health test function at least partly based on the user data.
Further, the device 1004 may include a heterogeneous computing network including two or more of a personal digital assistant (PDA), a personal entertainment device, a mobile phone, a laptop computer, a tablet personal computer, a networked computer, a computing system comprised of a cluster of processors, a computing system comprised of a cluster of servers, a workstation computer, or a desktop computer, operably coupled to a common computing network.
Although a user 101 is shown/described herein as a single illustrated figure, those skilled in the art will appreciate that a user 101 may be representative of a human user, a robotic user (e.g., computational entity), and/or substantially any combination thereof (e.g., a user may be assisted by one or more robotic agents). In addition, a user 101, as set forth herein, although shown as a single entity may in fact be composed of two or more entities. Those skilled in the art will appreciate that, in general, the same may be said of “sender” and/or other entity-oriented terms as such terms are used herein.
All of the above U.S. patents, U.S. patent application publications, U.S. patent applications, foreign patents, foreign patent applications and non-patent publications referred to in this specification and/or listed in any Application Data Sheet, are incorporated herein by reference, to the extent not inconsistent herewith.
Those having skill in the art will recognize that the state of the art has progressed to the point where there is little distinction left between hardware, software, and/or firmware implementations of aspects of systems; the use of hardware, software, and/or firmware is generally (but not always, in that in certain contexts the choice between hardware and software can become significant) a design choice representing cost vs. efficiency tradeoffs. Those having skill in the art will appreciate that there are various vehicles by which processes and/or systems and/or other technologies described herein can be effected (e.g., hardware, software, and/or firmware), and that the preferred vehicle will vary with the context in which the processes and/or systems and/or other technologies are deployed. For example, if an implementer determines that speed and accuracy are paramount, the implementer may opt for a mainly hardware and/or firmware vehicle; alternatively, if flexibility is paramount, the implementer may opt for a mainly software implementation; or, yet again alternatively, the implementer may opt for some combination of hardware, software, and/or firmware. Hence, there are several possible vehicles by which the processes and/or devices and/or other technologies described herein may be effected, none of which is inherently superior to the other in that any vehicle to be utilized is a choice dependent upon the context in which the vehicle will be deployed and the specific concerns (e.g., speed, flexibility, or predictability) of the implementer, any of which may vary. Those skilled in the art will recognize that optical aspects of implementations will typically employ optically-oriented hardware, software, and or firmware.
In some implementations described herein, logic and similar implementations may include software or other control structures suitable to operation. Electronic circuitry, for example, may manifest one or more paths of electrical current constructed and arranged to implement various logic functions as described herein. In some implementations, one or more media are configured to bear a device-detectable implementation if such media hold or transmit a special-purpose device instruction set operable to perform as described herein. In some variants, for example, this may manifest as an update or other modification of existing software or firmware, or of gate arrays or other programmable hardware, such as by performing a reception of or a transmission of one or more instructions in relation to one or more operations described herein. Alternatively or additionally, in some variants, an implementation may include special-purpose hardware, software, firmware components, and/or general-purpose components executing or otherwise invoking special-purpose components. Specifications or other implementations may be transmitted by one or more instances of tangible transmission media as described herein, optionally by packet transmission or otherwise by passing through distributed media at various times.
Alternatively or additionally, implementations may include executing a special-purpose instruction sequence or otherwise invoking circuitry for enabling, triggering, coordinating, requesting, or otherwise causing one or more occurrences of any functional operations described above. In some variants, operational or other logical descriptions herein may be expressed directly as source code and compiled or otherwise invoked as an executable instruction sequence. In some contexts, for example, C++ or other code sequences can be compiled directly or otherwise implemented in high-level descriptor languages (e.g., a logic-synthesizable language, a hardware description language, a hardware design simulation, and/or other such similar mode(s) of expression). Alternatively or additionally, some or all of the logical expression may be manifested as a Verilog-type hardware description or other circuitry model before physical implementation in hardware, especially for basic operations or timing-critical applications. Those skilled in the art will recognize how to obtain, configure, and optimize suitable transmission or computational elements, material supplies, actuators, or other common structures in light of these teachings.
The foregoing detailed description has set forth various embodiments of the devices and/or processes via the use of block diagrams, flowcharts, and/or examples. Insofar as such block diagrams, flowcharts, and/or examples contain one or more functions and/or operations, it will be understood by those within the art that each function and/or operation within such block diagrams, flowcharts, or examples can be implemented, individually and/or collectively, by a wide range of hardware, software, firmware, or virtually any combination thereof. In one embodiment, several portions of the subject matter described herein may be implemented via Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs), digital signal processors (DSPs), or other integrated formats. However, those skilled in the art will recognize that some aspects of the embodiments disclosed herein, in whole or in part, can be equivalently implemented in integrated circuits, as one or more computer programs running on one or more computers (e.g., as one or more programs running on one or more computer systems), as one or more programs running on one or more processors (e.g., as one or more programs running on one or more microprocessors), as firmware, or as virtually any combination thereof, and that designing the circuitry and/or writing the code for the software and or firmware would be well within the skill of one of skill in the art in light of this disclosure. In addition, those skilled in the art will appreciate that the mechanisms of the subject matter described herein are capable of being distributed as a program product in a variety of forms, and that an illustrative embodiment of the subject matter described herein applies regardless of the particular type of signal bearing medium used to actually carry out the distribution. Examples of a signal bearing medium include, but are not limited to, the following: a recordable type medium such as a floppy disk, a hard disk drive, a Compact Disc (CD), a Digital Video Disk (DVD), a digital tape, a computer memory, etc.; and a transmission type medium such as a digital and/or an analog communication medium (e.g., a fiber optic cable, a waveguide, a wired communications link, a wireless communication link (e.g., transmitter, receiver, transmission logic, reception logic, etc.).
With respect to the use of substantially any plural and/or singular terms herein, those having skill in the art can translate from the plural to the singular and/or from the singular to the plural as is appropriate to the context and/or application. The various singular/plural permutations are not expressly set forth herein for sake of clarity.
The herein described subject matter sometimes illustrates different components contained within, or connected with, different other components. It is to be understood that such depicted architectures are merely exemplary, and that in fact many other architectures may be implemented which achieve the same functionality. In a conceptual sense, any arrangement of components to achieve the same functionality is effectively “associated” such that the desired functionality is achieved. Hence, any two components herein combined to achieve a particular functionality can be seen as “associated with” each other such that the desired functionality is achieved, irrespective of architectures or intermedial components. Likewise, any two components so associated can also be viewed as being “operably connected”, or “operably coupled”, to each other to achieve the desired functionality, and any two components capable of being so associated can also be viewed as being “operably couplable”, to each other to achieve the desired functionality. Specific examples of operably couplable include but are not limited to physically mateable and/or physically interacting components, and/or wirelessly interactable, and/or wirelessly interacting components, and/or logically interacting, and/or logically interactable components.
In some instances, one or more components may be referred to herein as “configured to,” “configurable to,” “operable/operative to,” “adapted/adaptable,” “able to,” “conformable/conformed to,” etc. Those skilled in the art will recognize that “configured to” can generally encompass active-state components and/or inactive-state components and/or standby-state components, unless context requires otherwise.
While particular aspects of the present subject matter described herein have been shown and described, it will be apparent to those skilled in the art that, based upon the teachings herein, changes and modifications may be made without departing from the subject matter described herein and its broader aspects and, therefore, the appended claims are to encompass within their scope all such changes and modifications as are within the true spirit and scope of the subject matter described herein. It will be understood by those within the art that, in general, terms used herein, and especially in the appended claims (e.g., bodies of the appended claims) are generally intended as “open” terms (e.g., the term “including” should be interpreted as “including but not limited to,” the term “having” should be interpreted as “having at least,” the term “includes” should be interpreted as “includes but is not limited to,” etc.). It will be further understood by those within the art that if a specific number of an introduced claim recitation is intended, such an intent will be explicitly recited in the claim, and in the absence of such recitation no such intent is present. For example, as an aid to understanding, the following appended claims may contain usage of the introductory phrases “at least one” and “one or more” to introduce claim recitations. However, the use of such phrases should not be construed to imply that the introduction of a claim recitation by the indefinite articles “a” or “an” limits any particular claim containing such introduced claim recitation to claims containing only one such recitation, even when the same claim includes the introductory phrases “one or more” or “at least one” and indefinite articles such as “a” or “an” (e.g., “a” and/or “an” should typically be interpreted to mean “at least one” or “one or more”); the same holds true for the use of definite articles used to introduce claim recitations. In addition, even if a specific number of an introduced claim recitation is explicitly recited, those skilled in the art will recognize that such recitation should typically be interpreted to mean at least the recited number (e.g., the bare recitation of “two recitations,” without other modifiers, typically means at least two recitations, or two or more recitations). Furthermore, in those instances where a convention analogous to “at least one of A, B, and C, etc.” is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., “a system having at least one of A, B, and C” would include but not be limited to systems that have A alone, B alone, C alone, A and B together, A and C together, B and C together, and/or A, B, and C together, etc.). In those instances where a convention analogous to “at least one of A, B, or C, etc.” is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., “a system having at least one of A, B, or C” would include but not be limited to systems that have A alone, B alone, C alone, A and B together, A and C together, B and C together, and/or A, B, and C together, etc.). It will be further understood by those within the art that typically a disjunctive word and/or phrase presenting two or more alternative terms, whether in the description, claims, or drawings, should be understood to contemplate the possibilities of including one of the terms, either of the terms, or both terms. For example, the phrase “A or B” will be typically understood to include the possibilities of “A” or “B” or “A and B.”
In a general sense, those skilled in the art will recognize that the various aspects described herein which can be implemented, individually and/or collectively, by a wide range of hardware, software, firmware, and/or any combination thereof can be viewed as being composed of various types of “electrical circuitry.” Consequently, as used herein “electrical circuitry” includes, but is not limited to, electrical circuitry having at least one discrete electrical circuit, electrical circuitry having at least one integrated circuit, electrical circuitry having at least one application specific integrated circuit, electrical circuitry forming a general purpose computing device configured by a computer program (e.g., a general purpose computer configured by a computer program which at least partially carries out processes and/or devices described herein, or a microprocessor configured by a computer program which at least partially carries out processes and/or devices described herein), electrical circuitry forming a memory device (e.g., forms of memory (e.g., random access, flash, read only, etc.)), and/or electrical circuitry forming a communications device (e.g., a modem, communications switch, optical-electrical equipment, etc.). Those having skill in the art will recognize that the subject matter described herein may be implemented in an analog or digital fashion or some combination thereof.
With respect to the appended claims, those skilled in the art will appreciate that recited operations therein may generally be performed in any order. Also, although various operational flows are presented in a sequence(s), it should be understood that the various operations may be performed in other orders than those that are illustrated, or may be performed concurrently. Examples of such alternate orderings may include overlapping, interleaved, interrupted, reordered, incremental, preparatory, supplemental, simultaneous, reverse, or other variant orderings, unless context dictates otherwise. Furthermore, terms like “responsive to,” “related to” or other past-tense adjectives are generally not intended to exclude such variants, unless context dictates otherwise.
Although specific dependencies have been identified in the claims, it is to be noted that all possible combinations of the features of the claims are envisaged in the present application, and therefore the claims are to be interpreted to include all possible multiple dependencies.
The present application is related to and claims the benefit of the earliest available effective filing date(s) from the following listed application(s) (the “Related Applications”) (e.g., claims earliest available priority dates for other than provisional patent applications or claims benefits under 35 USC §119(e) for provisional patent applications, for any and all parent, grandparent, great-grandparent, etc. applications of the Related Application(s)). For purposes of the USPTO extra-statutory requirements, the present application constitutes a continuation-in-part of U.S. patent application Ser. No. 12/228,664, entitled System and Method for Transmitting Illusory Identification Characteristics, naming Alexander J. Cohen, Edward K. Y. Jung, Royce A. Levien, Robert W. Lord, Mark A. Malamud, William H. Mangione-Smith, John D. Rinaldo, Jr. and Casey Clarence T. Tegreene as inventors, filed Aug. 14, 2008, which is currently co-pending, or is an application of which a currently co-pending application is entitled to the benefit of the filing date. For purposes of the USPTO extra-statutory requirements, the present application constitutes a continuation-in-part of U.S. patent application Ser. No. 12/228,873, entitled System and Method for Transmitting Illusory and Non-Illusory Identification Characteristics, naming Alexander J. Cohen, Edward K. Y. Jung, Royce A. Levien, Robert W. Lord, Mark A. Malamud, William H. Mangione-Smith, John D. Rinaldo, Jr. and Clarence T. Tegreene as inventors, filed Aug. 15, 2008, which is currently co-pending, or is an application of which a currently co-pending application is entitled to the benefit of the filing date. The United States Patent Office (USPTO) has published a notice to the effect that the USPTO's computer programs require that patent applicants reference both a serial number and indicate whether an application is a continuation or continuation-in-part. Stephen G. Kunin, Benefit of Prior-Filed Application, USPTO Official Gazette Mar. 18, 2003, available at http://www.uspto.gov/web/offices/com/sol/og/2003/week11/patbene. htm. The present Applicant Entity (hereinafter “Applicant”) has provided above a specific reference to the application(s) from which priority is being claimed as recited by statute. Applicant understands that the statute is unambiguous in its specific reference language and does not require either a serial number or any characterization, such as “continuation” or “continuation-in-part,” for claiming priority to U.S. patent applications. Notwithstanding the foregoing, Applicant understands that the USPTO's computer programs have certain data entry requirements, and hence Applicant is designating the present application as a continuation-in-part of its parent applications as set forth above, but expressly points out that such designations are not to be construed in any way as any type of commentary and/or admission as to whether or not the present application contains any new matter in addition to the matter of its parent application(s). All subject matter of the Related Applications and of any and all parent, grandparent, great-grandparent, etc. applications of the Related Applications is incorporated herein by reference to the extent such subject matter is not inconsistent herewith.
Number | Name | Date | Kind |
---|---|---|---|
3985972 | Rolin et al. | Oct 1976 | A |
4218738 | Matyas et al. | Aug 1980 | A |
5732138 | Noll et al. | Mar 1998 | A |
5751806 | Ryan | May 1998 | A |
5835856 | Patel | Nov 1998 | A |
5933498 | Schneck et al. | Aug 1999 | A |
6005926 | Mashinsky | Dec 1999 | A |
6026291 | Carlsson et al. | Feb 2000 | A |
6224109 | Yang | May 2001 | B1 |
6351745 | Itakura et al. | Feb 2002 | B1 |
6496931 | Rajchel et al. | Dec 2002 | B1 |
6510236 | Crane et al. | Jan 2003 | B1 |
6522889 | Aarnio | Feb 2003 | B1 |
6529592 | Khan | Mar 2003 | B1 |
6857021 | Schuster et al. | Feb 2005 | B1 |
6985569 | Baker | Jan 2006 | B2 |
6990590 | Hanson et al. | Jan 2006 | B2 |
7133837 | Barnes, Jr. | Nov 2006 | B1 |
7159011 | Knight et al. | Jan 2007 | B1 |
7203315 | Livesay | Apr 2007 | B1 |
7225342 | Takao et al. | May 2007 | B2 |
7275090 | Oeda et al. | Sep 2007 | B2 |
7308251 | Karaoguz | Dec 2007 | B2 |
7310816 | Burns et al. | Dec 2007 | B1 |
7327312 | Harris | Feb 2008 | B1 |
7334267 | Engstrom | Feb 2008 | B2 |
7363024 | Jenkins | Apr 2008 | B2 |
7389541 | Jia et al. | Jun 2008 | B2 |
7400878 | Hassan et al. | Jul 2008 | B2 |
7567936 | Peckover et al. | Jul 2009 | B1 |
7614081 | Prohel et al. | Nov 2009 | B2 |
7616943 | Oesterling | Nov 2009 | B2 |
7627334 | Cohen et al. | Dec 2009 | B2 |
7630495 | Kiiveri et al. | Dec 2009 | B2 |
7634295 | Hayaashi et al. | Dec 2009 | B2 |
20010023432 | Council et al. | Sep 2001 | A1 |
20010031631 | Pitts | Oct 2001 | A1 |
20010034677 | Farhat et al. | Oct 2001 | A1 |
20010034723 | Subramaniam | Oct 2001 | A1 |
20010036822 | Mead et al. | Nov 2001 | A1 |
20020044067 | Ilcisin | Apr 2002 | A1 |
20020099822 | Rubin et al. | Jul 2002 | A1 |
20020169664 | Walker et al. | Nov 2002 | A1 |
20020174073 | Nordman et al. | Nov 2002 | A1 |
20020174363 | Chefalas et al. | Nov 2002 | A1 |
20020177449 | McDonnell et al. | Nov 2002 | A1 |
20020188562 | Igarashi et al. | Dec 2002 | A1 |
20020198777 | Yuasa | Dec 2002 | A1 |
20030008672 | Fujii | Jan 2003 | A1 |
20030009593 | Apte | Jan 2003 | A1 |
20030021413 | Kiiveri et al. | Jan 2003 | A1 |
20030086543 | Raymond | May 2003 | A1 |
20030134645 | Stern et al. | Jul 2003 | A1 |
20030177357 | Chamberlin et al. | Sep 2003 | A1 |
20030217151 | Roese et al. | Nov 2003 | A1 |
20030233329 | Laraki et al. | Dec 2003 | A1 |
20040015553 | Griffin et al. | Jan 2004 | A1 |
20040030932 | Juels et al. | Feb 2004 | A1 |
20040064692 | Kahn et al. | Apr 2004 | A1 |
20040162904 | Eida et al. | Aug 2004 | A1 |
20040178880 | Meyer et al. | Sep 2004 | A1 |
20040181683 | Jia et al. | Sep 2004 | A1 |
20040203776 | Jun | Oct 2004 | A1 |
20040248588 | Pell et al. | Dec 2004 | A1 |
20040255127 | Arnouse | Dec 2004 | A1 |
20050027618 | Zucker et al. | Feb 2005 | A1 |
20050048951 | Saito | Mar 2005 | A1 |
20050084100 | Spies et al. | Apr 2005 | A1 |
20050091543 | Holtzman et al. | Apr 2005 | A1 |
20050114343 | Wesinger, Jr. et al. | May 2005 | A1 |
20050136903 | Kashima et al. | Jun 2005 | A1 |
20050192056 | Karaki | Sep 2005 | A1 |
20050198131 | Appelman et al. | Sep 2005 | A1 |
20050204037 | Levy | Sep 2005 | A1 |
20050232423 | Horvitz et al. | Oct 2005 | A1 |
20060005023 | Homer et al. | Jan 2006 | A1 |
20060026438 | Stern et al. | Feb 2006 | A1 |
20060031369 | Caron et al. | Feb 2006 | A1 |
20060041507 | Novack et al. | Feb 2006 | A1 |
20060052095 | Vazvan | Mar 2006 | A1 |
20060079238 | Liu et al. | Apr 2006 | A1 |
20060123245 | Avidan et al. | Jun 2006 | A1 |
20060167991 | Heikes et al. | Jul 2006 | A1 |
20060168059 | Chang et al. | Jul 2006 | A1 |
20060248011 | Hecht-Nielsen et al. | Nov 2006 | A1 |
20070074046 | Czajkowski et al. | Mar 2007 | A1 |
20070208816 | Baldwin et al. | Sep 2007 | A1 |
20070208947 | Sudo et al. | Sep 2007 | A1 |
20070242827 | Prafullchandra et al. | Oct 2007 | A1 |
20070243880 | Gits et al. | Oct 2007 | A1 |
20070250571 | Griffin, Jr. | Oct 2007 | A1 |
20070250641 | Flannery et al. | Oct 2007 | A1 |
20070264974 | Frank et al. | Nov 2007 | A1 |
20070277235 | Barrett et al. | Nov 2007 | A1 |
20080010665 | Hinton et al. | Jan 2008 | A1 |
20080056468 | Fredlund et al. | Mar 2008 | A1 |
20080071544 | Beaufays et al. | Mar 2008 | A1 |
20080086646 | Pizano | Apr 2008 | A1 |
20080108324 | Moshir et al. | May 2008 | A1 |
20080163365 | Austin et al. | Jul 2008 | A1 |
20080207329 | Wallace et al. | Aug 2008 | A1 |
20080250129 | Carpenter et al. | Oct 2008 | A1 |
20080254817 | Tornkvist | Oct 2008 | A1 |
20080267099 | Curcio et al. | Oct 2008 | A1 |
20080318598 | Fry | Dec 2008 | A1 |
20090005072 | Forstall et al. | Jan 2009 | A1 |
20090081989 | Wuhrer | Mar 2009 | A1 |
20090099701 | Li et al. | Apr 2009 | A1 |
20090109037 | Farmer | Apr 2009 | A1 |
20090170532 | Lee et al. | Jul 2009 | A1 |
20090183215 | McCartie et al. | Jul 2009 | A1 |
20090195445 | DeHaas | Aug 2009 | A1 |
20090215469 | Fisher et al. | Aug 2009 | A1 |
20090227268 | Sorensson et al. | Sep 2009 | A1 |
20090234764 | Friesen | Sep 2009 | A1 |
20090248844 | Sommer et al. | Oct 2009 | A1 |
20090275363 | McGregor et al. | Nov 2009 | A1 |
20090318112 | Vasten | Dec 2009 | A1 |
20100009657 | Dingler et al. | Jan 2010 | A1 |
20100015991 | Evans et al. | Jan 2010 | A1 |
20100071035 | Budko et al. | Mar 2010 | A1 |
Number | Date | Country | |
---|---|---|---|
20100040214 A1 | Feb 2010 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12228664 | Aug 2008 | US |
Child | 12287268 | US | |
Parent | 12228873 | Aug 2008 | US |
Child | 12228664 | US |