Abstract: Techniques are provided for predicting and deleting idle remote sessions in a distributed file system. In an example, a server that serves a plurality of server message block (SMB) sessions analyzes with linear regression techniques those sessions to determine which sessions will become idle. In some examples, the server can then proactively close a SMB session that it predicts that an administrator would choose to close after a given idle period of time, or recommend to an administrator that the SMB session can be closed.

Abstract: An approximate count of a subset of records of a data set is obtained using one or more transformation functions. The subset comprises records which contain a first value of one input variable, a second value of another input variable, and a particular value of a target variable. Using the approximate count, an approximate correlation metric for a multidimensional feature and the target variable is obtained. Based on the correlation metric, the multidimensional feature is included in a candidate feature set to be used to train a machine learning model.

Abstract: A document-oriented database system generates an optimal query execution plan for database queries on an untyped data field included in a collection of documents. The system generates histograms for multiple types of data stored by the untyped data field and uses the histograms to assign costs to operators usable to execute the database query. The system generates the optimal query execution plan by selecting operators based on the assigned costs. In various embodiments, the untyped data field stores scalars, arrays, and objects.

Abstract: A system and method for dynamically determining a trust level of an end-to-end link of a computer database, including: in a preparation stage: capturing a first set of messages of an end-to-end link; compressing a skeleton of each message of the first set of messages to generate a construct of each message of the first set of messages, the skeleton includes the message without a value field; creating a characteristic histogram of the constructs of the first set of messages; and during an operation stage: capturing a second set of messages of the end-to-end link; compressing a skeleton of each message of the second set of messages to generate a construct of each of the second set of messages; creating a work histogram of the constructs of the second set of messages; and determining a trust level of the end-to-end link by comparing the work histogram with the characteristic histogram.

Abstract: According to an implementation, a method for digital information retrieval in a social media platform includes transmitting, over a network, information to render a timeline of social content for a user of a client application. The timeline of social content includes messages posted on the messaging platform by user accounts that are connected to a user account of the user in a connection graph. The method includes computing, using a machine-learning algorithm inputted with relevance signals, a relevance level between the user account of the user and a user account not linked to the user account of the user in the connection graph, and transmitting information about a profile of the user to a computing device associated with the user account not linked to the user account of the user in response to the relevance level being greater than a threshold level.

Abstract: A method, computer program product, and a system where a processor(s) obtains, from a data source, a list of objects at different layers of a computing system. The processor(s) generates exploration lists from the list (each exploration list with objects for a layer). The processor(s) identifies updated and new data at the layers associated with the objects on the list; the identified data comprises attributes for each layer. The processor(s) applies machine learning algorithm(s) to enrich the data by identifying dependencies between the attributes for each layer as influencers for one or more key performance indicators of the computing system. The processor(s) generates, from the enriched data, a hierarchy matrix. The processor(s) determines, based on the hierarchy matrix that an event associated with one or more computing resources of the computing system will influence a particular key performance indicator.

Abstract: Methods and apparatus that allow clients to specify custom network rules for their resource instances or network constructs in a provider network environment. Services and interfaces may be provided that allow a client to provide an executable module that implements custom rules for their resources, or alternatively to specify or select custom rules for their resources. The module may be installed on a host device, and may apply the custom rules to packets to and from the client's resources. Alternatively, the client-defined rules may be applied to packet flows according to the custom rules specified by the client and applied by a client rules service implemented on the provider network external to the host device or on a client resource instance on the host device. The custom network rules may, for example, extend or modify standard network rules for the client's resources on the host device.

Abstract: Techniques are described herein for early pruning of potential graph query results. Specifically, based on determining that property values of a path through graph data cannot affect results of a query, the path is pruned from a set of potential query solutions prior to fully exploring the path. Early solution pruning is performed on prunable queries that project prunable functions including MIN, MAX, SUM, and DISTINCT, the results of which are not tied to a number of paths explored for query execution. A database system implements early solution pruning for a prunable query based on intermediate results maintained for the query during query execution. Specifically, when a system determines that property values of a given potential solution path cannot affect the query results reflected in intermediate results maintained for the query, the path is discarded from the set of possible query solutions without further exploration of the path.

