1. Field of the Invention
The present invention relates generally to communications networks. More particularly, the present invention relates to a method and apparatus for intelligent delivery and storage of various information service messages to a subscriber including short message service (SMS) messages, particularly in a wireless communications network.
2. Background of Related Art
We are now in what is called the information age. More than ever, the exchange of information, and the ability to do the same, has become an important technical necessity of modern society. With the introduction and now wide usage of the Internet, and the advances in telecommunications, a variety of means for exchanging information have proliferated to bring a great number of people together through the exchange of information.
One way in which information is exchanged is through short messages. A short message is typically a textual such as paging message, e-mail or a voice mail message passed to and/or from various types of communication devices, e.g., cellular telephone handsets, telephones or computers with appropriate modems. A variety of services have been introduced using SMS networks including, for example, integrated electronic mail and fax, integrated paging, interactive banking, and information services such as stock quotes, and airline schedule delivery.
Although the recipient 804 is shown as being a mobile phone handset, the recipient 804 may comprise, e.g., a computer device connected either through the LAN 803 or via a direct modem connection to the WAN (e.g., PTSN or the Internet) 801.
An example of a wireless short message exchange network is described in co-pending and co-owned U.S. patent application Ser. No. 09/322,929, filed Jun. 1, 1999 by the same inventors as herein entitled: “SHORT MESSAGE SERVICE NOTIFICATION IN MULTIPLE SERVICE CENTER SHORT MESSAGE SERVICE NETWORK”, claiming priority from U.S. provisional application No. 60/105,774, filed Oct. 27, 1998, entitled: “PENDING MESSAGE NOTIFICATION SCHEME IN WIRELESS SYSTEM”, both of which are explicitly incorporated herein by reference.
A well known example of a system which delivers short messages is an electronic mail system, commonly referred to as e-mail. E-mail enables a sender to exchange information with a recipient from their respective communication devices, e.g., typically two remotely located computer devices.
An SMS network typically includes one or more short message service center(s) (SMSC) which each provide a store-and-forward mechanism to provide guaranteed delivery of a short message to an intended subscriber. Using the store-and-forward mechanism, delivery of transmitted short messages is guaranteed to the supported subscribers whether or not the intended recipient is “on-line” or active because the transmitted short message is stored within the one SMSC assigned to service the particular recipient subscriber, and later delivered to the intended subscriber recipient from their assigned SMSC once the subscriber recipient again becomes available.
Thus, if a subscriber recipient is inactive when a short message is originally transmitted to them, the short message will be stored at the relevant SMSC servicing the particular subscriber and forwarded once the subscriber again becomes active.
Integrated e-mail and fax, integrated paging, and/or interactive banking, and/or audible information services are all typical services provided by typical SMS network service providers. For example, with integrated e-mail, e-mail messages may be sent to and received from a mobile handset 804 via the Internet, PTSN, and/or a wireless network, as appropriate.
Example audible information services typically available include weather reports, traffic information, entertainment (e.g., movie and concert) information, and/or financial information such as stock quotes, exchange rates, banking and brokerage services, etc. These audible information services are typically delivered using a short message service using, e.g., a voice message and/or e-mail message to the subscriber.
Many of the audible information services provide information which is periodically updated. For example, weather reports, stock quotes, traffic information, etc. may be updated by the sender sending a revised voice message and/or e-mail message to the subscriber, e.g., every hour, three times a day, etc. Because of the periodic updates, certain short messages (i.e., the old ones) might be thought to have a “shelf life” after which they become unreliable. Unfortunately, a recipient receives all short messages addressed to them, and in fact is guaranteed delivery of all messages—including the outdated ones, because of the conventional store-and-forward techniques. Thus, for example, after an extended absence, many superceded stale messages must be sifted through by the recipient before the most current message is retrieved and confirmed.
Oftentimes, the source of a particular short message is not known until the content is reviewed by the recipient, which is typically wasteful of time, particularly after an extended period of absence by the recipient.
For example, a subscriber who subscribes to a stock quote service may periodically receive updated short messages (e.g., e-mail) every, e.g., 15 minutes, 30 minutes, hour, 3 times a day, etc. This is exacerbated by a user who subscribes to more than one information services. Thus, during an extended absence in particular, the subscriber may receive numerous short messages from each of the information services most of which may be out of date by the time they are retrieved by the user.
In particular, several short messages 1010, 1020, 1010A, 1030, 10108, 1010C, 1030A and 1010D are shown in
Short messages may be stored at a server location or at a mobile subscriber 804 of a SMS network, e.g., as described in the referenced co-pending application. The short messages are stored in a memory, often referred as a queue, either in the SMSC which services the subscriber or, after delivery, in the subscriber's receiving communication device, e.g., their mobile handset.
An exemplary conventional queue is shown in
In particular, a first in, first out (FIFO) queue 901 includes N+1 memory blocks, each of which can store all or a portion of a short message. The short messages may initially be stored starting from memory block, 0, with later received message being stored in a later memory block in the FIFO queue 901. Thus, the FIFO queue 901 in this example may be said to grow from memory block 0 in the direction of the memory block N.
The current message pointer 903 holds the location of the short message currently being accessed. A subscriber can typically “scroll” through their short messages in their queue 901 in either direction. For example, when the subscriber indicates that they desire to view the next short message by, e.g., pressing an appropriate key, the short message stored in the memory block i+1 will be accessed, and the value of the current message pointer 903 will change in the proper direction, e.g., from i to i+1. On the other hand, if the subscriber accesses a previous short message, memory block i−1 will be accessed, and the value of the current message pointer 903 will change, e.g., from i to i−1.
As another example, if a subscriber wants to access the short message stored in memory block 0, and if the current message being displayed is the Nth short message (i.e., value of the pointer 903 is N) currently in their queue 901, the subscriber must typically scroll through or otherwise access as many as N short messages by, e.g., pressing an appropriate scroll button N times.
A circularly arranged queue 902 as shown in
In particular, as shown in step 1101 of
A conventional SMSC may keep a message count corresponding to the number of short messages held by the SMSC for the relevant type short messages for later delivery to a particular subscriber, and increment the same every time a new short message of the relevant type is stored and added to the queue as shown in step 1102. For instance, a typical mobile handset of a receiving subscriber may similarly keep a message count corresponding to the number of short messages received by the handset, and similarly increment the count for that type short message every time a new short message is received.
The subscriber may typically delete any particular short message in the queue, typically by scrolling through the message queue to locate the particular short message to be deleted. Once a short message is deleted, the short messages in the queue are “shifted up” to fill the void created by the deletion, and the message count is decremented to update the new number of stored short messages.
In conventional SMSC networks thus far described, each newly received short message of relevant type is automatically appended to a queue for that type service, usually at the end of the relevant message queue.
Some short message service systems allow limited ability to prioritize a particular short message into a priority queue, which operates similarly for all messages with equal priority. Unfortunately, the conventional method of storage of short messages at the receiving subscriber's communication device (and/or at the SMSC before delivery) is disadvantageous in that the subscriber may be required to “scroll through” previous stale or obsolete messages from the same source (e.g., through several old weather reports or several old stock quotes) before accessing the most up-to-date short message from the relevant source.
Conventional SMSCs (or e-mail servers) do not take into account the above described potential multiplicity of short messages from particular information service provider, and thus deliver all short messages, including stale and/or obsolete short messages, when the subscriber again becomes available. Unfortunately, delivery of stale and/or obsolete short messages unnecessarily wastes bandwidth, and is quite inconvenient to the subscriber. Moreover, storage of stale and/or obsolete short messages tend to clutter and waste memory capacity of the relevant SMSCs, e-mail servers, subscriber computers, and/or subscriber computer and/or handsets.
Furthermore, conventional short message delivery and storage methods make it impractical to provide an efficient on-demand update of a particular short message. For instance, a subscriber may send a request to a particular service provider to provide a short message containing the latest update information, e.g., the latest quote of a particular stock. However, when delivered, the latest update short message is typically appended at the end of a potentially large queue including preceding short messages, requiring the subscriber to scroll through the earlier received short messages before access to the requested short message from that sender.
There is thus a need for an architecture and method for delivery and storage of messages in a short message exchange network which provides efficient use of memory in which the messages are stored, which does not require the subscriber to manually select and/or delete obsolete and/or stale messages, and/or which does not require unnecessary delivery by a servicing SMSC of obsolete and/or stale messages.
In accordance with the principles of the present invention, a message exchange network is provided for sending and receiving messages, including information service messages, which allow efficient use of memory space and on-demand updates of information without delivery and/or storage of obsolete and stale messages that are updated by being replaced by a newly received message. The message exchange network according to one aspect of the principles of the present invention comprises receiving at least one message intended for a subscriber of the network, determining whether each of the received messages is an information service message, locating any stored messages corresponding to the same information service, and overwriting any located messages from the same source with the newly received message if the newly received message is determined to be an appropriate information service message:
In accordance with another aspect of the principles of the present invention, a short message service center of an SMS network includes supercedingly updated information service short messages. A new short message intended for the subscriber is received into a storage queue. The new short message is determined to be an information service short message, and stored short messages are reviewed for any previously stored short message from the same information service. A queue control overwrites any located previously stored messages corresponding to the same information service.
In accordance with yet another aspect of the principles of the present invention, a mobile handset includes means for receiving a new message from the network, a storage queue for storing at least one message received from the network, means to determine whether the new message is an information service message, means to locate any previously stored messages corresponding to the same information service, and a queue control means to overwrite any located stored messages corresponding to the information service.
In accordance with another aspect of the principles of the present invention, an electronic mail application comprises means for determining whether a new message received by the computer is an information service message, means for locating from a storage queue of the computer any previously stored message corresponding to the same information service as the new message, and means for overwriting any located stored messages with corresponding to the same information service.
In addition, in accordance with the principles of the present invention, a method of sending, receiving and/or storing messages to and from a communication device in communication with a communications network is provided. A message queue stores at least one message intended for a particular communication device. A new message is received, and it is determined whether the new message is an information service message. If the new message is an information service message, any previously stored messages that correspond to the same information service are replaced with the new message.
Features and advantages of the present invention will become apparent to those skilled in the art from the following description with reference to the drawings, in which:
The present invention provides a method and apparatus for conveniently and efficiently receiving, storing and/or delivering short messages in a message exchange communications network from, e.g., information service providers. Although the following description is given with reference to a preferred embodiment in which the invention is practiced in a short message service network, particularly in a mobile communication network, it would be apparent to one of ordinary skill that the principles of the present invention are equally applicable to any other types of communications networks in which messages are exchanged and stored by subscribers of the network.
The subscriber receives a variety of messages, either as an electronic mail message delivered to the subscriber's computer connected to a communications network, e.g., shown in
An information service provider delivers information, e.g., stock quotes, weather forecast, or traffic information, to a subscriber by sending an information service message. The term “information service message” as used herein refers to a message that contains information that is updateable, such that information contained in a newer message updates information contained in any previous messages by replacement thereof, and renders the information contained in the previous message(s) stale, obsolete, and/or otherwise less relevant.
In contrast to the prior art process illustrated in
In step 101 of
In step 102, the recipient determines whether the newly received message is of the type that requires a superceding update, e.g., an information service message. The present invention contemplates a variety of ways, as will be discussed, in which the determination in step 102 may be made by the message recipient, e.g., a subscriber's mobile handset, an SMSC, an e-mail server, or an e-mail client application
If it is determined that the newly received message does not require superceding updates, then the message stored in a similar manner previously described with regard to a conventional message queue, i.e., the message is appended at the end of the message queue and the message count is incremented as shown in steps 103 and 109.
On the other hand, if the message is determined to be of the type that requires superceding updating, then a message previously stored in the message queue, and from the same message source is searched in step 104. If a previously stored message from the same source is found, the found message is replaced by the newly received message in step 105.
Once the newly received message is stored, either by append or replacement methods, the receipt of the new message is announced as appropriate in steps 106 to 108.
Each of the above steps of
As shown in
The destination address 203 and the origination address 202 identify the addresses of the recipient and the sender of the short message 201, respectively.
The data 205 includes the short messages being delivered, and may further include teleservice specific information, such as, for example, priority information, language information, security information, and the number of pending voice mail messages and the like.
The message Identifier 204 distinguishes a particular message from other message(s) intended for the same subscriber. In a conventional SMS network, the message identifier is typically generated by the SMSC for each message it receives for a particular subscriber by simply assigning the next unused number from a range of numbers, e.g., 0 through 4095.
In a preferred embodiment of the present invention, the message identifier 204 is used to determine if a particular message received is an information service message that is meant to supercedingly replace an existing message already stored in a message queue, e.g., a new price quote for a stock, or a new weather forecast update, etc. As shown in
In a preferred embodiment of the present application, in step 102 of
The message identifier may be assigned, for example, by the SMSC, which tests a received message to determine if it is an information service message and of which service by, for example, looking up the origination address from a look up table that lists various information service providers and their network addresses or by searching the text of the message for a test string, e.g., “weather”, “traffic” or “stock exchange”, and the like.
The message identifier may alternatively be assigned by an information service provider, who may interrogate the SMS network for the message identifier reserved for the type of service that he provides.
Yet another alternative may be to allow the subscriber to assign a particular reserved message identifier to an information service. The subscriber notifies the information service provider of his selection of message identifier for the provider. The service provider would then send all future messages to the subscriber using the selected message identifier.
Regardless of however a message identifier is assigned to a particular information service provider, once assignment is made, the one to one relationship between the network address of the information service provider and the corresponding message identifier makes it possible to identify one given the other. A record of the relationship for all information service providers and the respective message identifier is kept at the mobile handset, at the SMSC, or any other SMS network elements, e.g., a home location register (HLR), a visitor location register (VLR) and/or a mobile service center (MSC), capable of supplying the record to any other network elements that request the information. The record may be kept, for example, in a form of a look-up table.
Alternatively, the origination address 202 or the text of the message 205 rather than the message identifier 204 may be used to determine whether a received message is an information service message type by looking up a table or by searching for a test string as previously described above.
As shown in
The character set 206 defines the character set used for a message, e.g., western (ISO-8859-1) which is usually the default set or the Korean (euc-kr) set, etc. The encoding 207 specifies the content-transfer-encoding type of a message, e.g., 8-bit, quoted-printable, or the base64 encoding. The document type specifies the type of the document the message is in, e.g., text or HTML. The from address 209 specifies the address of the sender of the message. The subject 210 sets the subject of the message. The to address 211 specifies the address of the recipient of the message. The message 212 contains the body or the text of the message.
Any one, or a combination, of from address 209, the subject 211 or the message 212 may used to determine if a particular message received is an information service message. For example, an e-mail application client may use the from address 209 to determine whether the sender of the message is a information service provider, and use the information to replace a previous e-mail message from the same service provider. Alternatively, the subject 211 and/or the message 212 may be searched for a test string, e.g., “weather”, “traffic” or “stock exchange”, and the like.
In a preferred embodiment of the present invention, the e-mail client application creates and maintains a database of information service providers and their e-mail addresses, and thus is able, in step 102, to determine if the newly received message is an information service message by looking up the from address 209 from the database.
Once the determination that the newly received message is an information service message, then in step 104, the mobile handset examines its memory to determine if there is already stored a message having the same message identifier 204 as the newly received message. The e-mail client application may, in step 104, search, in the “in-box” message storage area, a previously stored message having the same from address 209 as the newly received e-mail message. The e-mail client application may examine the subject 210 and/or message 212 if necessary to distinguish between several messages having the same from address, if for example, several services are offered by the same provider (with the same e-mail address).
Alternatively, an e-mail client application may request the information service providers to include a unique identifier, e.g., a number or a text string, in the subject field, for example, to serve as a message identifier. The message identifier would then be used by an e-mail client application in a manner identical to the way in which a mobile handset uses the message identifier 204 to locate supercedingly updateable messages, both the updating and the updated.
In step 105, the previously stored message with the same message identifier, if found in step 104, is overwritten with the newly received message, i.e., the newly received message is stored in the same memory block as the memory block in which the previously was stored, supplanting the now stale and obsolete information in the previous message with the updated latest information contained in the newly received message.
It is to be understood that although not shown in
If it was determined in step 102 that the newly received message is not an information service message or if no previous message to be replaced by the newly received message was located in step 104, the newly received message is appended to the end of the message queue in steps 103 and 109 as previously described in connection with
The present invention further envisions that a subscriber selectable feature can be provided to alert the subscriber in the event of receipt of message(s) of particular import or interest. Thus, in step 106, a determination is made if the newly received message requires alerting of the user, and if so determined, an alert, i.e., flashing message on the display of the handset or the computer, or an audible sound, in step 107.
The controller 302 may be in the form of any conventional microcontroller, microprocessor, or the like, and may implement the above control functions and all of the processes of the present invention via hardware and/or software implementation. In a preferred embodiment of the present invention, the above control functions are implemented by appropriate software stored either in an internal memory of the controller 302 or in the memory 303. The control software is re-configurable/updateable via the communication interface 301 by a network administrator for easy accommodation of upgrade/update of the network.
It can be readily appreciated that the above described principles of the present invention may be implemented in message queues of message servers, e.g., an SMSC or an e-mail server, etc., without undue experiments or difficulties, particularly with the following example of an SMSC in accordance with the principles of the present invention.
For example,
The SMSC 410 may further include a controller 401 that controls the communications between the SMSC 410 and the network 800 via the interfaces 403 and 404, the storage and retrieval of short message(s) in memory 401, and receipt and delivery of short messages to and from the network 800.
The controller 410 may be in the form of any conventional microcontroller, microprocessor, or the like, and may implement the above control functions and all of the processes of the present invention via hardware and/or software implementation. In a preferred embodiment of the present invention, the above control functions are implemented by appropriate software residing either in an internal memory of the controller 410 or in the memory 402. The control software is re-configurable/updateable via the interfaces 403 or 404 by a network administrator for easy accommodation of upgrade/update of the network.
Once the address of the source of the information is ascertained, the communications device 310 sends a request for service to the information service provider having the address, in step 512. The request may be in the form of a mobile originated short message as described in the previously identified co-pending application. If the particular information service provider is capable of providing an on-demand update service, the information service provider sends a message that contains the requested updated information. The mobile handset receives the newly sent message from the information service provider in step 513, and, in step 514, replaces (overwrites) the message being pointed by the current message pointer 502 or 506.
In step 515, because the new message is now being pointed by the current message pointer 502 or 506, the message is immediately displayed on the display 304, saving the subscriber from having to scroll through other messages in order to view the requested updated message.
An alert may be made (either by displaying a flashing message or by an audible beep, etc.) to notify the subscriber of the completion of the requested update.
If the particular information service provider is incapable of responding to a on-demand request for update, the subscriber is notified of the inability to fulfill the request. For example, the handset may be programmed with a timer to “time out” after a predetermined time period without a response from the information service provider, and alert the subscriber of the failure.
An another example of a useful feature of the on-demand updating described above may be a provision of a running balance or call charge information after completion of a call or a transaction.
For example, a request for update can be generated by the handset automatically after each completion of a call, e.g., a voice call, or any other transaction, e.g., sending and receiving of messages, and sent to the network entity that keeps track of subscriber accounts. Thus, the subscriber may be able to instantly view such information as the duration of the last call, a running total usage time. This feature would be particularly useful to update a running balance of a pre-paid account after each use of the network service by the pre-paid account holder. A pre-paid account provides a predetermined amount of usage for which the subscriber pays in advance, and fees for each instances of usage by the subscriber is deducted from the predetermined pre-paid amount. Thus, information about the remaining balance in the pre-paid account after each usage is important and useful for the subscriber who may want to replenish the account in order to avoid possible interruption of service during an important call due to lack of available funds.
It can be appreciated that the above described architectures and methods for receipt, delivery and storage of messages in a message exchange network allows replaceable and/or on-demand update of information service messages while providing efficient use of message storage capacity, while avoiding the annoyance and inconvenience to the subscriber in having to scroll through numerous stale and/or obsolete messages to view the most current up-to-date message and having to manually select and/or delete obsolete and/or stale messages, and while avoiding unnecessary deliveries of the obsolete and stale Messages by message centers.
While the invention has been described with reference to the exemplary embodiments thereof, those skilled in the art will be able to make various modifications to the described embodiments of the invention without departing from the true spirit and scope of the invention. For example, any apparatus or method of the preceding description herein would be equally applicable if practiced with or implemented by any one of a mobile handset, an e-mail client application, an SMSC, an e-mail server or any other equivalent mechanisms, and such substitutions would be within such modifications that do not depart from the true spirit and scope of the present invention.
The present application is a continuation of U.S. application Ser. No. 12/926,122, entitled “Intelligent Queue for Information Teleservice Messages with Superceding Updates”, filed on Oct. 27, 2010, now U.S. Pat. No. 8,019,368; which in turn claims priority from U.S. application Ser. No. 10/865,924, entitled “Intelligent Queue For Information Teleservice Messages With Superceding Updates”, filed on Jun. 14, 2004, now U.S. Pat. No. 7,844,285; which in turn claims priority from U.S. application Ser. No. 09/411,240, entitled “Intelligent Queue For Information Teleservice Messages With Supercedinq Updates”, filed Oct. 4, 1999, now U.S. Pat. No. 6,751,463, issued Jun. 15, 2004, the entirety of all three of which are expressly incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
1103073 | O'Connell | Jul 1914 | A |
4651156 | Martinez | Mar 1987 | A |
4706275 | Kamil | Nov 1987 | A |
4891638 | Davis | Jan 1990 | A |
4891650 | Sheffer | Jan 1990 | A |
4952928 | Carroll et al. | Aug 1990 | A |
5014206 | Scribner et al. | May 1991 | A |
5043736 | Darnell et al. | Aug 1991 | A |
5055851 | Sheffer | Oct 1991 | A |
5068656 | Sutherland | Nov 1991 | A |
5068891 | Marshall | Nov 1991 | A |
5070329 | Jasinaki | Dec 1991 | A |
5081667 | Drori et al. | Jan 1992 | A |
5119104 | Heller | Jun 1992 | A |
5144283 | Arens et al. | Sep 1992 | A |
5161180 | Chavous | Nov 1992 | A |
5177478 | Wagai et al. | Jan 1993 | A |
5193215 | Olmer | Mar 1993 | A |
5208756 | Song | May 1993 | A |
5214789 | George | May 1993 | A |
5218367 | Sheffer et al. | Jun 1993 | A |
5223844 | Mansell et al. | Jun 1993 | A |
5239570 | Koster et al. | Aug 1993 | A |
5265630 | Hartmann | Nov 1993 | A |
5266944 | Caroll et al. | Nov 1993 | A |
5289527 | Tiedemann, Jr. | Feb 1994 | A |
5293642 | Lo | Mar 1994 | A |
5299132 | Wortham | Mar 1994 | A |
5325302 | Izidon et al. | Jun 1994 | A |
5334974 | Simms et al. | Aug 1994 | A |
5343493 | Karimullah et al. | Aug 1994 | A |
5347568 | Moody | Sep 1994 | A |
5351235 | Lahtinen | Sep 1994 | A |
5361212 | Class | Nov 1994 | A |
5363425 | Muffi et al. | Nov 1994 | A |
5374936 | Feng | Dec 1994 | A |
5379451 | Nakagoshi et al. | Jan 1995 | A |
5381338 | Wysocki et al. | Jan 1995 | A |
5387993 | Heller et al. | Feb 1995 | A |
5388147 | Grimes | Feb 1995 | A |
5390339 | Bruckert et al. | Feb 1995 | A |
5394158 | Chia | Feb 1995 | A |
5396227 | Carroll et al. | Mar 1995 | A |
5396558 | Ishiguro et al. | Mar 1995 | A |
5398190 | Wortham | Mar 1995 | A |
5406614 | Hara | Apr 1995 | A |
5408513 | Busch, Jr. et al. | Apr 1995 | A |
5408519 | Pierce et al. | Apr 1995 | A |
5408682 | Ranner et al. | Apr 1995 | A |
5412726 | Nevoux et al. | May 1995 | A |
5418537 | Bird | May 1995 | A |
5423076 | Westergren et al. | Jun 1995 | A |
5432841 | Kimer | Jul 1995 | A |
5434789 | Fraker et al. | Jul 1995 | A |
5438615 | Moen | Aug 1995 | A |
5440621 | Castro | Aug 1995 | A |
5454024 | Lebowitz | Sep 1995 | A |
5457737 | Wen | Oct 1995 | A |
5461390 | Hoshen | Oct 1995 | A |
5465289 | Kennedy, Jr. | Nov 1995 | A |
5469497 | Pierce et al. | Nov 1995 | A |
5470233 | Fruchterman et al. | Nov 1995 | A |
5479408 | Will | Dec 1995 | A |
5479482 | Grimes | Dec 1995 | A |
5485161 | Vaughn | Jan 1996 | A |
5485163 | Singer | Jan 1996 | A |
5485505 | Norman et al. | Jan 1996 | A |
5488563 | Chazelle et al. | Jan 1996 | A |
5494091 | Freeman et al. | Feb 1996 | A |
5497149 | Fast | Mar 1996 | A |
5502761 | Duncan et al. | Mar 1996 | A |
5506893 | Buscher et al. | Apr 1996 | A |
5508931 | Snider | Apr 1996 | A |
5513243 | Kage | Apr 1996 | A |
5515287 | Hakoyama et al. | May 1996 | A |
5519403 | Bickley et al. | May 1996 | A |
5532690 | Hertel | Jul 1996 | A |
5535434 | Siddoway et al. | Jul 1996 | A |
5539398 | Hall et al. | Jul 1996 | A |
5543776 | L'Esperance et al. | Aug 1996 | A |
5552772 | Janky et al. | Sep 1996 | A |
5555286 | Tendler | Sep 1996 | A |
5568119 | Schipper et al. | Oct 1996 | A |
5574648 | Pilley | Nov 1996 | A |
5579372 | Angstrom | Nov 1996 | A |
5588009 | Will | Dec 1996 | A |
5592535 | Klotz | Jan 1997 | A |
5604486 | Lauro et al. | Feb 1997 | A |
5606313 | Allen et al. | Feb 1997 | A |
5606850 | Nakamura | Mar 1997 | A |
5610815 | Gudat et al. | Mar 1997 | A |
5614890 | Fox | Mar 1997 | A |
5615116 | Gudat et al. | Mar 1997 | A |
5621793 | Bednarek et al. | Apr 1997 | A |
5628051 | Salin | May 1997 | A |
5628600 | Pasquini | May 1997 | A |
5633912 | Tsoi | May 1997 | A |
5682600 | Salin | Oct 1997 | A |
5740534 | Ayerst et al. | Apr 1998 | A |
5761618 | Lynch et al. | Jun 1998 | A |
5767795 | Schaphorst | Jun 1998 | A |
5768509 | Gunluk | Jun 1998 | A |
5774533 | Patel | Jun 1998 | A |
5787357 | Salin | Jul 1998 | A |
5794142 | Vanttila et al. | Aug 1998 | A |
5796734 | Izawa et al. | Aug 1998 | A |
5797094 | Houde et al. | Aug 1998 | A |
5797096 | Lupien et al. | Aug 1998 | A |
5802492 | DeLorme et al. | Sep 1998 | A |
5806000 | Vo et al. | Sep 1998 | A |
5822700 | Hult et al. | Oct 1998 | A |
5828740 | Khue et al. | Oct 1998 | A |
5920821 | Seazholtz et al. | Jul 1999 | A |
5930701 | Skog | Jul 1999 | A |
5943399 | Bannister et al. | Aug 1999 | A |
5946629 | Sawyer et al. | Aug 1999 | A |
5946630 | Willars | Aug 1999 | A |
5950130 | Coursey | Sep 1999 | A |
5953398 | Hill | Sep 1999 | A |
5974054 | Couts et al. | Oct 1999 | A |
5978685 | Laiho | Nov 1999 | A |
5987323 | Huotari | Nov 1999 | A |
5998111 | Abe | Dec 1999 | A |
6035025 | Hanson | Mar 2000 | A |
6049710 | Nilsson | Apr 2000 | A |
6055413 | Morse | Apr 2000 | A |
6058300 | Hanson | May 2000 | A |
6064875 | Morgan | May 2000 | A |
6070067 | Nguyen et al. | May 2000 | A |
6075982 | Donovan et al. | Jun 2000 | A |
6081508 | West et al. | Jun 2000 | A |
6101378 | Barabash et al. | Aug 2000 | A |
6122503 | Daly | Sep 2000 | A |
6122520 | Want et al. | Sep 2000 | A |
6148197 | Bridges et al. | Nov 2000 | A |
6148198 | Anderson et al. | Nov 2000 | A |
6149353 | Nilsson et al. | Nov 2000 | A |
6169891 | Gorham et al. | Jan 2001 | B1 |
6173181 | Losh | Jan 2001 | B1 |
6181935 | Gossman et al. | Jan 2001 | B1 |
6188752 | Lesley | Feb 2001 | B1 |
6188911 | Wallentin | Feb 2001 | B1 |
6198431 | Gibson | Mar 2001 | B1 |
6199045 | Giniger et al. | Mar 2001 | B1 |
6205330 | Winbladh | Mar 2001 | B1 |
6208854 | Roberts et al. | Mar 2001 | B1 |
6208870 | Lorello et al. | Mar 2001 | B1 |
6223046 | Hamill-keays et al. | Apr 2001 | B1 |
6226529 | Bruno et al. | May 2001 | B1 |
6249680 | Wax et al. | Jun 2001 | B1 |
6249744 | Morita | Jun 2001 | B1 |
6263212 | Ross et al. | Jul 2001 | B1 |
6266614 | Alumbaugh | Jul 2001 | B1 |
6289373 | Dezonno | Sep 2001 | B1 |
6292669 | Meuronen et al. | Sep 2001 | B1 |
6317594 | Gossman et al. | Nov 2001 | B1 |
6327479 | Mikkola | Dec 2001 | B1 |
6373930 | McConnell et al. | Apr 2002 | B1 |
6529722 | Heinrich | Mar 2003 | B1 |
6744854 | Berrier et al. | Jun 2004 | B2 |
6744858 | Ryan et al. | Jun 2004 | B1 |
6751463 | Lorello et al. | Jun 2004 | B1 |
6771742 | McCalmont et al. | Aug 2004 | B2 |
6771946 | Oyaski | Aug 2004 | B1 |
6775356 | Salvucci et al. | Aug 2004 | B2 |
6888927 | Cruickshank | May 2005 | B1 |
6922565 | Rhodes et al. | Jul 2005 | B2 |
7450935 | Link | Nov 2008 | B1 |
7693511 | Bottrich | Apr 2010 | B2 |
7844285 | Lorello et al. | Nov 2010 | B2 |
8019368 | Lorello et al. | Sep 2011 | B2 |
20020003345 | Stanly | Jan 2002 | A1 |
20030122669 | Filippov | Jul 2003 | A1 |
20030224840 | Frank | Dec 2003 | A1 |
20040158371 | Iggulden | Aug 2004 | A1 |
20040198332 | Lundsgaard | Oct 2004 | A1 |
20040203692 | Schwinke | Oct 2004 | A1 |
20050009576 | Van Bosch | Jan 2005 | A1 |
20050080519 | Oesterling | Apr 2005 | A1 |
20050090236 | Schwinke | Apr 2005 | A1 |
20050107132 | Kamdar | May 2005 | A1 |
20050201357 | Poyhonen | Sep 2005 | A1 |
20050260994 | Losch | Nov 2005 | A1 |
20060007920 | Michel | Jan 2006 | A1 |
20060092023 | Hofbeck | May 2006 | A1 |
Number | Date | Country | |
---|---|---|---|
20120106724 A1 | May 2012 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12926122 | Oct 2010 | US |
Child | 13137748 | US |