Method and apparatus for stress management in a searchable data service. The searchable data service may provide a searchable index to a backend data store, and an interface to build and query the searchable index, that enables client applications to search for and retrieve locators for stored entities in the backend data store. Embodiments of the searchable data service may implement a distributed stress management mechanism that may provide functionality including, but not limited to, the automated monitoring of critical resources, analysis of resource usage, and decisions on and performance of actions to keep resource usage within comfort zones. In one embodiment, in response to usage of a particular resource being detected as out of the comfort zone on a node, an action may be performed to transfer at least part of the resource usage for the local resource to another node that provides a similar resource.

Transaction-enabled systems and methods for royalty apportionment and stacking are disclosed. An example system may include a plurality of royalty generating elements (a royalty stack) each related to a corresponding one or more of a plurality of intellectual property (IP) assets (an aggregate stack of IP). The system may further include a royalty apportionment wrapper to interpret IP licensing terms and apportion royalties to a plurality of owning entities corresponding to the aggregate stack of IP in response to the IP licensing terms and a smart contract wrapper. The smart contract wrapper is configured to access a distributed ledger, interpret an IP description value and IP addition request, to add an IP asset to the aggregate stack of IP, and to adjust the royalty stack.

Transaction-enabled systems and methods for royalty apportionment and stacking are disclosed. An example system may include a plurality of royalty generating elements (a royalty stack) each related to a corresponding one or more of a plurality of intellectual property (IP) assets (an aggregate stack of IP). The system may further include a royalty apportionment wrapper to interpret IP licensing terms and apportion royalties to a plurality of owning entities corresponding to the aggregate stack of IP in response to the IP licensing terms and a smart contract wrapper. The smart contract wrapper is configured to access a distributed ledger, interpret an IP description value and IP addition request, to add an IP asset to the aggregate stack of IP, and to adjust the royalty stack.

A method is provided. The method includes one or more of obtaining client device data including a plurality of facts from a client device, limiting the client device data according to selection criteria, comparing the limited client device data to categorized historical data, determining one or more closest matches between the limited client device data and the categorized historical data, selecting, on the client device, content of interest from the one or more closest matches, and incorporating the content of interest into the categorized historical data. Each fact includes an entity, an observation, and an object.

A method is provided. The method includes one or more of obtaining client device data including a plurality of facts from a client device, limiting the client device data according to selection criteria, comparing the limited client device data to categorized historical data, determining one or more closest matches between the limited client device data and the categorized historical data, selecting, on the client device, content of interest from the one or more closest matches, and incorporating the content of interest into the categorized historical data. Each fact includes an entity, an observation, and an object.

A system and method are presented that improves search results based on skills associated with individuals. The system monitors an individual's contributions to a third-party forum and associates the contributions with skills. The system also monitors learnings received by the individual. Assignments are made to associate the individual with the skills and to assign points. Users request a search based on search skill parameters, and the system uses forum-based data and non-forum data to identify and sort individuals. Skill and point assignments are made temporarily, and assignments are deleted upon the expiration of a time-to-live clock. Save events can permanently save data. Local forum data is also stored and can be used to restore deleted assignments. Points are used to improve avatars used when interacting with searching users.

A system and method are presented that improves search results based on skills associated with individuals. The system monitors an individual's contributions to a third-party forum and associates the contributions with skills. The system also monitors learnings received by the individual. Assignments are made to associate the individual with the skills and to assign points. Users request a search based on search skill parameters, and the system uses forum-based data and non-forum data to identify and sort individuals. Skill and point assignments are made temporarily, and assignments are deleted upon the expiration of a time-to-live clock. Save events can permanently save data. Local forum data is also stored and can be used to restore deleted assignments. Points are used to improve avatars used when interacting with searching users.

A system and method that given one or more input molecules, produces a contextualized summary of characteristics of related target molecules, e.g., proteins. Using a knowledge graph which is populated with all known molecules, input molecules are analyzed according to various similarity indexes which relate the input molecules to target proteins or other biological entities. The knowledge graph may also comprise scientific literature, governmental data (FDA clinical phase data), private research endeavors (general assays, etc.), and other related biological data. The summary produced may comprise target proteins that satisfy certain biological properties, general assay results (ADMET characteristics), related diseases, off-target molecule interactions (non-targeted molecules involved in a specific pathway or cascade), market opportunities, patents, experiments, and new hypothesis.

A system and method that given one or more input molecules, produces a contextualized summary of characteristics of related target molecules, e.g., proteins. Using a knowledge graph which is populated with all known molecules, input molecules are analyzed according to various similarity indexes which relate the input molecules to target proteins or other biological entities. The knowledge graph may also comprise scientific literature, governmental data (FDA clinical phase data), private research endeavors (general assays, etc.), and other related biological data. The summary produced may comprise target proteins that satisfy certain biological properties, general assay results (ADMET characteristics), related diseases, off-target molecule interactions (non-targeted molecules involved in a specific pathway or cascade), market opportunities, patents, experiments, and new hypothesis.

The present disclosure is related to Virtual Desktop Infrastructure (VDI) that discloses a method and system for performing dynamic patch management in VDI platform. A patch managing system retrieves operational data and vulnerability remediation data related to IT services and infrastructures of the VDI platform from first and second data sources. Thereafter, the patch managing system detects gap in patching level based on operational data, vulnerability remediation data and corresponding industrial standard, and rolls out patches based on detected gap in patching level. Further, a patch prediction score that facilitates in identifying a probability of rolling back the patches rolled out for patching IT services and infrastructures of VDI platform is determined based on prediction parameters. A plan is generated based on the patch prediction score and executed to optimally patch the patches to IT services and infrastructures of the VDI platform, based on patching rules.