Microsoft Technology Licensing, LLC

Microsoft Corporation

Keith S Hamilton

Steve Jamieson

Robert Steven Meizlik

Antero T Koskinen

Robert Zhu

Joe Dennis Long

Ramesh Rajagopal

Rahul Ramesh Deshpande

Paul M Oeuvray

Steven T Antoch

Alexei Kourbatov

Jack Greenfield

George Mathew

Niall L McDonnell

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.

Lexicon-based content correlation and navigation

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.

System and method for reliably exchanging information across a computer network

Systems and methods that facilitate persona-based application personalization are disclosed. A persona is a conglomeration of a group of archetypal users that represent the personalization needs of many users and is based on observed behavior and patterns associated with the group of users. Users can be grouped into personas, and the personas can be analyzed to facilitate application personalization at a person level. Individual users can then be mapped to personas based on correlations of their respective individual behaviors and/or usage patters to the usage patterns of the persona as a whole.

Persona-based application personalization

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.

Partition-based undo of partitioned object graph

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.

Method and system for application partitions

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.

System and method for exchanging information across a computer network at variable transmission rates

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.

System determining whether to activate public and private components operating within multiple applications of a component-based computing system

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. The method determines the identity of the requested processing component, including an identity of a unique component class ID and an identity of a partition from a request to activate a component initiated by a calling component and obtains configuration data for the requested component, the configuration data comprises one or more component parameters for the requested component. If the configuration data indicates that the requested component is a component object alias, the method substitutes a unique component class ID for the component alias class ID and activates an instance of the requested component.

Component aliasing operating within a component-based computing system

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. 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. The sending system tracks receipt of acknowledgements by intended recipient and retransmits any unacknowledged packets so as to positively assure the packets are received. Receiving systems send negative acknowledgements to request retransmission of missing packets. Negative acknowledgement suppression is implemented at both the sender and receiver to prevent a flood of negative acknowledgements from overwhelming the network. Packets are transmitted by the sending system at a transmission rate selected to avoid any adverse impact on the packet loss rate of the network.

Method and computer program product for efficiently and reliably sending small data messages from a sending system to a large number of receiving systems

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. The sending system tracks receipt of acknowledgements by intended recipient and retransmits any unacknowledged packets so as to positively assure the packets are received. Receiving systems send negative acknowledgements to request retransmission of missing packets. Negative acknowledgement suppression is implemented at both the sender and receiver to prevent a flood of negative acknowledgements from overwhelming the network. When packets are missed, the receiver selects a wait time that must elapse before the negative acknowledgement is sent. The wait time is selected according to a refined probability density function that results in relatively few negative acknowledgements being sent early on and relatively more negative acknowledgements being sent later on.

Growing community of inventors

Redmond, WA, United States of America

Keith S Hamilton