Abstract: Systems and methods described herein provide for communication between a base component and a slate component of a hybrid computing system. The hybrid computing system is in a connected state when the base component and slate component are connected. Embodiments provide that the base component may control the slate component when the hybrid computing system is in a connected state. In addition, embodiments provide that a server module running on the display component and a client module running on the base component facilitate communication between the hybrid computing system components. Furthermore, systems and methods described herein provide that the base component may control hardware devices, peripheral devices, or software applications of the display component through communications between the server module and client module.

Abstract: Systems and methods described herein provide for communication between a base component and a tablet component of a hybrid computing system. The hybrid computing system is in a connected state when the base component and tablet component are connected. Systems and methods provide for a switch for determining control of the hybrid computing system when in a connected state. Embodiments provide that the base component may control the tablet component when the hybrid computing system is in a connected state and the switch is set to base control. According to embodiments, the display component may control the hybrid computing system when the hybrid computing system is in a connected state and the switch is set to tablet control. In addition, embodiments provide that a server module running on the display component and a client module running on the base component facilitate communication between the hybrid computing system components.

Abstract: Embodiments operating shared peripherals in a hybrid computing system are described. Embodiments control a shared wireless antenna variously between a primary system and a secondary system, where the secondary system is detachable from the primary system and operates as an independent computing device in the disconnected state, while operating as a display device in the connected state.

Abstract: Systems and methods described herein provide for a process for managing continuity of experience between operation of a hybrid computer system in the connected state and the slate component independently in the disconnected state. Embodiments further provide for the continuity of experience for devices operating under multiple processors or multiple platforms. According to embodiments, one or more states and conditions of the connected hybrid computer system may be synchronized with the slate component when the slate component is disconnected from the hybrid computer system. Alternatively, embodiments provide for the synchronization of one or more states and conditions of the independent slate component with the hybrid computer system responsive to connecting the slate component to the hybrid computer system. Non-limiting examples of states and conditions according to embodiments are web pages, applications, documents, lists of recently opened files and web pages, and web browser active tabs.

Abstract: Techniques and articles of manufacture are provided comprising computer readable programs that, when executed on the computer, cause the computer to delete a leaf from a patricia tree having leaf keys and pattern search control blocks containing a prefix and either an end-of-trail leaf or a pointer to another of the pattern search control blocks, by placing each of the prefixes in a tree prefix table; searching for a key in the tree; searching for the key in the prefix table if the tree searching does not find the key in the tree; confirming that the key is deleted if the key is not found in the prefix table; deleting the key from one of the pattern search control blocks; and collapsing the patricia tree by eliminating the left most pattern search control block from the patricia tree if the patricia tree searching finds the key.

Abstract: Arrangements and methods for facilitating access to VPN-derived data regardless of computing platform power state.

Abstract: Techniques and articles of manufacture are provided comprising computer readable programs that, when executed on the computer, cause the computer to delete a leaf from a Patricia tree having a direct table and a plurality of PSCB's which decode portions of the pattern of a leaf in the tree without shutting down the functioning of the tree. A leaf having a pattern is identified as a leaf to be deleted. Using the pattern, the tree is walked to identify the location of the leaf to be deleted. The leaf to be deleted is identified and deleted, and any relevant PSCB modified, if necessary. The technique also is applicable to deleting a prefix of a prefix.

Abstract: A technique is provided to delete a leaf from a Patricia tree having a direct table and a plurality of PSCB's which decode portions of the pattern of a leaf in the tree without shutting down the functioning of the tree. A leaf having a pattern is identified as a leaf to be deleted. Using the pattern, the tree is walked to identify the location of the leaf to be deleted. The leaf to be deleted is identified and deleted, and any relevant PSCB modified, if necessary. The technique also is applicable to deleting a prefix of a prefix.

Abstract: Arrangements for managing displays of ultra-mobile devices (UMD's). Automatically or manually, a small-mode interface on a UMD screen, wherein one application window is visible, is switched to a large-mode interface.

Abstract: A technique is provided to either insert or delete a leaf in a Patricia tree having a direct table and a plurality of PSCB's which decode portions of the pattern of a leaf in the tree without shutting down the functioning of the tree. A leaf having a pattern is identified as either a leaf to be inserted or deleted. Using the pattern, the tree is walked once to identify the location of the leaf to be deleted or the location where the leaf is to be inserted. If it is a delete operation, the leaf to be deleted is identified and deleted, and any relevant PSCB modified, if necessary. If it is an insert operation, the tree is walked a second time to insert the leaf and reform or create any PSCB in the chain that needs to be reformed or created. The technique also is applicable to inserting or deleting a prefix of a prefix.

Abstract: A tree structure and method to organize routing information for processing messages within a network, each message being associated with a search key of “n” bits. The processing determines where to send the message next. The structure has a direct table (DT) of 2x entries for decoding the first “x” bits of the search key, and one or more pattern search control blocks (PSCB's), each having 2m entries for decoding subsequent groups of “m” bits. Each PSCB entry and DT entry includes a pointer to data associated with a specific route, if at this point a specific routing table entry is a potential match to the search key or a pointer to a subsequent PSCB if the end of a search trail is not identified. Each PSCB entry DT entry also indicates that the search has been resolved to the end of the search trail.

Abstract: A technique is provided to either insert or delete a leaf in a Patricia tree having a direct table and a plurality of PSCB's which decode portions of the pattern of a leaf in the tree without shutting down the functioning of the tree. A leaf having a pattern is identified as either a leaf to be inserted or deleted. Using the pattern, the tree is walked once to identify the location of the leaf to be deleted or the location where the leaf is to be inserted. If it is a delete operation, the leaf to be deleted is identified and deleted, and any relevant PSCB modified, if necessary. If it is an insert operation, the tree is walked a second time to insert the leaf and reform or create any PSCB in the chain that needs to be reformed or created. The technique also is applicable to inserting or deleting a prefix of a prefix.

Abstract: A structure and method of routing a message is disclosed. A tree structure is provided for organizing routing information used in processing messages within a network, each message being associated with a search key of “n” bits. The processing includes a determination of where to send the message next to get the message closer to the desired destination. The structure has a direct table (DT) of 2x entries for decoding the first “x” bits of the search key. One or more pattern search control blocks (PSCB's), each having 2m entries for decoding subsequent groups of “m” bits, is provided. Each PSCB entry and DT entry includes a pointer to data associated with a specific route, if at this point a specific routing table entry is a potential match to the search key. Each PSCB entry and DT entry includes a pointer to a subsequent PSCB if the end of a search trail is not identified.