Abstract: A system and method matches data from a first set of data with that of an other set of data in a manner based on the size of a memory.

Abstract: Mapping of database partitions to available nodes. Metric information related to the partitions of the database are stored. One or more metrics associated with the partitions are gathered. A plurality of potential mappings of partitions to nodes are evaluated. One of the potential mappings of partitions to nodes to result in improved metric distribution among the nodes and the partition moves are within a pre-selected move constraint is selected. The selected potential mapping is implemented by moving one or more partitions between one or more nodes.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for a feature clustering of users, user correlation database access, and user interface generation system. The system can obtain information stored in different databases located across geographic regions, and determine unique users from the different information. The information can be included in unique records in the databases, with each record describing a particular user, and with each user described with imperfect identifying information. The system can analyze the different information utilizing machine learning models, and can associate each record with a particular unique user. The system can obtain identifications of items associated with each user, and determine the propensity of the user to disassociate with one or more items, or determine likelihoods of future association with different items not presently associated with the 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: Techniques related to code dictionary generation based on non-blocking operations are disclosed. In some embodiments, a column of tokens includes a first token and a second token that are stored in separate rows. The column of tokens is correlated with a set of row identifiers including a first row identifier and a second row identifier that is different from the first row identifier. Correlating the column of tokens with the set of row identifiers involves: storing a correlation between the first token and the first row identifier, storing a correlation between the second token and the second row identifier if the first token and the second token have different values, and storing a correlation between the second token and the first row identifier if the first token and the second token have identical values. After correlating the column of tokens with the set of row identifiers, duplicate correlations are removed.

Abstract: Techniques are provided for identifying anomalies in an Internet of Things (IoT) activity profile of a user using an analytic engine. An exemplary method comprises obtaining data from a plurality of IoT devices of a user, wherein at least one IoT device comprises an agent device that performs an action on behalf of the user; applying the obtained data to a feature engineering module to convert the obtained data into time-series features that capture behavior and/or characteristics of an IoT environment of the user; and applying the time-series features to an analytic engine comprising a multi-variate anomaly detection method that learns one or more patterns in the IoT activity profile of the user for a normal state and identifies an anomaly with respect to an action performed by the agent device based on a health score indicating a deviation from the learned patterns.

Abstract: An Autonomous Exchange via Entrusted Ledger (AXEL) blockchain is discussed herein. The AXEL blockchain enables users to perform transactions in a private setting while enabling the transaction records thereof to be verified by other network users without publicly divulging the contents or details of the transaction records. The token identification system and method allows the tokens to carry an immutable identification to prevent negative blockchain occurrences such as double spending. A payment methodology allowing integration of external financial institutions with user owned and managed wallet. The AXEL blockchain can also interface with and utilize a distributed database to create an immutable record of each transaction while providing a complete backup of the transactions that occur within the system and on the AXEL blockchain.

Abstract: A series of graphical user interfaces allows a user to define rules for parsing unstructured and structured log data and generate an aggregate rule to identify events across multiple lines of one or more log files. A first graphical user interface allows a user to select a line from a log file under analysis, search for matching lines in the log file, define rules for parsing the log file, and tokenize attributes of the selected lines. A second user interface allows the user to aggregate defined rules so that messages may be correlated to identify events that occur across multiple lines.

Abstract: Systems for prosecuting Internet messaging campaigns. Two or more data sources are determined where at least one of the data sources comprise demographic attributes corresponding to shared IDs such as recipient IDs. A first join operation is performed over matching instances of the shared IDs in the two or more data sources. The first join operation results in a personalization table comprising rows having at least recipient IDs, respective external addresses, and at least one of the demographic attributes. The personalization table is transformed into a key-value data structure that is published to a caching subsystem. The caching subsystem is used to select a first set of recipients determined without performing a second join operation. Personalized messages to at least some of the first and second set of recipients are formed using the message template and the key-value data structures.