Abstract: A dataset management system organizes datasets using a data relationship graph that serves as a representation of datasets that are related to one another. For example, the data relationship graph includes nodes that each represent a dataset as well as edges that each connect two nodes. Each edge represents a similarity in characteristics of the similar datasets such as a similarity in the datasets' origin, organizational schema, lineage, or data values. When a user is to be provided recommended datasets, the dataset management system identifies candidate datasets by traversing the nodes and edges of the data relationship graph. Amongst these candidate datasets, the dataset management system evaluates users that have accessed the candidate datasets as well as the context in which the candidate datasets were accessed to identify recommended datasets for presentation to the user.

Abstract: The present disclosure describes a plurality of examples for deploying an application workload consisting of micro-service instances. The examples include federating a cluster from a plurality of computing nodes, defining a network overlay policy based on an application policy associated with the application workload, configuring one or more virtual networks in accordance with defined network overlay policy, each virtual network from one or more virtual networks connects one or more computing nodes from the two or more computing nodes of the cluster for providing layer 2 adjacency, and deploying the plurality of micro-service instances on the two or more computing nodes in accordance with the network overlay policy, for executing the application workload.

Abstract: Systems and methods are disclosed for determining an engagement level of a user interacting with an electronic program, comprising receiving or determining a decision node tree, each node in the decision node tree corresponding to a user decision point in the electronic program, determining a number of levels in the decision node tree, determining a user traversed count comprising a number of levels the user has traversed in the decision node tree, and determining the engagement level of the user with the electronic program based upon the user traversed count and the number of levels in the decision node tree.

Abstract: A memory device having a memory array and a controller operably coupled to the memory array is described. The controller is configured to store a sketch comprising d rows and w columns, wherein d and w are positive integers. Each row corresponds to a different one of d hash functions. The controller is also configured to detect an event associated with a memory address and to hash the memory address with each of the d hash functions to generate a corresponding d sketch locations. The controller is further configured, for each of the d sketch locations, to set a detection window flag, if it is not already set, and to adjust a stored sketch value by an amount corresponding to the event. The controller is also configured to evaluate a summary metric corresponding to the stored sketch value in each of the d sketch locations to determine if a threshold value has been reached.

Abstract: A memory device having a memory array with a plurality of memory addresses and a controller operably coupled to the memory array is described. The controller is configured to store a sketch comprising d rows and w columns, wherein d and w are positive integers. Each of the d rows corresponds to a different one of d hash functions. The controller is also configured to detect an event associated with a first memory address of the plurality of memory addresses and to hash the first memory address with each of the d hash functions to generate a corresponding d sketch locations. The controller is further configured to adjust, for each of the d sketch locations, a stored sketch value by a first amount corresponding to the event.

Abstract: In an edge data management methodology, first information is obtained pertaining to a given data set associated with a computing environment, wherein the computing environment comprises one or more edge computing networks and one or more centralized computing networks. Second information is obtained that is descriptive of processing functionalities available at the one or more edge computing networks. Third information is obtained that is descriptive of processing functionalities available at the one or more centralized computing networks. A processing location decision is generated for at least a portion of the given data set based on the obtained first, second and third information. Time cost information may also be obtained that is associated with processing of at least a portion of the given data set, and used to generate the processing location decision.

Abstract: According to this invention, there is provided a system and method for authenticating, tracking, and rewarding word of mouth propagation, said system and method comprising a system/module for accessing social graph index; a system/module for accumulating points and incentivizing word of mouth propaganda; a system/module for WOM membership platform (coalition Social Loyalty Platform); a system/module for WOM counts equity program; a system/module for brand assurance; and a system/module for creating certified and ranked registry of users.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media for creating custom system generated hyperlinks for predefined search queries at an external website. The system stores, in a data storage device, a set of custom URL templates, the custom URL templates defining required data fields to concatenate as parameters for a website link. The system obtains user information about a user where the information includes at least a first name and last name of the user. The system retrieves from the data storage device the set of custom URL templates. The system generates multiple website links based on the retrieved custom URL templates, where the generated website link includes a domain name of a website, and concatenated fields that are parameter specific to the website. The system then displays, via a user interface, a representation of the generated website links for selection by a user.

