Abstract: Techniques and systems can receive a query identifying a name linked to performance data of a computer system and a location of the performance data. The name linked to the performance data of the computer system and the location of the performance data can be communicated to a first computer-implemented system. The first computer-implemented system can include identifying data derived from the name and the location of the performance data. Identifying data derived from the name and the location of the performance data can be received from the first computer-implemented system. The identifying data derived from the name and the location of the performance data can be used to retrieve the performance data. The performance data can be hosted by a second computer-implemented system that is different than the first computer-implemented system.

Abstract: A popularity estimation device includes: an acquisition unit configured to acquire a first map image including a first particular point and to acquire a plurality of second map images including a second particular point which is a particular point; a generation unit configured to generate a first feature vector and a second feature vector by inputting the first map image and the second map images to a geographical feature generation model with a map image as an input and with a feature vector indicating geographical features of the map image as an output; a score calculating unit configured to calculate a popularity score of the first particular point from a popularity score of the second particular point based on a degree of similarity between the first feature vector and the second feature vector; and an output unit configured to output the popularity score of the first particular point.

Abstract: The present disclosure relates to maintaining an electronic activity derived member node network. Exemplary implementations may: generate a plurality of node profiles; generate a node graph generated from the plurality of node profiles; identify a second electronic activity identifying a pair of electronic accounts; identify using the node graph, a pair of participant node profiles corresponding to the pair of electronic accounts identified by the second electronic activity; identify, using the node graph, an edge between a pair of nodes corresponding to the pair of participant node profiles; determine a relevancy score for the second electronic activity corresponding to the pair of the participant node profiles based on context of the second electronic activity; and update the node graph by modifying the connection corresponding to the edge between the pair of participant node profiles based on the relevancy score determined for the second electronic activity.

Abstract: The present disclosure provides techniques for detecting and correcting outliers in categories of transactions. One example method includes receiving electronic transaction data indicative of one or more current transactions, wherein the one or more current transactions are associated with a user of a software application, identifying, for each transaction of the one or more transactions, a category using a first machine learning model, computing a distribution for each category of a plurality of categories of the user, identifying, a particular category of the user as an anomalous category, based on the distribution for the particular category of the user and corresponding distributions for the particular category of other users, and updating a category assigned to one or more transactions such that a delta between a value relating to the anomalous category of the user and corresponding values relating to the particular category of the other users is reduced.

Abstract: The present disclosure relates to a method for building a knowledge graph, an electronic apparatus and a non-transitory computer-readable storage medium. The method for building a knowledge graph includes following steps: acquiring source data related to preset keywords according to the preset keywords; cleaning the source data according to a preset data dictionary and an error information table; extracting entities, attribute information of the entities and relationship information among the entities from the cleaned source data according to the preset data dictionary and an entity relationship; fusing the entities, the attribute information of the entities and the relationship information among the entities to obtain data triples, and taking the data triples as a built knowledge graph; and storing the knowledge graph into a preset graph database.

Abstract: Systems and methods for communicating, storing, and/or analyzing data that may include genomic data are described herein. In various embodiments, unaligned genomic sequence read data and/or portions thereof may be stored and/or communicated as a list of variants relative to a particular reference associated with a reference motif identified in the genomic sequence read data. In further embodiments, quality score information associated with a genomic dataset may be analyzed and/or communicated as quality score parameter information. Additional embodiments may facilitate relatively efficient analysis of unaligned genomic sequence read data using metadata associated with reference motifs identified in the unaligned genomic sequence read data.

Abstract: Techniques for providing a dynamic and modifiable sidebar of a user interface of a communication platform are discussed herein. The sidebar includes affordances of virtual spaces that are associated with a particular user account, such that a virtual space is accessible via a respective affordance. In examples, a section of the sidebar can be modifiable by the user, such as to enable the user to personalize the sidebar. The virtual spaces can include collaborative documents that are created and managed by the communication platform. In examples, the communication platform receives interaction data associated with an interaction of a first user with a collaborative document and identifies a second user associated with the collaborative document. Based in part on the interaction data, the communication platform causes a notification to be presented in a sidebar of user interface associated with the second user, to inform the second user of the update.