Abstract: The technology disclosed relates to creating and frequently updating multiple online analytic processing (OLAP) analytic databases from an online transaction processing (OLTP) transaction updatable system that includes transaction commit, rollback, and field level security capabilities. It also relates to transparently decoupling extraction from rebuilding of frequently updated OLAP analytic databases from the OLTP transaction updatable system.

Abstract: A processing node receives a finality proposal for a subject block within a blockchain. The finality proposal including an identifier of the subject block and one or more measures, wherein each of the one or more measures is based on the number of blocks within the blockchain that were mined by a respective node within the network of nodes other than the processing node. The processing node determines the subject block is a finalized block when a value based on the one or more measures satisfies a finality criterion. When the value fails to satisfy the finality criterion, the processing node transmits a subsequent finality proposal for the subject block. The subsequent finality proposal includes the identifier of the subject block, the one or more measures from the finality proposal, and an additional measure based on the number of blocks within the blockchain that were mined by the processing node.

Abstract: Methods, systems, and devices supporting a data model abstraction framework are described. Some platforms (e.g., a multi-tenant cloud computing platform) may manage data across a number of persistent systems (e.g., cloud platforms, data stores, packages, etc.). To efficiently manage data across such systems, a platform may implement a metadata-driven abstraction layer. The abstraction layer may support a number of interface objects and interface fields, which may operate as abstracted versions of persistent objects and persistent fields. External entities (e.g., users, triggers, customizations, packages, plugins, or any other entities) may interact with the interface objects, and the abstraction layer may automatically handle mappings from the interface objects to the persistent systems. By using the metadata-driven abstraction layer, the platform may resolve conflicts between the external entities and multiple underlying persistent systems.

Abstract: The APPARATUSES, METHODS AND SYSTEMS FOR A LEAD GENERATING HUB (“HUB”) facilitates the generation, evaluation, and recording of information and activities related to property transactions and associated communications. In embodiments, the HUB may be configured to identify leads for users based on user-entered information, user contacts, and/or the properties associated with a user and/or in which a user is interested. Leveraging connectivity between contract relationship management functionality, property listing service features, intelligent inbox coordination capabilities, and/or the like, the HUB may identify connections between user requirements and/or assets and opportunities to fulfill those requirements and/or to transact those assets.

Abstract: Techniques are provided for automatic verification of query results obtained from data formatted different from row-major format. Techniques are also provided for automatic triage of query results obtained from data formatted different from row-major format. In an embodiment, the query results may be obtained from querying data formatted in column-major format. In an embodiment, when the query results are determined to be incorrect, a cause of the error in the query results can be automatically identified.

Abstract: A method for increasing sargability of encrypted records to allow for searching of a first column of a first data table for encrypted values containing a search string without having to decrypt all encrypted values involves, for each respective data record in the first data table, accessing an encrypted data value from the first column, decrypting the accessed encrypted data value, generating from the decrypted data value a respective plurality of substrings of various lengths, encrypting each substring of the respective plurality of substrings as an encrypted substring token, and storing each encrypted substring token in association with a reference value for lookup of a corresponding record in the first data table. Subsequently, the first column of the first data table can be searched for encrypted values containing a first search string by encrypting the first search string and searching for encrypted substring tokens matching the encrypted first search string.

Abstract: Apparatus, methods, and computer-readable media facilitating efficiently scaling result caching are disclosed herein. An example method includes generating an index based on a plurality of source data objects in an object storage system. The generated index comprises a manifest, at least one symbol file, and at least one locality file. The example method also includes receiving a search query for the plurality of source data objects stored in the object storage system, and querying the generated index based on the search query and a manifest root file of the manifest. Additionally, the example method includes generating a materialized view of a result set of the search query based on the querying of the generated index. The example method also includes storing a cached manifest file at the generated index, the cached manifest file mapping the search query to a segment of the generated index based on the result set.

Abstract: A database system may receive a query and form a plan for executing the query using a hypothetical index selected based on columns referenced by the query. The database system may compare the hypothetical index to indexes on the computing nodes of the database system. Based on the comparison, the database system may form a new index, based on the hypothetical index, on one of the computing nodes. An additional computing node may be added to the database system for the purpose of maintaining the new index. Subsequent queries having commonality with the first query may be processed on a node maintaining the first index.

