Abstract: A set of microprocessors may be set to a common mode in which the microprocessors utilize features that are common to all microprocessors. The common mode facilitates proper multiprocessor operation and permits a fix to be applied to each of the microprocessors based on this common mode. Firmware or software can detect whether microprocessors are set to run in different modes in a multiprocessor system. If not, the microprocessors are allowed to run in their normal mode, such as by writing a value to a configuration register associated with each microprocessor. If features are mixed, a different value can be written which tells each microprocessor to revert to a common mode of operation for that family of microprocessors. A common set of microcode patches may be downloaded to the microprocessors. Alternatively, the various microprocessors may also be instructed to run in a particular mode that emulates a particular stepping.

Abstract: A system and method for designing web pages that enables web designers to place hyperlinks to web pages independent of any hierarchical relationship between the pages of the website. A link bar element is provided within a description of the website. The link bar element includes a persistent set of links, each link corresponding to one of several content files. One or more of the content files may be a web file. The link bar element is associated with at least one web file by including a link bar name in the at least one web file. In addition, other link bar information is stored in the web file and a description of the website is stored in a description file separate from the at least one web file that is associated with the link bar element. The description file includes an identifier for the link bar node and the one or more links.

Abstract: In a computing device that receives handwritten data, a method and system for finding matches for recognized handwritten words, by comparing a given search word (and possibly its alternates) with the words in a document, including recognized ink words and any possible alternates for those recognized words as returned by a recognizer. One described test looks for an exact match between an entered search word (and possibly its alternates) and the recognized words and their alternates stored in a handwritten document. Other tests are possible because of the use of alternates, which also may be returned with a probability ranking. For example, one scheme looks for a percentage of matching characters, with a user-determined threshold percentage. Other variations include giving different weight to certain characters, and/or factoring in the relative number of syllables and/or the relative lengths of the words.

Abstract: In a computing device that receives handwritten data, a method and data structure that enables extended data to be added to an existing ink word data structure without compromising backwards-compatibility. A flag in the header data structure is indicates to new ink processing programs the presence or absence of the extended data, and the size information maintained in the header is adjusted ensure that earlier versions of ink programs do not lose the extended data. The extended data is then added by including it in a copy of the existing ink word data structure, along with a tail structure that includes information describing the extended data and the tail structure to the new ink code, e.g., version and offset information. The tail structure can be used to locate a list of alternate word choices for an ink word that are maintained within the extended data.

Abstract: An application hosting a browser modifies its own functionality in some manner based on whether particular content (e.g., an identifier) is present in a document for rendering by the browser. In one embodiment, a financial statement page for rendering via the hosted browser is scanned to determine if an identifier corresponding to a download button is present. If present, the host application provides an alternate download button that does not scroll off the screen as the page is scrolled. The present invention also suppresses a dialog box (e.g., the open/save dialog box) when a request for a certain file type is made by a hosted browser. For example, a request for download of financial information suppresses the open/save dialog box, and automatically opens the downloaded file.

Abstract: An improved method and system for client-side caching that transparently caches suitable network files for offline use. A cache mechanism in a network redirector transparently intercepts requests to access server files, and if the requested file is locally cached, satisfies the request from the cache when possible. Otherwise the cache mechanism creates a local cache file and satisfies the request from the server, and also fills in a sparse cached file as reads for data in ranges that are missing in the cached file are requested and received from the server. A background process also fills in local files that are sparse, using the existing handle of already open server files, or opening, reading from and closing other server files. Security is also provided by maintaining security information received from the server for files that are in the cache, and using that security information to determine access to the file when offline.

Abstract: In a computing device that receives handwritten data, a method and system that corrects for parser segmentation errors by sending an entire line of ink to a recognizer, and then comparing, on a word-by-word basis, the initial segmentation guesses of the parser with the more-thoroughly recognized segmentation results of the handwriting recognition engine. In the correction process, the ink words are efficiently adjusted with relatively little data manipulation. As the recognizer is fed a series of strokes on a line, the recognizer returns segmentation information. For ink word breaks that are the same for any given set of data, the existing ink word is unchanged. For ink words that are recognized differently relative to their initial segmentation, one or more new ink words are created and the handwriting (including stroke) data of the parser's ink word is manipulated to create a new ink processor word (or words) to match the recognizer output.