Abstract: A method for ranking documents in search results includes defining a first training data set, the first training data set including, for each of a plurality of user queries, information respective of a document selected by a user from results responsive to the query and information respective of one or more documents within an observation window after the selected document in the results, and defining a second training data set, the second training data set including, for each of the plurality of user queries, information respective of the selected document. The method further includes training a first machine learning model with the first training data set, training a second machine learning model with the second training data set, and ranking documents of a further search result set according to the output of the first machine learning model and the output of the second machine learning model.

Abstract: An AI based moderator system for an electronic conference. The moderator scores users based on ratings and diversity, and attempts to keep a high rating person talking while maintaining diversity.

Abstract: There are provided a device and a method for generating timed media data, the timed media data comprising samples, the method comprising: obtaining samples of the time media data; creating tracks each comprising at least one of the obtained samples; and generating a presentation file comprising descriptive metadata associated with the created tracks, wherein the descriptive metadata comprise at least one track group box describing at least one group of created tracks, all the tracks belonging to a same group sharing properties, wherein a list of existing groups of tracks is declared in one single location in the presentation file, and wherein the properties shared by the tracks of a group of the list are declared at the same single location in the presentation file.

Abstract: Provided herein are system, apparatus, device, method, and/or computer program product embodiments, and/or combinations and sub-combinations thereof, for classifying a document using image analysis. In an embodiment, a server may train and implement a deep learning model to classify documents using image representations of the documents.

Abstract: Methods and systems for finding and ranking video sequences that contain tactical sequences (e.g., an uninterrupted portion of a sporting event) that are similar to tactical event content in a target video sequence, such as those occurring in sports, include learning and labelling (e.g., through use of metadata and the like) tactically significant sequences in a plurality of video segments, including a plurality of such tactically significant sequences in a single video segment.

Abstract: A computer system for extracting structured data from unstructured or semi-structured text in an electronic document, the system comprising: a graphical user interface configured to present to a user a graphical view of a document for use in training multiple data extraction models for the document, each data extraction model associated with a user defined question; a user input component configured to enable the user to highlight portions of the document; the system configured to present in association with each highlighted portion an interactive user entry object which presents a menu of question types to a user in a manner to enable the user to select one of the question types, and a field for receiving from the user a question identifier in the form of human readable text, wherein the question identifier and question type selected by the user are used for selecting a data extraction model, and wherein the highlighted portion of the document associated with the question identifier is used to train the sele

Abstract: In accordance with an embodiment, described herein is a system and method for enabling in-place record content management. A records management agent within a content management system can communicate with a records management system in an asynchronous manner, such as in response to a request or prompt, or in combination with check-in of content into the content management system. The records management agent can fetch a records folders hierarchy from the records management system for use in selecting record policies to be applied to content. The records management agent can associate content with selected records folders within the records folders hierarchy, and can update metadata corresponding to the content. The records management agent can send the updated metadata to the records management system. In an embodiment, the records management agent can be provided as a reusable, pluggable component within an existing content management system.

Abstract: Various methods, apparatuses/systems, and media for implementing an automatic data ingestion module for automatically making data ingestion agnostic to source format are provided. A database stores a plurality of entity data each having a different file format. A processor configures each entity data accessed from the database via a communication network; automatically parses each of the configured entity data; splits and converts the parsed entity data of different file formats into a single file format; and translate the single file formatted entity data into a graph database form for further processing and analysis.

Abstract: Non-relational database operations are invoked to provide results consistent with commands specified in a relational query language. A request to access data in a non-relational database is received that includes one or more commands specified in a query language for accessing data according to a relational data scheme. The request may be evaluated to determine one or more Application Programming Interfaces (APIs) to invoke operations at the non-relational database that provide a result consistent with the commands specified in the query language. The determined APIs are executed and a result returned for the request based on the execution of the APIs.

Abstract: Embodiments of the present disclosure provide a method and a device for evaluating a comment quality, an electronic device, and a computer readable storage medium. The method includes: selecting a metadata key associated with a comment of an object from metadata of the object, the metadata including a plurality of key-value pairs; determining a value corresponding to the metadata key based on the metadata; and evaluating the comment quality based on the comment and the value corresponding to the metadata key.