Abstract: A method of searching a database that includes executing a trie search algorithm on a first portion of data in the database, returning a tag narrowing a location of the first portion of data to optimize the database, and performing a directed search of the optimized database by executing the trie search algorithm again on the optimized database, where the trie search algorithm is an information retrieval data structure using a M-ary tree where each node consists of a M-positional vector of pointers.

Abstract: Techniques are disclosed relating to caching techniques for processing a database change stream. A caching module of a computer system may receive change records from a change stream that includes a plurality of records indicating changes to a database table. The change stream may include change records for multiple shards and is accessible by providing one or more position indicators for one or more of the multiple shards to request one or more change records and an updated position indicator. The caching module may store, for changes to a set of one or more shards for which the caching module is configured, one or more cache entries that each include a group of change records up to a threshold group size. A change processor module of the computer system may request a portion of the change stream by providing a received position indicator. The change processor module may receive, from the caching module, one or more cached change records from a cache entry that matches the provided position indicator.

Abstract: A system and method for processing a group and aggregate query on a relation are disclosed. A database system determines whether assistance of a heterogeneous system (HS) of compute nodes is beneficial in performing the query. Assuming that the relation has been partitioned and loaded into the HS, the database system determines, in a compile phase, whether the HS has the functional capabilities to assist, and whether the cost and benefit favor performing the operation with the assistance of the HS. If the cost and benefit favor using the assistance of the HS, then the system enters the execution phase. The database system starts, in the execution phase, an optimal number of parallel processes to produce and consume the results from the compute nodes of the HS. After any needed transaction consistency checks, the results of the query are returned by the database system.

Abstract: A system and method for dynamic transactional data streaming are provided.

Abstract: Systems and methods are disclosed for enhancing user queries. In one embodiment, a method includes receiving user data from a plurality of users in respective user sessions where the user data for each user includes at least one manufacturer-identified term for a product and at least one user term for the product, associating the user term for the product and the manufacturer-identified term for the product in response to receiving the user term and the manufacturer-identified term within a user session from a threshold number of users, and returning search results based on the associated manufacturer-identified term in response to receiving a search query that includes the user term.

Abstract: In accordance with an embodiment, described herein is a system and method for mining playlist data, for use in providing advertisement-supported media content or targeted advertisements. A media server provides media content items as one or more media streams. Each of a plurality of playlists is associated with theme words provided by a title and/or description of the playlist. A playlist can also be associated with one or more theme words associated with the at least one media content item included in the playlist based on inclusion of the at least one media content item in the playlist. A dataset of media content item-theme word pairs provides an association of a particular media content item included in a particular playlist, with a theme word associated with that playlist. A score is assigned to each of the media content item-theme word pairs based on their appearances across several playlists.

Abstract: A client device receives search queries and displays via a user interface, search results representing a set of the records based on the search queries. The client device monitors implicit user interactions with search query terms and records displayed in response to various search queries, for example, implicit user interactions representing movements of cursor on the portion of user interface displaying a particular record. The client device receives a partial search query. Partial search results representing a set of the records based on the partial search query are determined for display via the user interface. The relevance score for each record is determined based on implicit user interactions associated with past search queries. The partial search results are ranked based on the relevance scores and displayed by the client device according to the ranked order.

Abstract: A categorization analysis system is provided. The categorization analysis system includes one or more hardware processors, a memory including a first plurality of listings categorized in a first target category, and a categorization analysis engine executing on the one or more hardware processors. The categorization analysis engine is configured to determine a label for each listing including performing a search on title, select a set of training listings based on the determined labels, train a first model using the set of training listings and the determined labels, the first model being a classification model configured to classify categorization of listings, identify a suspect listing categorized in the first target category, apply the suspect listing to the first model, thereby generating a categorization result for the suspect listing, the categorization result indicating miscategorization of the suspect listing, and identify the suspect listing in the memory as miscategorized.

