Initialization and update of software and/or firmware in electronic devices

Information

  • Patent Grant
  • 8468515
  • Patent Number
    8,468,515
  • Date Filed
    Tuesday, December 12, 2006
    18 years ago
  • Date Issued
    Tuesday, June 18, 2013
    11 years ago
Abstract
A system and method to effectively and efficiently update a version of firmware resident in a device memory is provided. A method of identifying one or more versions of firmware is provided by way of initializing a device memory with a known pattern. In addition, the amount of free unused memory space may be identified and calculated in a device memory. The system and method generates software update packages that are minimal in size providing cost benefit to a manufacturer and convenience to a user.
Description
FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

[Not Applicable]


MICROFICHE/COPYRIGHT REFERENCE

[Not Applicable]


TECHNICAL FIELD

The present invention relates generally to the process of updating software in electronic devices in general, and, more specifically, to the specification and subsequent execution of software update activities in such devices.


BACKGROUND OF THE INVENTION

Electronic devices such as mobile phones, personal digital assistants, pagers, and interactive digital appliances have become indispensable as a tool as the number of features and functions they provide increases. As technology continues to evolve, a manufacturer of such devices will find it imperative to update these devices with revised software that enables a number of new features and functions.


The term “software” used herein is intended to include not only software, but also or alternatively firmware. Similarly, the term “firmware” used herein is intended to include not only firmware, but also or alternatively software.


When existing software in memory of an electronic device must be updated as a result of a version upgrade, the new version of the software may require more memory space than the existing version. An attempt to replace the existing version with the new version by replacement with new software may cause a shifting or relocation of adjacent code not related to the application software. Such relocations require the modification of software code in order to provide continued operation of the updated feature or function. These modifications often involve re-compiling any software code that is affected by address references to the relocated code. As a result, the size of an update may be quite large. The effects of shifting and relocation of adjacent software code as a part of a software update may result in significant costs to a manufacturer. Furthermore, the time it takes to update a software may increase due to a large update size, and this provides an inconvenience to any user.


In order to perform a software update, it is important to evaluate the free memory space available should the update size occupy a larger space than the existing software. However, it is often difficult to assess the amount of free or unused memory available in an electronic device's memory because the free space may contain un-initialized random bit patterns. Free or unused memory in electronic devices provided by different manufacturers is usually not initialized, making it difficult to determine the location and size of any unused or free space. When performing updates of firmware in an electronic device, the amount of unused memory required for installation is often critical.


During a manufacturing cycle, a manufacturer typically burns copies of identical software modules for their devices. However, the unused or free space may not have a consistent binary pattern. As a result, any two similar devices with the same make and model may often end up with different memory (ROM, RAM or FLASH) snapshots or images. When attempting to determine the difference between versions of software resident in the memory of any two devices, any unused space in either memory that contains random un-initialized sequences makes it difficult to compare the two.


In the case of mobile handsets, the software that is often updated and stored in read-only memory (ROM) or programmable ROM (PROM) is called firmware. Firmware is often responsible for the behavior of a system when it is first switched on and is used to properly boot up a mobile handset when powered up. The unused memory space generated by a particular firmware image may be filled with a random sequence of binary data. This results in firmware images that are not necessarily consistent across handsets with the same firmware version. In comparing the firmware images from two different handsets of the same type, the firmware may appear to be significantly different from each other, when in reality they may be identical. As a result, it becomes a difficult task to easily identify the version of software loaded in an electronic device based on the image it presents. Further, it becomes difficult to determine whether a device requires an update.


Further limitations and disadvantages of conventional and traditional approaches will become apparent to one of skill in the art, through comparison of such systems with some aspects of the present invention as set forth in the remainder of the present application with reference to the drawings.


BRIEF SUMMARY OF THE INVENTION

A system is provided to effectively update a software and/or firmware in an electronic device. The update system comprises a memory layout preprocessor used in formulating a memory layout of the firmware, a user interface to provide input data from a user, a binary image creator used to generate a firmware initialization binary pattern, a generator to provide a desirable software update package for incorporation into a device memory, a software repository for storing binary image patterns and software modules and objects, an external computer system for storing memory layout specifications, an update agent used for processing the software update package generated by the generator, and an electronic device containing the device memory in which the firmware to be updated is resident.


A method is provided for effectively updating a software and/or firmware in an electronic device. In one embodiment, the version of software resident in a device's memory and the location and size of unused free memory is determined by initializing the device's memory with one or more pre-determined binary patterns. In one embodiment, buffer spaces are inserted between software modules in a device's firmware to allow for expansion of a particular software module by way of a future update. In one embodiment, one or more software modules (or objects) are inserted into pre-configured code expansion slots in device's firmware. The memory space that remains after all objects are inserted into a slot provides buffer space to allow for future updates to these objects.


These and other advantages, aspects, and novel features of the present invention, as well as details of illustrated embodiments, thereof, will be more fully understood from the following description and drawings.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram of a memory initialization and software update system for an electronic device in accordance with an embodiment of the invention.



FIG. 2 is an operational flow diagram illustrating a method of initializing and updating software loaded in a device memory of an electronic device in accordance with an embodiment of the invention.



FIG. 3A is a diagram illustrating a memory image comprising a number of software modules and un-initialized free memory space configured for loading into an electronic device in accordance with an embodiment of the invention.



FIG. 3B is a diagram illustrating a device memory initialized with a pre-determined pattern in accordance with an embodiment of the invention.



FIG. 3C is a diagram illustrating a memory image comprising a number of software modules and initialized free memory space configured for loading into an electronic device in accordance with an embodiment of the invention.



FIG. 4A is a relational block diagram illustrating an arrangement of software modules and remaining free memory space in a device memory in accordance with an embodiment of the invention.



FIG. 4B is a relational block diagram illustrating an arrangement of software modules, a block of random free memory space between two software modules, and remaining free memory space in a device memory in accordance with an embodiment of the invention.



FIG. 5A is a relational block diagram illustrating a number of uniformly sized free memory spaces interspersed between a number of software modules in accordance with an embodiment of the invention.



FIG. 5B is a relational block diagram illustrating a number of software modules and corresponding free memory spaces in which the size of a free memory space is proportional to the size of its corresponding software module in accordance with an embodiment of the invention.



FIG. 6A illustrates an exemplary input that is processed by a layout processor to yield a scatter load file output in accordance with an embodiment of the invention.



FIG. 6B illustrates an exemplary scatter load output from a layout processor in accordance with an embodiment of the invention.



FIG. 7A illustrates the transfer of software from ROM to RAM in firmware without free buffer spaces.



FIG. 7B illustrates the transfer of software from ROM to RAM in firmware with free buffer spaces in accordance with an embodiment of the invention.



FIG. 8 illustrates groupings of object files based on change factors and their relationship to memory addresses in a device memory in accordance with an embodiment of the invention in accordance with an embodiment of the invention.



FIG. 9 provides an illustration of an exemplary scatter load file in accordance with an embodiment of the invention.



FIG. 10 is a block diagram illustrating objects and unused buffer spaces in firmware loaded on a device memory in accordance with an embodiment of the invention.





DETAILED DESCRIPTION OF THE INVENTION


FIG. 1 is a block diagram of a memory initialization and software update system in accordance with an embodiment of the invention. The memory initialization and software update system 105 comprises a generator 107 that generates a software update package for an electronic device 111 with device memory 110 by way of a memory layout specification, a software repository 113, an update agent 109 residing within the electronic device 111 that can apply the update package onto the electronic device 111 to upgrade any existing software resident in the device memory 110 of the electronic device 111, a layout preprocessor 115 that facilitates the introduction of unused memory space for software packages, a user interface 120 to allow input of parameters related to the memory layout specification, and a binary image creator 124 that generates binary image packages for initializing of the device memory 110 of the electronic device 111. The software repository 113 may store software packages generated by the generator 107, as well as binary image packages generated by the binary image creator 124. The software packages generated by the generator 107 comprise software required by the device memory 110 of the electronic device 111 to function properly. The software packages may comprise a number of software modules. Typically, the software (or firmware) is executed upon power up of the electronic device 111 in preparation for normal operation by the user. An external computer system 128 may be used as a source to provide a memory layout specification to the layout preprocessor 115. The terms software package, update package, and software update package used herein includes instructional code that may be processed by the update agent 109 in the creation of updated software in the electronic device 111. Herein, the concept of initializing a device memory 110 by a binary pattern occurs by way of creating a binary data image that is subsequently loaded onto the device memory 110 of the electronic device 111.


The electronic device 111 comprises any electronic device such as an exemplary mobile handset, personal digital assistant (PDA), computer, pager, interactive digital appliance, or the like. Within the electronic device 111 resides a device memory 110 capable of storing and running firmware or software for properly booting up and subsequently operating the electronic device 111. Exemplary device memory 110 includes flash memory, random operating memory (ROM), electrically programmable ROM, or the like.


The software repository 113 may comprise one or more computer storage devices such as a hard drive, optical drive, CD-ROM drive, DVD drive, tape drive, or other like device. As illustrated in FIG. 1, the software repository 113 interfaces with the binary image creator 124 and the generator 107.


The update agent 109 comprises hardware and/or software configured to provide processing of a software package provided to it by the generator 107. The update agent 109 may reside within the electronic device 111.


The external computer system 128 comprises one or more computers in a network providing one or more storage devices with storable media. The external computer system 128 interfaces with the binary image creator 124 or layout preprocessor 115.


The user interface comprises a keyboard or other input device, as well as a monitor or visual communications device capable of permitting a user to input commands and data into the software update system 105.


The binary image creator 124 configures a binary image by way of a memory layout specification for a given device memory 110. The binary image creator 124 may comprise a combination of hardware and software capable of generating binary image patterns. It is contemplated the memory layout specification may be obtained from the device memory 110 or from a storage device within an external computer system 128 or by manual input by way of a user interface 120 connected to the layout preprocessor 115. The memory layout specification provides information regarding the characteristics of the device memory 110 in the electronic device 111. In addition, the size of the unused memory space to be deployed and the location or position of these spaces comprise the memory layout specification.


The layout preprocessor 115 comprises hardware and/or software capable of utilizing a memory layout specification. It generates a layout configuration file often called a scatter load file (to be discussed later) that maps the memory locations of software modules loaded into the device memory 110. The configuration file is then provided to the generator 107 in which a suitable software update package is generated for the electronic device 111.


The generator 107 comprises hardware and software capable of generating a software package for direct incorporation into a device memory image or may store the software package in the software repository 113 for subsequent retrieval and use by one or a plurality of software update systems 105. It is contemplated the software package comprises either a new software package that is loaded in a new electronic device 111 at the time of manufacture or a software update package that is installed as a revision to an existing software package in an electronic device 111. Incorporation of the software package into the device memory 110 is by way of an update agent 109 resident within the electronic device 111. The generator 107 typically creates a software package by comparing an existing software image resident in the device memory 110 of the electronic device 111 to a newer version of the same software that may be stored in the software repository 113 or the external computer system 128. The generator 107 computes differences in the software images and creates an appropriate software package. The update agent 109 in the device 111 is capable of applying the update package onto the electronic device 111 by processing and executing the instructions provided with the software package.


The generator 107 determines that an electronic device 111 requires a software update by way of a binary image previously stored onto the device memory 110 of the electronic device 111 by way of the binary image creator 124. The binary image package may be generated by the binary image creator 124 for use by the generator 107 in the incorporation of new or updated software into the device 111. The binary image package generated by the binary image creator 124 and the software package generated by the generator 107 may be installed into a plurality of electronic devices that are similar or identical in design and function to the electronic device 111. The binary image package may be directly transmitted to the electronic device 111 by the binary image creator 124 for installation into the device memory 110. It is contemplated the update agent 109 may facilitate installation of the binary image. Different binary image packages comprising distinct binary patterns may be created. One or more of these patterns may be installed in a plurality of one or more types of devices as necessary. When interfaced with the generator 107, the different versions of installed binary images in the plurality of electronic devices may be easily analyzed or compared by the generator 107 in order to determine differences in software version. Further, the implementation of these unique binary images or patterns may allow the generator 107 to differentiate unused memory space from software resident in the device memory 111 and calculate any available free or unused memory space. It is contemplated the generator 107 may interface with an electronic device 111 by way of wireless or wireline data communications.


By populating the unused portion of memory with binary patterns characterized by a known and consistent value, a version of software that exists in a particular electronic device 111 may be identified. Further, a comparison of different versions of software resident in a device memory 110 should yield a specific difference image. For example, a generator 107 that is configured to process a difference image may subtract a version n image from a version n+m image to generate a resulting difference image, necessitating that a specific software update package be generated and incorporated into all electronic devices using a version n image.


In general, the binary image creator 124 creates a binary memory image for initialization of the device memory 110. A finalized binary image may be loaded into the device memory 110 by the binary image creator 124 before any software package is loaded onto the device memory 110 by the generator 107. In other instances, software modules may be incorporated into the binary memory image prior to loading. In one embodiment, the binary image creator 124 is responsible for assembling a finalized memory image that is subsequently programmed or flashed into the device memory 110 of the electronic device 111, such as during manufacturing. Furthermore, it is contemplated that predetermined binary images may be stored within the software repository 113 for future use. Predetermined binary images may be comprised of a pattern of binary or hexadecimal characters that create a unique image. For example, the device memory 110 may be initialized with the value 0xFFFF throughout its entire memory. Other values or combination of values may be employed in other embodiments. In one embodiment, the memory of the device memory 110 is segmented into multiple memory sections where each memory section is selectively initialized with a different predetermined memory pattern.


It is contemplated that various software packages representing different versions of software update packages may be saved in the software repository 113 by the generator 107 or loaded directly onto device memory 110 of one or more electronic devices 111. In one embodiment it is contemplated a software package may be incorporated into a binary image and then saved into the software repository 113 for future use by the generator 107. In one embodiment of the present invention, the values of the binary image pattern are consistent across electronic devices 111 with the same software or firmware version. The update agent 109 may serve to facilitate the incorporation of the binary image or software modules into the device memory 110.


In general, the binary image creator 124 may be used to initialize device memory 110 in different types of devices so that subsequent processing by the generator 107 may be accomplished. Such processing includes determining different versions of the same software or determining unused memory locations in a device memory 110.



FIG. 2 is a process flow diagram illustrating an exemplary process of memory image initialization of device memory and subsequent loading of software packages, in accordance with an embodiment of the invention. At step 209, a binary image creator 124, such as that illustrated in FIG. 1, selectively retrieves a memory layout specification from an external computer system 128, from a device memory 110, or from user input through a user interface 120. Information such as number of memory, type of memory, and size of memory is provided by the memory layout specification for use by the binary image creator 124. Next, at step 211, an appropriate binary image pattern configured for use with the memory layout specification is selected and retrieved from a binary image repository 113. Then, at a next block 213, the binary image creator 124 may create one or more images for initializing one or more device memories. The binary image creator 124 accomplishes this by writing or loading the one or more images it creates into one or more electronic devices 111. In other instances, the binary image creator 124 may configure a binary image comprising a pattern suitable for loading into a device memory for eventual or future use. This binary image may be stored in the software repository 113. Subsequently, at step 215, a software repository 107 provides an image of one or more software packages or software module(s) to the electronic device 111 for incorporation into the device memory 110. Software associated with functionality of the update agent 109 may be incorporated into memory by way of modification of the binary image. The resulting image in memory is such that unused or free memory can be identified by means of the initialized pattern(s). In addition, a particular binary pattern may be used in the initialization process to correspond with a particular software package version, type of software, or types of software modules loaded into the device memory 110. In this fashion, a particular software version resident in device memory 110 may be identified. Later, at steps 217 and 219, the initialized binary images with written software module(s) are saved in a software repository 113 or loaded into one or more device memories 110 of electronic devices 111.



FIG. 3A is a block diagram illustrating exemplary software modules and unused free memory space resident in an un-initialized device memory 307 of an electronic device, in accordance with an embodiment of the invention. Exemplary software modules A 309, B 313 and C 315 are distributed in the un-initialized memory 307 with some amount of free memory available 311, 317, although the available free memory 311, 317 may be indistinguishable from memory occupied by the software modules A 309, B 313, and C 315, because the unused free memory 311, 317 is characterized by a random bit pattern. In addition, a comparison of images resident in un-initialized memories of two similar electronic devices by the generator 107 is likely to produce inconsistent difference images. As illustrated in FIG. 3A, unused free memory 317 is typically located at the end of the un-initialized memory 307 and an occasional unused free memory block 311 may occur at random. Software modules A 309, B 313, and C 315 may have adjacent free memory blocks introduced intentionally or by random chance.



FIG. 3B is a block diagram illustrating an exemplary memory image of an initialized device memory 325, in accordance with an embodiment of the invention. Here, the entire memory is initialized with a unique pre-determined pattern. After initialization, the unused memory 327 spans the entire device memory. Because the pattern is known and deterministic, any unused or free memory space within a device memory is easily detected after a software package is loaded into the initialized device memory 325. In addition, the pre-determined pattern provides a recognizable image that may be used as a tag or identifier to identify a particular software version. When comparing a device memory of an earlier software version with a current release version, the exemplary generator 107 shown in FIG. 1 may generate a unique difference image and subsequently correlate this with a corresponding software update package. In one embodiment of initializing a memory, a specific pattern may be employed for an entire device memory. In another embodiment, the device memory is segmented into multiple segments, and different patterns are stored into the different segments of the memory during initialization. In the latter method, it is contemplated the different patterns provide additional means to identify an image.



FIG. 3C is a block diagram of an exemplary embodiment in accordance with the present invention, illustrating software modules A 359, B 363, and C 365 written into initialized device memory 357. The software modules A 359, B 363 and C 365 are written onto memory that is initialized with a specific pattern making it possible to distinguish the available free memory 361367 from memory currently occupied by software modules 359363365. In addition, the pre-determined pattern provides an image that may be used as a tag or identifier to identify a particular software version.


The electronic device 111 may determine a priority of use based upon the specific bit pattern employed in the unused free space. The electronic device 111 may consume portions of unused memory accordingly. For example, one or more portions of unused memory may be coded with a specific binary pattern indicating a priority or preference of use. If the electronic device 111 eliminates any software module, or if any software module relinquishes currently used memory, the released memory space can be selectively re-initialized with one or more specific patterns designating its preference for future use.


In one embodiment, the device memory 110 comprises a FLASH type of memory initialized entirely to a specific pattern comprising hexadecimal values of 0xFFFF. In another embodiment, the device memory 110 comprises four FLASH segments (FLASH1, FLASH2, FLASH3, FLASH4) specified to be 0x20000 in size, plus a RAM segment of size 0x40000. In one embodiment, the FLASH segments and the RAM segment are all initialized to the same pattern. In one embodiment, the FLASH and RAM segments are initialized using one or more patterns.


The layout preprocessor 115 determines available free space in the device memory 110 by way of a memory layout specification provided by the external computer system 128 or one or more electronic devices 111. The preprocessor 115 distributes available free space among individual software modules so as to provide effective and efficient updating of one or more software modules resident in the device memory 110. If the device 111 has extra free space that is currently not being used, the extra free space can be distributed among the available software modules and the software modules can be spread out in memory so as to provide free space segments, called reserved buffer spaces, juxtaposed to the software modules, providing a mechanism to constrain any update related changes to an individual software module and any dedicated free space around it.


In one embodiment of the present invention, one or more memory layout specifications are contained in the layout preprocessor 115 and may be selectively employed by the layout preprocessor 115 to distribute available free space among software modules in a device memory 110 by creating one or more reserved buffer spaces adjacent to each of the software modules. In another embodiment, a memory layout specification is retrieved by the layout preprocessor 115 from an external system 128, such as was described in FIG. 1.


In one embodiment, the memory layout specification specifies the layout of one or more sections of memory on the device, wherein the memory is comprised of one or more sections of FLASH memory and RAM memory. The origin and length of each section of FLASH or RAM is also specified along with assignments of one or more software modules to individual memory sections. The mapping of specific groups of code within a software module loaded onto the various sections of the memory (FLASH RAM) of the device are also specified. The layout preprocessor 115 incorporates the information contained in the memory layout specification in creating the reserved buffer spaces.


In one embodiment, the layout preprocessor 115 reorganizes and locates software modules on the electronic device 111 by computing the available free space and distributing this free space equally among the various software modules as reserved buffer spaces. In general, the layout preprocessor 115 is used as a pre-processing tool in configuring device memory images for different types of electronic devices 111 so that subsequent processing of one or more software modules by the generator 107 is easily performed with minimal change to unmodified software in the device memory 110. The layout preprocessor 115 may insert free spaces into one or more selected software modules in memory as a means to effectively localize changes to software that require additional free space.



FIG. 4A is a block diagram of an exemplary arrangement of software modules in a device memory 405 wherein the software modules A, B, C and D 407, 409, 411, 413 are positioned adjacent to each other without any free memory space separating the modules, according to an embodiment of the invention. Beyond the last module 413 is an unused or free memory segment 415 representing the remainder of unused memory. The software modules A 407, B 409, C 411, and D 413 may or may not be related to each other. Being adjacent to each other without any free memory between may cause a reorganization of links to addresses and references in other modules in order to modify or upgrade any one module. For example, if a new version of software module A 407 is loaded to replace the existing software module A 407, then replacing the existing version with the new version may require more or less memory space than what is currently utilized. Should additional memory space be required, a relocation or shifting of some or all modules B 409, C 411, and D 413 may occur. Relocation of software modules often necessitates changing the addresses of software jumps and references to addresses. Thus, an avalanche or overflow effect may occur in which an update to software module. A 407 results in changes to successive modules B 409, C 411, and D 413. Updates or revision to the last software module 413 may not produce an avalanche or overflow effect since it is adjacent to the free memory space 415 at the end of memory.



FIG. 4B is a block diagram of another exemplary layout of software modules in a memory displaying software modules that are adjacent to each other without free memory between them, according to an embodiment of the invention. As shown, a free memory segment 435 is characteristically located at the end of the memory block 425, and an occasional free memory block 437 may occur at random. It is contemplated the occasional free memory block 437 provides a small free memory space. Specifically, software modules A 427, B 429 and C 431 are adjacent to each other and modules A 427, B 429 do not have any adjacent free memory blocks while software module C 431 has a free memory block 437 adjacent to it, introduced not intentionally, but by random chance.


Such a memory layout may cause an avalanche or overflow effect described above for FIG. 4A, in which changes to any software module due to version upgrades are likely to cause relocation of one or more software modules downstream in the device memory 110. Relocation and shifting of memory may occur despite the occurrence of random free memory blocks 437 because they might not be large enough to accommodate the size requirements of software upgrades due to version changes, patches, or bug fixes.



FIG. 5A is a block diagram of an exemplary layout of software modules created by the layout processor 115 for a device memory 110 wherein uniform sized reserved buffer spaces are placed between the installed software modules A 507, B 509, C 511, and D 513, in accordance with an embodiment of the invention. By introducing reserved buffer spaces 517, 519, 521 and 533 adjacent to software modules A 507, B 509, C 511, and D 513, respectively, the layout processor 115 creates a layout for the software modules that accommodates changes to individual software modules without shifting other installed software modules. In fact, the size of each of the reserved buffer spaces may be adjusted so as to make relocation or shifting of other software modules unnecessary.


In one embodiment, the reserved buffer spaces 517, 519, 521 and 533 are configured to be the same size. In another embodiment, the reserved buffer spaces 517, 519, 521 and 533 vary based on the characteristics of the individual software modules A 507, B 509, C 511 and D 513.



FIG. 5B is a block diagram of an exemplary layout of software modules created by the generator 107 for a device memory 110 wherein non-uniform sized reserved buffer spaces 517, 519, 521 and 533 are positioned between the installed software modules so as to minimize the shifting effects associated with upgrading one or more software modules, according to an embodiment of the invention. Here, the size of each reserved buffer space is proportional to the size of the software module(s) it is associated with. For example, the size of reserved buffer space 517 adjacent to the software module A 507 is selected based upon and in proportion to the size of the corresponding software module A 507. Thus, reserved buffer space 519 is smaller than reserved buffer space 517 because the software module B 509 is smaller than the software module A 507.