Abstract: Various examples are directed to systems and methods for administering data model metadata for a plurality of data models. A metadata service may receive a first retrieval request from a requesting system. The first retrieval request may comprise an indication of a first local object identifier referencing a definition of a first local object from a first data model and an indication of a target data model. The metadata service may retrieve a first record from a metadata identifier registry, where the first record comprises an indication of the first local object identifier and an indication of a first global object identifier corresponding to the first local object identifier. The metadata service may determine a second local object identifier referencing a definition of a second local object identifier referencing a definition of a second local object in the target data model and return the second local object identifier.

Abstract: A method of encapsulating entities in a file, wherein the method comprises for at least one entity: generating a grouping data structure associated with at least one of the entities, and indicating that the at least one of the entities belong to a same group; encapsulating the grouping data structure and the entities in the file; wherein the grouping data structure is a proprietary grouping data structure comprising an universally unique identifier identifying the type of the proprietary grouping.

Abstract: A control system estimates a numerical value range within which a command value can fall from a distribution of second data relating to the command value in a learning data set used to construct a prediction model, and in such a manner that a first acceptable range prescribed by a preset first threshold value with respect to a command value for a subject device is extended, decides a second threshold value with respect to the command value for the subject device on the basis of the estimated numerical value range. Further, in an operational phase, on the basis of an output value from the prediction model, the control system decides a command value for the subject device within a second acceptable range prescribed by the decided second threshold value, and controls an operation of the subject device on the basis of the decided command value.

Abstract: A scheduling system and method provides a strategy for an interactive and automated summarized source network schedule on a time-scaled graph of a digital canvas that includes a hierarchy of schedule densities generated from source child activities. As the time-scaled graph is time compressed, the source child activities snap into parent activities of a higher hierarchy level such that the source child activities become visually non-present on the digital canvas and the parent activities of the higher hierarchy level becomes visually present on the digital canvas. As the time-scaled graph is time-stretched, the source child activities that are associated with the parent activities of the hierarchy level that is currently visible on the digital canvas snap out of the parent activities and become visually present on the digital canvas and the parent activities become visually non-present.

Abstract: Embodiments described herein relate to establishing a privacy risk score between two datasets based on features common to the datasets. Methods may include: receiving a first dataset of probe data points defining a trajectory; receiving a second dataset of the probe data points defining the trajectory; identifying a plurality of features common to the first dataset and the second dataset; computing a privacy risk value for the identified features common to the first dataset and the second dataset; and computing an aggregate privacy risk score between the first dataset and the second dataset.

Abstract: Systems and methods are provided for near-zero-cost (NZC) query framework or approach for differentially private deep learning. To protect the privacy of training data during learning, the near-zero-cost query framework transfers knowledge from an ensemble of teacher models trained on partitions of the data to a student model. Privacy guarantees may be understood intuitively and expressed rigorously in terms of differential privacy. Other features are also provided.

Abstract: The present application provides a method and system for identifying extreme climate events. The method acquires climate index (CI) grid data of a to-be-identified region within an extreme climate time period, and gradually expands each of event centers in the to-be-identified region, until CI values of all grids adjacent to the event center are not greater than a CI threshold. The method can obtain extreme climate impacted areas of extreme climate events in the to-be-identified region, and can further obtain CI intensities of the extreme climate events by average calculation. The method can obtain three pieces of dimension information on each of the extreme climate events in the to-be-identified region, including an extreme climate impacted area, a CI intensity and a duration. Therefore, the method can identify the extreme climate events more comprehensively.

Abstract: The disclosed systems and methods include pre-calculation, per object, of object feature bin values, for identifying close matches between objects, such as text documents, that have numerous weighted features, such as specific-length word sequences. Predetermined feature weights get scaled with two or more selected adjacent scaling factors, and randomly rounded. The expanded set of weighted features of an object gets min-hashed into a predetermined number of feature bins. For each feature that qualifies to be inserted by min-hashing into a particular feature bin, and across successive feature bins, the expanded set of weighted features get min-hashed and circularly smeared into the predetermined number of feature bins. Completed pre-calculated sets of feature bin values for each scaling of the object, together with the scaling factor, are stored for use in comparing sampled features of the object with sampled features of other objects by calculating an estimated Jaccard similarity index.

