Microsoft Technology Licensing, LLC

Scott D Quinn

Benjamin W Slivka

Charles A Strouss, Iii

Ralph A Lipe

Raymond D Pedrizetti

Phillip L Barrett

Richard P Jernigan, Iv

Timothy W Bragg

Eric John Straub

Daniel S Venolia

Peter Blackburn Stewart

A graphical user interface provides a graphical volume meter indicating the volume of the user's speech and a speech recognition meter showing the progress of a speech recognizer. The graphical volume meter and recognition meter are both located near each other on the display such that the user can focus on both meters at the same time. One aspect of the present invention is that a speech recognition meter is placed on the display near the insertion point where the user intends their speech to take effect. Thus, the user does not have to divert their view from the insertion point in order to check the progress of the speech recognizer.

Method and apparatus for displaying speech recognition progress

A low bandwidth link can be used optimally for software updates, by successively transferring more information about the updates only as the likelihood of an applicable update successively increases. A many-to-one mapping function (e.g. a hash function) is applied to update identifiers on a server to generate a table of single bit entries corresponding to the updates. At a client, the same mapping function is applied to program identifiers to determine whether the server has a potential update. If a potential update is noted, a second transmission is requested for conveying additional data from the server by which hash collisions can be identified. A third transmission from the server is received conveying the actual update only after the availability of an actual update (versus a hash collision) is confirmed. The same arrangement can be employed in reverse.

Determining update availability via set intersection over a sub-optimal pathway

The present invention provides a method in a computer system of integrating a compression system with an operating system. The computer system preferably comprises at least a memory device and one storage device. A user-supplied device driver is provided for storage devices that are not supported by the computer system to enable the computer system to communicate with the storage devices. In response to initialization of the computer system, the operating/compression system is loaded into the memory device and begins executing before any user-supplied device drivers are loaded into the memory device. Any compressed volume files located on the computer system are assigned drive letters at this time. When the user-supplied device drivers are loaded into the memory device, drive letters are assigned to the various storage devices. A drive letter conflict resolution scheme is provided to resolve conflicts that occur when the operating system attempts to assign a drive letter. The compression system assigns drive letters to compressed volume files (in the case where a compressed drive is created from free space on an existing drive) or to host drives (in the case where the contents of an existing drive are compressed).

Method and computer system for integrating a compression system with an operating system

A set of software programs on a client computer is compared against a set of updates on a server computer to determine which updates are applicable and should be transferred from the server to the client. If the link between the client and server is slow, the listing of available updates must be represented in compact form. A many-to-one mapping function (e.g. a hash function) is applied to update identifiers to generate a table of single bit entries indicating the presence of particular updates on the server. This table is transferred to the client over the slow link. At the client, the same mapping function is applied to program identifiers, and corresponding entries of the transferred table are checked to determine whether the server has a potential update. If such a potential update is noted, a second transmission is requested by the client from the server--this one conveying additional data by which hash collisions can be identified by the client and disregarded. If availability of an actual update (versus a hash collision) is thereby confirmed, the client requests a third transmission from the server--this one conveying the actual update data. By this arrangement, optimized use is made of the low bandwidth link, with successively more information transferred as the likelihood of an applicable update is successively increased. (The same arrangement can be employed in reverse, with the bit table generated at the client and identifying program files available for possible updating, transferred to the server, etc.).

Determining program update availability via set intersection over a

Method and computer system for integrating a compression system with an

A method and apparatus for storing compressed file data stored on a disk. The method includes an improved format for the Compressed Volume File (CVF), and more specifically, 10 an improved format for the MDFAT data structure stored within the CVF. The improved format includes using an additional byte for maintaining each entry in the MDFAT data structure which increases the number of sectors within the Sector Heap that can be addressed and accessed. The improved format further allows compressed clusters to be stored in fragments in various portions of vacant storage space located throughout the Sector Heap. The new format for the MDFAT data structure includes a bit that identifies whether each cluster is being stored in fragments. The method stores the locations of each of the fragments in a Fragment Pointer List located in the first sector of the first fragment.

Method and apparatus for storing compressed file data on a disk where

A method and apparatus for defragmenting compressed file data stored on a disk. The method includes a first pass in which the FAT and MDFAT entries for each file stored on the disk are rearranged into adjacent clusters, but in which no movement of the compressed file data occurs. The method includes a second pass in which the actual compressed file data is rearranged on the disk in accordance with the FAT and MDFAT entries. A reference point is identified within the disk storage space such that no compressed file data will be stored beyond the reference point after the second pass is completed. During the rearrangement of data during the second pass, compressed file data is temporarily relocated beyond the reference point if possible. During all movements of compressed file data, the method transfers as much data as can be stored within the space to which the data is to be moved.

Two-pass defragmentation of compressed hard disk data with a single data

A method and system for updating data stored on a computer storage device are provided. The data is contained in records or entries. Each record or entry has a primary pointer and an indicator. The indicator initially has each bit set to a predefined bit value. When data is to be updated (and thus, the record or entry containing the data is to be superseded), at least one bit of the indicator is changed from the predefined bit value to another bit value to point to the new record or entry and to indicate that the data in the new record or entry is an update of the data in the superseded record or entry. This method and system are especially suitable to be used in a write-once computer storage device.

System for updating data stored on a flash-erasable, programmable,

A method and apparatus for storing files on a computer file storage device. The files are organized into an hierarchical directory structure. The directory structure comprises directory entries and file entries. The file entries and directory each contain a primary and a secondary pointer. The secondary pointer is initially set to a predefined value. When an entry is to be updated, the secondary pointer is overridden with a value that points to the superseding entry. This directory structure is especially suitable to be used in a write-once computer memory.

Growing community of inventors

Issaquah, WA, United States of America

Scott D Quinn