Abstract: A method and system for transparently combining remote and local storage to provide an extended file system such as a virtual local drive for a computer system client/user, e.g., a user of a pocket sized personal computer or a cable set-top box. A client device may load file system object data, storing the directories and files remotely, and retrieving the files only when required. Via its local storage, the extended file system handles unreliable connections and delays. When a connection to an extended file system server is present, the extended file system provides automatic downloading of information that is not locally cached, and automatically uploading of information that has been modified on the client. Extended file system attributes are employed to determine the actual location of file system data, and a lightweight protocol is defined to download or upload remote data by low-level components that make the remote source transparent from the perspective of the application.

Abstract: A method and system for installing software implementations such as applications and COM classes as they are needed from an external source, such as a centralized network store. When a software implementation is needed, the system and method first look to the local system (e.g., registry) for that software implementation, and if found, returns the information such as a local path needed to use the software implementation. If the implementation is not found locally, the present invention dynamically looks to a centralized class store of a network, to locate the needed implementation. When located, the implementation is downloaded and locally installed in a manner that is essentially transparent to the user. Software implementations such as application products may be divided into features and components to improve on-demand installation thereof.

Abstract: A hierarchical, object-oriented definition of the health of resources on a machine or network. A schema of objects is defined to represent machine and/or network health. One class of objects defines DataGroups that can be nested to represent machine resources. In addition to DataGroup objects, three other types of objects are defined in the schema, namely DataCollectors, Thresholds and Actions. DataCollectors are objects that when instantiated, collect data by polling or event notification. Threshold class objects as defined in the schema are associated with the DataCollector objects, and each provides the threshold or thresholds against which a DataCollector's collected data is evaluated. Action objects specify what happens when a Threshold is violated, such as to send an e-mail, page someone, run a script, execute a command, or send a message alert to a console for an operator to see.

Abstract: Feature correspondence between images using an image pyramid is disclosed. In one embodiment, a fundamental matrix between a first and a second image is generated from the image pyramid. The image pyramid is first generated, and has a predetermined number of fineness levels, from a coarsest to a finest level. Each of the images has significant features at each pyramid level. A plurality of hypotheses, or particles, is generated for the fundamental matrix at the coarsest level, based on matching significant features of the images at the coarsest level. In an iterative procession through the levels of the image pyramid, starting at a present level initially set to the coarsest level and then subsequently advanced by one fineness level upon each iteration, an importance sampling function is first formulated from the hypotheses. The plurality of hypotheses is then generated at the next pyramid level based on the function, and on the significant features of the images at this next level.

Abstract: An efficient write-watch mechanism and process. A bitmap is associated with the virtual address descriptor (VAD) for a process, one bit for each virtual page address allocated to a process having write-watch enabled. As part of the write-watch mechanism, if a virtual address is trimmed to disk and that virtual address page is marked as modified, then the corresponding bit in the VAD is set for that virtual address page. In response to an API call (e.g., from a garbage collection mechanism) seeking to know which virtual addresses in a processs have been modified since last checked, the memory manager walks the bitmap in the relevant VAD for the specified virtual address range for the requested process. If a bit is set, then the page corresponding to that bit is known to have been modified since last asked. If specified by the API, the bit is cleared in the VAD bitmap so that it will reflect the state since this time of asking.

Abstract: A system and method for self-diagnosing a likely cause of a system crash is disclosed. A mechanism within an operating system checks for the existence of a stop code at startup of the machine. The existence of the stop code indicates that the system crashed during the previous session, and the type of system crash. The mechanism may read the stop code and implement a self-diagnostic procedure that corresponds to that stop code. In this manner, the mechanism may automate many of the tasks normally performed by humans, such as a system administrator, to self-diagnose the likely cause of the crash. If the crash occurs again, the mechanism, through the tracking procedures automatically implemented, may identify and report to a system administrator the likely cause of the crash, e.g. the particular faulty driver or configuration error.

