All The Claims

1. A wireless communication device for providing channel information comprising:
a housing having a first display and a second display, the housing having a first position exposing the first and second displays and a second position covering the first display and exposing the second display;
a memory configured to store a plurality of media objects that may be shown by the second display; and
a processor, coupled to the second display, configured to change operation of the second display from one media object to another;
a first sensor, supported by the housing and coupled to the processor, configured to cause the processor to cycle through the plurality of applications one-by-one in a particular order; and
a second sensor, supported by the housing and coupled to the processor, configured to cause the processor to cycle through the plurality of applications one-by-one in an order opposite the particular order.
2. The wireless communication device of claim 1, further comprising a select key, coupled to the processor, configured to interact with a media object currently shown by the second display.
3. The wireless communication device of claim 1, wherein the processor executes automatically a particular application when operation of the second display is changed to the particular application.
4. The wireless communication device of claim 1, wherein the processor terminates automatically a particular application when operation of the second display is changed from the particular application.
5. The wireless communication device of claim 1, further comprising a user interface supported by the housing and coupled to the processor, wherein the processor changes operation of the second display to a default application when a predetermined time period of inactivity at the user interface is detected.
6. The wireless communication device of claim 1, wherein the first display is configured to operate at least one configuration setting that controls operation of the second display.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

What is claimed is:

1. A method for reducing the size of a graphics image in a computer system, comprising:
recording a drawing command executed to create a portion of the graphics image; and
compressing said portion of the graphics image using a compression scheme, said compression scheme selected based on said drawing command.
2. A method for reducing the size of a graphics image in a computer system, comprising:
recording a drawing command executed to create a portion of the graphics image in a pixmap;
using said drawing command to update a data structure associated with said pixmap with information; and
compressing one or more sub-images of the graphics image using a compression scheme, each of said sub-images having a location, said location and said compression scheme for each of said sub-images chosen based on said information in said data structure.
3. The method of claim 2, wherein said data structure is associated with said pixmap using a private data field attached to said pixmap.
4. The method of claim 3, wherein said private data field is a pixmap devPrivates field.
5. The method of claim 2, wherein said data structure associated with said pixmap is a series of partially-transparent overlap layers.
6. The method of claim 2, wherein said data structure associated with said pixmap identifies the portion of the pixmap image that was created with a specific drawing command.
7. The method of claim 6, wherein said data structure associated with said pixmap is a bitmask identifying which pixels were rendered with a specific drawing command.
8. The method of claim 6, wherein said data structure associated with said pixmap is a list of rectangles specifying which pixels were rendered with a specific drawing command.
9. The method of claim 2, wherein said compression scheme is an RGB codec.
10. A method for reducing the size of a graphics image in a computer system, comprising:
recording a put image command executed to create a portion of the graphics image in a pixmap;
using said put image command to update a data structure associated with said pixmap with information; and
compressing one or more sub-images of the graphics image using a compression scheme, each of said sub-images having a location, said location and said compression scheme for each of said sub-images chosen based on said information in said data structure.
11. The method of claim 10, wherein said data structure associated with said pixmap is a series of partially-transparent overlap layers.
12. The method of claim 10, wherein said data structure associated with said pixmap identifies the portion of the pixmap image that was created with a specific drawing command.
13. The method of claim 12, wherein said data structure associated with said pixmap is a bitmask identifying which pixels were rendered with a specific drawing command.
14. The method of claim 12, wherein said data structure associated with said pixmap is a list of rectangles specifying which pixels were rendered with a specific drawing command.
15. The method of claim 10, wherein said compression scheme is an RGB codec.
16. A method for reducing the size of a graphics image in a computer system, comprising:
adding a drawn-to region to an RGB region when a put image command is executed;
removing a drawn-to region from said RGB region when an opaque fill command is executed;
compressing said RGB region using a compression scheme, said compression scheme optimized for use with RGB images.
17. The method of claim 16, further comprising intersecting said RGB region with a clip region before said compressing.
18. The method of claim 16, wherein said drawn-to region represents the region to which a command renders.
19. The method of claim 17, wherein said clip region represents the area in which the image may be drawn.
20. The method of claim 16, further comprising storing said RGB region in an RGB-tagging data structure.
21. The method of claim 20, wherein said storing comprises storing said RGB region as a list of rectangles in an RGB-tagging data structure.
22. The method of claim 21, wherein said compressing comprises:
compressing each of said one or more rectangles independently.
23. An apparatus for reducing the size of a graphics image in a computer system, comprising:
a drawing command recorder;
an image compressor coupled to said drawing command recorder.
24. An apparatus for reducing the size of a graphics image in a computer system, comprising:
a drawing command recorder;
a data structure updater coupled to said drawing command recorder; and
an image compressor coupled to said data structure updater.
25. An apparatus for reducing the size of a graphics image in a computer system, comprising:
a put image command recorder;
a data structure updater coupled to said put image command recorder; and
an image compressor coupled to said data structure updater.
26. An apparatus for reducing the size of a graphics image in a computer system, comprising:
a put image command detector;
a drawn-to region to RGB region adder coupled to said put image command detector;
an opaque fill command detector;
a drawn-to region to RGB region remover coupled to said opaque fill command detector;
a memory coupled to said drawn-to region to RGB region adder and to said drawn-to region to RGB region remover; and
an RGB region compressor coupled to said memory.
27. The apparatus of claim 26, further comprising an RGB region clip region intersector coupled to said memory and to said RGB region compressor.
28. The apparatus of claim 26, further comprising an RGB region rectangle list storer coupled to said drawn-to region to RGB region adder, said drawn-to region to RGB region remover and said memory.
29. The apparatus of claim 28, wherein said RGB region compressor comprises an independent rectangle compressor.
30. An apparatus for reducing the size of a graphics image in a computer system, comprising:
means for recording a drawing command executed to create a portion of the graphics image; and
means for compressing said portion of the graphics image using a compression scheme, said compression scheme selected based on said drawing command.
31. An apparatus for reducing the size of a graphics image in a computer system, comprising:
means for recording a drawing command executed to create a portion of the graphics image in a pixmap;
means for using said drawing command to update a data structure associated with said pixmap with information; and
means for compressing one or more sub-images of the graphics image using a compression scheme, each of said sub-images having a location, said location and said compression scheme for each of said sub-images chosen based on said information in said data structure.
32. The apparatus of claim 31, wherein said data structure associated with said pixmap is a series of partially-transparent overlap layers.
33. The apparatus of claim 31, wherein said compression scheme is an RGB codec.
34. The apparatus of claim 31, wherein said data structure associated with said pixmap identifies the portion of the pixmap image that was created with a specific drawing command.
35. The apparatus of claim 34, wherein said data structure associated with said pixmap is a bitmask identifying which pixels were rendered with a specific drawing command.
36. The method of claim 35, wherein said data structure associated with said pixmap is a list of rectangles specifying which pixels were rendered with a specific drawing command.
37. An apparatus for reducing the size of a graphics image in a computer system, comprising:
means for recording a put image command executed to create a portion of the graphics image in a pixmap;
means for using said put image command to update a data structure associated with said pixmap with information; and
means for compressing one or more sub-images of the graphics image using a compression scheme, each of said sub-images having a location, said location and said compression scheme for each of said sub-images chosen based on said information in said data structure.
38. The apparatus of claim 37, wherein said data structure is associated with said pixmap using a private data field attached to said pixmap.
39. The apparatus of claim 38, wherein said private data field is a pixmap devPrivates field.
40. The apparatus of claim 37, wherein said data structure associated with said pixmap is a series of partially-transparent overlap layers.
41. The apparatus of claim 39, wherein said data structure associated with said pixmap identifies the portion of the pixmap image that was created with a specific drawing command.
42. The apparatus of claim 41, wherein said data structure associated with said pixmap is a bitmask identifying which pixels were rendered with a specific drawing command.
43. The apparatus of claim 41, wherein said data structure associated with said pixmap is a list of rectangles specifying which pixels were rendered with a specific drawing command.
44. The apparatus of claim 37, wherein said compression scheme is an RGB codec.
45. An apparatus for reducing the size of a graphics image in a computer system, comprising:
means for adding a drawn-to region to an RGB region when a put image command is executed;
means for removing a drawn-to region from said RGB region when an opaque fill command is executed; and
means for compressing said RGB region using a compression scheme, said compression scheme optimized for use with RGB regions.
46. The apparatus of claim 45, further comprising means for intersecting said RGB region with a clip region before said compressing.
47. The apparatus of claim 45, wherein said drawn-to region represents the region to which a command renders.
48. The apparatus of claim 46, wherein said clip region represents the area in which the image may be drawn.
49. The apparatus of claim 45, further comprising means for storing said RGB region in an RGB-tagging data stricture.
50. The apparatus of claim 49, wherein said means for storing comprises means for storing said RGB region as a list of rectangles in an RGB-tagging data structure.
51. The apparatus of claim 49, wherein said means for compressing comprises:
means for compressing each of said one or more rectangles independently.
52. A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to perform a method for reducing the size of a graphics image in a computer system, the method comprising:
recording a drawing commands executed to create a portion of the graphics image; and
compressing said portion of the graphics image using a compression scheme, said compression scheme selected based on said drawing command.
53. A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to perform a method for reducing the size of a graphics image in a computer system, the method comprising: recording a drawing command executed to create a portion of the graphics image in a pixmap;
using said drawing command to update a data structure associated with said pixmap with information; and
compressing one or more sub-images of the graphics image using a compression scheme, each of said sub-images having a location, said location and said compression scheme for each of said sub-images chosen based on said information in said data structure.
54. A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to perform a method for reducing the size of a graphics image in a computer system, the method comprising:
recording a put image command executed to create a portion of the graphics image in a pixmap;
using said put image command to update a data structure associated with said pixmap with information; and
compressing one or more sub-images of the graphics image using a compression scheme, each of said sub-images having a location, said location and said compression scheme for each of said sub-images chosen based on said information in said data structure.
55. A program storage device readable by a machine, tangibly embodying a program of instructions executable by the machine to perform a method for reducing the size of a graphics image in a computer system, the method comprising:
adding a drawn-to region to an RGB region when a put image command is executed;
removing a drawn-to region from said RGB region when an opaque fill command is executed;
for any non-null RGB region, adding said non-null RGB region to a pixmap RGB region;
intersecting said pixmap RGB region with a clip region, resulting in a clipped RGB region; and
compressing said clipped RGB region using a compression scheme, said compression scheme optimized for use with RGB regions.

