Abstract: The present invention provides efficient target file window matching within the source file for delta compressors.

Abstract: The present invention provides a network monitoring device that monitors a network in order to gather information on the traffic flow generated by network users over the network. The network monitoring device can subsequently distribute network traffic information to subscribers. As the network traffic information is gathered, the network monitoring device can further analyze the information to discern patterns in the traffic flows. A large network service provider with access to network traffic data from a large population of network end-users and business servers can use the network traffic data to obtain information on various patterns in the network traffic data flow and related business interests in real-time.

Abstract: By checkpointing and restoring a user application process, that includes a volatile state and a persistent state, recovery of an application process from the checkpoint position is possible. Specifically, a volatile state is checkpointed in a checkpoint position. Next, the persistent state is monitored to detect a file operation following a checkpoint position that will modify the persistent state. Then, portions of the persistent state are checkpointed if a modification of the persistent state is about to be performed. Then, a recovery to the checkpoint position can be performed such that modifications to the persistent state since the checkpoint position are undone. This allows for resumption of the user application process from the checkpoint position.

Abstract: A checkpoint and restoration system is disclosed to provide checkpoint and restoration techniques for user application processes which save the process state, including the volatile state and desired portions of the persistent state, during normal execution, and thereafter restore the saved state. A lazy checkpoint technique is disclosed which delays the taking of the persistent state checkpoint until an inconsistency between the checkpointed volatile state and a portion of the persistent state is about to occur. The disclosed checkpoint and restoration system allows a user or a user application process to specify selected portions of the persistent state to be excluded from a checkpoint. A selected portion of the pre-restoring process state, such as a return value argument, may be protected before restoring the user application process to a checkpointed state, so that the pre-restoration values of the protected state are retained following restoration of the checkpoint.

Abstract: The present invention relates to systems for sharing idle workstation computers that are connected together through a network and shared file system. More particularly, a user of a local host workstation may submit jobs for execution on remote workstations. The systems of the present invention select a remote host that is idle in accordance with a decentralized scheduling scheme and then continuously monitor the activity of the remote host on which the job is executing. If the system detects certain activity on the remote host by one of the remote host's primary users, the execution of the job is immediately suspended to prevent inconvenience to the primary users. The system also suspends job execution if the remote host's load average gets too high. Either way, the suspended job is migrated by selecting another idle remote workstation to resume execution of the suspended job (from the point in time at which the last checkpoint occurred).

Abstract: Secure communication is effected when computers A and B that are interconnected by an insecure medium employ a dataset that is known to both and that is otherwise used within one or other of the computers for other than effecting secure communication as the shared secret from which an encryption key is derived. A dataset that needs to be securely communicated from computer A to computer B is encrypted with an encryption key derived from the shared secret. Computer B derives its own key and decrypts the received communication. In an enhanced version of this method, information is included in the transmission which assures computer B that no alterations occurred during transmission. When the dataset that needs to be securely communicated by computer A to computer B is an updated version of a dataset that already is present in computer B, a further enhancement suggests that computer A transmit only the difference between original dataset and the updated dataset.

Abstract: The apparent speed of a connection between a browser at a user station and a proxy or gateway on a network such as the Internet is increased by providing a local proxy at the user station which interacts with a remote proxy. While the remote proxy is retrieving a newly requested World Wide Web page, for example, from the appropriate content provider, it may also be sending to the local proxy a stale cached version of that page. When the new version of the page is finally retrieved, the remote proxy determines the differences between the new version and the stale version, and, assuming the differences do not exceed the new page in size, sends the differences to the local proxy which then reconstructs the new page from the differences and the stale version. The local proxy delivers the new page to the browser, which need not even be aware that a local proxy exists; it is aware only that it received the page it requested.

Abstract: A system and method for selective regression testing of a software system that determines which test units of a test suite must be re-run after a modification to the software system. The entities which are covered by each test unit are identified. When the software system is modified the entities which were changed by the modification are identified. The test units which need to be re-run are determined by analyzing the change information and the coverage information to select those test units that cover changed entities.

Abstract: The present invention relates to a computer-implemented technique for drawing directed graphs providing reduced crossings and improved picture quality. An edge list description provided by a user is processed to produce a ranking of all nodes that minimizes the weighted sum of all edges, an edge cost being the product of its weight and length. Nodes within a ranking are then positioned to reduce edge crossings using a heuristic based on node positions in adjacent ranks. Such heuristic uses a generalized median as a weighting function plus node transposition to avoid senseless edge crossings before proceeding to a next rank. Nodes are then positioned to minimize the weighted sum of horizontal distances among connected nodes. Spline control points are then computed for interconnected nodes, and a code sequence for a drawing is generated.