The methods described in FIGS. 5A and 5B illustrate an embodiment where reserved buffer spaces are placed between all software modules. Hence, each software module has its own dedicated free memory space.



FIG. 6A illustrates an exemplary input instructional software code that is processed by the layout preprocessor 115 to generate a memory mapping or scatter load file (as will be discussed later) that incorporates reserved buffer spaces between software modules in the device, in accordance with an embodiment of the invention. It depicts a memory that comprises a FLASH segment of size 0x70000 and a RAM segment of size 0x40000. The software code incorporates information provided by a memory layout specification.



FIG. 6B is an exemplary output of a scatter load file that is created by the layout preprocessor 115 that incorporates reserved buffer spaces between software modules in a device, according to an embodiment of the invention. It depicts a memory that comprises four FLASH segments, with a total size 0x70000, with one FLASH segment (FLASH1) specified to be 0x1000 in length and three other FLASH segments (FLASH1, FLASH1, FLASH1) specified to be 0x20000 in size, in addition to a RAM segment of size 0x40000. For each of the FLASH segments, a mapping of individual software modules is also depicted by way of a data structure termed SECTIONS.


When a new software module update is generated by the generator 107 (as illustrated in FIG. 1) for an electronic device 111, additional memory space may be required beyond the space occupied by the existing software module. One method to provide reserved buffer spaces within a device memory of an electronic device is by allocating slots within memory in which one or more software modules or object files may be loaded. These slots may be filled with other object files as new or updated code is incorporated to the electronic device. It is contemplated the slot sizes would be designed to accommodate any anticipated expansion due to expected software updates. Using a design technique described below, the expansion slots are not completely filled by successive updates. Hence, successive slots in memory are not be affected by overflow from a preceding slot obviating any shifting or relocation of software code.


An embodiment of the layout preprocessor 115, termed a code expansion slot tool (CEST), may be used to implement the slot allocation technique described in the preceding paragraph. In this embodiment, a scatter load file is employed to configure memory layout information of software modules stored within a device memory 110. In this embodiment, the scatter load files provide configuration information concerning the assignment of software modules (or objects) to slots and the amount of memory space assigned per slot. Any reserved buffer spaces are determined for each slot based on remaining space after all objects have been assigned to a particular slot. It is contemplated the CEST comprises a software application with graphical user interface that operates on the scatter load file and is executed at the layout preprocessor 115 (illustrated in FIG. 1). The scatter load file is ultimately used by the generator 107 in creating a software package for incorporation into the device memory 110.


The user of the CEST may specify the number of slots a memory image should be divided into by way of the user interface 120. The user of the CEST may organize the memory slots within the image according to a likelihood of change of the objects within a slot. In one embodiment, the objects that are likely to change may be placed within a slot closest to the end of memory. In one embodiment, the objects that are likely to change may be placed within a slot of large memory size. These scatter load files may be stored on a per project basis in the external computer system 128 or in the layout preprocessor 115. It is contemplated the CEST may be used as a tool to write or formulate an appropriate scatter load file. If the CEST determines that the user does not have enough memory (i.e., ROM) to partition the entire software into the number of slots required, the CEST may be configured to provide an error message and a diagnostic report.



FIG. 7A is a perspective block diagram that depicts exemplary ROM 707 and RAM 709 footprints in a typical mobile handset without the use of the methods described in connection with this invention. During operation, software code from ROM 707 (such as in a FLASH memory) is copied to a designated address location in RAM 709 for execution. In one embodiment, the addresses and references of the objects in ROM correspond to their actual designated locations in RAM during execution. As illustrated, the application software 701 in ROM is copied to RAM as identical application software 702.


In contrast, FIG. 7B is a perspective block diagram that depicts exemplary ROM 711 and RAM 713 footprints in a mobile handset wherein code expansion slots are employed to allow for growth in software code due to updates, in accordance with an embodiment of the invention. The application software 715, 716, 717 in ROM is identically transferred to RAM as application software 725, 726, 727. As a consequence, the mobile handset operates identically to that described in FIG. 7A.



FIG. 8 is a perspective block diagram that depicts an exemplary grouping of software objects that is grouped based on their probability of change, according to an embodiment of the invention. The probability of change is termed a change factor. As illustrated, objects having like probability of change are grouped into the same change factor. In this exemplary diagram, the change factor varies from a value of 0 to a value of 3. As illustrated, the objects having the greatest likelihood of change are placed towards the end of memory (at highest address locations) and are assigned a change factor of 3. As shown by the directional arrow 820, the change factors having a higher probability of change are stored in higher address memory locations in ROM. In this exemplary diagram, ROM is divided into four slots labeled APP_ROM1807, APP_ROM2808, APP_ROM3809, and APP_ROM4810 to accommodate object files with varying change characteristics. Object files Bootapp.o, audfmt.lib, saf.lib, bfcomdrv_null.o, NpComDrv_Common.o, and dsmgr.o are associated with a zero change factor and are characterized by a low probability of change. As a consequence, they are stored in a low address memory range such as APP_ROM1. On the other hand, object files such as dadownloadagent.o, dachunk.o, daheap.o, daprotocol.o, dsctl.o, and bfbearerlib_null.o are stored in APP_ROM4810 because these files are considered to have a high probability of change.


Typically, a firmware image may comprise thousands of objects to allow for a fully functional device. When a firmware comprises many thousands of object files, it is contemplated the update methods employed by the embodiments described is of greater significance because of the avalanche or overflow effect described. When such methods are not employed, an update may necessitate using an update package of increased size.


As the amount of available space in memory is limited, it is useful to allocate memory space as effectively as possible. Updates are often necessitated by major bug fixes, performance requirement changes, or new functionalities. Often a user's practical experience is employed to refine the amount of reserved buffer spaces allocated per block of device memory to accommodate for such updates. If experience dictates that a particular object is not going to change during a device's lifetime, it may be desirable to assign it to a slot containing little unused space unless extra space is plentiful. In one embodiment, a weighting factor may be used to multiply an average buffer slot size in the calculation of the amount of reserved buffer space or code expansion space required. It is contemplated that by experimentation and experience, a user may determine the average buffer slot size required.


The selection criteria for grouping objects are also addressed. For example, all objects that were predicted not to change may be grouped together into a common slot at the beginning of memory. In addition, if two or more objects share similar functionality, they may be grouped together. In this instance, it is contemplated the benefit is easier organization and implementation of a particular design.


In one embodiment, a firmware image intended for release is built by compiling code and organizing the compiled objects into an image. During the build process, a linker generates what may be called a map file. A map file contains the results of the link including the final sizes of objects and their placement in the firmware image. From the map file, the names and sizes of all objects are defined and this information may be subsequently assigned into a device memory's slots. In some cases, objects can be grouped and in other cases single objects could be placed in dedicated slots. As an example, an object A is found in the map file to occupy 24 KB. Because the probability of change for this object is considered high, it is estimated the object might grow to 32 KB in the future. Based on this value, a slot size of 32 KB may be specified in its corresponding scatter load file. With the slot sizes preliminarily defined by a map file, a scatter load file can be used to re-specify each slot or software module size and its associated object files. In one embodiment, a linker is used to place compiled source code into software (firmware). The linker arranges all the compiled objects into a firmware image of which the order of objects in firmware are specified by the scatter load file. This image is then copied into a flash memory of an electronic device. To implement an appropriate layout of memory, a scatter load file may be formatted as follows:












Scatter Load File (SLF) Format

















section-name starting-address size



{









object file-list









}











and has the following definitions:
  • section-name—An arbitrary label that describes a section, which can be considered a slot.
  • starting address—Address that specifies where in the final firmware memory the section is placed.
  • size—The size given to that section.
  • object file-list—The list of objects to be placed in the section or slot



FIGS. 9 and 10 illustrate a set of instructions implementing an exemplary scatter load file 905 and its corresponding mapping of object files 1010101210141016 and buffer spaces 1020, 1021, 1022 onto a firmware 1007, in accordance with embodiments of the invention. The scatter load file 905 specifies that an object A 910 is placed in section A 914, objects B 920 and C 922 are placed in section B 924, and an object D 930 is placed in section C 934. Section A 914 may accommodate up to 0x1000 bytes, while section B 924 up to 0x3000 bytes, and section C 934 up to 0x2000 bytes. In the case of section B 924, there are two objects of which the sizes of both objects B 920 and C 922 cannot exceed 0x3000 bytes. If the objects in any section exceed the section size, a linker error may be generated during the build of the firmware.


In one embodiment, a code expansion slot tool (CEST) of the layout preprocessor 115, shown in FIG. 1, may be configured to provide the following:

    • A per project configuration file that may comprise information such as:
      • Number of memory blocks a device memory is divided into
      • Change factor values for each memory block
      • Scatter load file information such as filename and location.
      • Memory size
      • Starting and ending addresses in each block of device memory
      • Amount and location of reserved buffer space or code expansion slot for each block of device memory
      • Map filename and location
      • The names of the object files and what blocks they belong to
    • Automated or manual creation of a scatter load file incorporating code expansion slots
    • A configuration file for the general tool use that will store the names and locations of each project
    • Ability to read Map files and determine the following:
      • Name of each load and execution block
      • Size of each load and execution block
      • Name and size of each object file
    • A graphical user interface provided by the CEST
    • Provide the user with the ability to input starting and ending information of blocks within device memory
    • Provide the user the ability to associate one or more groups of object files with a change factor. It is contemplated an exemplary numeric scale for this factor will be as follows:
    • 0. No changes
    • 1. Infrequent Changes
    • 2. Moderate Changes
    • 3. Frequent Changes
    • Ability to save a user's personal settings into the project configuration file
    • Allocation algorithms for configuring memory blocks or slots within a device memory:
      • Allocate object files to memory blocks or slots according to its associated change factor such that memory blocks (or slots) at the highest addresses in memory have the greatest available free space
      • Allocate free space evenly among the device memory blocks
      • Allocate no space for the first two address blocks or slots in device memory, but evenly split the unused free memory space among the remaining memory blocks
      • Allocate space based on weighting factors correlated to probability of change and an average reserved buffer size
      • It is contemplated other combination of uniform and non-uniform space allocation methodologies may exist and may be implemented
    • Provide an errata log which comprises the following:
      • Date in which error occurs
      • Project name associated with error
      • Error message
      • Diagnostic information
    • Prompt the user concerning the allocation of single large blocks of device memory for a large software module such as an exemplary main application software module. It is contemplated the CEST may divide this block into a number of sub-blocks. The CEST may alert the user if a block is of a certain maximum size, in order to ensure that block sizes are not too large.
    • Upon segmentation of large blocks, files may be assigned to the newly segmented memory blocks based on change factor.
    • Ability of a user to manually map object files or other files with specific ROM blocks.


The code expansion slot method utilizing a scatter load file as embodied in the CEST may provide minimization of update package sizes for many version releases of a firmware image. Just as an initial release requires code change factor estimates and heuristics that are experimented with until a desired slot organization and characteristics are achieved, during any revision work, the slots should not be adjusted until all the changes are implemented and desired characteristics are determined and achieved.


Organizing object code within firmware generally involves evaluating each software object and identifying the objects that are most likely to require modifications or enhancements. This determination may be based on a manufacturer's development cycle, product road map, or other distinguishable metrics. The objects with a high probability of significant modification would then be placed at the top of the firmware image or highest memory address in firmware. If modifications are required after the device's commercial release that result in significant changes to these objects, displacement, relocation, or shifting of objects into other memory blocks or slots would most likely occur. Further, the addition of large updates may overwhelm the reserved memory in one or more slots. However, since these objects were placed at the top of the image, the avalanche effect is limited to the top area of flash, resulting in a smaller update package (used for updates) than would have been generated (by a generator 107) if these objects were located at the bottom of the image.


In summary, aspects of the present invention provide a number of embodiments of a system and method to effectively initialize and update firmware in an electronic device. In one embodiment, the version of software resident in a device's memory and the location and size of unused free memory are determined by initializing the device's memory with one or more pre-determined binary patterns. In one embodiment, buffer spaces are inserted between software modules in a device's firmware to allow for expansion of a particular software module by way of a future update. In one embodiment, one or more software modules (or objects) are inserted into pre-configured code expansion slots in device's firmware. The memory space that remains after all objects are inserted into a slot provides buffer space to allow for future updates to these objects.


While the invention has been described with reference to certain embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted without departing from the scope of the invention. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the invention without departing from its scope. Therefore, it is intended that the invention not be limited to the particular embodiment disclosed, but that the invention will include all embodiments falling within the scope of the appended claims.

Claims
  • 1. A system for updating memory in an electronic device, the system comprising: at least one processor that, during operation, executes generator code for generating a software package from a plurality of code modules for the electronic device;layout preprocessor code executable by the at least one processor for parsing a memory layout specification and that receives at least one parameter that represents an estimated probability of future change of one or more code modules, to produce memory mapping information that assigns to each of the plurality of code modules space in one of a plurality of individual portions of the memory, based upon the memory layout specification;wherein execution of the layout preprocessor code determines an amount of unassigned space in the memory upon assignment of space in the memory to the plurality of code modules; andwherein execution of the generator code locates a corresponding fraction of the unassigned space in the memory in each of the individual portions of the memory, in accordance with the memory mapping information.
  • 2. The system according to claim 1, wherein the electronic device comprises one of a mobile handset, a pager, and a personal digital assistant (PDA).
  • 3. The system according to claim 1, wherein the plurality of code modules comprise code modules of a first version of code and corresponding code modules of a second version of code.
  • 4. The system according to claim 1, wherein the memory of the electronic device comprises update agent code executable by a processor in the electronic device.
  • 5. The system according to claim 4, wherein the software package comprises a set of instructions executable by the update agent code to transform code modules of a first version of code to code modules of a second version of code.
  • 6. The system according to claim 1, wherein the at least one parameter comprises a corresponding probability of change for each of the individual portions of the memory.
  • 7. The system according to claim 1, wherein the fraction of the unassigned space in the memory assigned to a corresponding one of the individual portions of the memory is a proportion of a total size of the code modules assigned to the corresponding one of the individual portions of the memory to a total memory space of the code modules that have been assigned space in the memory.
  • 8. The system according to claim 1, wherein the unassigned space in memory is set to a bit pattern selected to permit identification of the unassigned space by examination of the memory.
  • 9. The system according to claim 8, wherein the bit pattern comprises one or more contiguous occurrences of a sequence of one or more data values.
  • 10. The system according to claim 8, wherein the bit pattern is selected to permit identification of a version of code.
  • 11. The system according to claim 1, further comprising: communications code executable by the at least one processor that enables wireless transmission of the software package to the electronic device.
  • 12. A method for updating memory in an electronic device, the method comprising: receiving at least one parameter that represents an estimated probability of future change of one or more code modules;preprocessing a plurality of code modules for the electronic device, the preprocessing comprising determining an amount of unassigned space in the memory upon assignment of space in the memory to the plurality of code modules, andparsing a memory layout specification to produce memory mapping information that assigns to each of the plurality of code modules space in one of a plurality of individual portions of the memory, based upon the memory layout specification;after the preprocessing, processing the plurality of code modules to generate a software package, wherein generating comprises locating a corresponding fraction of the unassigned memory space in the memory in each of the individual portions of the memory, in accordance with the memory mapping information; andstoring the software package in a repository for later wireless transmission to the electronic device.
  • 13. The method according to claim 12, wherein the electronic device comprises one of a mobile handset, a pager, and a personal digital assistant (PDA).
  • 14. The method according to claim 12, wherein the plurality of code modules comprise code modules of a first version of code and corresponding code modules of a second version of code.
  • 15. The method according to claim 12, wherein the memory of the electronic device comprises update agent code executable by a processor in the electronic device.
  • 16. The method according to claim 15, wherein the software package comprises a set of instructions executable by the update agent code to transform code modules of the first version of code to code modules of the second version of code.
  • 17. The method according to claim 12, wherein the at least one parameter comprises a corresponding probability of change for each of the individual portions of the memory.
  • 18. The method according to claim 12, wherein the fraction of the unassigned space in the memory assigned to a corresponding one of the individual portions of the memory is a proportion of a total size of the code modules assigned to the corresponding one of the individual portions of the memory to a total memory space of the code modules that have been assigned space in the memory.
  • 19. The method according to claim 12, wherein the unassigned space in memory is set to a bit pattern selected to permit identification of the unassigned space by examination of the memory.
  • 20. The method according to claim 19, wherein the bit pattern comprises one or more contiguous occurrences of a sequence of one or more data values.
  • 21. The method according to claim 19, wherein the bit pattern is selected to permit identification of a version of code.
RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 10/411,784 titled “Initialization And Update Of Software And/Or Firmware In Electronic Devices”, filed Apr. 11, 2003, which is a continuation-in-part of U.S. patent application Ser. No. 10/311,462, titled “System and Method for Updating and Distributing Information”, filed May 13, 2003, and which makes reference to, claims benefit of, and claims priority to U.S. Provisional Patent Application Ser. No. 60/373,422 titled “Update Package Generation And Distribution Network”, filed Apr. 12, 2002; U.S. Provisional Patent Application Ser. No. 60/373,421 titled “Pattern Detection Preprocessor In An Update Generation System”, filed Apr. 12, 2002; U.S. Provisional Patent Application Ser. No. 60/373,423 titled “Layout Preprocessor In An Update Generation System”, filed Apr. 12, 2002; and U.S. Provisional Patent Application Ser. No. 60/372,066 titled “Memory Initialization System For Initializing A Memory Image With A Pattern”, filed Apr. 12, 2002. U.S. patent application Ser. No. 10/311,462 is the National Stage filing of PCT Application Ser. No. PCT/US01/44034, titled “System and Method for Updating and Distributing Information”, filed Nov. 19, 2001, which claims priority to U.S. Provisional Patent Application Ser. No. 60/249,606, filed Nov. 17, 2000. The complete subject matter of each of the above is incorporated herein by reference in its entirety. This application is also related to U.S. patent application Ser. No. 10/411,835 titled “Update Package Generation And Distribution Network”, filed Apr. 11, 2003, and U.S. patent application Ser. No. 10/412,045 titled “Pattern Detection Preprocessor In An Electronic Device Update Generation System”, filed Apr. 11, 2003, the complete subject matter of each of which is hereby incorporated by reference, in its entirety. This application is also related to the following co-pending applications, each of which is hereby incorporated herein by reference in its entirety: Ser.No.TitleFiledInventorsUpdate PackageApr. 11, 2003O'NeillGeneration andRaoDistribution NetworkPattern DetectionApr. 11, 2003ChenPreprocessor in anO'NeillElectronic DeviceRaoUpdate GenerationLilleySystem

