Abstract: A method and system for caching partial downloads of network content and using that cached partial content to satisfy requests for content from client applications, in a manner that is invisible to the application. A network interface receives a request for content corresponding to cached partial content, determines what portion is cached and what portion is missing, and requests from the server only the missing range of content. When the missing content is received in a partial range response, it is merged with the cached content to provide the full content requested. The interface further transforms the range response to a response that the application is expecting and is capable of handling. Benefits include reduced client latency, reduced server load and improved network utilization.

Abstract: A method and system in a server cluster for monitoring and controlling a resource object, such as a physical device or application. A cluster service connects to a resource monitoring component to control and monitor the health of one or more resource objects. The resource component includes a plurality of methods, common to all such resource components, for calling by the resource monitor to control and monitor operation of the resource object therethrough. The common methods enable the cluster server to treat all resources similarly without regard to the type of resource.

Abstract: A method and mechanism for efficiently handling connections in a computer system between client sockets and data sockets of a server. The server includes a receive-any thread having a socket mask associated therewith to listen for new connection requests and for activity on data sockets handled thereby. The server further includes receive-direct threads associated with at least some of the data sockets for handling data communication. When a receive-direct connection has no activity for a period of time, the connection is migrated to a receive-any connection. When a receive-any connection becomes active, the connection is migrated to a receive-direct connection if a receive-direct thread is available.

Abstract: A method and system for communicating modification information to servers in a server cluster. Local changes, such as modifications to a resource requested at one node, are associated into a single transaction. A master node, such as the node that owns the set of resources corresponding to the modifications in the transaction requests permission from a locker node to replicate the transaction. When permission to replicate the transaction is received from the locker node, the master node replicates the transaction by requesting each node in the cluster, one node at a time, to commit the transaction. Any node that does not commit the transaction is removed from the cluster, ensuring consistency of the cluster. Failure conditions of any node or nodes are also handled in a manner that ensures consistency.

Abstract: A method and system for preventing incorrect information from corrupting server object information maintained by a client machine. A DCOM client machine is provided with object reference information for accessing remote objects. DCOM unmarshals the information into server object information, including an object identifier and string bindings of a remote resolver through which the client machine may contact the remote server to obtain string bindings for that remote object. Each resolver string bindings received by a client machine are compared against known resolver string bindings and each unique permutation of string bindings is associated with a unique machine identifier locally generated therefor. Each object identifier is paired with its corresponding unique machine identifier so that all references to a remote object include the identity of the machine on which the object was created.

Abstract: A method and system for increasing perceived Internet browser performance by using a relatively high-bandwidth data source such as a CD-ROM and/or a hard drive directory as a local cache of Internet content. The content is provided by content providers via some high-bandwidth data source such as a CD-ROM media for a CD-ROM drive. An install program provided with the content registers with the system one or more URL patterns such as prefixes corresponding to the content, in association with one or more file system patterns (e.g., prefixes) corresponding to a cache container (file system directory). When subsequently browsing to a URL having a matching pattern, the URL pattern is resolved to the cache container, which is then used with the rest of the URL to construct a local file reference. The local file is accessed from the high-bandwidth data source. If the local file is not found, the original http URL is instead used, whereby the content is downloaded in the normal manner.

Abstract: A method and mechanism for displaying partial results of full context handwriting recognition. As handwritten characters are entered into a system, a shape matcher associates the character with a plurality of alternate code points, with each alternate code point having probability information associated therewith. The alternate code points are placed at the end of a queue, and a cost is determined from each alternate code point to any immediately preceding alternate in the queue. The cost is based on the probability information of the alternates and a transition cost therebetween. Then, the lowest cost path back from each of the alternates at the end of the queue to an alternate at the beginning of the queue is determined. If each lowest cost path back converges to a common alternate in the queue, the common alternate and any previous alternates on the path back are recognized as the code points for each of the handwritten characters associated therewith.