Abstract: A technology is provided for conflict resolution in a data proxy for a mutation. A mutation may be received at a data proxy from an application, and the data proxy is in a service provider environment. The mutation may be sent to be processed by a data store via a data access resolver. A conflict message may be received at the data proxy via the data access resolver for a conflict mutation at the data store for the mutation. The conflict may be resolved at the data proxy using a conflict resolution function in the data proxy.

Abstract: A computing resource service provider may store user data in a distributed data storage system. The distributed data storage system may contain one or more storage partitions configured to store based at least in part on prefixes of keys contained in a key-value store, where the size of the keys may vary. The one or more storage partitions may track requests to access data where the requests include a key such that the data may be located by the service provider based at least in part on the key. When a request is received a skew value associated with the key included in the request may be determined. The skew value may be determined based at least in part on the ratio of rate estimators, where the rate estimators represent a weighted average of the movement of the keys in a key space. If the skew value exceeds a threshold the service provider may take mitigating action.

Abstract: A system for providing a graph protocol for forming a decentralized and distributed graph database is disclosed. The system involves receiving, from a device, a bid request to generate a graph on a graph protocol network via the graph protocol. A plurality of masternodes in the system may transmit ask requests associated with providing storage and computation power to service the bid request. If the system determines that the requirements of the bid request match or correlate with the requirements of the ask request, the system may select any masternodes having matching or correlating ask requests to service the ask request. The system may then arrange the masternodes into a unique artificially-intelligent router of the graph protocol network. The system may then proceed to generate the graph on the graph protocol network by utilizing the masternodes of the router and may process any queries associated with the generated graph.

Abstract: Relationship management systems in accordance with embodiments of the invention are configured to provide systematic ways for a user to measure, and manage relationships in the user's social network. One embodiment of the invention includes a relationship management server system, and a database. In addition, the relationship management server system is configured to store a user account associated with a user in the database, store information concerning contacts associated with the user in the database, store event information associated with the user and at least one of the stored contacts in the database, store at least one objective in the database, score at least one relationship between the user and a contact based upon stored event information associated with the user and the contact to create a scored relationship graph, and generate a recommendation concerning an action based upon the stored objective and the scored relationship graph.

Abstract: Techniques for implementing a learning semantic representations of sparse entities using unsupervised embeddings are disclosed herein. In some embodiments, a computer system accesses corresponding profile data of users indicating at least one entity of a first facet type associated with the user, and generating a graph data structure comprising nodes and edges based on the accessed profile data, with each node corresponding to a different entity indicated by the accessed profile data, and each edge directly connecting a different pair of nodes and indicating a number of users whose profile data indicates both entities of the pair of nodes. The computer system generating a corresponding embedding vector for the entities based on the graph data structure using an unsupervised machine learning algorithm.

Abstract: For each vertex of a network graph that includes a set of vertices, a meta-property of the vertex is determined relative to other vertices of the set of vertices, a distance of the vertex from a user's viewpoint of a three-dimensional (3D) rendering of the network graph is determined, and a ranking figure is calculated as a function of the determined meta-property in combination with the determined distance. The set of vertices of the network graph is ranked as a function of the respective calculated ranking figures. Labels for a subset of the set of vertices are selectively displayed on a display as a function of the ranking.

Abstract: A computing device predicts occurrence of an event or classifies an object using distributed unlabeled data. A Laplacian matrix is computed using a kernel function. A predefined number of eigenvectors is selected from a decomposed Laplacian matrix to define a decomposition matrix. A gradient value is computed as a function of the defined decomposition matrix, a plurality of sparse coefficients, and a label matrix, a value of each coefficient of the plurality of sparse coefficients is updated based on the computed gradient value, and the computations are repeated until a convergence parameter value indicates the plurality of sparse coefficients have converged. A classification matrix is defined using the plurality of sparse coefficients to determine the target variable value for each observation vector of the plurality of unclassified observation vectors. The target variable value for each observation vector of the plurality of unclassified observation vectors is output.

Abstract: The disclosed technology includes systems and methods for identifying synthetic identities among a population of entity representations in an electronic database.

