Abstract: Various technologies and techniques are disclosed that use lexicons in content searching and browsing. Lexicons for a particular subject matter are identified. Groups of content are correlated together based upon the lexicons for the particular subject matter. Upon request, a particular portion of content, such as a web page, is displayed. The lexicon(s) for the particular content are retrieved and the key words of the lexicon(s) contained in the particular content are displayed in some manner. For example, the key words of the lexicon(s) that are present in the particular content can be visually indicated. As another example, the correlations to other content can be displayed upon selecting a particular key word of a lexicon that is present in the particular content.

Abstract: A send client can send a message or multiple segments of a message to a receive client via a computer network. A data exchange server can receive the message and store the message in a storage device. If the send client sent the message in multiple segments, the data exchange server can store the message segments in the storage device once it receives all the message segments. The data exchange server can send the message in multiple segments to a receive client. The data exchange server can send a send receipt to the send client upon sending the message to a next destination. The data exchange server can send a receive receipt to the send client upon receiving the message. The data exchange server can send messages of an ordered set in the order in which they are received from a send client.

Abstract: The performing of actions on an object graph that contains multiple objects. The objects are categorized into partitions. Taking into account the partitions, a particular non-final action performed on the object graph may be undone without necessarily first undoing all of the one or more subsequent actions. Instead, if the subsequent actions involved objects of different partitions than the objects that were affected by the particular action desired to be undone, the particular action may be undone without undoing the subsequent actions.

Abstract: A publish-subscribe event system for a set of communicating machines, where when a machine receives an event, whether a published event or a subscription event, it publishes locally the received event by an inter-process communication in the machine. In this way, the event is made available to other processes on the machine. For some embodiments, an event is published locally in a machine by placing it in shared memory. During a subscription process, each machine updates its routing table as subscription events are received. When a published event is received by a machine, it is published locally by the inter-process communication in the machine, where the one or more subscribing applications on the machine may have access to it. The received published event is also routed to other connected machines according to the machine's routing table. Other embodiments are described and claimed.

Abstract: Various technologies and techniques are disclosed that use lexicons in content searching and browsing. Lexicons for a particular subject matter are identified. Groups of content are correlated together based upon the lexicons for the particular subject matter. Upon request, a particular portion of content, such as a web page, is displayed. The lexicon(s) for the particular content are retrieved and the key words of the lexicon(s) contained in the particular content are displayed in some manner. For example, the key words of the lexicon(s) that are present in the particular content can be visually indicated. As another example, the correlations to other content can be displayed upon selecting a particular key word of a lexicon that is present in the particular content.

Abstract: Systems and methods for activating a component in a computing system having a plurality of partitions. One method includes receiving a request to activate a component having an object class ID and a partition ID and detecting if the object class ID is contained within a default partition corresponding to the partition ID. If the object class ID is contained within the default partition, an instance of the component in the partition ID is activated. If the object class ID is not contained within the default partition, the method includes detecting if the object class ID is contained within a base partition. If the object class ID is contained in the base partition, an instance of the component in the base partition is activated.

Abstract: A send client can send a message comprising multiple message segments to a receive client via a computer network. A data exchange server can receive the message segments sent by the send client and store these message segments in a storage device. The data exchange server can also send the message (once all the message segments are received) to a receive client. For each message segment to be sent to the receive client, the data exchange server can calculate a transmission rate for the message segment based upon current network throughput and send the message segment to the receive client at the calculated transmission rate.

Abstract: A method, apparatus, and article of manufacture provide a component-based computing system having both publicly accessible and privately-only accessible computing components within multiple applications for providing component addressing/identification and naming spaces. A requested processing component is initiated by a calling component within a local computing system having one or more applications. The identity of the requested processing component, including an identity of a class ID and an identity of a partition from a request to activate a component initiated by a calling component, is obtained using configuration data for the requested component. The configuration data provides an indication of public-private status for the requested component. An instance of the requested component can be activated based on the public-private status.

Abstract: A method, apparatus, and article of manufacture for providing a component-based computing system having programmable components and component aliases for identifying computing components for providing component addressing/identification and naming spaces is disclosed. The computing system has a partition activation control module for receiving a request to activate a component initiated by a calling component and activating an instance of the requested component, a permit object activation module for determining whether an instance of the requested component may be activated, a component object alias activation module for substituting a unique component class ID for a component alias class ID if the requested component corresponds to a component object alias, a system component catalog database for maintaining component object configuration data, and a component object activation module for activating the requested component.

Abstract: In a network with a sending system networked to at least one receiving system, it is sometimes desirable to transfer relatively short messages between the sending system and one or more receiving systems in a highly reliable yet highly efficient manner. The present invention defines two short message protocols, one of which relies on a statistical model and the other of which uses positive acknowledgement to track receipt of transmitted packets by intended recipient. The statistical reliability mode is based on the observation that for each packet in a message that is transmitted, the probability that at least one packet of the message is received by a given system increases. Thus, in the statistical reliability mode messages are divided into a guaranteed minimum number of packets, with additional packets being added if the message length is insufficient to fill the minimum number of packets.

Abstract: In a network with a sending system networked to at least one receiving system, it is sometimes desirable to transfer relatively short messages between the sending system and one or more receiving systems in a highly reliable yet highly efficient manner. The present invention defines two short message protocols, one of which relies on a statistical model and the other of which uses positive acknowledgement to track receipt of transmitted packets by intended recipient. The statistical reliability mode is based on the observation that for each packet in a message that is transmitted, the probability that at least one packet of the message is received by a given system increases. Thus, in the statistical reliability mode messages are divided into a guaranteed minimum number of packets, with additional packets being added if the message length is insufficient to fill the minimum number of packets.

Abstract: In a network with a sending system networked to at least one receiving system, it is sometimes desirable to transfer relatively short messages between the sending system and receiving systems in a highly reliable yet highly efficient manner. The present invention defines two short message protocols, one of which relies on a statistical model and the other of which uses positive acknowledgement to track receipt of transmitted packets by intended recipient. In the statistical reliability mode messages are divided into a guaranteed minimum number of packets, with additional packets being added if the message length is insufficient to fill the guaranteed minimum number of packets. The positive reliability mode of the present invention periodically sets an acknowledgement flag in the packets transmitted for a message. Receiving systems send an acknowledgement in response to receipt of that packet.