Abstract: Systems and methods are disclosed for executing a query that includes an indication to process data managed by an external data system. The system identifies the external data system that manages the data to be processed, and obtained search configuration data from the external system. The system uses the search configuration data to generate a subquery for the external data system. The system also generates instructions for one or more worker nodes to receive and process results of the subquery from the external data system.

Abstract: A search system configured to determine, according to a facet hierarchy definition, a facet hierarchy for a set of search results, the facet hierarchy comprising a plurality of facet topics represented by a set of search results. The search is further configured to generate a search user interface comprising a facet hierarchy interface configured to display a representation of the facet hierarchy in conjunction with results from a set of results, update the search results display to display faceted search results and update the facet hierarchy interface to display, in conjunction with the faceted search results, a control to allow a user to select a search facet topic where the search facet topic is a facet topic from the facet hierarchy that is not represented in the faceted search results.

Abstract: An interactive database object representation may be created based on configuration instructions. The interactive database object representation may include a plurality of graphical elements that are each associated with a respective database object field. Each of the database object fields may be associated with a database object definition within a database. The interactive database object representation may be published to a storage medium for transmission upon request to a client machine via a network. The interactive database object representation may facilitate the display and editing of data associated with an instance of the database object.

Abstract: Systems, methods, and devices for a cyberphysical (IoT) software application development platform based upon a model driven architecture and derivative IoT SaaS applications are disclosed herein. The system may include concentrators to receive and forward time-series data from sensors or smart devices. The system may include message decoders to receive messages comprising the time-series data and storing the messages on message queues. The system may include a persistence component to store the time-series data in a key-value store and store the relational data in a relational database. The system may include a data services component to implement a type layer over data stores. The system may also include a processing component to access and process data in the data stores via the type layer, the processing component comprising a batch processing component and an iterative processing component.

Abstract: Apparatus and methods for secure data logging are disclosed. An example method for secure data transfer from a process control system network includes storing information received by a process controller via the process control system network, the process controller including a safety instrumented system controller or a process control system controller, the information transferred uni-directionally from the process control system network to a data logger via a data diode, identifying a trigger event on the process control system network, in response to identifying the trigger event, parsing the stored information for event data, and transferring the event data from the data logger to a data extractor.

Abstract: A system for dynamic and automated conversion of party objects based on a change in party type and/or party classification. Party-type and/or party-classification specific rules are relied on to determine which data and processes to include in the converted party object. As such, the converted party object provides for (i) retaining data and processes that are common to both party types and/or classifications, (ii) disabling or otherwise deleting data and processes not associated with the new party type and/or classification, and (iii) adding new data, data entry fields and processes for data and processes associated with the new party type and/or classification that were not associated with the previous party type.

Abstract: A user data visualization and parsing system may receive from a user a selection of a first data item from a data set, the data item associated with a location identifier. The data visualization and parsing system may extract a first value of the first data item associated with the location identifier and identify, in a second data set of the data stream, a second data item associated with the location identifier. The system may extract a second value of the second data item associated with the location identifier, generate a visual representation of the first and second values, and display the visual representation to the user through the user interface.

Abstract: This present application discloses a method and apparatus for synchronizing data in a robot operating system. A specific implementation of the method includes: detecting an operation on data being transmitted between communication processes, wherein the operation includes at least one of updating the data, deleting the data, and storing the data; determining whether the data are persistent data, in response to positively detecting an operation on the data being transmitted between the communication processes; and transmitting a change message of the data to communication processes other than the communication processes in response to positively determining that the data are persistent data. In the embodiment, the persistent data may always remain consistent across the communication processes.

Abstract: A method, apparatus, and system for join operations of a plurality of relations that are distributed over a plurality of storage locations over a network of computing components.

