Abstract: Methods and systems are provided for displaying a context-sensitive overlay in conjunction with a calendar displayed by a calendar application. The calendar application can determine contextual information from the calendar that indicates context for the calendar. The contextual information comprises calendar data or third-party data linked to calendar items that are displayed in the calendar. The calendar application can automatically query a backend system to dynamically determine, based on the contextual information, at least one context-sensitive overlay that is pertinent to the calendar in view of the contextual information. The context-sensitive overlay provides supplemental information that is directly associated with the contextual information from the calendar. The context-sensitive overlay can be displayed in conjunction with the calendar so that it is superimposed on at least a portion of the calendar.

Abstract: In an example, a computing system may include a thread record provider. In some examples, the computing system may incrementally change a first data structure as threads are established and completed, wherein the first data structure comprises first information of currently active threads; incrementally change a second different data structure responsive to a portion of changes of the first data structure, wherein the second data structure correlates second information that is different than the first information to the currently active threads; identifying a plurality of times; and at each selected time, synchronously extracting content from the first and second data structures for a selected thread and concatenating the extracted content to form a record for the selected thread.

Abstract: Methods and systems are provided for creating a calendar event in a calendar application to provide at least some attendees with access to supplemental information related to the calendar event. The calendar application is configurable to allow sharing of supplemental information between users who are affiliated with a first organization that utilizes the calendar application in a cloud computing system, and other users who are affiliated with a second organization. When a user affiliated with the first organization creates create a calendar event that includes a list of attendees that includes second user-attendee(s) affiliated with a second organization that utilizes the calendar application, the user can enable sharing of the supplemental information with any of the second user-attendees included in the list of attendees so that they are allowed to view the supplemental information when viewing the calendar event.

Abstract: The technology disclosed relates to a self-service customization protocol for a single page website that implements a support component add-in to the CRM website. The self-service customization protocol may be configured to customize at least one page element of the customized component, wherein the page element is configured to allow a website visitor to interface with a service provided via the website, which may be edited by customers without having to perform coding. In some embodiments, code may be generated for the customized component via an engine.

Abstract: Systems, methods, and computer-readable media for identifying and managing memory allocation for one or more threads are described. A computer system may detect that a threshold memory utilization has been met, and may determine an aggregate memory allocation for a thread. The aggregate memory allocation may be a difference between a first memory allocation for the thread at a first time that the threshold memory utilization was met and a second memory allocation for the thread at a second time that the threshold memory utilization was met. The computer device may provide an indication that the thread has met or exceeded a threshold memory allocation when the aggregate memory allocation is greater than or equal to the threshold memory allocation. The computer device may disable the thread when the aggregate memory allocation is greater than or equal to the threshold memory allocation. Other embodiments may be described and/or claimed.

Abstract: In an example, a computing system may include a thread record provider. In some examples, the computing system may incrementally change a first data structure as threads are established and completed, wherein the first data structure comprises first information of currently active threads; incrementally change a second different data structure responsive to a portion of changes of the first data structure, wherein the second data structure correlates second information that is different than the first information to the currently active threads; and synchronously extract content from the first and second data structures for a selected thread at a selected instant and concatenate the extracted content to form a record for the selected thread.

Abstract: Disclosed are examples of systems, apparatus, methods and computer program products for generating or updating a graph of nodes and edges using logs, where the graph can be used for database searching. In some implementations, a server can identify logs. Based on the identified logs, log nodes can be generated or updated. Log nodes can be sorted in a first ordered list according to each log node's key data. Log node pairs can be determined from the log nodes in the first list. The log node pairs can be aggregated and sorted into a second ordered list. A graph of nodes and edges can be generated or updated according to the relative importances of the log node pairs in the second ordered list.

Abstract: The technology disclosed relates to systems and methods for providing a CSS parser to improve the maintainability of code that displays data to users. The technology disclosed also improves the performance and consistency of the code that delivers a user's experience.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for managing access to data based on information associated with a physical location of a user. These mechanisms and methods for managing access to systems, products, or data based on information associated with a physical location of a user can enable improved data management efficiency, enhanced data management accuracy, decreased data management costs, decreased licensing costs, increased security, additional marketing opportunities, etc.

Abstract: A method and system for adding contact information to a user account in a database. A registered user of the database presents a query having search criteria. The search criteria identifies records that have contact information including an address located within a defined distance of a specified location, such as the user's current location. Instructions are transmitted to the client device for rendering a map of the specified location and a representation of the search results on a display of the user's device. If a record is not owned by or associated with the user, the contact information is obscured on the display. A widget is configured on the display of obscured records that enables the user to purchase the record. Upon selection of the widget, a purchase transaction is executed, and the identified record is added to the user account.

Abstract: The technology disclosed relates to thwarting attempts in between software releases to take advantage of security holes in web applications. A virtual patch is a data object comprising an identifier that indicates a relevant local context for the patch and may be created while the application is running. One or more conditions included in the patch are evaluated using data from a service request or from the local context. A patch directive specifies an action to perform when the one or more conditions are satisfied. A virtual patch may be applied to the running application without requiring replacing the application code. Responsive to a request for a web service, a web application may execute code in multiple distinct local contexts such as session management, authorization, and application-specific business logic. The code for each local context may independently retrieve a set of virtual patches relevant to its particular local context.