US Referenced Citations (889)
Number Name Date Kind
4337376 Gruenberg Jun 1982 A
4344091 Gardner et al. Aug 1982 A
4429387 Kaminski Jan 1984 A
4493083 Kinoshita Jan 1985 A
4783841 Crayson Nov 1988 A
4807182 Queen Feb 1989 A
4809170 Leblang et al. Feb 1989 A
5084816 Boese et al. Jan 1992 A
5155847 Kirouac et al. Oct 1992 A
5204960 Smith et al. Apr 1993 A
5261055 Moran et al. Nov 1993 A
5274823 Brenner et al. Dec 1993 A
5325531 McKeeman et al. Jun 1994 A
5392353 Morales Feb 1995 A
5410703 Nilsson et al. Apr 1995 A
5418837 Johannson et al. May 1995 A
5420616 Suemitsu et al. May 1995 A
5421006 Jablon et al. May 1995 A
5442771 Filepp et al. Aug 1995 A
5444765 Marui et al. Aug 1995 A
5450589 Maebayashi et al. Sep 1995 A
5463766 Schieve et al. Oct 1995 A
5471592 Gove et al. Nov 1995 A
5479637 Lisimaque et al. Dec 1995 A
5479654 Squibb Dec 1995 A
5481713 Wetmore et al. Jan 1996 A
5491807 Freeman et al. Feb 1996 A
5491821 Kilis Feb 1996 A
5535357 Moran et al. Jul 1996 A
5563931 Bishop et al. Oct 1996 A
5579522 Christeson et al. Nov 1996 A
5586328 Caron et al. Dec 1996 A
5594903 Bunnell et al. Jan 1997 A
5596738 Pope Jan 1997 A
5598531 Hill Jan 1997 A
5598534 Haas Jan 1997 A
5606693 Nilsen et al. Feb 1997 A
5608910 Shimakura Mar 1997 A
5623604 Russell et al. Apr 1997 A
5628016 Kukol May 1997 A
5649112 Yeager et al. Jul 1997 A
5649200 Leblang et al. Jul 1997 A
5666293 Metz et al. Sep 1997 A
5675628 Hokkanen Oct 1997 A
5677708 Matthews, III Oct 1997 A
5689712 Heisch Nov 1997 A
5704031 Mikami et al. Dec 1997 A
5708709 Rose Jan 1998 A
5715462 Iwamoto et al. Feb 1998 A
5717737 Doviak et al. Feb 1998 A
5721824 Taylor Feb 1998 A
5724526 Kunita Mar 1998 A
5727202 Kucala Mar 1998 A
5729735 Meyering Mar 1998 A
5752039 Tanimura May 1998 A
5752042 Cole et al. May 1998 A
5764658 Sekiguchi et al. Jun 1998 A
5774715 Madany et al. Jun 1998 A
5778440 Yiu et al. Jul 1998 A
5781921 Nichols Jul 1998 A
5790860 Wetmore et al. Aug 1998 A
5790974 Tognazzini Aug 1998 A
5794254 McClain Aug 1998 A
5802554 Caceres et al. Sep 1998 A
5805899 Evans et al. Sep 1998 A
5809251 May et al. Sep 1998 A
5815722 Kalwitz et al. Sep 1998 A
5822692 Krishan et al. Oct 1998 A
5826012 Lettvin Oct 1998 A
5832000 Lin et al. Nov 1998 A
5832520 Miller Nov 1998 A
5835777 Staelin Nov 1998 A
5838981 Gotoh Nov 1998 A
5845077 Fawcett Dec 1998 A
5875404 Messiet Feb 1999 A
5878124 Griesmer et al. Mar 1999 A
5878256 Bealkowski et al. Mar 1999 A
5881292 Sigal et al. Mar 1999 A
5896566 Averbuch et al. Apr 1999 A
5901310 Rahman et al. May 1999 A
5901330 Sun et al. May 1999 A
5913027 Matsuda et al. Jun 1999 A
5919247 Van Hoff et al. Jul 1999 A
5930504 Gabel Jul 1999 A
5931909 Taylor Aug 1999 A
5933498 Schneck et al. Aug 1999 A
5937019 Padovani Aug 1999 A
5943406 Leta et al. Aug 1999 A
5944839 Isenberg Aug 1999 A
5953653 Josenhans et al. Sep 1999 A
5954817 Janssen et al. Sep 1999 A
5960189 Stupek, Jr. et al. Sep 1999 A
5960445 Tamori et al. Sep 1999 A
5968182 Chen et al. Oct 1999 A
5974179 Caklovic Oct 1999 A
5974250 Angelo et al. Oct 1999 A
5974454 Apfel et al. Oct 1999 A
5987325 Tayloe Nov 1999 A
5999978 Angal et al. Dec 1999 A
6006034 Heath et al. Dec 1999 A
6009274 Fletcher et al. Dec 1999 A
6009497 Wells et al. Dec 1999 A
6011973 Valentine et al. Jan 2000 A
6014561 Molne Jan 2000 A
6018747 Burns et al. Jan 2000 A
6021415 Cannon et al. Feb 2000 A
6021428 Miloslavsky Feb 2000 A
6029004 Bortnikov et al. Feb 2000 A
6031830 Cowan Feb 2000 A
6032044 Shannon et al. Feb 2000 A
6038636 Brown, III et al. Mar 2000 A
6041333 Bretschneider et al. Mar 2000 A
6044270 Raith Mar 2000 A
6044403 Gerszberg Mar 2000 A
6047242 Benson Apr 2000 A
6047279 Barrack et al. Apr 2000 A
6052531 Waldin et al. Apr 2000 A
6052600 Fette et al. Apr 2000 A
6058435 Sassin et al. May 2000 A
6064814 Capriles et al. May 2000 A
6070012 Eitner et al. May 2000 A
6070142 McDonough et al. May 2000 A
6073206 Piwonka et al. Jun 2000 A
6073214 Fawcett Jun 2000 A
6077315 Greenbaum et al. Jun 2000 A
6080207 Kroening et al. Jun 2000 A
6081518 Bowman-Amuah Jun 2000 A
6081731 Boltz et al. Jun 2000 A
6088759 Hasbun et al. Jul 2000 A
6097942 Laiho Aug 2000 A
6097966 Hanley Aug 2000 A
6105063 Hayes, Jr. Aug 2000 A
6112024 Almond et al. Aug 2000 A
6112197 Chatterjee et al. Aug 2000 A
6115693 McDonough et al. Sep 2000 A
6115737 Ely et al. Sep 2000 A
6117187 Staelin Sep 2000 A
6126327 Bi et al. Oct 2000 A
6128695 Estakhri et al. Oct 2000 A
6128713 Eisler et al. Oct 2000 A
6131096 Ng et al. Oct 2000 A
6134530 Bunting et al. Oct 2000 A
6138002 Alperovich et al. Oct 2000 A
6138239 Veil Oct 2000 A
6138249 Nolet Oct 2000 A
6141564 Bruner et al. Oct 2000 A
6145012 Small Nov 2000 A
6148192 Ahvenainen Nov 2000 A
6148441 Woodward Nov 2000 A
6151643 Cheng et al. Nov 2000 A
6157559 Yoo Dec 2000 A
6163274 Lindgren Dec 2000 A
6167567 Chiles et al. Dec 2000 A
6178452 Miyamoto Jan 2001 B1
6189096 Haverty Feb 2001 B1
6195546 Leung et al. Feb 2001 B1
6195946 Lott et al. Mar 2001 B1
6198946 Shin et al. Mar 2001 B1
6199204 Donohue Mar 2001 B1
6202207 Donohue Mar 2001 B1
6209111 Kadyk et al. Mar 2001 B1
6209127 Mori et al. Mar 2001 B1
6212281 Vanstone Apr 2001 B1
6212489 Klein et al. Apr 2001 B1
6212659 Zehavi Apr 2001 B1
6230319 Britt et al. May 2001 B1
6233332 Anderson et al. May 2001 B1
6256497 Chambers Jul 2001 B1
6262973 Shiraishi et al. Jul 2001 B1
6263214 Yazaki et al. Jul 2001 B1
6266809 Craig et al. Jul 2001 B1
6272333 Smith Aug 2001 B1
6278449 Sugiarto et al. Aug 2001 B1
6279153 Bi et al. Aug 2001 B1
6282709 Reha et al. Aug 2001 B1
6289509 Kryloff Sep 2001 B1
6292492 Bonomi et al. Sep 2001 B1
6301710 Fujiwara Oct 2001 B1
6308061 Criss et al. Oct 2001 B1
6311322 Ikeda et al. Oct 2001 B1
6317872 Gee et al. Nov 2001 B1
6321263 Luzzi et al. Nov 2001 B1
6321348 Kobata Nov 2001 B1
6324402 Waugh et al. Nov 2001 B1
6333980 Hollatz et al. Dec 2001 B1
6334212 Nakajma Dec 2001 B1
6343379 Ozawa et al. Jan 2002 B1
6345288 Reed et al. Feb 2002 B1
6347331 Dutcher et al. Feb 2002 B1
6349205 Fang et al. Feb 2002 B1
6353737 Herzog Mar 2002 B1
6357021 Kitagawa et al. Mar 2002 B1
6360362 Fichtner et al. Mar 2002 B1
6360366 Heath et al. Mar 2002 B1
6366584 Gulliford et al. Apr 2002 B1
6366777 Uusitalo Apr 2002 B1
6367072 Justice et al. Apr 2002 B1
6374250 Ajtai et al. Apr 2002 B2
6381740 Miller et al. Apr 2002 B1
6381742 Forbes et al. Apr 2002 B2
6389464 Krishnamurthy et al. May 2002 B1
6393018 Miloslavsky May 2002 B2
6393585 Houha et al. May 2002 B1
6397385 Kravitz May 2002 B1
6400965 Phillips et al. Jun 2002 B1
6405364 Bowman-Amuah Jun 2002 B1
6408175 Park Jun 2002 B1
6408434 Fujiwara Jun 2002 B1
6418311 Chmaytelli et al. Jul 2002 B1
6421776 Hillis et al. Jul 2002 B1
6425125 Fries et al. Jul 2002 B1
6426955 Gossett Dalton, Jr. et al. Jul 2002 B1
6438585 Mousseau et al. Aug 2002 B2
6442660 Henerlau et al. Aug 2002 B1
6442754 Curtis Aug 2002 B1
6445914 Findikli et al. Sep 2002 B1
6446206 Feldbaum Sep 2002 B1
6449270 Miloslavsky Sep 2002 B1
6456732 Kimbell et al. Sep 2002 B1
6456843 Daly Sep 2002 B1
6457175 Lerche Sep 2002 B1
6463300 Oshima Oct 2002 B1
6466999 Sliger et al. Oct 2002 B1
6477531 Sullivan et al. Nov 2002 B1
6477703 Smith et al. Nov 2002 B1
6487403 Carroll Nov 2002 B2
6487717 Brunemann et al. Nov 2002 B1
6493871 McGuire et al. Dec 2002 B1
6504932 Vasnier et al. Jan 2003 B1
6505228 Schoening et al. Jan 2003 B1
6526574 Jones Feb 2003 B1
6529729 Nodoushani et al. Mar 2003 B1
6530036 Frey, Jr. Mar 2003 B1
6535894 Schmidt et al. Mar 2003 B1
6536038 Ewertz et al. Mar 2003 B1
6542504 Mahler et al. Apr 2003 B1
6542906 Korn Apr 2003 B2
6546243 Tiedemann, Jr. et al. Apr 2003 B2
6546492 Walker et al. Apr 2003 B1
6546552 Peleg Apr 2003 B1
6549770 Marran Apr 2003 B1
6553113 Dhir et al. Apr 2003 B1
6556842 Ericsson Apr 2003 B1
6564369 Hove et al. May 2003 B1
6571244 Larson May 2003 B1
6574657 Dickenson Jun 2003 B1
6577229 Bonneau et al. Jun 2003 B1
6581105 Miloslavsky et al. Jun 2003 B2
6587684 Hsu et al. Jul 2003 B1
6587685 Mittal et al. Jul 2003 B2
6591095 Palaniswamy et al. Jul 2003 B1
6591098 Shieh et al. Jul 2003 B1
6594723 Chapman et al. Jul 2003 B1
6594822 Schweitz et al. Jul 2003 B1
6595856 Ginsburg et al. Jul 2003 B1
6601153 Engelbrecht et al. Jul 2003 B1
6601212 Guha et al. Jul 2003 B1
6603854 Judkins et al. Aug 2003 B1
6603968 Anvekar et al. Aug 2003 B2
6606744 Mikurak Aug 2003 B1
6615038 Moles et al. Sep 2003 B1
6615240 Sullivan et al. Sep 2003 B1
6615404 Garfunkel et al. Sep 2003 B1
6622017 Hoffman Sep 2003 B1
6625451 La Medica et al. Sep 2003 B1
6640334 Rasmussen Oct 2003 B1
6643506 Criss et al. Nov 2003 B1
6647260 Dusse et al. Nov 2003 B2
6651249 Waldin et al. Nov 2003 B2
6658090 Harjunen et al. Dec 2003 B1
6659345 Sukeda et al. Dec 2003 B2
6665376 Brown Dec 2003 B1
6665861 Francis et al. Dec 2003 B1
6668049 Koch et al. Dec 2003 B1
6668336 Lasser Dec 2003 B2
6671265 Hwang et al. Dec 2003 B1
6675201 Parkkinen Jan 2004 B1
6675382 Foster Jan 2004 B1
6683993 Mead Jan 2004 B1
6684396 Brittain et al. Jan 2004 B1
6687341 Koch et al. Feb 2004 B1
6687901 Imamatsu Feb 2004 B1
6690788 Bauer et al. Feb 2004 B1
6694314 Sullivan et al. Feb 2004 B1
6694336 Multer et al. Feb 2004 B1
6697808 Hurwood et al. Feb 2004 B1
6697969 Merriam Feb 2004 B1
6698013 Bertero et al. Feb 2004 B1
6704303 Bowman-Amuah Mar 2004 B1
6714642 Dhir et al. Mar 2004 B2
6721713 Guheen et al. Apr 2004 B1
6721946 Fogarty et al. Apr 2004 B1
6725048 Mao et al. Apr 2004 B2
6725056 Moles et al. Apr 2004 B1
6725392 Frey et al. Apr 2004 B1
6728531 Lee et al. Apr 2004 B1
6728950 Davis et al. Apr 2004 B2
6730027 Iliff May 2004 B2
6731932 Rune et al. May 2004 B1
6741848 Timonen et al. May 2004 B2
6741934 Chen et al. May 2004 B2
6741980 Langseth et al. May 2004 B1
6742025 Jennery et al. May 2004 B2
6754181 Elliott et al. Jun 2004 B1
6754895 Bartel et al. Jun 2004 B1
6754896 Mishra et al. Jun 2004 B2
6757263 Olds Jun 2004 B1
6760730 Kataoka Jul 2004 B1
6763104 Judkins et al. Jul 2004 B1
6763403 Cheng et al. Jul 2004 B2
6772338 Hull Aug 2004 B1
6775267 Kung et al. Aug 2004 B1
6775423 Kulkarni et al. Aug 2004 B2
6779177 Bahrs et al. Aug 2004 B1
6785834 Chefalas et al. Aug 2004 B2
6789215 Rupp et al. Sep 2004 B1
6798876 Bala Sep 2004 B1
6799155 Lindemann et al. Sep 2004 B1
6802061 Parthasarathy et al. Oct 2004 B1
6807574 Partovi et al. Oct 2004 B1
6813571 Lightbody et al. Nov 2004 B2
6816719 Heinonen et al. Nov 2004 B1
6820214 Cabrera et al. Nov 2004 B1
6820259 Kawamata et al. Nov 2004 B1
6823432 Chen et al. Nov 2004 B2
6832373 O'Neill Dec 2004 B2
6836657 Ji et al. Dec 2004 B2
6839841 Medvinsky et al. Jan 2005 B1
6842628 Arnold et al. Jan 2005 B1
6845370 Burkey et al. Jan 2005 B2
6847970 Kar et al. Jan 2005 B2
6850533 Gerszberg et al. Feb 2005 B2
6850614 Collins Feb 2005 B1
6856676 Pirot et al. Feb 2005 B1
6873988 Herrmann et al. Mar 2005 B2
6879685 Peterson et al. Apr 2005 B1
6880051 Timpanaro-Perrotta Apr 2005 B2
6883168 James et al. Apr 2005 B1
6885862 Pearson Apr 2005 B1
6889054 Himmel et al. May 2005 B2
6895387 Roberts et al. May 2005 B1
6904405 Suominen Jun 2005 B2
6918112 Bourke-Dunphy et al. Jul 2005 B2
6922722 Mann et al. Jul 2005 B1
6925300 Horne Aug 2005 B2
6925467 Gu et al. Aug 2005 B2
6928108 Nelson et al. Aug 2005 B2
6928468 Leermakers Aug 2005 B2
6941129 Marce et al. Sep 2005 B2
6941453 Rao Sep 2005 B2
6944621 Collart Sep 2005 B1
6948099 Tallam Sep 2005 B1
6948104 Herley et al. Sep 2005 B2
6950660 Hsu et al. Sep 2005 B1
6956846 Lewis et al. Oct 2005 B2
6957041 Christensen et al. Oct 2005 B2
6957062 Castrogiovanni et al. Oct 2005 B2
6966058 Earl et al. Nov 2005 B2
6968179 De Vries Nov 2005 B1
6968543 Takahara et al. Nov 2005 B2
6970181 Fadel Nov 2005 B1
6970189 Bernstein et al. Nov 2005 B1
6981020 Miloslavsky et al. Dec 2005 B2
6983458 Honda Jan 2006 B1
6986133 O'Brien et al. Jan 2006 B2
6990656 Ersek et al. Jan 2006 B2
6990660 Moshir et al. Jan 2006 B2
6996603 Srinivasan Feb 2006 B1
6999990 Sullivan et al. Feb 2006 B1
7002919 El-Sayed Feb 2006 B1
7003534 Peng Feb 2006 B2
7007049 Peng Feb 2006 B2
7024557 Moles et al. Apr 2006 B1
7027586 Bushey et al. Apr 2006 B2
7031972 Ren et al. Apr 2006 B2
7032033 Ledoux et al. Apr 2006 B1
7039594 Gersting May 2006 B1
7047448 Rao et al. May 2006 B2
7050566 Becerra et al. May 2006 B2
7055098 Hull et al. May 2006 B2
7055148 Marsh et al. May 2006 B2
7058860 Miller et al. Jun 2006 B2
7058978 Feuerstein et al. Jun 2006 B2
7061891 Kilfoyle et al. Jun 2006 B1
7062031 Becerra et al. Jun 2006 B2
7065347 Vikse et al. Jun 2006 B1
7069452 Hind et al. Jun 2006 B1
7069545 Wang et al. Jun 2006 B2
7069578 Prus et al. Jun 2006 B1
7073017 Yamamoto Jul 2006 B2
7073172 Chamberlain Jul 2006 B2
7076051 Brown et al. Jul 2006 B2
7080371 Arnaiz et al. Jul 2006 B1
7080372 Cole Jul 2006 B1
7086049 Goodman Aug 2006 B2
7089036 Prise Aug 2006 B2
7089549 Venkiteswaran Aug 2006 B2
7096311 Chiang Aug 2006 B2
7099896 Fields et al. Aug 2006 B2
7103172 Brown et al. Sep 2006 B2
7106843 Gainsboro et al. Sep 2006 B1
7110525 Heller et al. Sep 2006 B1
7111201 Largman et al. Sep 2006 B2
7117172 Black Oct 2006 B1
7117195 Chantrain et al. Oct 2006 B2
7120909 Shibuya Oct 2006 B1
7130896 Engel et al. Oct 2006 B2
7136857 Chen et al. Nov 2006 B2
7137034 Largman et al. Nov 2006 B2
7143115 Jones et al. Nov 2006 B2
7143153 Black et al. Nov 2006 B1
7145898 Elliott Dec 2006 B1
7146002 Smith et al. Dec 2006 B1
7146609 Thurston et al. Dec 2006 B2
7149508 Herle Dec 2006 B2
7150015 Pace et al. Dec 2006 B2
7165173 Herle Jan 2007 B1
7171660 McCaleb et al. Jan 2007 B2
7181731 Pace et al. Feb 2007 B2
7194728 Sirota et al. Mar 2007 B1
7200390 Henager et al. Apr 2007 B1
7206576 Jain et al. Apr 2007 B2
7210010 Ogle Apr 2007 B2
7216343 Das et al. May 2007 B2
7222340 Willis, II May 2007 B2
7230951 Mizell et al. Jun 2007 B2
7231411 Lu Jun 2007 B1
7240356 Iki et al. Jul 2007 B2
7242929 Draluk et al. Jul 2007 B2
7263379 Parkulo et al. Aug 2007 B1
7266371 Amin et al. Sep 2007 B1
7269821 Sahinoja et al. Sep 2007 B2
7274911 Li Sep 2007 B2
7275243 Mittal et al. Sep 2007 B2
7277529 Wuthnow et al. Oct 2007 B1
7287068 Eriksson et al. Oct 2007 B1
7292846 Mittal Nov 2007 B2
7310720 Cornett Dec 2007 B2
7313791 Chen et al. Dec 2007 B1
7324815 Ross et al. Jan 2008 B2
7349695 Oommen et al. Mar 2008 B2
7350205 Ji Mar 2008 B2
7353533 Wright et al. Apr 2008 B2
7367027 Chen et al. Apr 2008 B1
7369851 Okonnen et al. May 2008 B2
7373109 Pohja et al. May 2008 B2
7376711 Du et al. May 2008 B2
7405537 Hoffman et al. Jul 2008 B2
7409685 Chen et al. Aug 2008 B2
7415706 Raju et al. Aug 2008 B1
7433936 Zhu et al. Oct 2008 B2
7461294 Sano Dec 2008 B2
7469306 Ng Dec 2008 B2
7493128 Tang et al. Feb 2009 B2
7500143 Buia et al. Mar 2009 B2
7509496 Skog et al. Mar 2009 B2
7509652 Niemi Mar 2009 B2
7518504 Peeters Apr 2009 B2
7523155 Hayes, Jr. Apr 2009 B2
7526563 Ingimundarson et al. Apr 2009 B2
7555750 Lilley Jun 2009 B1
7577722 Khandekar et al. Aug 2009 B1
7584466 Rao Sep 2009 B1
7657884 Okonnen et al. Feb 2010 B2
7657886 Chen et al. Feb 2010 B1
7673300 Herle et al. Mar 2010 B2
7673325 Vincent et al. Mar 2010 B2
7680828 Gorelik Mar 2010 B2
7689981 Gustafson Mar 2010 B1
7698698 Skan Apr 2010 B2
7707570 Yoshimura et al. Apr 2010 B2
7725889 Gustafson et al. May 2010 B2
7739679 Qumei Jun 2010 B2
7784065 Polivy et al. Aug 2010 B2
7797693 Gustafson et al. Sep 2010 B1
7797695 Motta Sep 2010 B2
7818556 Lima et al. Oct 2010 B2
7823148 Deshpande et al. Oct 2010 B2
7823155 Misra et al. Oct 2010 B2
7844964 Marolia Nov 2010 B2
7873714 Kaappa et al. Jan 2011 B2
7889869 Ypya et al. Feb 2011 B2
8063929 Kurtz et al. Nov 2011 B2
8099078 Lazaridis Jan 2012 B2
20010008024 Inaba Jul 2001 A1
20010018673 Goldband et al. Aug 2001 A1
20010029178 Criss et al. Oct 2001 A1
20010042112 Slivka et al. Nov 2001 A1
20010047363 Peng Nov 2001 A1
20010047441 Robertson Nov 2001 A1
20010048728 Peng Dec 2001 A1
20010049263 Zhang Dec 2001 A1
20010052066 Lee et al. Dec 2001 A1
20010053688 Rignell et al. Dec 2001 A1
20010055414 Thieme Dec 2001 A1
20010056348 Hyde-Thomson et al. Dec 2001 A1
20020010702 Ajtai et al. Jan 2002 A1
20020023258 Elwahab et al. Feb 2002 A1
20020030634 Noda et al. Mar 2002 A1
20020046400 Burch Apr 2002 A1
20020052938 Kanemitsu May 2002 A1
20020053044 Gold et al. May 2002 A1
20020059526 Dillon et al. May 2002 A1
20020072359 Moles et al. Jun 2002 A1
20020073304 Marsh et al. Jun 2002 A1
20020073309 Kurn et al. Jun 2002 A1
20020075824 Willekes Jun 2002 A1
20020078142 Moore et al. Jun 2002 A1
20020078185 Swerup et al. Jun 2002 A1
20020078209 Peng Jun 2002 A1
20020085704 Shires Jul 2002 A1
20020087668 San Martin et al. Jul 2002 A1
20020090934 Mitchelmore Jul 2002 A1
20020091568 Kraft et al. Jul 2002 A1
20020091815 Anderson et al. Jul 2002 A1
20020092008 Kehne et al. Jul 2002 A1
20020092010 Fiske Jul 2002 A1
20020092011 Liu et al. Jul 2002 A1
20020095615 Hastings et al. Jul 2002 A1
20020099726 Crudele et al. Jul 2002 A1
20020100028 Kosaka et al. Jul 2002 A1
20020114384 Nelson et al. Aug 2002 A1
20020116261 Moskowitz et al. Aug 2002 A1
20020116665 Pickover et al. Aug 2002 A1
20020120776 Eggebratten et al. Aug 2002 A1
20020120810 Brouwer Aug 2002 A1
20020123335 Luna et al. Sep 2002 A1
20020124209 Faust et al. Sep 2002 A1
20020129355 Velten et al. Sep 2002 A1
20020131404 Mehta et al. Sep 2002 A1
20020144254 Owada Oct 2002 A1
20020152005 Bagnordi Oct 2002 A1
20020156863 Peng Oct 2002 A1
20020157089 Patel et al. Oct 2002 A1
20020157090 Anton, Jr. Oct 2002 A1
20020159479 Watanuki et al. Oct 2002 A1
20020162098 Suzuki Oct 2002 A1
20020166027 Shirasawa et al. Nov 2002 A1
20020170052 Radatti Nov 2002 A1
20020174422 Kelley et al. Nov 2002 A1
20020178241 Eriksson Nov 2002 A1
20020184619 Meyerson Dec 2002 A1
20020188886 Liu et al. Dec 2002 A1
20020194532 Nagasawa Dec 2002 A1
20020197991 Anvekar et al. Dec 2002 A1
20020198971 Resnick et al. Dec 2002 A1
20020198976 Davenport Dec 2002 A1
20030005108 Bartley et al. Jan 2003 A1
20030005362 Miller et al. Jan 2003 A1
20030005426 Scholtens et al. Jan 2003 A1
20030009752 Gupta Jan 2003 A1
20030013434 Rosenberg et al. Jan 2003 A1
20030018524 Fishman et al. Jan 2003 A1
20030018764 Shell et al. Jan 2003 A1
20030018810 Karagiannis et al. Jan 2003 A1
20030018889 Burnett et al. Jan 2003 A1
20030022663 Rajaram et al. Jan 2003 A1
20030023573 Chan et al. Jan 2003 A1
20030023849 Martin, Jr. Jan 2003 A1
20030023964 Rajaram et al. Jan 2003 A1
20030027563 Herle et al. Feb 2003 A1
20030027581 Jokinen et al. Feb 2003 A1
20030033525 Rajaram et al. Feb 2003 A1
20030033599 Rajaram et al. Feb 2003 A1
20030037075 Hannigan et al. Feb 2003 A1
20030041125 Salomon Feb 2003 A1
20030043180 Gusler et al. Mar 2003 A1
20030044086 Jia et al. Mar 2003 A1
20030046485 Zitlaw Mar 2003 A1
20030046680 Gentry Mar 2003 A1
20030054811 Han et al. Mar 2003 A1
20030055919 Fong et al. Mar 2003 A1
20030061323 East et al. Mar 2003 A1
20030061384 Nakatani Mar 2003 A1
20030065738 Yang et al. Apr 2003 A1
20030066062 Brannock et al. Apr 2003 A1
20030074658 Kim Apr 2003 A1
20030074672 Daniels Apr 2003 A1
20030081557 Mettala et al. May 2003 A1
20030081786 Nakano et al. May 2003 A1
20030084177 Mulligan May 2003 A1
20030084283 Pixton May 2003 A1
20030084434 Ren May 2003 A1
20030084435 Messer et al. May 2003 A1
20030092438 Moore et al. May 2003 A1
20030100303 Armbruster et al. May 2003 A1
20030101246 Lahti May 2003 A1
20030101446 McManus et al. May 2003 A1
20030103484 Oommen et al. Jun 2003 A1
20030110412 Neville Jun 2003 A1
20030117956 Lee Jun 2003 A1
20030121032 Cho et al. Jun 2003 A1
20030131226 Spencer et al. Jul 2003 A1
20030133552 Pillai et al. Jul 2003 A1
20030143991 Minear et al. Jul 2003 A1
20030154471 Teachman et al. Aug 2003 A1
20030156719 Cronce Aug 2003 A1
20030162533 Moles et al. Aug 2003 A1
20030172094 Lauria et al. Sep 2003 A1
20030172138 McCormack et al. Sep 2003 A1
20030172175 McCormack et al. Sep 2003 A1
20030177485 Waldin, Jr. et al. Sep 2003 A1
20030182414 O'Neill Sep 2003 A1
20030186689 Herle et al. Oct 2003 A1
20030186722 Weiner Oct 2003 A1
20030188120 Maeda Oct 2003 A1
20030188156 Yasala et al. Oct 2003 A1
20030191955 Wagner et al. Oct 2003 A1
20030195110 Moody et al. Oct 2003 A1
20030195753 Homuth Oct 2003 A1
20030195951 Wittel et al. Oct 2003 A1
20030196110 Lampson et al. Oct 2003 A1
20030204640 Sahinoja et al. Oct 2003 A1
20030214919 Kilfoyle et al. Nov 2003 A1
20030217193 Thurston et al. Nov 2003 A1
20030217358 Thurston et al. Nov 2003 A1
20030221190 Deshpande et al. Nov 2003 A1
20030226030 Hurst et al. Dec 2003 A1
20030226137 Nagao Dec 2003 A1
20030233649 Reimert Dec 2003 A1
20040006760 Gove et al. Jan 2004 A1
20040008113 Pradhan et al. Jan 2004 A1
20040015952 Lajoie et al. Jan 2004 A1
20040017831 Shen et al. Jan 2004 A1
20040018831 Majmundar et al. Jan 2004 A1
20040031027 Hiltgen Feb 2004 A1
20040031029 Lee et al. Feb 2004 A1
20040031031 Rudelic Feb 2004 A1
20040034853 Gibbons et al. Feb 2004 A1
20040038692 Muzaffar Feb 2004 A1
20040039801 Srinivasan et al. Feb 2004 A9
20040040020 Yang Feb 2004 A1
20040041800 Daniels Mar 2004 A1
20040043788 Mittal Mar 2004 A1
20040049394 Burger et al. Mar 2004 A1
20040049609 Simonson et al. Mar 2004 A1
20040054764 Aderton et al. Mar 2004 A1
20040054995 Lee Mar 2004 A1
20040058651 Ross et al. Mar 2004 A1
20040058652 McGregor et al. Mar 2004 A1
20040059725 Sharangpani et al. Mar 2004 A1
20040062130 Chiang Apr 2004 A1
20040068721 O'Neill et al. Apr 2004 A1
20040068724 Gardner et al. Apr 2004 A1
20040072578 Keutmann et al. Apr 2004 A1
20040073901 Imamatsu Apr 2004 A1
20040073912 Meza Apr 2004 A1
20040078427 Gil et al. Apr 2004 A1
20040082346 Skytt et al. Apr 2004 A1
20040083472 Rao et al. Apr 2004 A1
20040088281 Matsuishi May 2004 A1
20040088694 Ho May 2004 A1
20040092255 Ji et al. May 2004 A1
20040093342 Arbo et al. May 2004 A1
20040093523 Matsuzaki et al. May 2004 A1
20040093557 Kawatani May 2004 A1
20040093597 Rao et al. May 2004 A1
20040095457 Pokorny et al. May 2004 A1
20040098413 Peng May 2004 A1
20040098421 Peng May 2004 A1
20040098427 Peng May 2004 A1
20040098715 Aghera et al. May 2004 A1
20040103214 Adwankar et al. May 2004 A1
20040103340 Sundareson et al. May 2004 A1
20040107416 Buban et al. Jun 2004 A1
20040110497 Little Jun 2004 A1
20040111582 Maeda et al. Jun 2004 A1
20040111702 Chan Jun 2004 A1
20040111723 Moles et al. Jun 2004 A1
20040117322 Bjorksten et al. Jun 2004 A1
20040117760 McFarling Jun 2004 A1
20040117785 Kincaid Jun 2004 A1
20040123188 Srinivasan et al. Jun 2004 A1
20040123270 Zhuang et al. Jun 2004 A1
20040123282 Rao Jun 2004 A1
20040126803 Cash et al. Jul 2004 A1
20040133887 Herle et al. Jul 2004 A1
20040143573 Burkey et al. Jul 2004 A1
20040143836 McCormack et al. Jul 2004 A1
20040148379 Ogura Jul 2004 A1
20040150519 Husain et al. Aug 2004 A1
20040152455 Herle Aug 2004 A1
20040153327 Liu et al. Aug 2004 A1
20040153356 Lockwood et al. Aug 2004 A1
20040158583 Kaappa Aug 2004 A1
20040158829 Beresin et al. Aug 2004 A1
20040166839 Okkonen et al. Aug 2004 A1
20040168165 Kokkinen Aug 2004 A1
20040174264 Reisman et al. Sep 2004 A1
20040190693 Beiermeister Sep 2004 A1
20040192280 Dalton et al. Sep 2004 A1
20040192299 Wilson et al. Sep 2004 A1
20040192306 Elkarat et al. Sep 2004 A1
20040194081 Qumei et al. Sep 2004 A1
20040198447 Larsson Oct 2004 A1
20040204117 Weiner Oct 2004 A1
20040208182 Boles et al. Oct 2004 A1
20040215702 Hamasaki et al. Oct 2004 A1
20040215755 O'Neill Oct 2004 A1
20040215830 Shenfield Oct 2004 A1
20040224679 Okoro et al. Nov 2004 A1
20040226008 Jacobi et al. Nov 2004 A1
20040229684 Blackburn et al. Nov 2004 A1
20040237081 Homiller Nov 2004 A1
20040239975 Kawaura et al. Dec 2004 A1
20040242286 Benco et al. Dec 2004 A1
20040243991 Gustafson et al. Dec 2004 A1
20040243992 Gustafson et al. Dec 2004 A1
20040243993 Okonnen et al. Dec 2004 A1
20040244008 Lee Dec 2004 A1
20040250245 Rao et al. Dec 2004 A1
20040255291 Sierer et al. Dec 2004 A1
20040257208 Huang et al. Dec 2004 A1
20040261072 Herle et al. Dec 2004 A1
20040261073 Herle et al. Dec 2004 A1
20040267481 Resnick et al. Dec 2004 A1
20040267833 Meller et al. Dec 2004 A1
20040268041 Smith Dec 2004 A1
20050005268 Zilvay et al. Jan 2005 A1
20050010552 Kaappa et al. Jan 2005 A1
20050010585 Sahinoja et al. Jan 2005 A1
20050027867 Mueller et al. Feb 2005 A1
20050033774 Brentano et al. Feb 2005 A1
20050033829 Oommen Feb 2005 A1
20050037762 Gurbani et al. Feb 2005 A1
20050038955 Chen Feb 2005 A1
20050039178 Marolia et al. Feb 2005 A1
20050055397 Zhu et al. Mar 2005 A1
20050055453 Zhu Mar 2005 A1
20050055595 Frazer et al. Mar 2005 A1
20050060361 Chatrath et al. Mar 2005 A1
20050060699 Kim et al. Mar 2005 A1
20050066019 Egan et al. Mar 2005 A1
20050071385 Rao Mar 2005 A1
20050073438 Rodgers et al. Apr 2005 A1
20050079863 Macaluso Apr 2005 A1
20050084079 Lang Apr 2005 A1
20050086328 Landram et al. Apr 2005 A1
20050096025 Qumei et al. May 2005 A1
20050097544 Kim May 2005 A1
20050102615 Roman et al. May 2005 A1
20050114493 Mandato et al. May 2005 A1
20050114504 Marolia et al. May 2005 A1
20050114852 Chen et al. May 2005 A1
20050132179 Glaum et al. Jun 2005 A1
20050132349 Roberts et al. Jun 2005 A1
20050135286 Nurminen et al. Jun 2005 A1
20050136942 Timiri et al. Jun 2005 A1
20050144609 Rothman et al. Jun 2005 A1
20050144612 Wang et al. Jun 2005 A1
20050148359 Joeressen Jul 2005 A1
20050153741 Chen et al. Jul 2005 A1
20050160195 Bruner et al. Jul 2005 A1
20050170863 Shostak Aug 2005 A1
20050172117 Aura Aug 2005 A1
20050172141 Gayde et al. Aug 2005 A1
20050182697 Rao Aug 2005 A1
20050198062 Shapiro Sep 2005 A1
20050198379 Panasyuk et al. Sep 2005 A1
20050204068 Zhu et al. Sep 2005 A1
20050204353 Ji Sep 2005 A1
20050216902 Schaefer Sep 2005 A1
20050216903 Schaefer Sep 2005 A1
20050220079 Asokan Oct 2005 A1
20050227677 Kallio Oct 2005 A1
20050227683 Draluk et al. Oct 2005 A1
20050228847 Hayes, Jr. Oct 2005 A1
20050228874 Edgett et al. Oct 2005 A1
20050233733 Roundtree et al. Oct 2005 A1
20050234967 Draluk et al. Oct 2005 A1
20050239447 Holzman et al. Oct 2005 A1
20050246703 Ahonen Nov 2005 A1
20050251848 Al-Janabi Nov 2005 A1
20050257214 Moshir et al. Nov 2005 A1
20050264404 Franczyk et al. Dec 2005 A1
20050268296 Marolia et al. Dec 2005 A1
20050272455 Oommen Dec 2005 A1
20050278399 Herle et al. Dec 2005 A1
20050278715 Herle et al. Dec 2005 A1
20050282533 Draluk et al. Dec 2005 A1
20060007901 Roskowski et al. Jan 2006 A1
20060010437 Marolia Jan 2006 A1
20060015626 Hallamaa et al. Jan 2006 A1
20060015860 Liu et al. Jan 2006 A1
20060020947 Hallamaa et al. Jan 2006 A1
20060026228 Kim Feb 2006 A1
20060031449 Hallamaa et al. Feb 2006 A1
20060036493 Aufricht et al. Feb 2006 A1
20060036874 Cockerille et al. Feb 2006 A1
20060036941 Neil Feb 2006 A1
20060039313 Chou et al. Feb 2006 A1
20060039561 Ypya et al. Feb 2006 A1
20060052089 Khurana et al. Mar 2006 A1
20060053066 Sherr et al. Mar 2006 A1
20060059481 Smith et al. Mar 2006 A1
20060068786 Florence Mar 2006 A1
20060072847 Chor et al. Apr 2006 A1
20060079224 Welnick et al. Apr 2006 A1
20060080635 Anwar et al. Apr 2006 A1
20060080650 Winters et al. Apr 2006 A1
20060080659 Ganji Apr 2006 A1
20060080681 Anwar et al. Apr 2006 A1
20060087982 Kuure et al. Apr 2006 A1
20060089999 Xiang et al. Apr 2006 A1
20060101040 Ren et al. May 2006 A1
20060106806 Sperling et al. May 2006 A1
20060129414 Hallamaa et al. Jun 2006 A1
20060130046 O'Neill Jun 2006 A1
20060158510 Lia et al. Jul 2006 A1
20060160533 Chou et al. Jul 2006 A1
20060161599 Rosen Jul 2006 A1
20060173976 Vincent et al. Aug 2006 A1
20060174242 Zhu et al. Aug 2006 A1
20060176397 Panabaker Aug 2006 A1
20060181553 Choe et al. Aug 2006 A1
20060190608 Sahinoja et al. Aug 2006 A1
20060193337 Paila et al. Aug 2006 A1
20060200658 Penkethman Sep 2006 A1
20060200814 Kontinen et al. Sep 2006 A1
20060203722 Oommen Sep 2006 A1
20060203738 Fok et al. Sep 2006 A1
20060212561 Feng Sep 2006 A1
20060212937 Natarajan Sep 2006 A1
20060217111 Marolia et al. Sep 2006 A1
20060223528 Smith Oct 2006 A1
20060224712 Aho Oct 2006 A1
20060236325 Rao et al. Oct 2006 A1
20060242305 Alnas Oct 2006 A1
20060246922 Gasbarro et al. Nov 2006 A1
20060248172 Zurawka et al. Nov 2006 A1
20060258344 Chen Nov 2006 A1
20060271659 Mittal et al. Nov 2006 A1
20060277590 Limont et al. Dec 2006 A1
20070014243 Meyer et al. Jan 2007 A1
20070028226 Chen et al. Feb 2007 A1
20070036294 Chaudhuri et al. Feb 2007 A1
20070041545 Gainsboro Feb 2007 A1
20070043849 Lill et al. Feb 2007 A1
20070049265 Kaimal et al. Mar 2007 A1
20070093243 Kapadekar et al. Apr 2007 A1
20070106806 Tu et al. May 2007 A1
20070132774 Fan et al. Jun 2007 A1
20070133484 Albal et al. Jun 2007 A1
20070150444 Chesnais et al. Jun 2007 A1
20070150524 Eker et al. Jun 2007 A1
20070169073 O'Neill et al. Jul 2007 A1
20070169075 Lill et al. Jul 2007 A1
20070169089 Bantz et al. Jul 2007 A1
20070169099 Rao et al. Jul 2007 A1
20070186108 Passarella et al. Aug 2007 A1
20070190939 Abel Aug 2007 A1
20070192158 Kim Aug 2007 A1
20070192453 Copeland et al. Aug 2007 A1
20070200713 Weber et al. Aug 2007 A1
20070220504 Eker Sep 2007 A1
20070226805 Jeal et al. Sep 2007 A1
20070259633 Rao Nov 2007 A1
20070277169 Rao et al. Nov 2007 A1
20070282621 Altman et al. Dec 2007 A1
20070283003 Broyles et al. Dec 2007 A1
20070294684 Kumashiro et al. Dec 2007 A1
20080032763 Giobbi Feb 2008 A1
20080043726 Herrero-Veron et al. Feb 2008 A1
20080046583 Rao Feb 2008 A1
20080062900 Rao Mar 2008 A1
20080062926 Oba Mar 2008 A1
20080108321 Taaghol et al. May 2008 A1
20080127320 De Lutiis et al. May 2008 A1
20080144590 Rantanen et al. Jun 2008 A1
20080154633 Ishibashi et al. Jun 2008 A1
20080160983 Poplett et al. Jul 2008 A1
20080196019 Meller et al. Aug 2008 A1
20080205419 Shin et al. Aug 2008 A1
20080208928 Hernandez Aug 2008 A1
20080244049 Normark et al. Oct 2008 A1
20080271023 Bone et al. Oct 2008 A1
20090030965 Hayes, Jr. Jan 2009 A1
20090064341 Hartung et al. Mar 2009 A1
20090113386 Eker et al. Apr 2009 A1
20090190757 Chen et al. Jul 2009 A1
20090204845 Herscovitz et al. Aug 2009 A1
20090219848 Lohmar et al. Sep 2009 A1
20090328099 Praden et al. Dec 2009 A1
20100185727 Mittal Jul 2010 A1
20100275010 Ghirardi Oct 2010 A1
20100279733 Karsten et al. Nov 2010 A1
20100287308 Robbin et al. Nov 2010 A1
20110022948 Brown et al. Jan 2011 A1
20110209055 Plestid et al. Aug 2011 A1
Foreign Referenced Citations (136)
Number Date Country
2339923 Mar 2000 CA
2414281 May 2002 CA
1864429 Nov 2006 CN
1906574 Jan 2007 CN
101043372 Sep 2007 CN
101543016 Sep 2009 CN
101595469 Dec 2009 CN
101904105 Dec 2010 CN
10115729 Oct 2001 DE
112007002863 Oct 2009 DE
112008002767 Oct 2010 DE
0717353 Jun 1996 EP
0803812 Oct 1997 EP
0811942 Dec 1997 EP
1049346 Nov 2000 EP
1052571 Nov 2000 EP
1077407 Feb 2001 EP
1152338 Nov 2001 EP
1176840 Jan 2002 EP
1184785 Mar 2002 EP
1256865 Nov 2002 EP
1333375 Jun 2003 EP
1331833 Jul 2003 EP
1584005 Jul 2004 EP
1597668 Aug 2004 EP
1654640 Dec 2004 EP
1639435 Jan 2005 EP
1652100 Jan 2005 EP
1652075 Feb 2005 EP
1513317 Mar 2005 EP
1515571 Mar 2005 EP
1519600 Mar 2005 EP
1660996 Mar 2005 EP
1665041 Apr 2005 EP
1668951 Jun 2005 EP
1563436 Aug 2005 EP
1584016 Oct 2005 EP
1691282 Aug 2006 EP
1705832 Sep 2006 EP
1732037 Dec 2006 EP
2024850 Feb 2009 EP
2025095 Feb 2009 EP
2047420 Apr 2009 EP
2087644 Aug 2009 EP
2104992 Sep 2009 EP
1614034 Jan 2012 EP
2426151 Nov 2006 GB
2458047 Sep 2009 GB
2468225 Sep 2010 GB
61173360 Aug 1986 JP
07160490 Jun 1995 JP
07219780 Aug 1995 JP
08202626 Aug 1996 JP
8202626 Aug 1996 JP
11003223 Jan 1999 JP
11161479 Jun 1999 JP
11272454 Oct 1999 JP
11345127 Dec 1999 JP
2001233353 Feb 2003 JP
19990050594 Nov 1999 KR
2002-0034228 May 2000 KR
20010046714 Jun 2001 KR
20010076555 Aug 2001 KR
2001-0100328 Nov 2001 KR
20010100328 Nov 2001 KR
20020034228 May 2002 KR
100506785 Aug 2005 KR
1020050088193 Sep 2005 KR
1020080008425 Mar 2006 KR
1020060064660 Jun 2006 KR
1020060064663 Jun 2006 KR
1020060089229 Aug 2006 KR
20090035044 Apr 2009 KR
100986487 Oct 2010 KR
101085987 Nov 2011 KR
090107418 Jan 2003 TW
WO9632679 Oct 1996 WO
WO9838823 Sep 1998 WO
WO9856149 Dec 1998 WO
WO9921382 Apr 1999 WO
WO9957900 Nov 1999 WO
WO0001187 Jan 2000 WO
WO0002358 Jan 2000 WO
WO0022860 Apr 2000 WO
0106798 Jan 2001 WO
WO0106798 Jan 2001 WO
WO0186985 Nov 2001 WO
WO0223925 Mar 2002 WO
WO0225438 Mar 2002 WO
WO0241147 May 2002 WO
WO03010656 Feb 2003 WO
WO03012574 Feb 2003 WO
WO03025742 Mar 2003 WO
WO03034765 Apr 2003 WO
WO03049381 Jun 2003 WO
WO2004031889 Apr 2004 WO
WO2004038546 May 2004 WO
WO2004042538 May 2004 WO
WO2004049104 Jun 2004 WO
WO2004049115 Jun 2004 WO
WO2004049314 Jun 2004 WO
WO2004059956 Jul 2004 WO
WO2004061551 Jul 2004 WO
WO2004061615 Jul 2004 WO
WO2004063899 Jul 2004 WO
WO2004066091 Aug 2004 WO
WO2004070571 Aug 2004 WO
WO2004072773 Aug 2004 WO
WO2004086196 Oct 2004 WO
WO2004095457 Nov 2004 WO
WO2004109510 Dec 2004 WO
WO2005001665 Jan 2005 WO
WO2005004395 Jan 2005 WO
WO2005008940 Jan 2005 WO
WO2005013123 Feb 2005 WO
WO2005015343 Feb 2005 WO
WO2005024628 Mar 2005 WO
WO2005031570 Apr 2005 WO
WO2005036916 Apr 2005 WO
WO2005041459 May 2005 WO
WO2005079334 Sep 2005 WO
WO2006003254 Jan 2006 WO
WO2007112108 Oct 2007 WO
WO2007117514 Oct 2007 WO
WO2007146710 Dec 2007 WO
WO2008003081 Jan 2008 WO
WO2008008880 Jan 2008 WO
WO2008014454 Jan 2008 WO
WO2008022195 Feb 2008 WO
WO2008022198 Feb 2008 WO
WO2008028072 Mar 2008 WO
WO2008033962 Mar 2008 WO
WO2008045700 Apr 2008 WO
WO2008048905 Apr 2008 WO
WO2008067446 Jun 2008 WO
WO2009051760 Apr 2009 WO
Non-Patent Literature Citations (742)
Entry
Sevanto et al, “Introducing quality-of-service and traffic classes into wireless mobile networks” 1998, ACM, Proc. of 1st ACM Intl. Wkshp on Wireless Mobile Multimedia, WOWMOM '98, pp. 21-29.
Deitel and Deitel, “C How to Program”, 1994, Prentice-Hall, Inc., Second Edition, Chapter 5.
W. J. Meyers. 1980. Design of a microcode link editor. In Proceedings of the 13th annual workshop on Microprogramming (MICRO 13). IEEE Press, Piscataway, NJ, USA, 165-170.
“ILOG Delivers Enterprise-Wide Business Rule Management With ILOG JRules 4.5”, Jun. 10, 2003, Press Release, Archived Aug. 4, 2003 at http://web.archive.org/web/20030804140400/http://www.ilog.com/corporate/releases/us/030610—jrules45.cfm.
Randal C. Burns and Darrell D. E. Long. 1998. In-place reconstruction of delta compressed files. In Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing (PODC '98). ACM, New York, NY, USA, 267-275. DOI=10.1145/277697.277747 http://doi.acm.org/10.1145/277697.277747.
European Search Report, Appln. No. 04759830.5 dated Jan. 18, 2008.
“Focus on Open View a Guide to Hewlett-Packard's Network and Systems Management Platform,” Nathan J. Muller, pp. 1-291, CBM Books, published 1995.
“Client Server Computing in Mobile Environments,” J. Jing et al., ACM Computing Surveys, vol. 31, Issue 2, pp. 117-159, ACM Press, Jul. 1999.
“ESW4: Enhanced Scheme for WWW Computing in Wireless Communication Environments,” S. Hadjiefthymiades, et al. ACM SIGCOMM Computer Communication Review, vol. 29, Issue 5, pp. 24-35, ACM Press, Oct. 1999.
“Introducing Quality-of-Service and Traffic Classes in Wireless Mobile Networks,” J. Sevanto, et al. Proceedings of the 1st ACM International Workshop on Wireless Mobile Multimedia, pp. 21-29, ACM Press, 1998.
“Any Network, Any Terminal, Anywhere,” A Fasbender et al., IEEE Personal Communications, Apr. 1999, pp. 22-30, IEEE Press, 1999.
Meyers, W.J., “Design of a Microcode Link Editor”, Proceedings of the 13th Annual Workshop on Microprogramming, pp. 165-170.
Computer Dictionary, Microsoft Press, 2002, pp. 380 and 423.
Koenig et al. “Re: ext2—available+used not equal to total” Dec. 31, 1998, acessed on Oct. 9, 2007 from <http://www.uwsg.iu.edu/hypermail/linux/kerne1/9901.0/0270.html>, Linux Kernel Archive, 1 page.
Bettini, L., “Software Update via Mobile Agent Based Programming,” Proc. ACM SAC, Jan. 1, 2002, pp. 32-36.
Bitfone Corp., Ca Office Action Jun. 8, 2007, CA App. No. 2,414,281, 4 p.
Bitfone Corp., CN Office Action Jun. 5, 2009, CN App. No. 200610067641.4, 12 p.
Bitfone Corp., CN Office Action Dec. 12, 2010, CN App. No. 200610067641.4, 3 p.
Bitfone Corp., EP Office Action Mar. 16, 2010, EP App. No. EP04777313.0, 8 p.
Bitfone Corp., EP Search Report Mar. 22, 2012, EP App. No. 06251423.7, 6 p.
Bitfone Corp., EP Office Action Mar. 26, 2010, EP App. No. 04785381.7, 5 p.
Bitfone Corp., EP Office Action May 11, 2012, EP App. No. 04777313.0, 9 p.
Bitfone Corp., EP Search Report Jan. 18, 2008, EP App No. 04759830.5, 5 p.
Bitfone Corp., EP Search Report Mar. 20, 2011, EP App. No. 06251423.7, 7 p.
Bitfone Corp., EP Search Report Jul. 1, 2011, EP App. No. 06251423.7, 11 p.
Bitfone Corp., EP Search Report Jul. 4, 2006, EP App. No. EP06250739.7, 7 p.
Bitfone Corp., EP Search Report Jul. 19, 2006, EP App. No. 06251512.7, 8 p.
Bitfone Corp., EP Search Report Nov. 26, 2009, EP App. No. EP04777313.0, 3 p.
Bitfone Corp., Int'l Prelim Rpt Jan. 9, 2006, PCT App. No. PCT/US2004/022598, 7 p.
Bitfone Corp., Int'l Prelim Rpt Jan. 30, 2006, PCT App. No. PCT/US2004/024876, 8 p.
Bitfone Corp., Int'l Prelim Rpt Mar. 6, 2006, PCT App. No. PCT/US2004/028433, 8 p.
Bitfone Corp., Int'l Prelim Rpt Mar. 13, 2006, PCT App. No. PCT/US2004/021037, 7 p.
Bitfone Corp., Int'l Prelim Rpt Mar. 27, 2006, PCT App. No. PCT/US2004/031547, 9 p.
Bitfone Corp., Int'l Prelim Rpt Aug. 5, 2005, PCT App No. PCT/US2004/002950, 6 p.
Bitfone Corp., Int'l Prelim Rpt Aug. 12, 2005, PCT App. No. PCT/US2004/002084, 4 p.
Bitfone Corp., Int'l Prelim Rpt Sep. 30, 2008, PCT App. No. PCT/US2007/007489, 4 p.
Bitfone Corp., Int'l Prelim Rpt Oct. 1, 2005, PCT App. No. PCT/US2004/008918, 4 p.
Bitfone Corp., Int'l Prelim Rpt Oct. 28, 2008, PCT App. No. PCT/US2004/000694, 4 p.
Bitfone Corp., Int'l Prelim Rpt Nov. 7, 2006, PCT App. No. PCT/US2005/004520, 4 p.
Bitfone Corp., Int'l Prelim Rpt Dec. 8, 2005, PCT App. No. PCT/US2004/017731, 8 p.
Bitfone Corp., Int'l Prelim Rpt Dec. 10, 2008, PCT App. No. PCT/US2007/070534, 9 p.
Bitfone Corp., Int'l Prelim Rpt, Apr. 3, 2006, PCT App. No. PCT/US2004/033071, 9 p.
Bitfone Corp., Int'l Search Report & Written Opinion Jan. 4, 2005, PCT App. No. PCT/US2004/002084, 8 p.
Bitfone Corp., Int'l Search Report & Written Opinion Jan. 14, 2005, PCT App. No. PCT/US2004/011219, 9 p.
Bitfone Corp., Int'l Search Report & Written Opinion Jul. 14, 2008, PCT App. No. PCT/US2004/001574, 16 p.
Bitfone Corp., Int'l Search Report Jan. 10, 2005, PCT App. No. PCT/US2003/033241, 3 p.
Bitfone Corp., Int'l Search Report Jan. 19, 2005, PCT App. No. PCT/US2004/024876, 1 p.
Bitfone Corp., Int'l Search Report Jan. 25, 2005, PCT App. No. PCT/US2003/037265, 3 p.
Bitfone Corp., Int'l Search Report Jan. 25, 2005, PCT App. No. PCT/US2004/033071, 3 p.
Bitfone Corp., Int'l Search Report Jan. 20, 2006, PCT App. No. PCT/US2004/021037, 3 p.
Bitfone Corp., Int'l Search Report Feb. 10, 2005, PCT App. No. PCT/US2004/031547, 3 p.
Bitfone Corp., Int'l Search Report Mar. 7, 2005, PCT App. No. PCT/US2004/002950, 4 p.
Bitfone Corp., Int'l Search Report Mar. 16, 2005, PCT App. No. PCT/US2004/008918, 3 p.
Bitfone Corp., Int'l Search Report Apr. 12, 2008, PCT App. No. PCT/US2004/063899, 3 p.
Bitfone Corp., Int'l Search Report Apr. 22, 2004, PCT App. No. PCT/US2003/027620, 4 p.
Bitfone Corp., Int'l Search Report Apr. 23, 2008, PCT App. No. PCT/US2007/007489, 3 p.
Bitfone Corp., Int'l Search Report May 26, 2005, PCT App. No. PCT/US2004/028433, 7 p.
Bitfone Corp., Int'l Search Report Jun. 22, 2005, PCT App. No. PCT/US2003/041555, 3 p.
Bitfone Corp., Int'l Search Report Jul. 20, 2005, PCT App. No. PCT/US2004/022598, 3 p.
Bitfone Corp., Int'l Search Report Jul. 27, 2005, PCT App No. PCT/US2003/035934, 3 p.
Bitfone Corp., Int'l Search Report Aug. 23, 2005, PCT App. No. PCT/US2004/017731, 6 p.
Bitfone Corp., Int'l Search Report Oct. 3, 2006, PCT App. No. PCT/US2005/004520, 3 p.
Bitfone Corp., Int'l Search Report Oct. 3, 2008, PCT App. No. PCT/US2004/000694, 3 p.
Bitfone Corp., Int'l Search Report Oct. 14, 2004, PCT App. No. PCT/US2003/035377, 4 p.
Bitfone Corp., Int'l Search Report Dec. 3, 2004, PCT App. No. PCT/US2003/036995, 4 p.
Bitfone Corp., Int'l Search Report,JUl. 20, 2006, PCT App. No. PCT/US2003/027727, 8 p.
Bitfone Corp., JP Final Office Action Jun. 6, 2006, Jap. App. No. 2002-543291, 10 p.
Bitfone Corp., JP Office Action Nov. 8, 2005, JP App. No. 2002-543291, 13 p.
Bitfone Corp., KR Office Action Feb. 16, 2011, Kr App. No. KR-10-2006-7006350, 4 p.
Bitfone Corp., KR Office Action Apr. 10, 2008, KR App. No. KR10-2006-7004343, 7 p.
Bitfone Corp., KR Office Action May 21, 2008, KR App. No. KR10-2006-7004488, 8 p.
Bitfone Corp., KR Office Action Aug. 21, 2007, KR App. No. KR10-2006-7004343, 5 p.
Bitfone Corp., KR Office Action Aug. 21, 2007, KR App. No. KR10-2006-7004488, 5 p.
Bitfone Corp., Written Opinion Jan. 19, 2005, PCT App. No. PCT/US2004/017731, 7 p.
Bitfone Corp., Written Opinion Jan. 30, 2006, PCT App. No. PCT/US2004/021037, 6 p.
Bitfone Corp., Written Opinion Mar. 26, 2006, PCT App. No. PCT/US2004/031547, 8 p.
Bitfone Corp., Written Opinion Jul. 20, 2005, PCT App. No. PCT/US2004/022598, 6 p.
Bitfone Corp., Written Opinion Dec. 4, 2005, PCT App. No. PCT/US2004/017731, 7 p.
Burns et al., “In-Place Reconstruction of Version Differences,” IEEE Transactions on Knowledge and Data Engineering, Vo. 15. No. 4, Jul./Aug. 2003, pp. 973-984.
Ciancarini et al., “Using a Coordination Language to Specify and Analyze Systems Containing Modile Components,” ACM Transactions, vol. 9. No. 2, Apr. 2000, pp. 167-198.
Claise et al., “IPFIX Protocol Specification”, IPFIX Working Group, Jun. 2003, retrieved from: http://tools.ietf.org/html/draft-ietf-ipfix-protocol-00.
CRC Press LLC., “Overview of Cryptography,” Copyright 1997 CRC Press LLC, 48 p.
Fasbender et al., “Any Network, Any Terminal, Anywhere,” IEEE Personal Communications, Apr. 1999, pp. 22-30, IEEE Press. 1999.
Hadjiefthymiades et al., “ESW4: Enhanced Scheme for WWW Computing in Wireless Communication Environments,” ACM SIGCOMM Computer Communication Review, vol. 29, Issue 5, pp. 24-35, ACM Press, Oct., 1999.
Hoffmeyer et al., “Radio Software Download for Commercial Wireless Reconfigurable Devices,” IEEE Communications Magazine, IEEE Service Center, New York, NY, US. vol. 42, No. 3, Mar. 2004, pp. S26-S32.
HPC, Int'l Search Report Sep. 5, 2007, PCT App. No. PCT/U52007/008415, 2 p.
HPDC, CN Office Action Sep. 22, 2011, CN App. No. 200780044370.3, 9 p.
HPDC, EP Office Action Jan. 22, 2010, EP App. No. 04701739.7, 7 p.
HPDC, EP Office Action Feb. 4, 2011, EP App. No. 07843502.1, 4 p.
HPDC, EP Office Action Feb. 9, 2011, EP App. No. 04759830.5, 3 p.
HPDC, EP Office Action Mar. 4, 2011, EP App. No. 07813468.1, 9 p.
HPDC, EP Office Action Mar. 23, 2010, EP App. No. 04705590.0, 10 p.
HPDC, EP Office Action Apr. 3, 2009, EP App. No. 04779823.6, 7 p.
HPDC, EP Office Action Apr. 11, 2008, EP App. No. 04759830.5, 5 p.
HPDC, EP Office Action Apr. 23, 2009, EP App. No. 04701739.7, 7 p.
HPDC, EP Office Action May 4, 2011, EP App. No. 04759830.5, 3 p.
HPDC, EP Office Action May 11, 2010, EP App. No. 03759224.3, 6 p.
HPDC, EP Office Action Jun. 3, 2009, EP App. No. 01991949.7, 7p.
HPDC, EP Office Action Jun. 30, 2009, EP App. No. 07798184.3, 5 p.
HPDC, EP Office Action Jul. 27, 2011, EP App. No. 07844241.5, 6 p.
HPDC, EP Office Action Aug. 12, 2011, EP App. No. 04759830.5. 56 p.
HPDC, EP Office Action Aug. 30, 2011, EP App. No. 04779823.6, 6 p.
HPDC, EP Office Action Sep. 2, 2010, EP App. No. 04759830.5, 4 p.
HPDC, EP Office Action Sep. 7, 2009, EP App. No. 07844241.5, 3 p.
HPDC, EP Office Action Sep. 18, 2009, EP App. No. 07843502.1, 2 p.
HPDC, EP Office Action Oct. 15, 2009, EPp App. No. 04785067.2, 6 p.
HPDC, EP Office Action Oct. 27, 2009, EP App. No. 04782849.6, 3 p.
HPDC, EP Office Action Nov. 10, 2009, EP App. No. 07798184.3, 4 p.
HPDC, EP Supp. Search Report Feb. 6, 2009, EP App. No. 04701739, 3 p.
HPDC, EP Search Report Feb. 23, 2010, EP App. No. 03789910.1, 5 p.
HPDC, EP Search Report Mar. 6, 2009, EP App. No. 01991949.7, 7 p.
HPDC, EP Search Report Jun. 3, 2009, EP App. No. 01991949.7, 7 p.
HPDC, EP Search Report Aug. 9, 2010, EP App. No. 03789910.1, 6 p.
HPDC, EP Search Report Oct. 19, 2009, EP App. No. 07813468.1, 10 p.
HPDC, EP Search Report Nov. 13, 2009, EP App. No. 04756990.0, 4 p.
HPDC, EP Search Report Nov. 24, 2008, EP App. No. 04779823.6, 3 p.
HPDC, EP Search Report Nov. 25, 2009, EP App. No. 04705590.0, 6 p.
HPDC, EP Supp. Search Report Feb. 6, 2009, EP App. No. 004701739.7, 3 p.
HPDC, EP Supp. Search Report Jan. 26, 2010, EP App. No. 03759224.3, 3 p.
HPDC, EP Supp. Search Report Dec. 22, 2009, EP App. No. 03789910.1, 7 p.
HPDC, GB Office Action Feb. 25, 2011, GB App. No. 0910190.8, 6 p.
HPDC, GB Office Action Jul. 26, 2011, GB App. No. 0910190.8, 1 p.
HPDC, GB Office Action Sep. 20, 2011, GB App. No. 1007372.4, 3 p.
HPDC, GB Office Action Dec. 22, 2011, GB App. No. 1007372.4, 2 p.
HPDC, Int'l Prelim Rpt Jan. 6, 2009, PCT App. No. PCT/US2007/072493, 8 p.
HPDC, Int'l Prelim Rpt Jan. 13, 2009, PCT App. No. PCT/US2007/073340, 8 p.
HPDC, Int'l Prelim Rpt Jan. 27, 2009, PCT App. No. PCT/US2007/074586, 5 p.
HPDC, Int'l Prelim Rpt Feb. 17, 2009, PCT App. No. PCT/US2007/076001, 7 p.
HPDC, Int'l Prelim Rpt Feb. 17, 2009, PCT App. No. PCT/US2007/076006, 7 p.
HPDC, Int'l Prelim Rpt Mar. 3, 2009, PCT App. No. PCT/US2007/077288, 7 p.
HPDC, Int'l Prelim Rpt Mar. 17, 2009, PCT App. No. PCT/US2007/078326, 7 p.
HPDC, Int'l Prelim Rpt Apr. 7, 2009, PCT App. No. PCT/US2007/079920, 8 p.
HPDC, Int'l Prelim Rpt Apr. 20, 2010, PCT App. No. PCT/US2008/011824, 6 p.
HPDC, Int'l Prelim Rpt Apr. 22, 2009, PCT App. No. PCT/US2007/081273, 8 p.
HPDC, Int'l Prelim Rpt Jun. 3, 2009, PCT App. No. PCT/US2007/085903, 6 p.
HPDC, Int'l Prelim Rpt Sep. 30, 2008, PCT App. No. PCT/US2007/008415, 7 p.
HPDC, Int'l Search Report Jan. 3, 2008, PCT App. No. US2007/073340, 5 p.
HPDC, Int'l Search Report Jan. 31, 2008, PCT App. No. PCT/US2007/076001, 3 p.
HPDC, Int'l Search Report Feb. 14, 2008, PCT App. No. PCT/US2007/072493, 5 p.
HPDC, Int'l Search Report Mar. 5, 2008, PCT App. No. PCT/US2007/078326, 5 p.
HPDC, Int'l Search Report Mar. 25, 2009, PCT App. No. PCT/US2008/011824, 2p.
HPDC, Int'l Search Report Mar. 27, 2008, PCT App. No. PCT/US2007/079920, 3 p.
HPDC, Int'l Search Report Apr. 10, 2008, PCT App No. PCT/US2007/070534, 7 p.
HPDC, Int'l Search Report Jun. 26, 2008, PCT App. No. PCT/US2007/076006, 5 p.
HPDC, Int'l Search Report Jul. 18, 2008, PCT App. No. PCT/US2007/077288, 5 p.
HPDC, Int'l Search Report Aug. 13, 2008, PCT App. No. PCT/US2007/085903, 3 p.
HPDC, Int'l Search Report Sep. 2, 2008, PCT App. No. PCT/US2007/081273, 5 p.
HPDC, Int'l Search Report Oct. 24, 2008, PCT App. No. PCT/US2007/074586, 3 p.
HPDC, JP Office Action Nov. 8, 2005, JP App. No. 2002-543291, 13 p.
HDPC, KR Office Action May, 6, 2010, KR App. No. 10-2009-7005363, 3 p.
HPDC, KR Office Action Nov. 11, 2009, KR App. No. 10-2009-7005363, 2 p.
HPDC, Written Opinion Apr. 17, 2010, PCT App. No. PCT/US2008/011824, 4 p.
IBM, “System Firmware Update Method Before Rebooting the Operating System,” Research Disclosure, Mason Publications, vol. 425, No. 86, Sep. 1, 1999, 2 p.
Jing et al., “Client Server Computing in Mobile Environments,” ACM Computing Surveys, vol. 31, No. 2, Jun. 1999, pp. 117-157.
Jones, F., “Jambala-Intelligence beyond digital wireless,” Ericsson Review No. 3, 1998, pp. 126-131.
Klein et al., “Compressed Delta Encoding for Lzss Encoded Files,” 2007 Data Compression Conference (Dcc'07) IEEE Computer Society, 10 p.
Koenig et al., “Re: ext2—available+used not equal to total,” Dec. 31, 1998, accessed on Oct. 9, 2007 from <http://www.uwsg.iu.edu/hypermail/linux/kerne1/9901.0/0270.html>, Linux Kernel Archive, 2 p.
Lindholm et al., “Fast and Simple XML Tree Dfferencing by Sequence Alignment,” DocEng '06, Oct. 10-13, 2006, Amsterdam, The Netherlands, Copyright 2006 ACM, pp. 75- 84.
Memorymanagement.Org, http://web.archive.org/web/20020313115607/http://www.memorymanagement.org/glossary, 3 p. 2003.
Meng et al., “Schema-Guided Wrapper Maintenance for Web-Data Extraction,” WIDM'03, Nov. 7-8, 2003, pp. 1-8.
Microsoft, “Computer Dictionary,” Microsoft Press, 2002, pp. 372, 373, 380, 423 and 565.
Oommen, P., “A Framework for Integrated Management of Mobile-Stations Over-the-Air,” Integrated Network Management Proceedings, 2001 IEEE/IFIP International Symposium on May 14-18, 2001, pp. 247-256.
Oommen, P., “Over the Air Handset Management,” Emerging Technologies Symposium; Broadband, Wireless Internet Access, 2000 IEEE Apr. 10-11, 2000, 4 p.
Open Mobile Alliance, “Device Management Protocol, Candidate,” Ver 1.2, Jun. 2, 2006.
Open Mobile Alliance, “Generic Content Download Over the Air Specification,” Version 1.0, Sep. 2002, 42 p.
Pant et al., Software Reliability Predictions for Distributed Software, IEEE, 1998, pp. 11-21.
Park et al., “A Low-cost Memory Architecture with NAND XIP for Mobile Embedded Systems,” Codes+ISSS'03, Oct. 1-3, 2003, pp. 138-143.
Pedram, M., “Power Optimization and Management in Embedded Systems,” Jan. 2001, pp. 239-244.
Peymandoust et al., “Low Power Embedded Software Optimization Using Symbolic Algebra,” Mar. 2002, pp. 1-7.
Raskar et al., “Image Fusion for Context Enhancement and Video Surrealism,” Proceedings of the Third Int'l. Symposium on Non-Photorealistic Animation and Rendering (NPAR2004), Jun. 7-9, 2004, 9 p.
Satoh et al., Experiment of Component-Based Software Development on Multiple Distributed Object Environments, IEEE, 1998, 8 p.
Sevanto et al., “Introducing Quality-of-Service and Traffic Classes into Wireless Mobile Networks,” Wowmom 98 Dallas, Texas, USA, Copyright ACM 1998 pp. 21-30.
Symborski, C. W., “Updating Softwaare and Configuration Data in a Distributed Communications Nev.'Vork”. 1988 Computer NetworKing Symposium, 8 p.
Varshney et al., “Emerging Mobile and Wireless Networks,” Communications of the ACM Jun. 2000, vol. 43, No. 6, pp. 73-81.
W3C, XML Signature Syntax and Processing, (2nd edition), Jun. 10, 2008, 1 p. [Online] http://www.w3.org/TR/xmldsig-core/.
White, Ron, “How Computers Work,” Millennium Ed., Que Corporation, Indianapolis, in, 1999, 284 p.
Yergeau, F., “UTF-8, a transformation format of ISO 10646,” Jan. 1998, Alis Technologies, 10 p.
Yoshimura et al., “Mobile Streaming Media CDN Enabled by Dynamic SMIL,” WWW2003, May 7-11, 2002, Honolulu, Hawaii, ACM, pp. 651-661.
Wheatley, Office Action Dec. 27, 2011, U.S. Appl. No. 12/057,044, Mar. 27, 2008, 6 p.
Rao, Office Action Nov. 14, 2008, U.S. Appl. No. 11/057,361, Feb. 14, 2005, 8 p.
Insun, Office Action Feb. 3, 2010, U.S. Appl. No. 11/111,276, Apr. 21, 2005, 10 p.
Insun, Office Action Jul. 12, 2010, U.S. Appl. No. 11/111,276, Apr. 21, 2005, 11 p.
Iyad, Office Action Jan. 28, 2008, U.S. Appl. No. 11/100,305, Apr. 6, 2005, 20 p.
Iyad, Final Office Action Jul. 22, 2008, U.S. Appl. No. 11/100,305, Apr. 6, 2005, 11 p.
Iyad, Office Action Jan. 21, 2009, U.S. Appl. No. 11/100,305, Apr. 6, 2005, 7 p.
Iyad, Final Office Action Jul. 8, 2009, U.S. Appl. No. 11/100,305, Apr. 6, 2005, 25 p.
Shao-Chun, Office Action Dec. 11, 2008, U.S. Appl. No. 11/120,556, May 3, 2005, 28 p.
Shao-Chun, Final Office Action May 26, 2009, U.S. Appl. No. 11/120,556, May 3, 2005, 30 p.
Shao-Chun, Office Action Oct. 28, 2009, U.S. Appl. No. 11/120,556, May 3, 2005, 31 p.
Shao-Chun, Final Office Action May 13, 2010, U.S. Appl. No. 11/120,556, May 3, 2005 32 p.
Shao-Chun, Office Action Nov. 29, 2010, 11/120,556, May 3, 2005, 26 p.
Shao-Chun, Office Action Oct. 29, 2008, U.S. Appl. No. 11/124,866, May 9, 2005, 13 p.
Shao-Chun, Office Action May 5, 2009, U.S. Appl. No. 11/124,866, May 9, 2005, 14 p.
Shao-Chun, Office Action Nov. 12, 2008, U.S. Appl. No. 11/144,537, Jun. 3, 2005, 16 p.
Shao-Chun, Final Office Action Apr. 29, 2009, U.S. Appl. No. 11/144,537, Jun. 3, 2005, 22 p.
Sunil, Office Action Aug. 20, 2008, U.S. Appl. No. 11/189,344, Jul. 26, 2005, 12 p.
Sunil, Final Office Action Feb. 19, 2009, U.S. Appl. No. 11/189,344, Jul. 26, 2005, 13 p.
Sunil, Office Action Aug. 19, 2009, U.S. Appl. No. 11/189,344, Jul. 26, 2005, 10 p.
Sunil, Office Action Sep. 4, 2008, U.S. Appl. No. 11/226,032, Sep. 14, 2005, 17 p.
Sunil, Final Office Action Jul. 6, 2009, U.S. Appl. No. 11/226,032, Sep. 14, 2005, 17 p.
Sunil, Office Action Dec. 14, 2009, U.S. Appl. No. 11/226,032, Sep. 14, 2005, 23 p.
Sunil, Final Office Action Apr. 29, 2010, U.S. Appl. No. 11/226,032, Sep. 14, 2005, 16 p.
Rao, Office Action Aug. 21, 2009, U.S. Appl. No. 11/247,463, Oct. 11, 2005, 18 p.
Rao, Final Office Action Jul. 13, 2010, U.S. Appl. No. 11/247,463, Oct. 11, 2005, 19 p.
Rao, Office Action Mar. 8, 2011, U.S. Appl. No. 11/247,463, Oct. 11, 2005, 20 p.
Rao, Final Office Action Aug. 30, 2011, U.S. Appl. No. 11/247,463, Oct. 11, 2005, 20 p.
Shao-Chun, Office Action Jul. 8, 2009, U.S. Appl. No. 11/316,291, Dec. 21, 2005, 18 p.
Shao-Chun, Final Office Action Dec. 2, 2009, U.S. Appl. No. 11/316,291, Dec. 21, 2005, 18 p.
Giovanni, Office Action Jul. 8, 2009, U.S. Appl. No. 11/316,292, Dec. 21, 2005, 8 p.
Giovanni, Office Action Jan. 25, 2010, U.S. Appl. No. 11/316,292, Dec. 21, 2005, 7 p.
Shao-Chun, Office Action May 27, 2009, U.S. Appl. No. 11/352,813, Feb. 13, 2006, 31 p.
Sunil, Office Action Jun. 10, 2008, U.S. Appl. No. 11/352,702, Feb. 13, 2006, 8 p.
Sunil, Final Office Action Mar. 20, 2009, U.S. Appl. No. 11/352,702, Feb. 13, 2006, 11 p.
Sunil, Office Action Sep. 28, 2009, U.S. Appl. No. 11/352,702, Feb. 13, 2006, 9 p.
Sunil, Final Office Action Mar. 16, 2010, U.S. Appl. No. 11/352,702, Feb. 13, 2006, 11 p.
Rao, Office Action Feb. 17, 2009, U.S. Appl. No. 11/374,481, Mar. 9, 2006, 17 p.
Rao, Final Office Action Jul. 21, 2009, U.S. Appl. No. 11/374,481, Mar. 9, 2006, 18 p.
Rao, Office Action Jan. 4, 2010, U.S. Appl. No. 11/374,481, Mar. 9, 2006, 10 p.
Jason, Office Action Oct. 16, 2008, U.S. Appl. No. 11/369,561, Mar. 7, 2006, 13 p.
Jason, Final Office Action May 8, 2009, U.S. Appl. No. 11/369,561, Mar. 7, 2006, 14 p.
Rao, Office Action Mar. 12, 2009, U.S. Appl. No. 11/385,162, Mar. 21, 2006, 6 p.
Rao, Office Action Sep. 25, 2009, U.S. Appl. No. 11/385,162, Mar. 21, 2006, 8 p.
Rao, Final Office Action May 4, 2010, U.S. Appl. No. 11/385,162, Mar. 21, 2006, 8 p.
Sunil, Office Action Nov. 13, 2008, U.S. Appl. No. 11/189,944, Jul. 26, 2005, 19 p.
Sunil, Final Office Action Apr. 27, 2009, U.S. Appl. No. 11/189,944, Jul. 26, 2005, 21 p.
Glenn, Office Action May 29, 2009, U.S. Appl. No. 11/478,108, Jun. 28, 2006, 19 p.
Glenn, Office Action Dec. 18, 2009, U.S. Appl. No. 11/478,108, Jun. 26, 2006, 17 p.
Glenn, Final Office Action Apr. 27, 2010, U.S. Appl. No. 11/478,108, Jun. 28, 2006, 17 p.
Glenn, Office Action Sep. 2, 2010, U.S. Appl. No. 11/478,108, Jun. 28, 2006, 21 p.
Glenn, Office Action Dec. 29, 2010, U.S. Appl. No. 11/478,108, Jun. 28, 2006, 16 p.
Rao, Office Action Apr. 6, 2010, U.S. Appl. No. 11/397,187, Apr. 4, 2006, 12 p.
Giovanni, Office Action May 26, 2010, U.S. Appl. No. 11/500,754, Aug. 7, 2006, 12 p.
Giovanni, Final Office Action Sep. 2, 2010, U.S. Appl. No. 11/500,754, Aug. 7, 2006, 17 p.
Uma, Office Action Oct. 6, 2009, U.S. Appl. No. 11/707,505, Feb. 16, 2007, 16 p.
Uma, Final Office Action Mar. 8, 2010, U.S. Appl. No. 11/707,505, Feb. 16, 2007 17 p.
Uma, Office Action Dec. 10, 2010, U.S. Appl. No. 11/707,505, Feb. 16, 2007 12 p.
Sunil, Office Action Oct. 7, 2010, U.S. Appl. No. 11/824,344, Jun. 29, 2007, 7 p.
Marko, Office Action Apr. 6, 2009, U.S. Appl. No. 11/732,267, Apr. 2, 2007, 23 p.
Marko, Final Office Action Oct. 9, 2009, U.S. Appl. No. 11/732,267, Apr. 2, 2007, 10 p.
Rao, Office Action Oct. 9, 2009, U.S. Appl. No. 11/799,586, May 2, 2007, 18 p.
Rao, Final Office Action Mar. 8, 2010, U.S. Appl. No. 11/799,586, May 2, 2007, 18 p.
Rao, Office Action Aug. 18, 2010, U.S. Appl. No. 11/799,586, May 2, 2007, 19 p.
Rao, Office Action Mar. 21, 2008, U.S. Appl. No. 11/728,517, Mar. 26, 2007, 17 p.
Rao, Office Action Oct. 20, 2008, U.S. Appl. No. 11/728,517, Mar. 26, 2007, 21 p.
Rao, Office Action Apr. 13, 2009, U.S. Appl. No. 11/728,517, Mar. 26, 2007, 23 p.
Rao, Office Action Dec. 3, 2009, U.S. Appl. No. 11/728,517, Mar. 26, 2007, 19 p.
Rao, Final Office Action Jun. 24, 1970, U.S. Appl. No. 11/728,517, Mar. 26, 2007, 25 p.
Marolia, Office Action Jul. 28, 2009, U.S. Appl. No. 11/827,583, Jul. 12, 2007, 18 p.
Rao, Office Action Jun. 16, 2009, U.S. Appl. No. 11/839,143, Aug. 15, 2007, 11 p.
Rao, Final Office Action Jan. 8, 2010, U.S. Appl. No. 11/839,143, Aug. 15, 2007, 15 p.
Rao, Office Action Aug. 4, 2010, U.S. Appl. No. 11/839,143, Aug. 15, 2007, 16 p.
Rao, Final Office Action Oct. 5, 2011, U.S. Appl. No. 11/839,143, Aug. 15, 2007, 20 p.
Rao, Office Action May 13, 2011, U.S. Appl. No. 11/839,143, Aug. 15, 2007, 17 p.
Rao, Final Office Action Aug. 23, 2011, U.S. Appl. No. 11/839,143, Aug. 15, 2007, 17 p.
Rao, Office Action Sep. 17, 2009, U.S. Appl. No. 11/847,658, Aug. 30, 2007, 10 p.
Rao, Office Action Mar. 25, 2010, U.S. Appl. No. 11/847,658, Aug. 30, 2007, 11 p.
Rao, Office Action Aug. 25, 2010, U.S. Appl. No. 11/847,658, Aug. 30, 2007, 13 p.
Rao, Office Action Nov. 18, 2010, U.S. Appl. No. 11/847,658, Aug. 30, 2007, 11 p.
Rao, Office Action Aug. 24, 2010, U.S. Appl. No. 11/854,414, Sep. 12, 2007, 14 p.
Rao, Office Action Nov. 17, 2009, U.S. Appl. No. 11/947,322, Nov. 29, 2007, 15 p.
Rao, Final Office Action May 14, 2010, U.S. Appl. No. 11/947,322, Nov. 29, 2007, 22 p.
Rao, Office Action Dec. 27, 2010, U.S. Appl. No. 11/947,322, Nov. 29, 2007, 43 p.
Rao, Final Office Action May 26, 2011, U.S. Appl. No. 11/947,322, Nov. 29, 2007, 40 p.
Rao, Office Action Jan. 9, 2012, U.S. Appl. No. 11/947,322, Nov. 29, 2007, 40 p.
Brunet, Office Action Jan. 25, 2006, U.S. Appl. No. 10/822,092, Apr. 9, 2004, 14 p.
Brunet, Final Office Action Aug. 23, 2006, U.S. Appl. No. 10/822,092, Apr. 9, 2004, 13 p.
Brunet, Office Action Feb. 22, 2007, U.S. Appl. No. 10/822,092, Apr. 9, 2004, 19 p.
Brunet, Final Office Action Nov. 15, 2007, U.S. Appl. No. 10/822,092, Apr. 9, 2004, 22 p.
Brunet, Office Action Apr. 4, 2008, U.S. Appl. No. 10/822,092, Apr. 9, 2004, 27 p.
Brunet, Final Office Action Sep. 23, 2008, U.S. Appl. No. 10/822,092, Apr. 9, 2004, 28 p.
Brunet, Office Action Mar. 8, 2007, U.S. Appl. No. 10/889,693, Jul. 12, 2004, 17 p.
Brunet, Final Office Action Nov. 28, 2007, U.S. Appl. No. 10/889,693, Jul. 12, 2004, 19 p.
Brunet, Office Action Jun. 25, 2008, U.S. Appl. No. 10/889,693, Jul. 12, 2004, 69 p.
Brunet, Final Office Action Dec. 23, 2008, U.S. Appl. No. 10/889,693, Jul. 12, 2004, 23 p.
Brunet, Office Action Jun. 29, 2006, U.S. Appl. No. 10/999,606, Nov. 29, 2004, 9 p.
Brunet, Final Office Action Mar. 7, 2007, U.S. Appl. No. 10/999,606, Nov. 29, 2004, 10 p.
Brunet, Office Action Apr. 18, 2008, U.S. Appl. No. 10/999,606, Nov. 29, 2004, 6 p.
Brunet, Office Action Apr. 24, 2009, U.S. Appl. No. 10/999,606, Nov. 29, 2004, 12 p.
Brunet, Final Office Action Aug. 20, 2009, U.S. Appl. No. 10/999,606, Nov. 29, 2004, 16 p.
Brunet, Office Action Nov. 10, 2009, U.S. Appl. No. 10/999,606, Nov. 29, 2004, 16 p.
Brunet, Final Office Action Feb. 18, 2010, U.S. Appl. No. 10/999,606, Nov. 29, 2004, 16 p.
Shao-Chun, Office Action Jun. 6, 2007, U.S. Appl. No. 11/125,974, May 9, 2005, 9 p.
Shao-Chun, Office Action Jan. 17, 2008, U.S. Appl. No. 11/125,974, May 9, 2005, 9 p.
Shao-Chun, Final Office Action Aug. 18, 2008, U.S. Appl. No. 11/125,974, May 9, 2005, 13 p.
Jeffrey, Office Action Jul. 26, 2006, U.S. Appl. No. 11/247,459, Oct. 11, 2005, 9 p.
Jeffrey, Office Action May 15, 2007, U.S. Appl. No. 11/247,459, Oct. 11, 2005, 10 p.
Jeffrey, Office Action Oct. 31, 2007, U.S. Appl. No. 11/247,459, Oct. 11, 2005, 26 p.
O'Neill, Office Action Aug. 25, 2006, U.S. Appl. No. 10/311,462, May 13, 2003, 24 p.
O'Neill, Office Action Mar. 5, 2010, U.S. Appl. No. 10/311,462, May 13, 2003, 23 p.
O'Neill, Final Office Action Jul. 23, 2010, U.S. Appl. No. 10/311,462, May 13, 2003, 24 p.
O'Neill, Office Action Nov. 18, 2009, U.S. Appl. No. 11/335,312, Jan. 19, 2006, 12 p.
O'Neill, Office Action Mar. 12, 2004, U.S. Appl. No. 10/404,601, Apr. 1, 2003, 28 p.
Shao-Chun, Final Office Action Jul. 25, 2006, U.S. Appl. No. 10/411,784, Apr. 11, 2003, 22 p.
Shao-Chun, Office Action Mar. 27, 2007, U.S. Appl. No. 10/411,784, Apr. 11, 2003, 16 p.
Shao-Chun, Final Office Action Oct. 18, 2007, U.S. Appl. No. 10/411,784, Apr. 11, 2003, 15 p.
Rao, Examiner's Answer Dec. 6, 2011, U.S. Appl. No. 11/427,635, Jan. 24, 2005, 19 p.
Rao, Final Office Action Jun. 10, 2011, U.S. Appl. No. 11/427,635, Jan. 24, 2005, 18 p.
Rao, Office Action Dec. 27, 2010, U.S. Appl. No. 11/427,635 Jan. 24, 2005, 13 p.
Rao, Office Action Mar. 31, 2010, U.S. Appl. No. 11/427,635 Jan. 24, 2005, 14 p.
Rao, Office Action Oct. 15, 2009, U.S. Appl. No. 11/427,635, Jan. 24, 2005, 11 p.
Rao, Final Office Action Apr. 30, 2009, U.S. Appl. No. 11/427,635, Jan. 24, 2005, 13 p.
Rao, Office Action Nov. 26, 2008, U.S. Appl. No. 11/427,635, Jan. 24, 2005, 15 p.
Rao, Examiner's Answer Mar. 26, 2011, U.S. Appl. No. 11/043,813, Jan. 26, 2005, 16 p.
Rao, Final Office Action Aug. 20, 2010, U.S. Appl. No. 11/043,813, Jan. 26, 2005, 16 p.
Rao, Office Action Mar. 9, 2010, U.S. Appl. No. 11/043,813, Jan. 26, 2005, 14 p.
Rao, Final Office Action Nov. 13, 2009, U.S. Appl. No. 11/043,813, Jan. 26, 2005, 15 p.
Rao, Office Action Mar. 30, 2009, U.S. Appl. No. 11/043,813, Jan. 26, 2005, 11 p.
Rao, Office Action Oct. 2, 2008, U.S. Appl. No. 11/043,813, Jan. 26, 2005, 23 p.
Chen, Examiner's Answer Aug. 16, 2012, U.S. Appl. No. 11/099,870, Apr. 6, 2005, 12 p.
Chen, Final Office Action Dec. 23, 2011, U.S. Appl. No. 11/099,870, Apr. 6, 2005, 12 p.
Chen, Office Action Jul. 6, 2011, U.S. Appl. No. 11/099,870, Apr. 6, 2005, 13 p.
Chen, Final Office Action Nov. 26, 2010, U.S. Appl. No. 11/099,870, Apr. 6, 2005, 9 p.
Chen, Office Action Jun. 24, 2010, U.S. Appl. No. 11/099,870, Apr. 6, 2005, 7 p.
Chen, Office Action Nov. 30, 2009, U.S. Appl. No. 11/099,870, Apr. 6, 2005, 8 p.
Chen, Final Office Action Apr. 14, 2009, U.S. Appl. No. 11/099,870, Apr. 6, 2005, 19 p.
Chen, Office Action Sep. 24, 2008, U.S. Appl. No. 11/099,870, Apr. 6, 2005, 7 p.
Chen, Office Action Apr. 25, 2008, U.S. Appl. No. 11/099,870, Apr. 6, 2005, 5 p.
Chen, Final Office Action Oct. 11, 2007, U.S. Appl. No. 11/099,870, Apr. 6, 2005, 16 p.
Chen, Office Action Aug. 24, 2006, U.S. Appl. No. 11/099,870, Apr. 6, 2005, 15 p.
Zhu, Examiner's Answer Aug. 16, 2012, U.S. Appl. No. 11/386,560, Mar. 22, 2006, 9 p.
Zhu, Final Office Action Feb. 16, 2012, U.S. Appl. No. 11/386,560, Mar. 22, 2006, 23 p.
Zhu, Office Action Sep. 30, 2011, U.S. Appl. No. 11/386,560, Mar. 22, 2006, 19 p.
Zhu, Final Office Action Mar. 3, 2011, U.S. Appl. No. 11/386,560, Mar. 22, 2006, 24 p.
Zhu, Office Action Sep. 15, 2010, U.S. Appl. No. U.S. Appl. No. 11/386,560, Mar. 22, 2006, 21 p.
Zhu, Office Action Mar. 31, 2010, U.S. Appl. No. 11/386,560, Mar. 22, 2006, 17 p.
Chen, Decision on Appeal Jun. 29, 2012, U.S. Appl. No. 11/637,550, Dec. 12, 2006, 9 p.
Chen, Examiner's Answer Mar. 30, 2009, U.S. Appl. No. 11/637,550, Dec. 12, 2006, 18 p.
Chen, Final Office Action May 22, 2008, U.S. Appl. No. 11/637,550, Dec. 12, 2006, 18 p.
Chen, Office Action Oct. 5, 2007, U.S. Appl. No. 11/637,550, Dec. 12, 2006, 20 p.
Chen, Final Office Action Jul. 27, 2012, U.S. Appl. No. 12/057,067, Mar. 27, 2008, 20 p.
Chen, Office Action Feb. 2, 2012, U.S. Appl. No. 12/057,067, Mar. 27, 2008, 18 p.
Chen, Final Office Action Jul. 28, 2011, U.S. Appl. No. 12/057,067, Mar. 27, 2008, 17 p.
Chen, Office Action Feb. 16, 2011, U.S. Appl. No. 12/057,067, Mar. 27, 2008, 22 p.
O'Neill, Final Office Action Jul. 17, 2012, U.S. Appl. No. 10/411,835, Apr. 11, 2003, 32 p.
O'Neill, Office Action Feb. 10, 2012 , U.S. Appl. No. 10/411,835, Apr. 11, 2003, 26 p.
O'Neill, Advisory Action Jul. 29, 2011, U.S. Appl. No. 10/411,835, Apr. 11, 2003, 3 p.
O'Neill, Advisory Action Jun. 28, 2011, U.S. Appl. No. 10/411,835, Apr. 11, 2003, 3 p.
O'Neill, Final Office Action Apr. 11, 2011, U.S. Appl. No. 10/411,835, Apr. 11, 2003, 29 p.
O'Neill, Office Action Nov. 8, 2010, U.S. Appl. No. 10/411,835, Apr. 11, 2003, 26 p.
O'Neill, Office Action Aug. 26, 2009, U.S. Appl. No. 10/411,835, Apr. 11, 2003, 25 p.
Chen, Notice of Allowance Aug. 31, 2012, U.S. Appl. No. 10/412,045, Apr. 11, 2003, 10 p.
Chen, Final Office Action Jan. 25, 2012, U.S. Appl. No. 10/412,045, Apr. 11, 2003, 18 p.
Chen, Office Action Aug. 3, 2011, U.S. Appl. No. 10/412,045, Apr. 11, 2003, 18 p.
Chen, Final Office Action Apr. 19, 2010, U.S. Appl. No. 10/412,045, Apr. 11, 2003, 25 p.
Chen, Office Action Aug. 26, 2009, U.S. Appl. No. 10/412,045, Apr. 11, 2003, 17 p.
O'Neill, Office Action Jul. 23, 2012, U.S. Appl. No. 12/636,600, Dec. 11, 2009, 17 p.
Rao, Examiner's Answer May 26, 2011, U.S. Appl. No. 11/637,435, Dec. 12, 2006, 20 p.
Rao, Final Office Action Sep. 15, 2010, U.S. Appl. No. 11/637,435, Dec. 12, 2006, 15 p.
Rao, Office Action Sep. 10, 2009, U.S. Appl. No. 11/637,435, Dec. 12, 2006, 16 p.
Rao, Final Office Action Mar. 17, 2009, U.S. Appl. No. 11/637,435, Dec. 12, 2006, 15 p.
Rao, Office Action Sep. 22, 2008, U.S. Appl. No. 11/637,435, Dec. 12, 2006, 14 p.
Rao, Decision on Appeal Jun. 29, 2012 , U.S. Appl. No. 10/706,362, Nov. 12, 2003, 6 p.
Rao, Examiner Answer Oct. 30, 2009, U.S. Appl. No. 10/706,362, Nov. 12, 2003, 24 p.
Rao, Final Office Action Apr. 15, 2009, U.S. Appl. No. 10/706,362, Nov. 12, 2003, 20 p.
Rao, Office Action Oct. 1, 2008, U.S. Appl. No. 10/706,362, Nov. 12, 2003, 19 p.
Rao, Office Action Jan. 9, 2008, U.S. Appl. No. 10/706,362, Nov. 12, 2003, 16 p.
Rao, Office Action Jul. 31, 2007, U.S. Appl. No. 10/706,362, Nov. 12, 2003, 17 p.
Rao, Office Action Dec. 5, 2006, U.S. Appl. No. 10/706,362, Nov. 12, 2003, 15 p.
McGhee, Decision on Appeal Jun. 6, 2012, U.S. Appl. No. 10/774,027, Feb. 6, 2004, 8 p.
McGhee, Examiner's Answer Oct. 30, 2009, U.S. Appl. No. 10/774,027, Feb. 6, 2004, 31 p.
McGhee, Final Office Action Apr. 24, 2009, U.S. Appl. No. 10/774,027, Feb. 6, 2004, 23 p.
McGhee, Office Action Oct. 15, 2008, U.S. Appl. No. 10/774,027, Feb. 6, 2004, 25 p.
McGhee, Office Action Mar. 4, 2008, U.S. Appl. No. 10/774,027, Feb. 6, 2004, 26 p.
Yang, Corrected Examiner's Answer Nov. 21, 2011, U.S. Appl. No. 12/030,757, Feb. 13, 2008, 2 p.
Yang, Examiner's Answer Nov. 10, 2011, U.S. Appl. No. 12/030,757, Feb. 13, 2008, 19 p.
Yang, Advisory Action Sep. 29, 2011, U.S. Appl. No. 12/030,757, Feb. 13, 2008, 3 p.
Yang, Final Office Action Jul. 14, 2011, U.S. Appl. No. 12/030,757, Feb. 13, 2008, 17 p.
Yang, Office Action Mar. 9, 2011, U.S. Appl. No. 12/030,757, Feb. 13, 2008, 33 p.
Rao, Final Office Action Nov. 20, 2012, U.S. Appl. No. 10/909,550, Aug. 2, 2004, 20 p.
Rao, Office Action Jun. 19, 2012, U.S. Appl. No. 10/909,550, Aug. 2, 2004, 24 p.
Rao, Advisory Action Oct. 8, 2010, U.S. Appl. No. 10/909,550, Aug. 2, 2004, 3 p.
Rao, Advisory Action Sep. 1, 2010, U.S. Appl. No. 10/909,550, Aug. 2, 2004, 3 p.
Rao, Final Office Action Jun. 3, 2010, U.S. Appl. No. 10/909,550, Aug. 2, 2004, 26 p.
Rao, Office Action Nov. 27, 2009, U.S. Appl. No. 10/909,550, Aug. 2, 2004, 17 p.
Rao, Office Action Jun. 23, 2009, U.S. Appl. No. 10/909,550, Aug. 2, 2004, 7 p.
Rao, Final Office Action Sep. 25, 2008, U.S. Appl. No. 10/909,550, Aug. 2, 2004, 19 p.
Rao, Office Action Apr. 23, 2008, U.S. Appl. No. 10/909,550, Aug. 2, 2004, 29 p.
Chia, Notice of Allowance May 31, 2012, U.S. Appl. No. 10/943,455, Sep. 17, 2004, 11 p.
Chia, Final Office Action Dec. 8, 2011, U.S. Appl. No. 10/943,455, Sep. 17, 2004, 23 p.
Chia, Office Action Jun. 22, 2010, U.S. Appl. No. 10/943,455, Sep. 17, 2004, 34 p.
Chia, Office Action Jan. 7, 2010, U.S. Appl. No. 10/943,455, Sep. 17, 2004, 21 p.
Chia, Office Action Jun. 11, 2009, U.S. Appl. No. 10/943,455, Sep. 17, 2004, 18 p.
Chia, Final Office Action Dec. 24, 2008, U.S. Appl. No. 10/943,455, Sep. 17, 2004, 17 p.
Chia, Office Action Mar. 21, 2008, U.S. Appl. No. 10/943,455, Sep. 17, 2004, 22 p.
Wang, Examiner's Answer Aug. 19, 2011, U.S. Appl. No. 11/183,199, Jul. 15, 2005, 23 p.
Wang, Advisory Action Feb. 23, 2011, U.S. Appl. No. 11/183,199, Jul. 15, 2005, 2 p.
Wang, Final Office Action Nov. 1, 2010, U.S. Appl. No. 11/183,199, Jul. 15, 2005, 19 p.
Wang, Office Action Apr. 28, 2010, U.S. Appl. No. 11/183,199, Jul. 15, 2005, 17 p.
Wang, Final Office Action Aug. 17, 2009, U.S. Appl. No. 11/183,199, Jul. 15, 2005, 16 p.
Wang, Office Action Feb. 13, 2009, U.S. Appl. No. 11/183,199, Jul. 15, 2005, 16 p.
Wang, Interview Summary Feb. 5, 2009, U.S. Appl. No. 11/183,199, Jul. 15, 2005, 2 p.
Wang, Final Office Action Oct. 28, 2008, U.S. Appl. No. 11/183,199, Jul. 15, 2005, 19 p.
Wang, Office Action Apr. 17, 2008, U.S. Appl. No. 11/183,199, Jul. 15, 2005, 41 p.
Wang, Final Office Action Oct. 9, 2007, U.S. Appl. No. 11/183,199, Jul. 15, 2005, 13 p.
Wang, Office Action Jan. 9, 2007, U.S. Appl. No. 11/183,199, Jul. 15, 2005, 15 p.
Randall, Examiner's Answer Jun. 9, 2010, U.S. Appl. No. 10/955,021, Sep. 30, 2004, 22 p.
Randall, Final Office Action Nov. 6, 2009, U.S. Appl. No. 10/955,021, Sep. 30, 2004, 25 p.
Randall, Office Action Apr. 1, 2009, U.S. Appl. No. 10/955,021, Sep. 30, 2004, 16 p.
Randall, Office Action Oct. 17, 2008, U.S. Appl. No. 10/955,021, Sep. 30, 2004, 16 p.
Randall, Office Action May 1, 2008, U.S. Appl. No. 10/955,021, Sep. 30, 2004, 18 p.
Daley, Corrected Examiner's Answer Nov. 1, 2011, U.S. Appl. No. 11/039,000, Jan. 18, 2005, 2 p.
Daley, Examiner's Answer Oct. 24, 2011, U.S. Appl. No. 11/039,000, Jan. 18, 2005, 20 p.
Daley, Final Office Action Feb. 17, 2011, U.S. Appl. No. 11/039,000, Jan. 18, 2005, 15 p.
Daley, Office Action Aug. 30, 2010, U.S. Appl. No. 11/039,000, Jan. 18, 2005, 15 p.
Daley, Final Office Action Nov. 27, 2009, U.S. Appl. No. 11/039,000, Jan. 18, 2005, 14 p.
Daley, Office Action May 28, 2009, U.S. Appl. No. 11/039,000, Jan. 18, 2005, 13 p.
Daley, Final Office Action Dec. 3, 2008, U.S. Appl. No. 11/039,000, Jan. 18, 2005, 15 p.
Daley, Office Action Jun. 5, 2008, U.S. Appl. No. 11/039,000, Jan. 18, 2005, 25 p.
Kapadekar, Examiner's Answer Mar. 2, 2011, U.S. Appl. No. 11/552,942, Oct. 25, 2006, 18 p.
Kapadekar, Final Office Action Jun. 11, 2010, U.S. Appl. No. 11/552,942, Oct. 25, 2006, 17 p.
Kapadekar, Office Action Oct. 30, 2009, U.S. Appl. No. 11/552,942, Oct. 25, 2006, 15 p.
Kapadekar, Final Office Action Jul. 24, 2009, U.S. Appl. No. 11/552,942, Oct. 25, 2006, 12 p.
Kapadekar, Office Action Jan. 14, 2009, U.S. Appl. No. 11/552,942, Oct. 25, 2006, 8 p.
Logan, Examiner's Answer Jul. 28, 2011, U.S. Appl. No. 11/500,734, Aug. 7, 2006, 2 p.
Logan, Examiner's Answer Jun. 28, 2011, U.S. Appl. No. 11/500,734, Aug. 7, 2006, 25 p.
Logan, Advisory Action Feb. 17, 2011, U.S. Appl. No. 11/500,734, Aug. 7, 2006, 2 p.
Logan, Office Action Sep. 29, 2010, U.S. Appl. No. 11/500,734, Aug. 7, 2006, 24 p.
Logan, Office Action Apr. 27, 2010, U.S. Appl. No. 11/500,734, Aug. 7, 2006, 23 p.
Logan, Final Office Action Dec. 14, 2009, U.S. Appl. No. 11/500,734, Aug. 7, 2006, 22 p.
Logan, Office Action Nov. 26, 2008, U.S. Appl. No. 11/500,734, Aug. 7, 2006, 20 p.
Rao, Examiner's Answer Jun. 28, 2011, U.S. Appl. No. 11/385,502, Mar. 21, 2006, 17 p.
Rao, Final Office Action Nov. 26, 2010, U.S. Appl. No. 11/385,502, Mar. 21, 2006, 11 p.
Rao, Office Action Jun. 25, 2010, U.S. Appl. No. 11/385,502, Mar. 21, 2006, 10 p.
Rao, Final Office Action Dec. 15, 2009, U.S. Appl. No. 11/385,502, Mar. 21, 2006, 10 p.
Rao, Office Action May 12, 2009, U.S. Appl. No. 11/385,502, Mar. 21, 2006, 9 p.
Motta, Final Office Action Nov. 19, 2012, U.S. Appl. No. 11/449,259, Jun. 7, 2006, 25 p.
Motta, Office Action Jul. 26, 2012, U.S. Appl. No. 11/449,259, Jun. 7, 2006, 20 p.
Motta, Decision on Appeal Jun. 20, 2012, U.S. Appl. No. 11/449,259, Jun. 7, 2006, 7 p.
Motta, Examiner's Answer Jul. 23, 2009, U.S. Appl. No. 11/449,259, Jun. 7, 2006, 28 p.
Motta, Interview Summary Feb. 12, 2009, U.S. Appl. No. 11/449,259, Jun. 7, 2006, 4 p.
Motta, Advisory Action Jan. 27, 2009, U.S. Appl. No. 11/449,259, Jun. 7, 2006, 3 p.
Motta, Final Office Action Nov. 13, 2008, U.S. Appl. No. 11/449,259, Jun. 7, 2006, 18 p.
Motta, Office Action Jul. 10, 2008, U.S. Appl. No. 11/449,259, Jun. 7, 2006, 22 p.
Motta, Examiner's Answer Nov. 25, 2011, U.S. Appl. No. 11/590,137, Oct. 30, 2006, 11 p.
Motta, Final Office Action Jul. 19, 2011, U.S. Appl. No. 11/590,137, Oct. 30, 2006, 11 p.
Motta, Office Action Mar. 11, 2011, U.S. Appl. No. 11/590,137, Oct. 30, 2006, 12 p.
Daley, Final Office Action Mar. 17, 2011, U.S. Appl. No. 11/676,997, Feb. 20, 2007, 34 p.
Daley, Office Action Aug. 17, 2010, U.S. Appl. No. 11/676,997, Feb. 20, 2007, 31 p.
Daley, Office Action Feb. 22, 2010, U.S. Appl. No. 11/676,997, Feb. 20, 2007, 27 p.
Motta, Interview Summary Apr. 12, 2012, U.S. Appl. No. 11/829,520, Jul. 27, 2007, 3 p.
Motta, Final Office Action Jan. 13, 2012, U.S. Appl. No. 11/829,520, Jul. 27, 2007, 27 p.
Motta, Interview Summary Nov. 29, 2011, U.S. Appl. No. 11/829,520, Jul. 27, 2007, 3 p.
Motta, Office Action Sep. 1, 2011, U.S. Appl. No. 11/829,520, Jul. 27, 2007, 14 p.
Daley, Examiner's Answer Nov. 2, 2010, U.S. Appl. No. 11/839,396, Aug. 15, 2007, 15 p.
Daley, Final Office Action May 25, 2010, U.S. Appl. No. 11/839,396, Aug. 15, 2007, 16 p.
Daley, Interview Summary Feb. 25, 2010, U.S. Appl. No. 11/839,396, Aug. 15, 2007, 3 p.
Daley, Office Action Dec. 21, 2009, U.S. Appl. No. 11/839,396, Aug. 15, 2007, 14 p.
Daley, Office Action Jul. 29, 2009, U.S. Appl. No. 11/839,396, Aug. 15, 2007, 23 p.
Rao, Final Office Action Sep. 21, 2012, U.S. Appl. No. 11/867,370, Oct. 4, 2007, 14 p.
Rao, Office Action May 3, 2012, U.S. Appl. No. 11/867,370, Oct. 4, 2007, 13 p.
Rao, Final Office Action Dec. 22, 2010, U.S. Appl. No. 11/867,370, Oct. 4, 2007, 10 p.
Rao, Office Action Sep. 3, 2010, U.S. Appl. No. 11/867,370, Oct. 4, 2007, 11 p.
Rao, Examiner's Answer Apr. 12, 2012, U.S. Appl. No. 11/871,867, Oct. 12, 2007, 14 p.
Rao, Final Office Action Oct. 11, 2011, U.S. Appl. No. 11/871,867, Oct. 12, 2007, 14 p.
Rao, Interview Summary Aug. 5, 2011, U.S. Appl. No. 11/871,867, Oct. 12, 2007, 4 p.
Rao, Office Action Apr. 29, 2011, U.S. Appl. No. 11/871,867, Oct. 12, 2007, 13 p.
Rao, Final Office Action Sep. 20, 2010, U.S. Appl. No. 11/871,867, Oct. 12, 2007, 14 p.
Rao, Office Action Mar. 25, 2010, U.S. Appl. No. 11/871,867, Oct. 12, 2007, 11 p.
Rao, Office Action Aug. 10, 2009, U.S. Appl. No. 11/871,867, Oct. 12, 2007, 14 p.
Chowdhary, Decision on Appeal Nov. 1, 2012, U.S. Appl. No. 11/005,312, Dec. 6, 2004, 8 p.
Chowdhary, Order Apr. 27, 2009, U.S. Appl. No. 11/005,312, Dec. 6, 2004, 3 p.
Chowdhary, Examiner's Answer Aug. 20, 2008, U.S. Appl. No. 11/005,312, Dec. 6, 2004, 28 p.
Chowdhary, Office Action Sep. 5, 2006, Nov. 1, 2012, U.S. Appl. No. 11/005,312, Dec. 6, 2004, 29 p.
Chowdhary, Final Office Action Mar. 21, 2007, U.S. Appl. No. 11/005,312, Dec. 6, 2004, 27 p.
Chowdhary, Office Action Jan. 11, 2008, U.S. Appl. No. 11/005,312, Dec. 6, 2004, 24 p.
Rao, Final Office Action Oct. 16, 2012, U.S. Appl. No. 13/350,355, Jan. 13, 2012, 18 p.
Rao, Office Action May 16, 2012, U.S. Appl. No. 13/350,355, Jan. 13, 2012, 28 p.
Okkonen, Office Action Dec. 28, 2005, U.S. Appl. No. 10/417,285,Apr. 15, 2003, 21 p.
Okkonen, Final Office Action May 1, 2006, U.S. Appl. No. 10/417,285, Apr. 15, 2003, 41 p.
Okkonen, Office Action Jan. 29, 2007, U.S. Appl. No. 10/417,285, Apr. 15, 2003, 41 p.
Okkonen, Office Action Aug. 6, 2007, U.S. Appl. No. 10/417,285, Apr. 15, 2003, 6 p.
Okkonen, Office Action Dec. 9, 2009, U.S. Appl. No. 11/650,777, Jan. 8, 2007, 17 p.
Okkonen, Final Office Action May 13, 2010, U.S. Appl. No. 11/650,777, Jan. 8, 2007, 24 p.
O'Neill, Office Action Jun. 26, 2006, U.S. Appl. No. 10/631,567, Jul. 31, 2003, 18 p.
O'Neill, Final Office Action Apr. 10, 2007, U.S. Appl. No. 10/631,567, Jul. 31, 2003, 31 p.
O'Neill, Office Action Jan. 14, 2008, U.S. Appl. No. 10/631,567, Jul. 31, 2003, 41 p.
O'Neill, Office Action Jul. 9, 2008, U.S. Appl. No. 10/631,567, Jul. 31, 2003, 14 p.
O'Neill, Final Office Action Jan. 22, 2009, U.S. Appl. No. 10/631,567, Jul. 31, 2003, 14 p.
Chen, Office Action Jan. 8, 2007, U.S. Appl. No. 10/646,324, Aug. 22, 2003, 9 p.
Chen, Office Action May 13, 2011, U.S. Appl. No. 11/923,383, Oct. 24, 2007, 22 p.
Chen, Final Office Action Nov. 10, 2011, U.S. Appl. No. 11/923,383, Oct. 24, 2007, 27 p.
O'Neill, Office Action Oct. 23, 2006, U.S. Appl. No. 10/654,149, Sep. 3, 2003, 13 p.
O'Neill, Office Action May 31, 2007, U.S. Appl. No. 10/654,149, Sep. 3, 2003, 13 p.
O'Neill, Final Office Action Dec. 13, 2007, U.S. Appl. No. 10/654,149, Sep. 3, 2003, 15 p.
O'Neill, Office Action Dec. 4, 2008, U.S. Appl. No. 10/654,149, Sep. 3, 2003, 14 p.
O'Neill, Final Office Action May 26, 2009, U.S. Appl. No. 10/654,149, Sep. 3, 2003, 15 p.
Rao, Office Action Feb. 7, 2007, U.S. Appl. No. 10/654,412, Sep. 3, 2003, 9 p.
Rao, Final Office Action Aug. 24, 2007, U.S. Appl. No. 10/654,412, Sep. 3, 2003, 13 p.
Rao, Office Action May 5, 2008, U.S. Appl. No. 10/654,412, Sep. 3, 2003, 15 p.
Chen, Office Action Nov. 20, 2006, U.S. Appl. No. 10/646,319, Aug. 22, 2003, 8 p.
Chen, Office Action Aug. 16, 2011, U.S. Appl. No. 12/032,809, Feb. 18, 2008, 20 p.
Chen, Final Office Action Jan. 19, 2012, U.S. Appl. No. 12/032,809, Feb. 18, 2008, 24 p.
Rao, Office Action Aug. 16, 2006, U.S. Appl. No. 10/695,713, Oct. 29, 2003, 12 p.
Rao, Final Office Action Dec. 20, 2006, U.S. Appl. No. 10/695,713, Oct. 29, 2003, 13 p.
Rao, Office Action Oct. 21, 2009, U.S. Appl. No. 11/688,820, Mar. 20, 2007, 10 p.
Rao, Final Office Action May 3, 2010, U.S. Appl. No. 11/688,820, Mar. 20, 2007, 14 p.
Rao, Office Action Dec. 30, 2004, U.S. Appl. No. 10/689,309, Oct. 20, 2003, 5 p.
Rao, Office Action Jun. 24, 2009, U.S. Appl. No. 11/251,046, Oct. 14, 2005, 8 p.
Lilley, Office Action Oct. 24, 2006, U.S. Appl. No. 10/681,861, Oct. 8, 2003, 24 p.
Lilley, Final Office Action Jul. 23, 2007, U.S. Appl. No. 10/681,861, Oct. 8, 2003, 18 p.
Lilley, Office Action Nov. 16, 2007, U.S. Appl. No. 10/681,861, Oct. 8, 2003, 18 p.
Lilley, Final Office Action Jun. 16, 2008, U.S. Appl. No. 10/681,861, Oct. 8, 2003, 24 p.
O'Neill, Office Action Mar. 22, 2007, U.S. Appl. No. 10/721,658, Nov. 25, 2003, 14 p.
O'Neill, Final Office Action Sep. 25, 2007, U.S. Appl. No. 10/721,658, Nov. 25, 2003, 9 p.
O'Neill, Final Office Action Feb. 20, 2008, U.S. Appl. No. 10/721,658, Nov. 25, 2003, 13 p.
Rao, Office Action Oct. 5, 2004, U.S. Appl. No. 10/701,848, Nov. 5, 2003, 12 p.
Rao, Final Office Action May 5, 2005, U.S. Appl. No. 10/701,848, Nov. 5, 2003, 14 p.
Rao, Office Action Nov. 23, 2005, U.S. Appl. No. 10/701,848, Nov. 5, 2003, 13 p.
Rao, Final Office Action Aug. 15, 2006, U.S. Appl. No. 10/701,848, Nov. 5, 2003, 16 p.
Rao, Office Action Nov. 14, 2006, U.S. Appl. No. 10/706,219, Nov. 12, 2003, 12 p.
Rao, Final Office Action May 2, 2007, U.S. Appl. No. 10/706,219, Nov. 12, 2003, 17 p.
Rao, Office Action Dec. 13, 2007, U.S. Appl. No. 10/706,219, Nov. 12, 2003, 13 p.
Rao, Office Action Jun. 25, 2008, U.S. Appl. No. 10/706,219, Nov. 12, 2003, 10 p.
Rao, Final Office Action Jan. 6, 2009, U.S. Appl. No. 10/706,219, Nov. 12, 2003, 16 p.
Rao, Office Action Jul. 22, 2009, U.S. Appl. No. 10/706,219, Nov. 12, 2003, 6 p.
Rao, Office Action Mar. 26, 2009, U.S. Appl. No. 11/401,708, Apr. 11, 2006, 20 p.
Rao, Office Action Aug. 9, 2005, U.S. Appl. No. 10/695,524, Oct. 28, 2003, 19 p.
Chia, Office Action May 28, 2008, U.S. Appl. No. 10/719,114, Nov. 21, 2003, 10 p.
Chia, Final Office Action Dec. 2, 2008, U.S. Appl. No. 10/719,114, Nov. 21, 2003, 8 p.
Chia, Final Office Action May 4, 2009, U.S. Appl. No. 10/719,114, Nov. 21, 2003, 11 p.
Chia, Office Action Aug. 19, 2009, U.S. Appl. No. 10/719,114, Nov. 21, 2003, 8 p.
Chia, Final Office Action Mar. 17, 2010, U.S. Appl. No. 10/719,114, Nov. 21, 2003, 9 p.
Jacobi, Office Action Dec. 10, 2004, U.S. Appl. No. 10/697,458, Oct. 30, 2003, 16 p.
Jacobi, Final Office Action Jun. 14, 2005, U.S. Appl. No. 10/697,458, Oct. 30, 2003, 16 p.
Gustafson, Office Action Mar. 4, 2008, U.S. Appl. No. 10/761,735, Jan. 20, 2004, 25 p.
Gustafson, Office Action Sep. 8, 2008, U.S. Appl. No. 10/761,735, Jan. 20, 2004, 25 p.
Gustafson, Final Office Action Mar. 20, 2009, U.S. Appl. No. 10/761,735, Jan. 20, 2004, 27 p.
Rao, Office Action Sep. 25, 2008, U.S. Appl. No. 11/083,596, Mar. 18, 2005, 7 p.
Rao, Office Action Oct. 19, 2004, U.S. Appl. No. 10/765,817, Jan. 27, 2004, 8 p.
Rao, Office Action Feb. 4, 2008, U.S. Appl. No. 10/782,083, Feb. 19, 2004, 21 p.
Rao, Final Office Action Jul. 15, 2008, U.S. Appl. No. 10/782,083, Feb. 19, 2004, 25 p.
Gustafson, Office Action Jul. 24, 2007, U.S. Appl. No. 10/790,340, Mar. 1, 2004, 21 p.
Gustafson, Office Action Jun. 12, 2008, U.S. Appl. No. 10/790,340, Mar. 1, 2004, 20 p.
Gustafson, Office Action Dec. 23, 2008, U.S. Appl. No. 10/790,340, Mar. 1, 2004, 21 p.
Gustafson, Final Office Action Jul. 6, 2009, U.S. Appl. No. 10/790,340, Mar. 1, 2004, 21 p.
Lilley, Final Office Action Jul. 25, 2007, U.S. Appl. No. 10/646,975, Aug. 22, 2003, 13 p.
Lilley, Office Action Oct. 31, 2007, U.S. Appl. No. 10/646,975, Aug. 22, 2003, 15 p.
Lilley, Final Office Action Apr. 16, 2008, U.S. Appl. No. 10/646,975, Aug. 22, 2003, 14 p.
Rao, Office Action Jun. 30, 2006, U.S. Appl. No. 10/797,176, Mar. 10, 2004, 15 p.
Rao, Final Office Action Jul. 17, 2007, U.S. Appl. No. 10/797,176, Mar. 10, 2004, 26 p.
Rao, Final Office Action Oct. 31, 2007, U.S. Appl. No. 10/797,176, Mar. 10, 2004, 29 p.
Rao, Office Action Apr. 14, 2008, U.S. Appl. No. 10/797,176, Mar. 10, 2004, 31p.
Rao, Office Action Oct. 16, 2008, U.S. Appl. No. 10/797,176, Mar. 10, 2004, 33 p.
Rao, Final Office Action Nov. 25, 2009, U.S. Appl. No. 10/797,176, Mar. 10, 2004, 41 p.
Rao, Final Office Action Aug. 19, 2010, U.S. Appl. No. 10/797,176, Mar. 10, 2004, 5 p.
Okkonnen, Office Action Feb. 28, 2005, U.S. Appl. No. 10/807,694, Mar. 24, 2004, 18 p.
Okkonnen, Final Office Action Aug. 10, 2005, U.S. Appl. No. 10/807,694, Mar. 24, 2004, 17 p.
Okkonen, Office Action Mar. 14, 2006, U.S. Appl. No. 10/807,694, Mar. 24, 2004, 21 p.
Okkonen, Office Action Oct. 24, 2006, U.S. Appl. No. 10/807,694, Mar. 24, 2004, 16 p.
Okkonen, Office Action Jul. 10, 2007, U.S. Appl. No. 10/807,694, Mar. 24, 2004, 19 p.
Okkonen, Final Office Action Dec. 18, 2007, U.S. Appl. No. 10/807,694, 03/64/04, 22 p.
Okkonen, Office Action May 12, 2008, U.S. Appl. No. 10/807,694, Mar. 24, 2004, 22 p.
Okkonen, Final Office Action Nov. 20, 2008, U.S. Appl. No. 10/807,694, Mar. 24, 2004, 22 p.
Okkonen, Office Action Jun. 25, 2009, U.S. Appl. No. 10/807,694, Mar. 24, 2004, 34 p.
McGhee, Office Action Sep. 27, 2006, U.S. Appl. No. 10/797,825, Mar. 10, 2004, 7 p.
McGhee, Final Office Action Jun. 25, 2007, U.S. Appl. No. 10/797,825, Mar. 10, 2004, 6 p.
Yang, Office Action Jan. 28, 2008, U.S. Appl. No. 10/802,191, Mar. 17, 2004, 18 p.
Yang, Final Office Action Jun. 6, 2008, U.S. Appl. No. 10/802,191, Mar. 17, 2004, 19 p.
Yang, Office Action Sep. 5, 2008, U.S. Appl. No. 10/802,191, Mar. 17, 2004, 16 p.
Qumei, Final Office Action Nov. 23, 2007, U.S. Appl. No. 10/813,212, Mar. 30, 2004, 11 p.
Yang, Office Action Sep. 21, 2006, U.S. Appl. No. 10/635,991, Aug. 7, 2003, 10 p.
Yang, Office Action Jun. 6, 2010, U.S. Appl. No. 12/014,549, Jan. 15, 2008, 8 p.
Yang, Final Office Action Sep. 16, 2010, U.S. Appl. No. 12/014,549, Jan. 15, 2008, 7 p.
Yang, Office Action Nov. 2, 2006, U.S. Appl. No. 10/887,490, Jul. 8, 2004, 12 p.
Yang, Final Office Action Apr. 17, 2007, U.S. Appl. No. 10/887,490, Jul. 8, 2004, 13 p.
Marolia, Final Office Action Jan. 30, 2008, U.S. Appl. No. 10/852,396, May 24, 2004, 17 p.
Marolia, Office Action May 28, 2008, U.S. Appl. No. 10/852,396, May 24, 2004, 20 p.
Marolia, Office Action Dec. 8, 2008, U.S. Appl. No. 10/852,396, May 24, 2004, 19 p.
Marolia, Final Office Action Jun. 17, 2009, 10/852,396, May 24, 2004, 24 p.
Marolia, Office Action Dec. 14, 2009, U.S. Appl. No. 10/852,396, May 24, 2004, 19 p.
Marolia, Office Action Jun. 3, 2005, U.S. Appl. No. 10/888,841, Jul. 9, 2004, 8 p.
Marolia, Final Office Action Dec. 6, 2005, U.S. Appl. No. 10/888,841, Jul. 9, 2004, 10 p.
Marolia, Office Action May 4, 2006, U.S. Appl. No. 10/888,841, Jul. 9, 2004, 13 p.
Marolia, Final Office Action Jan. 12, 2007, U.S. Appl. No. 10/888,841, Jul. 9, 2004, 15 p.
Marolia, Office Action Jun. 18, 2007, U.S. Appl. No. 10/888,841, Jul. 9, 2004, 16 p.
Marolia, Final Office Action Nov. 27, 2007, U.S. Appl. No. 10/888,841, Jul. 9, 2004, 17 p.
Marolia, Office Action Apr. 28, 2009, U.S. Appl. No. 10/888,841, Jul. 9, 2004, 15 p.
Qumei, Office Action Apr. 21, 2008, U.S. Appl. No. 10/864,095, Jun. 9, 2004, 15 p.
Marolia, Office Action Dec. 11, 2007, U.S. Appl. No. 10/879,869, Jun. 28, 2004, 10 p.
Marolia, Final Office Action May 30, 2008, U.S. Appl. No. 10/879,869, Jun. 28, 2004, 15 p.
Marolia, Office Action Aug. 18, 2008, U.S. Appl. No. 10/879,869, Jun. 28, 2004, 17 p.
Marolia, Final Office Action Jan. 28, 2009, U.S. Appl. No. 10/879,869, Jun. 28, 2004, 18 p.
Rao, Office Action Jul. 25, 2007, U.S. Appl. No. 10/860,964, Jun. 4, 2004, 22 p.
Rao, Final Office Action Jan. 7, 2008, U.S. Appl. No. 10/860,964, Jun. 4, 2004, 26 p.
Rao, Office Action Apr. 30, 2008, U.S. Appl. No. 10/860,964, Jun. 4, 2004, 23 p.
Rao, Final Office Action Oct. 28, 2008, U.S. Appl. No. 10/860,964, Jun. 4, 2004, 29 p.
Yang, Office Action Jun. 27, 2007, U.S. Appl. No. 10/860,978, Jun. 4, 2004, 14 p.
Yang, Final Office Action Dec. 7, 2007, U.S. Appl. No. 10/860,978, Jun. 4, 2004, 16 p.
Yang, Office Action Jun. 20, 2008, U.S. Appl. No. 10/860,978, Jun. 4, 2004, 13 p.
Yang, Office Action Dec. 23, 2008, U.S. Appl. No. 10/860,978, Jun. 4, 2004, 13 p.
Yang, Final Office Action Jun. 19, 2009, U.S. Appl. No. 10/860,978, Jun. 4, 2004, 16 p.
Rao, Office Action Aug. 24, 2007, U.S. Appl. No. 10/868,050, Jun. 15, 2004, 15 p.
Rao, Office Action Feb. 4, 2008, U.S. Appl. No. 10/868,050, Jun. 15, 2004, 16 p.
Rao, Final Office Action Aug. 6, 2008, U.S. Appl. No. 10/868,050, Jun. 15, 2004, 18 p.
Rao, Office Action Apr. 15, 2008, U.S. Appl. No. 10/899,513, Jul. 26, 2004, 14 p.
Rao, Final Office Action Oct. 24, 2008, U.S. Appl. No. 10/899,513, Jul. 26, 2004, 16 p.
Rao, Office Action Jun. 11, 2007, U.S. Appl. No. 10/902,452, Jul. 29, 2004, 13 p.
Rao, Final Office Action Dec. 20, 2007, U.S. Appl. No. 10/902,452, Jul. 29, 2004, 10 p.
Rao, Final Office Action Jun. 23, 2008, U.S. Appl. No. 10/902,425, Jul. 29, 2004, 14 p.
Rao, Office Action Jan. 5, 2009, U.S. Appl. No. 10/902,452, Jul. 29, 2004, 16 p.
Rao, Final Office Action Jul. 20, 2009, U.S. Appl. No. 10/902,452, Jul. 29, 2004, 16 p.
Rao, Office Action May 13, 2010, U.S. Appl. No. 10/902,452, Jul. 29, 2004, 16 p.
Qumei, Office Action Jul. 12, 2007, U.S. Appl. No. 10/909,519, Aug. 2, 2004, 17 p.
Qumei, Final Office Action Dec. 20, 2007, U.S. Appl. No. 10/909,519, Aug. 2, 2004, 11 p.
Qumei, Office Action May 29, 2008, U.S. Appl. No. 10/909,519, Aug. 2, 2004, 21 p.
Qumei, Final Office Action Nov. 17, 2008, U.S. Appl. No. 10/909,519, Aug. 2, 2004, 24 p.
Qumei, Office Action Apr. 28, 2009, U.S. Appl. No. 10/909,519, Aug. 2, 2004, 23 p.
Chen, Office Action May 14, 2008, U.S. Appl. No. 10/932,175, Sep. 1, 2004, 18 p.
Chen, Final Office Action Feb. 6, 2009, U.S. Appl. No. 10/932,175, Sep. 1, 2004, 15 p.
Chen, Office Action Mar. 1, 2010, U.S. Appl. No. 10/932,175, Sep. 1, 2004, 16 p.
Chen, Final Office Action Sep. 21, 2010, U.S. Appl. No. 10/932,175, Sep. 1, 2004, 17 p.
Okkonen, Office Action Jan. 5, 2007, U.S. Appl. No. 10/945,466, Sep. 20, 2004, 5 p.
Okkonen, Office Action Aug. 10, 2007, U.S. Appl. No. 10/945,466, Sep. 20, 2004, 5 p.
Okkonen, Final Office Action Jan. 9, 2008, U.S. Appl. No. 10/945,466, Sep. 20, 2004, 7 p.
Okkonen, Office Action May 12, 2008, U.S. Appl. No. 10/945,466, Sep. 20, 2004, 6 p.
Okkonen, Office Action Nov. 12, 2008, U.S. Appl. No. 10/945,466, Sep. 20, 2004, 5 p.
Okkonen, Office Action Apr. 14, 2009, U.S. Appl. No. 10/945,466, Sep. 20, 2004, 5 p.
Rao, Office Action Aug. 27, 2007, U.S. Appl. No. 10/950,764, Sep. 27, 2004, 14 p.
Rao, Final Office Action Mar. 4, 2008, U.S. Appl. No. 10/950,746, Sep. 27, 2004, 17 p.
Rao, Office Action Nov. 3, 2008, U.S. Appl. No. 10/950,764, Sep. 27, 2004, 12 p.
Rao, Final Office Action Jun. 30, 2009, U.S. Appl. No. 10/950,764, Sep. 27, 2004, 15 p.
Chen, Office Action Jan. 29, 2008, U.S. Appl. No. 10/958,148, Oct. 4, 2004, 16 p.
Chen, Final Office Action Aug. 20, 2008, U.S. Appl. No. 10/958,148, Oct. 4, 2004, 19 p.
Chen, Office Action Apr. 14, 2009, U.S. Appl. No. 10/958,148, Oct. 4, 2004, 11 p.
Chen, Final Office Action Nov. 25, 2009, U.S. Appl. No. 10/958,148, Oct. 4, 2004, 12 p.
Chen, Office Action Apr. 1, 2010, U.S. Appl. No. 10/958,148, Oct. 4, 2004, 13 p.
Gustafson, Office Action Sep. 11, 2007, U.S. Appl. No. 11/010,913, Dec. 13, 2004, 27 p.
Gustafson, Office Action Feb. 1, 2008, U.S. Appl. No. 11/010,913, Dec. 13, 2004, 29 p.
Gustafson, Final Office Action Feb. 18, 2010, U.S. Appl. No. 11/010,913, Dec. 13, 2004, 31 p.
Ren, Office Action Jan. 22, 2008, U.S. Appl. No. 10/989,628, Nov. 16, 2004, 8 p.
Ren, Office Action Aug. 18, 2008, U.S. Appl. No. 10/989,628, Nov. 16, 2004, 7 p.
Ren, Final Office Action Nov. 24, 2009, U.S. Appl. No. 10/989,628, Nov. 16, 2004, 9 p.
Slyz, Office Action Mar. 1, 2010, U.S. Appl. No. 11/874,102, Oct. 17, 2007, 13 p.
Qumei, Office Action Apr. 9, 2007, U.S. Appl. No. 10/698,665, Oct. 30, 2003, 22 p.
Qumei, Office Action Jul. 29, 2010, U.S. Appl. No. 11/852,933, Sep. 10, 2007, 14 p.
Qumei, Final Office Action Feb. 17, 2011, U.S. Appl. No. 11/852,933, Sep. 10, 2007, 19 p.
Chen, Office Action Apr. 19, 2007, U.S. Appl. No. 10/903,394, Jul. 30, 2004, 31 p.
Chen, Final Office Action Oct. 18, 2007, U.S. Appl. No. 10/903,394, Jul. 30, 2004, 34 p.
Chen, Office Action May 13, 2008, U.S. Appl. No. 10/903,394, Jul. 30, 2004, 14 p.
Chen, Office Action Nov. 26, 2008, U.S. Appl. No. 10/903,394, Jul. 30, 2004, 14 p.
Chen, Final Office Action Apr. 21, 2009, U.S. Appl. No. 10/903,394, Jul. 30, 2004, 21 p.
Chen, Office Action Oct. 30, 2009, U.S. Appl. No. 10/903,394, Jul. 30, 2004, 19 p.
Chen, Final Office Action Apr. 29, 2010, U.S. Appl. No. 10/903,394, Jul. 30, 2004, 24 p.
Rao, Office Action Feb. 4, 2008, U.S. Appl. No. 11/047,212, Jan. 31, 2005, 9 p.
Rao, Final Office Action Sep. 3, 2008, U.S. Appl. No. 11/047,212, Jan. 31, 2005, 8 p.
Rao, Office Action Feb. 2, 2009, U.S. Appl. No. 11/047,212, Jan. 31, 2005, 8 p.
Rao, Final Office Action Sep. 25, 2009, U.S. Appl. No. 11/047,212, Jan. 31, 2005, 9 p.
Rao, Office Action Jan. 22, 2010, U.S. Appl. No. 11/047,212, Jan. 31, 2005, 9 p.
Rao, Final Office Action Jun. 10, 2010, U.S. Appl. No. 11/047,212, Jan. 31, 2005, 11 p.
Rao, Office Action Jan. 14, 2011, U.S. Appl. No. 11/047,212, Jan. 31, 2005, 9 p.
Kokkinen, Office Action Feb. 23, 2007, U.S. Appl. No. 10/688,640, Oct. 17, 2003, 23 p.
Kokkinen, Office Action Aug. 21, 2007, U.S. Appl. No. 10/688,640, Oct. 17, 2003, 23 p.
Kokkinen, Office Action Jul. 18, 2008, U.S. Appl. No. 10/688,640, Oct. 17, 2003, 28 p.
Kokkinen, Office Action Dec. 30, 2008, U.S. Appl. No. 10/688,640, Oct. 17, 2003, 29 p.
Kokkinen, Office Action Jul. 21, 2009, U.S. Appl. No. 10/688,640, Oct. 17, 2003, 30 p.
Kokkinen, Office Action Feb. 24, 2010, U.S. Appl. No. 10/688,640, Oct. 17, 2003, 33 p.
Kokkinen, Office Action Aug. 6, 2010, U.S. Appl. No. 10/688,640, Oct. 17, 2003, 26 p.
Okkonen, Office Action Apr. 19, 2007, U.S. Appl. No. 10/788,768, Feb. 27, 2004, 14 p.
Okkonen, Final Office Action Oct. 2, 2007, U.S. Appl. No. 10/788,768, Feb. 27, 2004, 18 p.
Okkonen, Office Action Mar. 20, 2008, U.S. Appl. No. 10/788,768, Feb. 27, 2004, 16 p.
Okkonen, Office Action Oct. 2, 2008, U.S. Appl. No. 10/788,768, Feb. 27, 2004, 17 p.
Okkonen, Final Office Action Apr. 14, 2009, U.S. Appl. No. 10/788,768, Feb. 27, 2004, 18 p.
Qumei, Final Office Action Sep. 7, 2007, U.S. Appl. No. 10/770,983, Feb. 3, 2004, 15 p.
Qumei, Office Action Jan. 25, 2008, U.S. Appl. No. 10/770,983, Feb. 3, 2004, 18 p.
Qumei, Office Action Jul. 3, 2008, U.S. Appl. No. 10/770,983, Feb. 3, 2004, 22 p.
Qumei, Office Action Dec. 19, 2008, U.S. Appl. No. 10/770,983, Feb. 3, 2004, 19 p.
Qumei, Final Office Action Jun. 11, 2009, U.S. Appl. No. 10/770,983, Feb. 3, 2004, 21 p.
Hamasaki, Office Action Jan. 9, 2008, U.S. Appl. No. 10/748,053, Dec. 30, 2003, 18 p.
Hamasaki, Final Office Action Aug. 20, 2008, U.S. Appl. No. 10/748,053, Dec. 30, 2003, 21 p.
Hamasaki, Office Action Feb. 27, 2009, U.S. Appl. No. 10/748,053, Dec. 30, 2003, 19 p.
Hamasaki, Final Office Action Sep. 11, 2009, U.S. Appl. No. 10/748,053, Dec. 30, 2003, 19 p.
Hamasaki, Final Office Action May 17, 2010, U.S. Appl. No. 10/748,053, Dec. 30, 2003, 21 p.
Rao, Office Action Feb. 6, 2009, U.S. Appl. No. 10/754,378, Jan. 9, 2004, 14 p.
Rao, Final Office Action Jul. 13, 2009, U.S. Appl. No. 10/754,378, Jan. 9, 2004, 25 p.
Rao, Office Action May 17, 2010, U.S. Appl. No. 10/754,378, Jan. 9, 2004, 43 p.
Marolia, Office Action Oct. 17, 2006, U.S. Appl. No. 10/754,313, Jan. 9, 2004, 16 p.
Marolia, Office Action Feb. 20, 2008, U.S. Appl. No. 10/754,313, Jan. 9, 2004, 11 p.
Gustafson, Office Action Jan. 4, 2007, U.S. Appl. No. 10/756,103, Jan. 13, 2004, 10 p.
Gustafson, Office Action Aug. 10, 2007, U.S. Appl. No. 10/756,103, Jan. 13, 2004, 11 p.
Gustafson, Office Action Jan. 22, 2008, U.S. Appl. No. 10/756,103, Jan. 13, 2004, 11 p.
Gustafson, Office Action Jul. 8, 2009, U.S. Appl. No. 10/756,103, Jan. 13, 2004, 21 p.
Gustafson, Final Office Action Dec. 18, 2009, U.S. Appl. No. 10/756,103, Jan. 13, 2004, 22 p.
Chen, Office Action Jul. 23, 2007, U.S. Appl. No. 10/646,230, Aug. 22, 2003, 14 p.
Chen, Final Office Action Dec. 28, 2007, U.S. Appl. No. 10/646,230, Aug. 22, 2003, 14 p.
Chen, Office Action Dec. 23, 2008, U.S. Appl. No. 10/646,230, Aug. 22, 2003, 25 p.
Chen, Final Office Action May 27, 2009, U.S. Appl. No. 10/646,230, Aug. 22, 2003, 28 p.
Chen, Office Action Dec. 2, 2009, U.S. Appl. No. 10/646,230, Aug. 22, 2003, 15 p.
Chen, Office Action May 27, 2010, U.S. Appl. No. 10/646,230, Aug. 22, 2003, 17 p.
Chen, Final Office Action Nov. 10, 2010, U.S. Appl. No. 10/646,230, Aug. 22, 2003, 17 p.
Chen, Office Action Aug. 23, 2011, U.S. Appl. No. 10/646,230, Aug. 22, 2003, 6 p.
Marolia, Office Action Aug. 17, 2007, U.S. Appl. No. 10/852,396, May 24, 2004, 17 p.
Qumei, Office Action Jun. 20, 2007, U.S. Appl. No. 10/813,212, Mar. 30, 2004, 10 p.
Chen, Office Action Jun. 12, 2008, U.S. Appl. No. 10/646,230, Aug. 22, 2003, 14 p.
Chen, Office Action Dec. 7, 2005, U.S. Appl. No. 10/411,784, Apr. 4, 2003, 15 p.
Chen, Final Office Action Nov. 6, 2007, U.S. Appl. No. 11/125,974, May 9, 2005, 10 p.
Gustafson, Office Action Jan. 22, 2009, U.S. Appl. No. 10/756,103, Jan. 13, 2004, 15.p.
Qumei, Office Action, Apr. 13, 2007, U.S. Appl. No. 10/770,983, Feb. 3, 2004, 11 .p.
Muller, N. J., “Focus on OpenView a guide to Hewlett-Packard's Network and Systems Management Platform,” pp. 1-291, CBM Books, published 1995.
ILOG, “ILOG Jrules—Complete business rule management,” [Online] <http://www.ilog.com/products/jrules/datasheet> (May 2003).
Verbauwhede et al., “Low power DSP's for wireless communications (embedded tutorial session)”, Aug. 2000, pp. 303-310. [Online] <http://delivery.acm.org/1 0.1145/350000/34464 7/p303-verbauwhede. pdf>.
“Over the Air User Initiated Provisioning Recommended Practice for the Mobile Information Device Profile”, Version 1.0, May 7, 2001.
Oma, “SyncML Device Management Tree and Description, Version 1.1.2,” Dec. 2, 2003, pp. 1-44.
Lucent Technologies, “Wireless Intelligent Network Over-the-Air Service Provisioning,” Technical Brochure, [Online] <http://www.lucent.com/livelink/146175-Brochure.pdf>, 1997.
3GPP2 C:R1001-A 2.0: Administration of Parameter Value Assignments for cdma2000 Spread Spectrum Standards, Release A: Jul. 14, 2000.
Albright, Brian, “Managing the force: Planning makes the difference,” Frontline Solutions, Jan. 2001, retrieved from scholar.google.com search Jun. 15, 2006.
Bailey, E. C., “Maximum RPM: Taking the Red Hat Package Manager to the Limit,” Copyright 2000 by Red Hat, Inc., 14 p.
Baker et al., “Compressing Differences of Executable Code,” Apr. 22, 1999.
Bokun et al. (Active Badges—The Next Generation, Linux Journa, Oct. 1998, Issue 54).
Brown, Michael et al., PGP in Constrined Wireless Devices, 1-23, 9th USENIX Security Symposium Paper 2000, retrieved Apr. 16, 2007.
Ortiz, C. Enrique, “Introduction to OTA Application Provisioning,” Nov. 2002, [Online] http://developers.sun.com/techtopics/mobility/midparticles/ota/ retrieved on Mar. 29, 2007.
Microsoft, “Computer Dictionary,” Microsoft Press Third Edition, pp. 88, 190, 1997.
Deitel & Deitel, “C How to Program,” 1994, Prentice-Hall, Inc., Second Edition, Chapter 5.
Digital Cellular Telecomminications System (Phase 2+) AT Command Set for GSM Mobile Equipment (ME) (GSM 07.07 version 7.4.0 Release 1998), MI TS 100 916 V7.4.0 (Nov. 1999), 126 p.
Engstrom, Don, “Two Clicks to a Rejuvenated Mac: A Review of UpdateAgent—CD Edition,” 20 Febuary 2002, pp. 1-3.
Eppstein, D., “Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs,” Jan. 31, 2001, pp. 1-10. [Online] http://www.ics.uci.edu/-eppstein/projects/pairs/Papers/ Epp-SODA-98.pdf>.
Euroloader, “Technical Specification” Dec. 2001, ECCA Euroloader Specificaion, pp. 1-60.
Fowler et al., “Lossless Compression ofVolumne Data,” 1995, IEEE, pp. 43-50.
Funambol Inc., “Funambol DM Server Developer's Guide Version 3.0,” Sep. 2006.
Guanluca, Moro, “On the Event Coordination in Multi-Component Systems,” published 2002, pp. 315-322.
Hicks et al., Dynamic Software Updating, Jun. 2001. [Online] <citeseer.ist.psu.edu/336947.html>.
IEEE LAN Man Standards Committee, “Draft Amendment to IEEE Standard for Local and Metropolitan Area Networks; Part 16: Air Interface for Fixed and Mobile Broadband Wireless Access Systems—Amendment to IEE Standards for Local and Metorpolitian Area Networks—Management Plane Procedures and Services,” IEEE Draft Standards, No. 802. 16g-04/03, Dec. 2004, pp. 1-8, XP002469853.
Jansen et al., “APPROX 2000, LNCS 1913,” pp. 84-95, 2000, Springer-Verlag, Berlin Heidelberg 2000.
Luculli, Gabriele, “Efficient and Effective Simulation of Memory Maps for System-on-Chip,” 11th IEEE Int'l. Conference and Workshop on the Engineering of Computer Baseed Systems, May 24-27, 2004, pp. 242-247.
Open Mobile Alliance, “Firmware Update Management Object,” 2006.
Open Mobile Alliance, “OMA Device Management Security,” Jul. 2005, Candidate Version 1.2.
Open Mobile Alliance, “SyncML Device Management Bootstrap,” 2003.
Open Mobile Alliance, “Firmware Update Management Object,” OMA-DM-V0—14-2004Oct28-D.
Open Mobile Alliance, “OMA Device Management Tree and Description—ver 1.2,” Jun. 15, 2005 (OMA-TS-DM-TND-V1—2-20050615-C).
Paila et al. “FLUTE-File Delivery Over Unidirectional Transport,” Network Working Group Request for Comments; 3926 Category; Experimental; Oct. 2004.
“Part 16: Air Interface for Fixed Broadband Wireless Access Systems,” Sep. 22, 2005, pp. 1-257, XP007904329.
“Problem Tracking Task Reference,” Continuus Software Corporation, Whole Manual, Part No. Pttr-041-011, 1996.
riel, “Object-Oriented Design Heuristics,” Apr. 30, 1996, Addison-Wesley Professional, Section 10.1.
Rodriguez et al., “TCP/IP Tutorial and Technical Overview,” Copyright 2002, pp. 489-490.
Shapira et al., “In Place Differential File Compression,” The Author 2005; Published by Oxford University Press on behalf of the British Computer Society; Advance Access published on Aug. 26, 2005; 15 p.
Starlin, Mark, UpdateAgent 8, Nov. 19, 2002, pp. 1-2.
Symbian, “Symbian OS powered Sony Ericsson P800 Smartphone to ship in Q32003” Mar. 2002 pp. 1-2.
Tansley, “Linux and Unix Shell Programming,” Dec. 27, 1999, Addison-Wesley Professional, 2 p.
The Mac Observer, Update Agent Scouts Out an Update for Itself, May 9, 2000, pp. 1-3.
TIA/EIA/IS-683-A: Over-the-Air Service Provisioning of Mobile Stations in Spread Spectrum Systems: May 1998.
Veeraraghavan et al., “A distributed control strategy for wireless ATM networks,” pp. 323•339, Wireless Networks 1995, retrieved from ACM database search Jun. 15, 2006.
Yang et al. , “Reuse Linux Device Drivers in Embedded Systems,” 1998 International Computer Symposium Workshop on Software Engineering and Database Systems Dec. 17-19, 1998.
Yau et al., “An approach to distributed component-based real-time application software development,” 1998, pp. 275-283.
Related Publications (1)
Number Date Country
20070089108 A1 Apr 2007 US
Provisional Applications (5)
Number Date Country
60373422 Apr 2002 US
60373421 Apr 2002 US
60373423 Apr 2002 US
60372066 Apr 2002 US
60249606 Nov 2000 US
Continuations (1)
Number Date Country
Parent 10411784 Apr 2003 US
Child 11637550 US
Continuation in Parts (1)
Number Date Country
Parent 10311462 US
Child 10411784 US