Abstract: A method for storage management of an object among a plurality of storage devices of a datacenter is provided. The method, in response to receiving an input on a selection item presented through a UI, determines that a manual storage management of an object is selected. The method then receives a storage policy for storing the object. Based on the storage policy, the method defines a plurality of components for the object and determines whether a set of one or more storage resources is available for storing the plurality of components. When the method determines that the set is available, for each component, the method presents the set of storage resources, receives a selection of a storage resource in the set to store the component, and updates the set based on the policy and the selection before presenting the updated set to select from for storing a next component.

Abstract: Embodiments of systems and methods for browsing offline and queried content are presented herein. Specifically, embodiments may receive a request that a content associated with a request be managed at the user cache on a mobile device. Embodiment may also determine that the content associated with the request has been updated and, based on the determination the content associated with the request has been updated, send an instruction with respect to the content associated with the request to the mobile application.

Abstract: The present disclosure is directed to systems and methods for identifying and providing highlight messages from a group messaging thread. For example, systems and methods described herein detect when a group messaging thread participant becomes absent from the group messaging thread, and identifies one or more highlight messages that were submitted to the group messaging thread while the participant was absent. Systems and methods described herein identify highlight messages that are specific to the absent participant, such that when the participant again accesses the group messaging thread, the participant can review the identified highlight messages in order to quickly “catch up” on the group messaging thread without having to read each electronic message submitted to the group messaging thread during the participant's absence.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer-storage media, for enhanced preparation and integration of data sets. In some implementations, data indicating user input that identifies a first data set that includes streaming data and a second data set that includes non-streaming data is received. The first data set and the second data set are integrated to generate a hybrid data set. The data processing system provides access to the hybrid data set through a (i) non-streaming access channel that provides a periodically-refreshed summary of both the streaming data and the non-streaming data and (ii) a streaming access channel that provides a data stream based on combined data of the first data set and the second data set. One or more application programing interfaces are provided. The one or more application programming interfaces allow at least one client device to access the non-streaming access channel and the streaming access channel.

Abstract: Techniques are described for a social networking system to enable multiple users to collaboratively create, publish, receive attribution, and/or edit content. In some cases, the social networking system may be configured to distribute the collaborative content and feedback associated therewith based on metrics and relationships between collaborators of the collaborative content and users of the social networking system.

Abstract: A design engine implements a probabilistic approach to generating designs that exposes automatically-generated design knowledge to the user during operation. The design engine interactively generates successive populations of designs based on a problem definition associated with a design problem and/or a previously-generated population of designs. During the above design process, the design engine generates a design knowledge graphical user interface (GUI) that graphically exposes various types of design knowledge to the user. In particular, the design engine generates a design variable dependency GUI that visualizes various dependencies between designs variables. The design engine also generates a design evolution GUI that animates the evolution of designs across the successive design populations. Additionally, the design engine generates a design exploration GUI that facilitates the user exploring various statistical properties of automatically-generated designs.

Abstract: An interactive and automated summarized schedule on a digital canvas includes a hierarchy of logic-tied schedule densities generated from source schedule activities and for which there is the ability in real-time to zoom in/out among the hierarchy of logic-tied schedule densities. For example, the hierarchy of logic-tied schedule densities is generated in response to and as the timescale (e.g., grid spacing) is compressed or stretched. This permits users to “zoom in” and “zoom out” on the digital canvas to observe the schedule activities individually or at various levels of summary groups that are summed-up from underlying individual activities, all while maintaining logic-relationships between the summarized groups.

Abstract: The present disclosure relates to a content recommendation method, device and system. The method includes: recommending a content in a content set to a user based on an average recommendation probability; collecting feedback information on the recommended content from the user's client, wherein the feedback information includes display information and click information, the display information including displaying times and displaying timing of the recommended content on the client, and the click information including clicking times and clicking timing of the recommended content on the client; and determining a sequence of preferred contents from the contents in the content set according to the feedback information, so as to recommend a content to the user based on the sequence of preferred contents.

Abstract: A system for predicting a non-fraud dispute using an artificial intelligence (AI) based communications system is disclosed. The system may comprise a data access interface to receive instructions historical transaction and disputes data from at least one data source associated with an account issuer. The data access interface may also receive incoming transaction data associated with a transaction from at least one data source associated with an account holder.