Abstract: A system and method for improved monitoring of chat room conversations, including a database which stores penalty information corresponding to the identities of users. When the identity of a user on a channel is received, the database is queried with the identity of the user. In response, penalty information corresponding to that user is received, and if found, a penalty corresponding to the penalty information is automatically applied to the user. The system and method also provide a mechanism for handling user complaints. User complaints are received from a user at the chat channel and forwarded to a complaint channel for review by a monitor client. The system receives a response to the complaint message from the monitor client, which may include one or more assessed penalties. The penalty information is applied to the user and stored in the database.

Abstract: An improved method and mechanism for recognizing chirographs (handwritten characters) input into a computer system. A primary recognizer is provided for converting chirographs to code points, and secondary recognizers such as binary CART trees are developed and trained to differentiate chirographs which produce certain code points at the primary recognizer. Each such secondary recognizer is associated with each selected code point. When a chirograph is received, the chirograph is provided to the primary recognizer whereby a code point corresponding thereto is received. If the code point corresponds to one of the secondary recognizers, the chirograph is passed to the secondary recognizer, and a code point is returned from the secondary recognizer. If not, the code point provided by the primary recognizer is returned.

Abstract: The system described herein automatically defines a set of radicals to be used in a Kanji character handwriting recognition system and automatically creates a dictionary of the Kanji characters that are recognized by the system. In performing its functionality, the system described herein first obtains representative handwriting samples for each Kanji character that is to be recognized by the system. The system described herein then evaluates the samples to identify a set of subparts ("radicals") that are common to at least two of the Kanji characters. These radicals represent component roots from which the characters are formed. Each Kanji character is formed by one or more of these radicals. The radicals that are identified by the system described herein are not constrained to any preset definition (e.g., the traditional set of radicals used to organize Japanese dictionaries).

Abstract: A wheelchair with a detachable combined armrest and transfer board. The transfer board is attached to the wheelchair by a unique coupling. The transfer board is linked to the seating surface of the wheelchair and is reconfigurable from a first position in which the transfer board extends along one side of the seating surface to a second position in which the transfer board is capable of extending from the seating surface of the wheelchair to a second seating surface remote of the wheelchair. The coupling permits unrestricted movement of the transfer board relative to the wheelchair while maintaining a linkage between the wheelchair and the transfer board, thus aiding in stability of the transfer board.

Abstract: A check out stand (20) having a telescoping take-away conveyor (26) extending between a front module (22) and a rear module (24). Retraction of the telescoping take-away conveyor (26) allows an area located beneath the leading end of the conveyor to be exposed. The exposed area can support a single bag (85) for bagging groceries and other items. If the telescoping take-away conveyor (26) is retracted only a limited amount, the single bag (85) may be inserted between the leading end of the telescoping take-away conveyor (26) and the trailing end of the scanner (32). The telescoping take-away conveyor (26) utilizes a friction roller (66) that permits the powered roller (60) for the telescoping take-away conveyor (26).

Abstract: A method and mechanism for rapidly freeing storage space allocated to any logical portion of a file. An application program provides the file system with information indicating a block of logical data to free. The file system converts the information to the physical allocation units such as the clusters corresponding to the logical block of data, and manipulates the file's meta data to indicate that the physical space is no longer allocated to the file. The file system then adds the space to disk free space. Applications such as merge applications and those managing FIFO queues may use the method and mechanism to shrink a file from the start of the file toward the end thereof without copying the logical data or adjusting internal pointers relative to the logical file data.

Abstract: A method and system for data entry of handwritten text into a computer program that is not designed to accept handwritten text is provided. In preferred embodiments, the computer program is designed to operate in a windowing environment. A data entry program receives handwritten data, recognizes the data, and sends the recognized data to the computer program. The computer program processes the recognized data as if it had been entered from the keyboard. According to the present invention, the data entry program overlaps the window of the computer program with an invisible window. To the user, it looks as if the computer program is accepting handwritten data directly.