1. A system, comprising:
at least one memory storing computer-executable instructions; and
at least one processor, communicatively coupled to the at least one memory, that facilitates execution of the computer-executable instructions to at least:
determine a first number of requests for a service associated with an object of a computing device communicatively coupled as an intermediary between a first computing system and a second computing system, wherein the requests are waiting for respective responses; and
in response to detection of an increase in volume of the requests for the service and in response to detection of a response time of the first computing system meeting a criterion based on a predetermined period of time, modify a parameter defining a second number of the requests for the service that are acceptable by the service.
2. The system of claim 1, wherein the at least one processor further facilitates the execution of the computer-executable instructions to reject at least one of the requests in response to a likelihood of failure of the request meeting a condition.
3. The system of claim 1, wherein the at least one processor further facilitates the execution of the computer-executable instructions to reject at least one of the requests based on a condition.
4. The system of claim 1, wherein the at least one processor further facilitates the execution of the computer-executable instructions to determine a responsiveness of a billing system associated with the middleware tier.
5. The system of claim 1, wherein the at least one processor further facilitates the execution of the computer-executable instructions to assess a quantity of resources of the computing device consumed by an other service that is associated with a billing system to facilitate a determination of acceptance of at least one of the requests.
6. The system of claim 5, wherein the at least one processor further facilitates the execution of the computer-executable instructions to determine the quantity of the resources based on a threshold for a third number of requests, for the service that is associated with the billing system, that are acceptable for execution.
7. The system of claim 1, wherein the at least one processor further facilitates the execution of the computer-executable instructions to determine available resources associated with the object of the application.
8. The system of claim 7, wherein the object is a run-time object.
9. The system of claim 8, wherein at least one of the requests associates an application programming interface with the run-time object.
10. The system of claim 7, wherein the at least one processor further facilitates the execution of the computer-executable instructions to determine that the second number of requests associated with the object of the application that are acceptable for execution.
11. The system of claim 7, wherein the at least one processor further facilitates the execution of the computer-executable instructions to determine the available resources based on a threshold for a third number of requests that are acceptable for execution.
12. The system of claim 1, wherein the at least one processor further facilitates the execution of the computer-executable instructions to differentiate between a billing system associated with a degraded response time and the increase in volume of the requests.
13. The system of claim 12, wherein the at least one processor further facilitates the execution of the computer-executable instructions to reject at least one of the requests in response to detection of a response time of the billing system satisfying another criterion based on another predetermined period of time.
14. The system of claim 1, wherein the at least one processor further facilitates the execution of the computer-executable instructions to vary acceptance of a third number of requests associated with a billing system coupled to the computing device that are concurrently executing.
15. The system of claim 1, wherein the at least one processor further facilitates the execution of the computer-executable instructions to allocate resources between services including the service.
16. The system of claim 1, wherein the at least one processor further facilitates the execution of the computer-executable instructions to provide notification of a rejection of at least one of the requests, wherein the rejection is directed to a client device associated with the request.
17. The system of claim 1, wherein the at least one processor further facilitates the execution of the computer-executable instructions to reject at least one of the requests in response to a service of a billing system coupled to the computing device operating without satisfying predetermined performance metrics.
18. The system of claim 17, wherein the predetermined performance metrics are associated with failure of resources associated with the computing device.
19. The system of claim 1, wherein the server is configured to broker data transmissions between a client device and a billing system that is coupled to the computing device.
20. The system of claim 1, wherein the application is associated with respective functions.
21. The system of claim 1, wherein the object is a run-time object.
22. The system of claim 1, wherein the at least one processor further facilitates the execution of the computer-executable instructions to accept at least one of the requests based on the parameter.
23. A system, comprising:
at least one memory storing computer-executable instructions; and
at least one processor, communicatively coupled to the at least one memory, that facilitates execution of the computer-executable instructions to at least:
determine a quantity of requests for a service that are waiting for respective responses associated with an object of an application of a computing device communicatively coupled as an intermediary between a first computing system and a second computing system; and
increase a value that indicates a number of the requests for the service that are acceptable by the service in response to detection of a response time of the first computing system not being greater than a predetermined period of time and in response to an increase in the quantity of the requests for the service.
24. The system of claim 23, wherein the computing device is configured to provide an extensible markup language interface to a resource associated with a billing system.
25. The system of claim 23, wherein the requests include a synchronous request.
26. The system of claim 23, wherein the at least one processor further facilitates the execution of the computer-executable instructions to identify a billing system associated with at least one of the requests.
27. The system of claim 23, wherein the at least one processor further facilitates the execution of the computer-executable instructions to reject at least one of the requests and direct a response to a device associated with the at least one of the requests.
28. The system of claim 23, wherein the at least one processor further facilitates the execution of the computer-executable instructions to identify resources that are being employed to process different requests.
29. The system of claim 23, wherein the at least one processor further facilitates the execution of the computer-executable instructions to identify resources associated with at least one of the requests.
30. The system of claim 23, wherein the at least one processor further facilitates the execution of the computer-executable instructions to facilitate access to a status of a service manager component, and control an operation of the service manager component.
31. A method, comprising:
receiving, by a processor based device, a request from a first device;
identifying, by the processor based device based on the request, a quantity of requests for a service associated with an object of an application of a computing device communicatively coupled as an intermediary between a first system and a second system, wherein the requests are waiting for respective responses; and
in response to detecting an increase in the quantity of the requests for the service and detecting a response time of the first system meeting a condition with respect to a predetermined period of time, increasing, by the processor based device, an amount of the requests being accepted.
32. The method of claim 31, further comprising providing, by the processor based device, notification of a rejection of the request directed to the first device.
33. The method of claim 32, wherein the providing further comprises providing, by the processor based device, the notification based on a condition.
34. The method of claim 31, further comprising:
accepting, by the processor based device, the request in response to determining the request is to be accepted; and
processing, by the processor based device, the request.
35. The method of claim 31, further comprising:
rejecting, by the processor based device, the request in response to a number of requests for a resource associated with the request being greater than a predetermined number of requests related to the resource.
36. The method of claim 31, further comprising:
rejecting, by the processor based device, the request in response to a number of requests associated with the object being greater than a predetermined number of requests for the object.
37. The method of claim 31, further comprising:
determining, by the processor based device, a number of requests currently being processed;
increasing, by the processor based device, the number of requests in response to accepting, by the processor based device, the request; and
decreasing, by the processor based device, the number of requests in response to receiving a response to the request.
38. A non-transitory computer readable storage medium comprising computer executable instructions that, in response to execution, cause a computing system including at least one processor to perform operations, comprising:
receiving requests for a service associated with an object of an application of a computing device communicatively coupled as an intermediary between an other computing device and respective clients;
evaluating a quantity of the requests that are waiting for respective responses; and
in response to detecting an increase in the quantity of the requests and detecting a response time of the other computing device satisfying a function of a predetermined period of time, increasing a maximum number of the requests for the service being accepted.
39. The system of claim 1, wherein the at least one processor further facilitates the execution of the computer-executable instructions to perform administration of wireless communication between devices.
40. The system of claim 39, wherein the at least one processor further facilitates the execution of the computer-executable instructions to utilize different services for different predefined markets associated with different client devices.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. A deodorant composition comprising:
(a) a polyphenol compound or a plant extract containing a polyphenol compound,
(b) a basic substance, and
(c) a metal salt.
2. A deodorant composition comprising:
(a) a granulated substance which contains a polyphenol compound or a plant extract containing a polyphenol compound,
(b) a basic substance, and
(c) a metal salt.
3. The deodorant composition according to claim 1 or 2, which further comprises a polyphenol compound oxidase.
4. The deodorant composition according to claim 1 or 2, which further comprises a silicon dioxide.
5. The deodorant composition according to claim 1 or 2, wherein the basic substance is at least one member selected from the group consisting of brine, lye, and a bleach.
6. The deodorant composition according to claim 1 or 2, wherein the metal salt is bittern.
7. A method for deodorizing a malodor, which comprises applying the deodorant composition according to any one of claims 1 to 6 to a malodor component.
8. (canceled)