Abstract: A technique produces a graph data structure based on at least partially unstructured information dispersed over web documents. The technique involves applying a machine-trained model to a set of documents (or, more generally “document units”) to identify topics in the documents. The technique then generates count information by counting the occurrences of the single topics and co-occurrences of parings of topics in the documents. The technique generates conditional probability information based on the count information. An instance of conditional probability information describes a probability that a first topic will occur, given an appearance of a second topic, and a probability that the second topic will occur, given an appearance of the first topic. The technique then formulates the conditional probability information in a graph data structure. The technique also provides an application system that utilizes the graph data structure to provide any kind of computer-implemented service to a user.

Abstract: A determination device includes an image obtaining unit for obtaining an image in a linked area associated with an URL, a linked-to page obtaining unit for obtaining, from storing means for storing content, a linked-to page specified by the URL associated with the linked area, and a character determination unit for determining correctness of association between the linked area and the URL based on the image obtained by the image obtaining unit and the linked-to page obtained by the linked-to page obtaining unit.

Abstract: Described herein are techniques for identifying and displaying key excerpts of a digital work and related key excerpts of other digital works. Key excerpts are identified by evaluating (a) the number of interactions by human readers within each of the key excerpts and (b) the number of reviews that reference each of the key excerpts. Related excerpts from other books can be identified by comparing the key excerpts of the other books. Excerpts can be displayed by subject, and links are provided to move from one subject to another.

Abstract: The present invention provides a method and system for automatically identifying and selecting preferred classification and regression trees. The invention is used to identify a specific decision tree or group of trees that are consistent across train and test samples in node-specific details that are often important to decision makers. Specifically, for a tree to be identified as preferred by this system, the train and test samples must both agree on key measures for every terminal node of the tree. In addition to this node-by-node criterion, an additional tree selection method may be imposed. Accordingly, the train and test samples rank order the nodes on a relevant measure in the same way. Both consistency criteria may be applied in a fuzzy manner in which agreement must be close but need not be exact.

Abstract: A high availability system in a cloud computing environment includes a snapshot manager disposed in a mirror environment having at least one computer server and a plurality of virtual machines disposed in a production environment. Each of the plurality of virtual machines includes a snapshot agent configured to perform a method. The method includes periodically taking snapshots of the virtual machine associated with the snapshot agent, determining a delta image based on a change between a current snapshot and a previous snapshot, removing previous snapshots in the virtual machine and transmitting the delta image to the snapshot manager. The snapshot manager is configured to store a recovery image for each of the plurality of virtual machines and to merge the received delta image with the recovery image to update the recovery image.

Abstract: A method and system for automatically ranking product reviews according to review helpfulness. Given a collection of reviews, the method employs an algorithm that identifies dominant terms and uses them to define a feature vector representation. Reviews are then converted to this representation and ranked according to their distance from a ‘locally optimal’ review vector. The algorithm is fully unsupervised and thus avoids costly and error-prone manual training annotations. In one embodiment a Multi Layer Lexical Model (MLLM) approach partitions the dominant lexical terms in a review into layers, creates a compact unified layers lexicon, and ranks the reviews according to their weight with respect to unified lexicon, all in a fully unsupervised manner. When used to rank book reviews, it was found that the invention significantly outperforms the user votes-based ranking employed by Amazon.

Abstract: With use of GPS, an action-history recording apparatus obtains latitudes and longitudes representing places of user's action where a user is acting, and stores action-history data containing place names indicating the places of user's action at a predetermined processing timing. In the case where, the place of user's action is a specific place unique to the user, where the user visits customarily or frequently, the user is allowed to enter an arbitrary name independent of the latitude and longitude. The name entered by the user is used as a pace name to be contained in action-history data. In this way, the apparatus obtains a place name appropriate for the user and the user can use the name conveniently as the place name of the user's action.

Abstract: A computer implemented method for clustering customers includes receiving a source set of customer records, wherein each customer record represents one customer, and each customer record includes at least one data attribute, and each data attribute has an attribute value; pre-processing the source set of customer records to generate a pre-processed set of customer records; executing a clustering algorithm on the pre-processed set of customer records to group the pre-processed set of customer records into clusters of a pre-defined number. The pre-processing comprises: determining the type of a customer in the source set of customer records; using a type attribute value to indicate the type of the customer in its customer record; normalizing data attribute values and type attribute values; weighting to the data attribute values and the type attribute values respectively to obtain weighted attribute values of the data attribute and weighted attribute values of the type attribute.