Abstract: A system and method store information to a sequential storage media such that storage space occupied-by data deemed obsolete may be reclaimed. Information may be written to the storage media as sequential data sets with each data set including a catalog describing the information in the data set. A reclamation catalog identifies the obsolete data stored on the media and is written to the media. A generation number on the storage media may indicate whether the storage media has been reclaimed. A reclamation process transfers data from the source media (e.g., the tape media that includes obsolete data) to a destination media (e.g., a blank tape) while excluding the obsolete data identified in the reclamation catalog. The reclamation process may read a catalog stored on the source media that describes the data stored on the source media. The reclamation process then modifies that catalog by the information stored in the reclamation catalog to create a unified catalog.

Abstract: A method and improved data structure for attaching information to words in a trie of nodes. Each node of a trie includes a single tag bit which is interpreted according to information specified in a header of the trie. The information may specify that a node may be tagged with multiple tags, whereby if the tag bit is set in a given node, the node further includes a bitmask indicating which one or ones of the tags apply to that node. A value mask may be provided in the header indicating which of the tags (if any) have values associated therewith, whereby information representative of the value such as the value itself or a pointer thereto is stored in each node tagged with at least one tag having an associated value. Partial enumeration of tagged nodes may be provided by storing a count of the number of tagged words under a node, wherein if a trie has multiple tags, each tag may be selectively and separately enumerated as specified in header information.

Abstract: A method and system wherein following a partitioning of a server cluster, operational subgroups arbitrate for possession of a quorum resource that determines cluster representation, wherein the arbitration is biased by a relative weight of the subgroup. The weight may be relative to the original cluster weight, or submitted as a bid that is relative to other possible subgroup weights. The biasing gives subgroups that are better capable of representing the cluster an arbitration advantage over lesser subgroups. The biasing weight of each subgroup may be determined by node count and/or by a calculation of the subgroup's resources. The arbitration may be delayed based on the relative weight, or alternatively, the arbitration may comprise a bidding process in which a subgroup's bid is based on the subgroup's relative weight.

Abstract: A snapshot system capable of capturing snapshots of multiple volumes wherein the snapshots are coordinated. A snapshot manager determines which volumes are to be involved in a snapshot operation, and issues a message to the file system for each volume involved, each message including information sufficient to identify the volumes involved in the snapshot operation. Each file system passes its respective message down to a coordinator mechanism. The coordinator mechanism coordinates the state of each of the volumes, such as by holding writes thereto, to put each volume into a quiescent state, and then enables the snapshot to be captured. When the snapshots are captured, a snapshot set will include snapshots that are coordinated across the multiple volumes. The coordinator mechanism releases any writes being held for the volumes involved.

Abstract: A system and method for configuring image data, such as data suitable for JPEG compression, into a format that can be streamed and displayed even if part of the image is lost in transmission. The image data is scrambled and compressed into restartable segments of compressed data. After compression, the data is packetized, with segment restart information written into headers accompanying the payload in each packet. When the packets arrive, they are parsed to determine from their restart information which restart segments have arrived. Each restart segment that has arrived is sent to an image decompressor, resulting in a scrambled bitmap image, having gaps wherever data segments were lost. The image is then unscrambled, resulting in small, isolated blocks of missing data psuedo-randomly dispersed throughout the image. Fill-in techniques from the surrounding pixels further improve the perceived image quality.

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.

Abstract: A mechanism is provided that allows an application program to write, as a single file, a large block of data comprising multiple portions that could otherwise be written as several smaller files, then to access, as individual files, each of the portions within the large block of data, and to be able to create individual files efficiently out of each of these subfiles. The mechanism may be partially embodied in a file system that includes an information store defining each file on a volume. The application program writes, via the file system, a single file to the volume as (preferably) a contiguous block of data. The single file includes two or more separable streams of data capable of being stored as individual files (subfiles). Once the single file is written to the volume, multiple entries are made to the information store. Each entry defines and points to a subfile within the single file.