Abstract: In pattern discovery visual analytics, a patient data table (14) is generated that tabulates, for each patient, attribute values for a set of attributes. A positive or negative prediction is generated for each patient for a target value of a target attribute using a prediction pattern (20) of attribute values for w attributes (22). The prediction is positive if at least a threshold fraction (26) of the w attributes of the patient match the prediction pattern, is negative otherwise. Patients are grouped into a selected proportion of a confusion matrix (30) in accord with the positive or negative predictions and actual values of the target attribute T in the patient data table. A display component (4) displays a representation (42) of patient statistics for the selected proportion of the confusion matrix on a per-attribute basis for attributes of the w attributes. A patient cohort (44) is identified using the representation.

Abstract: A processing device generates an index node for an attribute in a graph database, wherein the index node is linked to a second node by a first edge having a first edge type. The processing device determines a first plurality of additional nodes that have the attribute. For each node of the first plurality of additional nodes, the processing device generates an edge linking the node to the index node, wherein the edge comprises a second edge type.

Abstract: Implementations of the present specification disclose method, apparatus, and device for processing graph data using a random walk-based process. The process is applicable to either a cluster of machines, a stand-alone machine, or both. In one aspect, the method includes: obtaining, by a cluster, data describing a graph that has nodes and edges between the nodes, wherein the cluster comprises (i) a server cluster that includes a plurality of server machines and (ii) a working machine cluster that includes a plurality of working machines; generating a two-dimensional array based on the data, wherein generating the two-dimensional array comprises generating, for each node included in the graph, a row comprising respective identifiers of adjacent nodes of the node; and generating, based on the two-dimensional array, a random sequence that represents a random walk processing of the data by the cluster.

Abstract: An online system determines a stability metric that indicates overlap between the set of entities associated with a particular entity when embeddings have been adjusted due to modifications in the input data of an embedding model. The online system generates a stability score for the embedding model by computing a statistic for one or more stability metrics. The online system determines a stability metric for a particular content provider by identifying a first cluster of content providers in a set of first embeddings, and a second cluster of content providers in a set of second embeddings. The second embeddings are generated after modifications have been made to input data. The online system determines the stability metric based on an overlap between the first cluster and the second cluster of content providers. The stability score can be an indicator of model performance that can be used to select embedding models.

Abstract: Certain aspects of the present disclosure provide techniques for interacting with a graph database structure. In one embodiment, a method includes receiving, at an application, information regarding a first entity; transmitting, to a graph database, a query regarding the first entity; receiving, at the application, query results based on one or more relationships between the first entity and other entities in the graph database; making, by the application, an inference based on the query results; modifying, by the application, a user interface of the application based on the inference by displaying at least one user interface element suggesting a selection of an application option; and receiving, by the application, a user selection of the suggested application option.

Abstract: A learning device sets each search range that is a part of a graph in which a plurality of nodes are connected by a plurality of edges, for each start node of one or more start nodes in the graph, on the basis of a set problem and relevance of an attribute of each of one or more nodes or edges connected to the each start node, generates an evaluation value of each of the one or more nodes and edges included in the each search range on the basis of a learning result by a learning model of the set problem, updates the one or more nodes and edges of the each search range on the basis of the evaluation value corresponding to the each search range and the relevance of the attribute corresponding to the each search range and the set problem, and performs a search.

Abstract: Systems and methods are provided for determining a request to validate data, the request specifying validation criteria; generating a graph for validating the data, the graph including at least one node-based connected component that evaluates the data, the node-based connected component being constructed to represent the validation criteria; validating the data using the generated graph, wherein the data being validated is evaluated by the node-based connected component; and providing information describing the validated data.

Abstract: Examples disclosed herein relate to visualization of associations among data records in a security information sharing platform. Some examples may enable creating, in the security information sharing platform, an association between a first data record comprising a security indicator, and a second data record. Some examples may further enable providing a visual representation of the first data record, the second data record, and the association, wherein the first data record represents a first node in the visual representation, the second data record represents a second node in the visual representation, and the association represents an edge that connects the first node and the second node.

Abstract: A system gathers information on important and influential people and builds a social graph. The system regularly sends news alert messages to users. This can help users nurture their relationship with persons they are connected to, by providing them with updates on news and other events that happen to persons they are connected to. The watch can be customized with a variety of options, such as including related entities, organizing news alerts with user data, and other options.