Abstract: A method comprising using one or more hardware processors for automatically receiving two or more data objects and two or more data storage addresses, wherein each data storage address directs to one of two or more non-transitory computer readable storage medium locations. The method comprises the action of computing two or more parameter values for each of the data objects. The method comprises the action of grouping the data objects based on the parameter values and two or more predefined rules, thereby producing two or more groups. The method comprises the action of assigning each of the groups to one of the data storage addresses based on the predefined rules. The method comprises the action of storing each of the objects of the groups at one of the non-transitory computer readable storage medium locations based on the assigning.

Abstract: Disclosed method for generating synthetic data for minority classes in a very large dataset comprises grouping samples stored on several devices, into different groups. A pivot is identified to be used as a reference for grouping the samples into bins. The samples are assigned to a bin, based on a closest pivot. The samples are regrouped into different groups, based on identities of the bins, and each of the groups is distributed to the several devices. Samples belonging to majority class and minority classes for which synthetic data is not being generated are removed from each of the different groups. Samples of each of these groups are arranged in different M-Trees to facilitate identification of K-nearest neighbours for each sample within each of the different groups to generate K pairs of nearest neighbours. Finally, synthetic samples are generated for the K pairs of nearest neighbours by creating random samples.

Abstract: An intelligent advertisement publishing system and method based on a double-sided printer distribution map. The method includes: generating a distribution map based on geographical location information of double-sided printers; displaying the distribution map of the double-sided printers, and after obtaining advertisement content input by a user and an advertisement publishing scope selected by the user on the distribution map, generating advertisement information; parsing to obtain the corresponding advertisement publishing scope and advertisement content, generating corresponding advertisement push information based on the advertisement content, and sending the advertisement push information to double-sided printers in the advertisement publishing scope; and enabling the double-sided printers to print the corresponding advertisement information at the back of cash register paper when printing cash registration information.

Abstract: Disclosed herein are system, method, and computer-readable storage-medium embodiments for automatic discovery of translated text. An embodiment may include relating a user-interface (UI) output with a corresponding localization object in a code-base index and matching a first instance of a unique identifier with a second instance of the unique identifier. The first instance of the unique identifier may be located in a code base corresponding to the code-base index, and the second instance of the unique identifier may correspond to the UI output. The code base may be structured to comprise the unique identifier in a given context. Further operations may include retrieving a reference to the corresponding localization object of the UI output in response to a determination that the UI output is incorrect in the given context, and outputting the reference to the corresponding localization object. The reference may be copied into a ticket of a tracking system.

Abstract: Provided are a computer program product, system, and method for providing information on detected user interactions with natural language processor (NLP) items to a server to use to determine an order in which to render NLP items in a user interface. Interactions with natural language processing (NLP) items in documents are detected. For each interaction with an NLP item of the NLP items in the documents, determination is made of a context attribute value for a context attribute related to the interaction with the NLP item. Then interaction information is generated indicating the NLP item and the determined context attribute value. The interaction information is sent to the server to include in user interaction information in a database.

Abstract: A method, computer program product, and a system where a processor(s) monitors, via sensor(s) configured to monitor physical behaviors of a user engaged in reading document(s) on a user interface of a client, where the monitoring captures the physical behaviors and portions of the one or more processors being read during the physical behaviors. The processor(s) analyses the physical behaviors and the captured portions to generate implicit feedback indicating amounts of time the user engaged with each portion of the one or more documents during the monitoring. The processor(s) generates a model profile for the user including relative timing measures indicating ranked levels of engagement of the user with the portions and ranked levels of importance of each portion.

Abstract: Embodiments as disclosed may generate an organizational hierarchy based on embeddings of portions of documents. Embeddings resulting from the embedding of the portions of the documents can be clustered using a hierarchical clustering mechanism to segment the portion space into a set of hierarchical clusters. Documents can be assigned to these clusters based on the presence of a portion of a document within a cluster. In this manner, the documents may themselves be clustered based on the clusters created from portions across the documents of the corpus. The clusters to which a document is assigned may also be ranked with respect to that document. Similarly, documents assigned to cluster can be ranked within the cluster to which they are assigned. Additionally, in certain embodiments, names or snippets for the clusters of the hierarchy may be derived from the portions comprising that cluster.

