Patents by Inventor Ransom L. Richardson
Ransom L. Richardson has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 11423095Abstract: Methods, systems, and computer storage media for providing action-recommendations (e.g., save action, collaboration action, and upload action) using cloud system operations in a cloud system. For example, action-recommendations are predicted using usage data of applications and communicated to a user (e.g., via a prompt) such that the user elects to perform or not perform the action-recommendation. In operation, usage data for an application and an action-recommendation profile are accessed. Determining that an action-recommendation should be generated is based on the usage data and the action-recommendation profile. The determination is further based on action scores and thresholds (e.g., save action, collaboration action, upload action). When the action scores meet certain thresholds, the action-recommendation is generated as a save-action-recommendation, a collaboration-action-recommendation, or an upload-action-recommendation.Type: GrantFiled: September 3, 2020Date of Patent: August 23, 2022Assignee: Microsoft Technology Licensing, LLCInventors: William N. Saez, Pramod Kumar Gupta, Sidhika Varshney, Jichen Yang, Joe A. Herzog, Michael M. Santos, Ransom L. Richardson, Yimeng Li, Yash Ravi Punjabi, Tejprakash S. Gill, Tracy A. Childers, Siqing Chen, Rui Hu, Jinnie Park, Elijah John Scherrer, Raymond C. Li, Juan Antonio Karmy Tacla, Priya Tushar Nakhre, Anshul Basia, David Milićević
-
Publication number: 20220067106Abstract: Methods, systems, and computer storage media for providing action-recommendations (e.g., save action, collaboration action, and upload action) using cloud system operations in a cloud system. For example, action-recommendations are predicted using usage data of applications and communicated to a user (e.g., via a prompt) such that the user elects to perform or not perform the action-recommendation. In operation, usage data for an application and an action-recommendation profile are accessed. Determining that an action-recommendation should be generated is based on the usage data and the action-recommendation profile. The determination is further based on action scores and thresholds (e.g., save action, collaboration action, upload action). When the action scores meet certain thresholds, the action-recommendation is generated as a save-action-recommendation, a collaboration-action-recommendation, or an upload-action-recommendation.Type: ApplicationFiled: September 3, 2020Publication date: March 3, 2022Inventors: William N. SAEZ, Pramod Kumar GUPTA, Sidhika VARSHNEY, Jichen YANG, Joe A. HERZOG, Michael M. SANTOS, Ransom L. RICHARDSON, Yimeng LI, Yash Ravi PUNJABI, Tejprakash S. GILL, Tracy A. CHILDERS, Siqing CHEN, Rui HU, Jinnie PARK, Elijah John SCHERRER, Raymond C. LI, Juan Antonio KARMY TACLA, Priya Tushar NAKHRE, Anshul BASIA, David MILICEVIC
-
Patent number: 8165041Abstract: A collaboration system using peer-to-multi-peer distribution of messages representing changes to a shared workspace. Each peer determines a distribution mechanism for messages to each of the target peers sharing the workspace. The selected distribution mechanism may depend on capabilities of a home relay associated with a peer initiating a message. Further, messages to subsets of the target peers sharing the workspace may be distributed using a session for each subset on which each message is sent only one time. The subset of target peers associated with some of the sessions may be selected so that target peers for which communication attempts have failed are grouped in the same session. In some scenarios, the initiating peer may provide multiple routing paths for target peers in a session and the home relay server may appropriately forward the message to the target peers, using one of the routing paths.Type: GrantFiled: December 15, 2008Date of Patent: April 24, 2012Assignee: Microsoft CorporationInventors: Jim Jianping Wang, Robert A. Lomme, Jr., Ransom L. Richardson, Thomas D. Sanfilippo
-
Patent number: 8073905Abstract: In a peer-to-peer collaboration system, deltas containing data change commands are organized in a persistent data structure called a delta log. The delta log is organized into blocks, which are the largest division in the delta log. In turn, blocks contain groups, groups contain chains and chains contain deltas. Delta blocks are used to implement priority deltas that are used to limit the collection of data change commands that must be transferred. Within a block the deltas are organized by groups, each of which is a set of deltas organized into chains. The delta group in used to determine which deltas to purge. The chains are ordered by increasing creator ID of the endpoint that created the chain. Organizing the delta log in this fashion allows the log to be “walked” to detect convergence problems. To achieve causality-preservation, each delta has a list of dependencies representing other deltas that must be executed before the current delta can be executed.Type: GrantFiled: June 22, 2007Date of Patent: December 6, 2011Assignee: Microsoft CorporationInventors: Jack E. Ozzie, Raymond E. Ozzie, Ransom L. Richardson
-
Publication number: 20100150157Abstract: A collaboration system using peer-to-multi-peer distribution of messages representing changes to a shared workspace. Each peer determines a distribution mechanism for messages to each of the target peers sharing the workspace. The selected distribution mechanism may depend on capabilities of a home relay associated with a peer initiating a message. Further, messages to subsets of the target peers sharing the workspace may be distributed using a session for each subset on which each message is sent only one time. The subset of target peers associated with some of the sessions may be selected so that target peers for which communication attempts have failed are grouped in the same session. In some scenarios, the initiating peer may provide multiple routing paths for target peers in a session and the home relay server may appropriately forward the message to the target peers, using one of the routing paths.Type: ApplicationFiled: December 15, 2008Publication date: June 17, 2010Applicant: Microsoft CorporationInventors: Jim Jianping Wang, Robert A. Lomme, JR., Ransom L. Richardson, Thomas D. Sanfilippo
-
Patent number: 7340502Abstract: In a peer-to-peer collaboration system, deltas containing data change commands are organized in a persistent data structure called a delta log. The delta log is organized into blocks, which are the largest division in the delta log. In turn, blocks contain groups, groups contain chains and chains contain deltas. Delta blocks are used to implement priority deltas that are used to limit the collection of data change commands that must be transferred. Within a block the deltas are organized by groups, each of which is a set of deltas organized into chains. The delta group in used to determine which deltas to purge. The chains are ordered by increasing creator ID of the endpoint that created the chain. Organizing the delta log in this fashion allows the log to be “walked” to detect convergence problems. To achieve causality-preservation, each delta has a list of dependencies representing other deltas that must be executed before the current delta can be executed.Type: GrantFiled: October 24, 2002Date of Patent: March 4, 2008Assignee: Microsoft CorporationInventors: Ransom L. Richardson, Raymond E. Ozzie, Jack E. Ozzie
-
Patent number: 6941510Abstract: An in-memory storage manager represents XML-compliant documents as a collection of objects in memory. The storage manager allows real-time access to the objects by separate processes operating in different contexts. The data in the objects is stored in memory local to each process and the local memories are synchronized by means of a distributed memory system that stores the data in the same data region, but maps the data region to the address space of each process. Data corruption in the data region is prevented by a locking mechanism that prevents the processes from simultaneously modifying same data.Type: GrantFiled: June 6, 2000Date of Patent: September 6, 2005Assignee: Groove Networks, Inc.Inventors: Raymond E. Ozzie, Kenneth G. Moore, Ransom L. Richardson, Edward J. Fischer
-
Publication number: 20040083263Abstract: In a peer-to-peer collaboration system, deltas containing data change commands are organized in a persistent data structure called a delta log. The delta log is organized into blocks, which are the largest division in the delta log. In turn, blocks contain groups, groups contain chains and chains contain deltas. Delta blocks are used to implement priority deltas that are used to limit the collection of data change commands that must be transferred. Within a block the deltas are organized by groups, each of which is a set of deltas organized into chains. The delta group in used to determine which deltas to purge. The chains are ordered by increasing creator ID of the endpoint that created the chain. Organizing the delta log in this fashion allows the log to be “walked” to detect convergence problems. To achieve causality-preservation, each delta has a list of dependencies representing other deltas that must be executed before the current delta can be executed.Type: ApplicationFiled: October 24, 2002Publication date: April 29, 2004Applicant: Groove Networks, Inc.Inventors: Ransom L. Richardson, Raymond E. Ozzie, Jack E. Ozzie