Abstract: A first entity and a second entity can be retrieved from a database and compared. The first entity and the second entity can each comprise at least one respective primary key, at least one respective attribute, and at least one pair of corresponding instances. One or more equivalent attributes can be identified, and, for each equivalent attribute, a set of attribute value differences can be compiled for each respective corresponding instance between the first entity and the second entity.

Abstract: A method, system, and computer program product for graph-based searching for one or more data streams is disclosed. A computer-implemented method comprises extracting a plurality of tuples from one or more data streams. The method further comprises generating a graph for the plurality of tuples in which a node represents a tuple of the plurality of tuples and an edge represents a correlation between the node and another node, and the edge is generated based at least partly on one or more predetermined queries for the one or more data streams. The method further comprises traversing the graph based on the one or more predetermined queries. Accordingly, embodiments of the present disclosure can improve the search speed by use of the graph-based searching for one or more data streams.

Abstract: Techniques for automated form understanding via layout-agnostic identification of keys and corresponding values are described. An embedding generator creates embeddings of pixels from an image including a representation of a form. The generated embeddings are similar for pixels within a same key-value unit, and far apart for pixels not in a same key-value unit. A weighted bipartite graph is constructed including a first set of nodes corresponding to keys of the form and a second set of nodes corresponding to values of the form. Weights for the edges are determined based on an analysis of distances between ones of the embeddings. The graph is partitioned according to a scheme to identify pairings between the first set of nodes and the second set of nodes that produces a minimum overall edge weight. The pairings indicate keys and values that are associated within the form.

Abstract: In one embodiment, an online social network accesses a place-entity cluster comprising a number of place-entity nodes corresponding to a particular place-entity having a geographic location. One of the place-entity nodes is identified as an initial canonical place-entity cluster connected to the other place-entity nodes by redirection edges. A cluster score is calculated for each place-entity node in the cluster, and nodes having a cluster score above a threshold is identified. One of the identified place-entity nodes is selected as a replacement canonical place-entity node. If the replacement node is different from the initial canonical node, then the place-entity cluster is updated by adding or removing at least one place-entity node from the cluster based on their respective cluster scores.

Abstract: Techniques herein minimally communicate between computers to repartition a graph. In embodiments, each computer receives a partition of edges and vertices of the graph. For each of its edges or vertices, each computer stores an intermediate representation into an edge table (ET) or vertex table. Different edges of a vertex may be loaded by different computers, which may cause a conflict. Each computer announces that a vertex resides on the computer to a respective tracking computer. Each tracking computer makes assignments of vertices to computers and publicizes those assignments. Each computer that loaded conflicted vertices transfers those vertices to computers of the respective assignments. Each computer stores a materialized representation of a partition based on: the ET and vertex table of the computer, and the vertices and edges that were transferred to the computer. Edges stored in the materialized representation are stored differently than edges stored in the ET.

Abstract: A method, system and computer-usable medium are disclosed for using travel-related cognitive graph vectors.

Abstract: Systems and techniques for an automatic graph-based detection of unlikely file possession are described herein. In an example, a system for detecting unauthorized file possession is adapted to generate a networked computing environment graph for files and the devices which store the files. The detection system may be further adapted to identify a file in question and a device in question that is in possession of the file in question. The detection system may be further adapted to generate a set of connection paths from the device in question to the file in question based upon the edges of the graph. The detection system may be further adapted to determine the device in question should not have possession of the file in question based on a set of metrics derived from the connection paths. The detection system may be further adapted to generate an alert based on the determination.

Abstract: A composer interface allows a user to provide input, such as text data, to the social networking system. To reduce the number of inputs for a user to provide to the social networking system, one or more phrase objects are presented to the user when providing input. A phrase object includes a group of objects that users have previously provided to the social networking system. The social networking system presents phrase objects to the user that match at least a portion of the received input. Context information associated with the input and associated with various phrase objects may be used to select the presented phrase objects. By selecting a presented phrase object, the user includes the selected phrase object in the input.