Abstract: The following disclosure describes software components, such as add-ins, that are launched automatically, without being manually activated by a user. In some embodiments, the add-in may run silently, e.g. the add-in runs in the background, without displaying content in an ancillary pane. The add-in may be given access to document content, enabling pre-processing as well as decorating document content with metadata for future use. The add-in may determine that the document has met a criteria, and in response, display a visual cue directing the user to activate the add-in. When a user does manually activate the add-in by clicking on an icon or pressing a keyboard shortcut, the add-in may be pre-loaded, initialized, and have already accessed and processed document content. In this way, the add-in may display useful content in an ancillary pane in much less time, solving the technological problem of delay between manual activation and initialization of an add-in.

Abstract: A computer-implemented system is described for identifying and retrieving similar radiology images to a query image. The system includes one or more fetchers receiving the query image and retrieving a set of candidate similar radiology images from a data store. One or more scorers receive the query image and the set of candidate similar radiology images and generate a similarity score between the query image and each candidate image. A pooler receives the similarity scores from the one or more scorers, ranks the candidate images, and returns a list of the candidate images reflecting the ranking. The scorers implement a modelling technique to generate the similarity score capturing a plurality of similarity attributes of the query image and the set of candidate similar radiology images and annotations associated therewith.

Abstract: The overall architecture and details of a scalable video fingerprinting and identification system that is robust with respect to many classes of video distortions is described. In this system, a fingerprint for a piece of multimedia content is composed of a number of compact signatures, along with traversal hash signatures and associated metadata. Numerical descriptors are generated for features found in a multimedia clip, signatures are generated from these descriptors, and a reference signature database is constructed from these signatures. Query signatures are also generated for a query multimedia clip. These query signatures are searched against the reference database using a fast similarity search procedure, to produce a candidate list of matching signatures. This candidate list is further analyzed to find the most likely reference matches. Signature correlation is performed between the likely reference matches and the query clip to improve detection accuracy.

Abstract: Data from social networking applications and other applications that can be used to communicate are combined for a user to generate a graph of the various relationships that the user has with other users in the social networking applications and other applications. In addition, the behaviors of each user with respect to communicating through the various social networking applications and other applications are monitored to generate task data that describes user preferences for communicating using each social networking application or other application for different tasks. At a later time, when a user is looking to connect with another user for an indicated task such as networking, the graph can be used to recommend paths to other users in the various social networking applications and other applications, and the generated task data can be used to rank the recommended paths based on the indicated task.

Abstract: According to one embodiment, a retrieval device includes one or more processors configured to retrieve a plurality of search image regions from an intended image through image search using a search query, extract a plurality of learning image regions from a learning image used in learning of the image search, through the image search using the search query, and display the search image regions and the learning image regions on a display.

Abstract: Described is a system and method for enabling visual search for information. With each selection of an object included in an image, additional images that include visually similar objects are determined and presented to the user.

Abstract: A multi-dimensional database and indexes and operations on the multi-dimensional database are described which include video search applications or other similar sequence or structure searches. Traversal indexes utilize highly discriminative information about images and video sequences or about object shapes. Global and local signatures around keypoints are used for compact and robust retrieval and discriminative information content of images or video sequences of interest. For other objects or structures relevant signature of pattern or structure are used for traversal indexes. Traversal indexes are stored in leaf nodes along with distance measures and occurrence of similar images in the database. During a sequence query, correlation scores are calculated for single frame, for frame sequence, and video clips, or for other objects or structures.

Abstract: There is disclosed a method comprising: receiving one or more items of metadata associated with an item of content, each of the items of metadata identifying a characteristic of a part of the item of content; receiving one or more items of user behaviour information corresponding to an engagement of a user with one or more parts of the item of content; and linking the metadata to the user behaviour in dependence on user engagement for the part of the content associated with the metadata.

Abstract: In some examples, formatting semi-structured data in a database includes obtaining semi-structured data in a column store database, assigning the semi-structured data to a semi-structured column with a key and value format, and formatting the semi-structured data with an optimal search format.