Abstract: Methods and systems are provided for assigning computational problems to be solved by compute nodes that have artificial intelligence problem-solving capability. A method includes receiving a computational problem to be solved. Node-related processing attributes of the compute nodes are used to determine which one or more of the compute nodes are capable of solving the computational problem. One or more of the compute nodes are selected to handle the computational problem based upon the determination.

Abstract: The technology disclosed proposes using a combination of computationally cheap, less-accurate bag of words (BoW) model and computationally expensive, more-accurate long short-term memory (LSTM) model to perform natural processing tasks such as sentiment analysis. The use of cheap, less-accurate BoW model is referred to herein as “skimming”. The use of expensive, more-accurate LSTM model is referred to herein as “reading”. The technology disclosed presents a probability-based guider (PBG). PBG combines the use of BoW model and the LSTM model. PBG uses a probability thresholding strategy to determine, based on the results of the BoW model, whether to invoke the LSTM model for reliably classifying a sentence as positive or negative. The technology disclosed also presents a deep neural network-based decision network (DDN) that is trained to learn the relationship between the BoW model and the LSTM model and to invoke only one of the two models.

Abstract: A computer-implemented database system as described herein includes a memory device and one or more processors coupled with the memory device. The one or more processors are configurable to create and maintain a folder structure for a user interface (UI) environment, wherein the folder structure includes: a feature folder that defines an application feature supported by the UI environment, the application feature having a UI component associated therewith, and the UI component having a UI text string associated therewith; a component folder located in the feature folder, the component folder having computer readable files that define the UI component; and a text string file located in the component folder, wherein the text string file defines content of the UI text string.

Abstract: A system and related processing methodologies for managing text strings in a graphical user interface are disclosed here. The system is a computer-based system having a memory device and one or more processors configured to execute instructions stored on the memory device to perform a method that provides a user interface (UI) environment having a plurality of features, each of the plurality of features comprising at least one UI component. The method also creates associations between UI text strings, UI components, and features of the UI environment, generates different UI text string identifiers for each unique association of UI text string, UI component, and feature, and maintains, in the memory device, the created associations and the generated UI text string identifiers.

Abstract: The technology disclosed proposes using a combination of computationally cheap, less-accurate bag of words (BoW) model and computationally expensive, more-accurate long short-term memory (LSTM) model to perform natural processing tasks such as sentiment analysis. The use of cheap, less-accurate BoW model is referred to herein as “skimming”. The use of expensive, more-accurate LSTM model is referred to herein as “reading”. The technology disclosed presents a probability-based guider (PBG). PBG combines the use of BoW model and the LSTM model. PBG uses a probability thresholding strategy to determine, based on the results of the BoW model, whether to invoke the LSTM model for reliably classifying a sentence as positive or negative. The technology disclosed also presents a deep neural network-based decision network (DDN) that is trained to learn the relationship between the BoW model and the LSTM model and to invoke only one of the two models.

Abstract: A method for presenting a visual implementation of data by a computing device comprising at least one processor and a system memory element is provided. The method executes a software application, by the at least one processor of the computing device; detects an operation performed by the software application during execution; monitors performance of the software application, by: identifying successful execution of the operation; and identifying timing data indicating a length of time for completion of the operation during execution of the software application; and presents visual feedback of the performance during execution of the software application, via a display element of the computing device, wherein the visual feedback comprises a first set of graphical elements indicating the successful execution and the timing data, and wherein the first set of graphical elements is presented onscreen with a concurrent presentation of the software application.

Abstract: An in-browser proxy enables an application in a frame to make a cross domain request. The proxy executes within the browser, which has a first domain. The browser provides a frame in which a client application executes, which has a second domain. The request from the client application is a request for data access to the external domain. The proxy identifies a registration of the client application, and forwards the request to the external domain. The proxy receives a response to the request and provides the response back to the client application within the frame.

Abstract: Distributed version control systems, methods, and computer-readable media are described. A computer system may implement a version control blockchain system by obtaining source code and/or an artifact associated with source code. The computer system may serialize the source code and/or the artifact to obtain serialized data, and may encipher the serialized data to obtain a current block identifier (cb_id). The computer system may generate a block to include the cb_id, and may add the generated block to the version control blockchain upon validation of the block. Other embodiments may be described and/or claimed.

Abstract: A method of providing feed information is provided. The method comprises calculating an affinity score for each information source that provides updates to an information feed for a first user of a social networking system wherein the affinity score for each information source is calculated based on interaction factors between the first user and the information source. The method further comprises assigning a transparency value to each information source by converting the affinity score to a transparency value, generating the information feed of the social networking system for the first user wherein the information feed includes updates from the information sources, sending the information feed and the transparency value for each information source to a web browser operated by the first user, and instructing the web browser to display each update at a transparency level that corresponds to the transparency value assigned to the information source that provided the update.