Abstract: Particular embodiments may locally store, at a client device of a first user, information associated with a plurality of nodes and a plurality of edges of a social graph received from a social-networking system. The first user may be associated with a first node of the social graph. The client device may detect that the first user is entering an input term. The client device may provide predictive typeahead results as the first user enters the input term. The predictive typeahead results may be based on the input term. Each predictive typeahead result may correspond to one of the nodes of the social graph stored locally on the client device. Each predictive typeahead result may include at least one image associated with the corresponding node.

Abstract: In selected embodiments a recommendation generator builds a network of interrelationships between venues, reviewers and users based on attributes and reviewer and user reviews of the venues. Each interrelationship or link may be positive or negative and may accumulate with other links (or anti-links) to provide nodal links the strength of which are based on commonality of attributes among the linked nodes and/or common preferences that one node, such as a reviewer, expresses for other nodes, such as venues. The links may be first order (based on a direct relationship between, for instance, a reviewer and a venue) or higher order (based on, for instance, the fact that two venue are both liked by a given reviewer). The recommendation engine in certain embodiments determines recommended venues based on user attributes and venue preferences by aggregating the link matrices and determining the venues which are most strongly coupled to the user.

Abstract: The subject matter described herein relates to database middleware for enabling graph processing. A middleware between the graph data and underlying relational or SQL database is proposed. The local properties and topology information of nodes in the graph can be stored in a single node table in the database, thereby eliminating the need for a physical junction table. The middleware may efficiently translate graph queries into SQL queries over related tables. In some examples, the middleware may optimize the translated queries using the topology knowledge which is oblivious to the database query engine.

Abstract: A computing device includes program instructions to select, based on indicia of interest for media content for each of a plurality of users, a first user and second user to engage in an interaction related to a media content item. The computing device further includes programming to select a topic related to the media content item for the interaction and initiate the interaction between the first and second user based on the topic.

Abstract: A method for capturing evolving data, comprising observing a data graph, identifying a first entity within the graph, defining a first property of the first entity, and identifying a first data value corresponding to the property and the entity. The method further comprises associating a second entity with the first entity at first data value, and forming a dimension of the first entity with associations to other entities within the graph for different data values of the first property. Identifying the first entity comprises identifying a property of the first entity representing a dimension but the property does not relate to other entities through the dimension. Defining the first property comprises identifying an attribute of the first entity that will not change; establishing the attribute as the first property.

Abstract: In partitioning a graph database, a plurality of vertices of the graph database is assigned to a plurality of nodes. The vertices of the graph database are connected by edges that indicate relationships between the vertices. One or more abstract paths between one or more vertices of the graph database are identified. Each abstract path is weighted based on a likelihood of a database query following the abstract path. The vertices of the graph database are assigned to the nodes according to the abstract paths between the vertices.

Abstract: Embodiments of the present invention is a technique of searching for relevant nodes. This technique may include: in response to selection of a first node, displaying, as first relevant nodes, nodes having a first relevance of at least a predetermined value among nodes connected from the first node by two hops; and, in response to selection of at least one of the first relevant nodes, displaying the selected first relevant node as a second node involving the first node. This technique may further include displaying, as second relevant nodes, nodes having a second relevance of at least a predetermined value among nodes connected from the second node by two hops.

Abstract: The present disclosure relates generally to systems and methods of managing normally independent or unassociated business artifacts using an integrated business artifact management system (IBAMS) to deliver a cohesive, linked, and traceable network of related and integrated artifacts that supports improved business knowledge and impact analysis. A disclosed IBAMS includes a collection of integrated business artifacts stored in a memory of the IBAMS and a plurality of links, each associated with a respective data island of a plurality of data islands. Each link includes a set of instructions that, when executed by a processor of the IBAMS, cause the processor to: receive business artifacts from the respective data island; generate representations that are abstractions of the business artifacts received from the respective data island; and store and integrate the representations in the collection of integrated business artifacts.

Abstract: A method for data inspection includes upon receiving an out-of-order part of a sequence of parts, checking the out-of-order part for matching in forward and backward direction of the sequence; temporarily saving a forward state and a backward state of said both checkings; and upon receiving an in-order part of the sequence, checking the in-order part for matching in the forward direction of the sequence and if the in-order packet is within a gap between the first part and the last part of the sequence the in-order part is also checked for matching in backward direction of the sequence. The backward state or the forward and backward state are updated or temporarily saved.