Abstract: A computer-implemented method is disclosed. The method includes: receiving video data for a live video stream; identifying a product that is displayed in a video frame of the live video stream; obtaining identifying information for a viewer of the live video stream; determining a product variant preference for the viewer; obtaining a graphical representation of the product variant; and providing modified video data of the live video stream based on presenting the graphical representation of the product variant as overlay content for the live video stream. Related apparatuses and computer-readable media are also disclosed.

Abstract: Disclosed are systems and methods for facilitating gift purchases by a buyer on an e-commerce platform when the buyer does not know a recipient's destination address without revealing the recipient's destination address to the buyer. A computer receives information for a recipient of an online order associated with a merchant for delivery to the recipient. The computer queries a database using the recipient information to obtain the recipient's destination address. The computer generates a token corresponding to the destination address, where the token includes an obfuscated representation of the destination address. The computer transmits the token to a client device for submission of the online order for delivery to the recipient, where the token is adapted to satisfy a requirement to provide the destination address for the online order. When the computer receives the token from a merchant device, the computer presents the destination address to the merchant device.

Abstract: A computer-implemented method identifies strings of data from a database. One or more processors receive data as an input string. The processor(s) generate a first binary code using a binary locality sensitive hashing of k-grams in the input string, where the binary locality sensitive hashing on the k-grams in the input string is derived from a first set of bi-grams in the input string, a second set of bi-grams in the input string, and a quantity of intersecting bi-grams from the first set of bi-grams and the second set of bi-grams. In response to receiving a search request for a particular string, the processor(s) generate a second binary code using a binary locality sensitive hashing on the particular string, and search a database in a query process. The processor(s) then rank and return a set of similar strings found in the database.

Abstract: Mechanisms are provided for accessing security vulnerability issue information. The mechanisms monitor security analyst interactions with security vulnerability issues via the security management system to generate analyst interaction log data, and generate one or more security analyst models corresponding to one or more security analysts by performing a machine learning operation on the analyst interaction log data. The mechanisms generate an analyst-issue model based on the one or more security vulnerability issue models and the one or more security analyst models, and generate an issue recommendation for a security analyst based on the analyst-issue model.

Abstract: A method for ambiguity resolution in retrieving security information. A unified representation model utilizing the security information mined from a group of sources is generated by a computer system, wherein the unified representation model represents terms in the security information using vectors that describe locations in space for the terms. Distances between the terms indicate correlations between the terms, and the terms are for security concepts in the security information. The computer system represents the security concepts utilizing a group of weighted graphs that identifies semantic-relatedness between the terms utilizing the vectors in the unified representation model, wherein the group of weighted graphs enables interpreting queries with reduced ambiguity. The computer system interprets a seed query utilizing the group of weighted graphs. The computer system retrieves a portion of the security information utilizing the seed query interpreted utilizing the group of weighted graphs.

Abstract: A method prevents source code from using an unsecure application program interface (API) due to a change to the source code. One or more processors and/or a user identify changes in source code. The processor(s) and/or user associate the changed code with affected APIs that are used by the changed code, and identify which commands are utilized by the changed code. The processor(s) and/or user determine that at least one command utilized by the changed code causes the source code to use an unsecure API. In response to determining that the at least one command utilized by the changed code causes the source code to use the unsecure API, the processor(s) and/or user modify the changed code to prevent the source code from using the unsecure API.

Abstract: Mechanisms are provided for accessing security vulnerability issue information. The mechanisms monitor security analyst interactions with security vulnerability issues via the security management system to generate analyst interaction log data, and generate one or more security analyst models corresponding to one or more security analysts by performing a machine learning operation on the analyst interaction log data. The mechanisms generate an analyst-issue model based on the one or more security vulnerability issue models and the one or more security analyst models, and generate an issue recommendation for a security analyst based on the analyst-issue model.

Abstract: A computer-implemented method identifies strings of data from a database. One or more processors receive data as an input string. The processor(s) generate a first binary code using a binary locality sensitive hashing of k-grams in the input string, where the binary locality sensitive hashing on the k-grams in the input string is derived from a first set of bi-grams in the input string, a second set of bi-grams in the input string, and a quantity of intersecting bi-grams from the first set of bi-grams and the second set of bi-grams. In response to receiving a search request for a particular string, the processor(s) generate a second binary code using a binary locality sensitive hashing on the particular string, and search a database in a query process. The processor(s) then rank and return a set of similar strings found in the database.

Abstract: A method selectively disables commands that are utilized by changed code. One or more processors and/or a user identify changes in a source code that result in changed code in the source code. The processor(s) and/or user associate the changed code with affected application program interfaces (APIs) that are used by the changed code. The processor(s) and/or user identify which commands are utilized by the changed code, and selectively disable the commands that are utilized by the changed code while leaving all other commands enabled in the affected APIs.

Abstract: A computer-implemented method searches a database for a particular string. One or more processors receive data as an input string, and then identify multiple k-grams in, unique characters in, and a length of the input string. The one or more processors perform binary locality sensitive hashing on the k-grams, the unique characters, and the length for the input string, and then sum the binary locality sensitive hashings to create a first addition vector, which is used to generate a first binary vector. The same process is performed on a particular string being requested to generate a second binary vector. The one or more processors then search the database for the particular string that was requested using the second binary vector in a large scale hamming distance query process that determines a hamming distance between the first binary code and the second binary code.

Abstract: A computer-implemented method improves the security of a system. One or more processors identify changes in source code, resulting in changed code in the source code. The one or more processors associate the changed code with affected application program interfaces (APIs) that are used by the changed code, and then manipulate parameters within the affected APIs based on the changes in the source code. The one or more processors execute a dynamic security scan on only the affected APIs using the manipulated parameters, in order to identify security vulnerabilities in only the affected APIs. The one or more processors then modify the source code to remove the security vulnerabilities in only the affected APIs, thus improving the security of the system on which the source code is running.

Abstract: A method for ambiguity resolution in retrieving security information. A unified representation model utilizing the security information mined from a group of sources is generated by a computer system, wherein the unified representation model represents terms in the security information using vectors that describe locations in space for the terms. Distances between the terms indicate correlations between the terms, and the terms are for security concepts in the security information. The computer system represents the security concepts utilizing a group of weighted graphs that identifies semantic-relatedness between the terms utilizing the vectors in the unified representation model, wherein the group of weighted graphs enables interpreting queries with reduced ambiguity. The computer system interprets a seed query utilizing the group of weighted graphs. The computer system retrieves a portion of the security information utilizing the seed query interpreted utilizing the group of weighted graphs.

Abstract: A computer-implemented method searches a database for a particular string. One or more processors receive data as an input string, and then identify multiple k-grams in, unique characters in, and a length of the input string. The one or more processors perform binary locality sensitive hashing on the k-grams, the unique characters, and the length for the input string, and then sum the binary locality sensitive hashings to create a first addition vector, which is used to generate a first binary vector. The same process is performed on a particular string being requested to generate a second binary vector. The one or more processors then search the database for the particular string that was requested using the second binary vector in a large scale hamming distance query process that determines a hamming distance between the first binary code and the second binary code.

Abstract: A computer-implemented method improves the security of a system. One or more processors identify changes in source code, resulting in changed code in the source code. The one or more processors associate the changed code with affected application program interfaces (APIs) that are used by the changed code, and then manipulate parameters within the affected APIs based on the changes in the source code. The one or more processors execute a dynamic security scan on only the affected APIs using the manipulated parameters, in order to identify security vulnerabilities in only the affected APIs. The one or more processors then modify the source code to remove the security vulnerabilities in only the affected APIs, thus improving the security of the system on which the source code is running.