Abstract: A computer implemented method for clustering customers includes receiving a source set of customer records, wherein each customer record represents one customer, and each customer record includes at least one data attribute, and each data attribute has an attribute value; pre-processing the source set of customer records to generate a pre-processed set of customer records; executing a clustering algorithm on the pre-processed set of customer records to group the pre-processed set of customer records into clusters of a pre-defined number. The pre-processing comprises: determining the type of a customer in the source set of customer records; using a type attribute value to indicate the type of the customer in its customer record; normalizing data attribute values and type attribute values; weighting to the data attribute values and the type attribute values respectively to obtain weighted attribute values of the data attribute and weighted attribute values of the tune attribute.

Abstract: A method of classifying a plurality of documents. The method includes steps of providing a first set of classification terms and a second set of classification terms, the second set of classification terms being different from the first set of classification terms; generating a first frequency array of a number of occurrences of each term from the first set of classification terms in each document; generating a second frequency array of a number of occurrences of each term from the second set of classification terms in each document; generating a first similarity matrix from the first frequency array; generating a second similarity matrix from the second frequency array; determining an entrywise combination of the first similarity matrix and the second similarity matrix; and clustering the plurality of documents based on the result of the entrywise combination.

Abstract: Using keywords to merge document clusters is described. Documents are distributed into document clusters that include a first document cluster of first documents and a second document cluster of second documents. A template associated with the first document cluster is created. The template includes keywords associated with most of the first documents. A distance is calculated between keyword location information associated with the template and word location information associated with a document in the second document cluster. The keyword location information includes information indicating a location of a keyword in the template relative to other keywords in the template. The word location information includes information indicating a location of a word in the document relative to other words in the document. A determination is made whether the distance is less than a threshold value.

Abstract: Interrelated items in a complex item set (such as a set of components in a complex software architecture) may be difficult to present in a manner that facilitates an understanding and evaluation of the item set, due to the amount of information and the difficulty in automatically discerning the organization of the item set. A set of criteria may be utilized to form criterion groups to which items matching respective criteria may be automatically assigned. Further grouping assignments may be achieved by identifying an ungrouped item that is associated with a grouped item. Such techniques may be applied in many variations to yield a representation of the item set, and a presentation of the item set to a user, that aggregates similar items and interrelationships, thereby promoting an understanding and analysis of the structure and organization of the item set while reducing the user involvement in the generation of same.

Abstract: Described is a technology for obtaining labeled sample data. Labeling guidelines are converted into binary yes/no questions regarding data samples. The questions and data samples are provided to judges who then answer the questions for each sample. The answers are input to a label assignment algorithm that associates a label with each sample based upon the answers. If the guidelines are modified and previous answers to the binary questions are maintained, at least some of the previous answers may be used in re-labeling the samples in view of the modification.

Abstract: Systems and methods are provided for intrusion detection. The systems and methods may include receiving transaction information related to one or more current transactions between a client entity and a resource server, accessing a database storing a plurality of transaction groups, analyzing the received transaction information with respect to information related to at least one of the plurality of transaction groups, and based on said analyzing, determining a possibility of an occurrence of an intrusion act at the resource server. The transaction groups may be formed based on a plurality of past transactions between a plurality of client entities and the resource server. Identity information of a user associated with the one or more current transactions may also be received along with the transaction information. The user may be associated with at least one of the plurality of transaction groups.

Abstract: The present application relates to a method for implementing picture search and a website server thereof.

Abstract: Methods, apparatus, systems and computer program products are described and claimed that provide for automatically and positively determining that an associate accessing a business domain/application using an application-specific associate identifier is the same associate that is accessing another business domain/application using another application-specific associate identifier. Once the positive determination of same associate is made, a federated identifier key is generated and applied to all of the platforms in which the associate can be positively identified, so as to globally identify the associates across multiple enterprise-wide domains/applications. As such, the present invention eliminates the need to manually analyze associate data to determine if an associate interfacing with one domain/application is the same associate interfacing with another domain/application.