Abstract: The present teaching relates to estimating one or more parameters on a system including a plurality of nodes. In one example, the system comprises: one or more learner nodes, each of which is configured for generating information related to a group of words for estimating the one or more parameters associated with a machine learning model; and a plurality of server nodes, each of which is configured for obtaining a plurality of sub-vectors each of which is a portion of a vector that represents a word in the group of words, updating the sub-vectors based at least partially on the information to generate a plurality of updated sub-vectors, and estimating at least one of the one or more parameters associated with the machine learning model based on the plurality of updated sub-vectors.

Abstract: An improved knowledge representation uses interlinked construct nodes to represent knowledge in a uniform and consistent manner across all forms and scopes of knowledge. The node consists of a unique identifier, plurality of data fields, and plurality of paired node linking categories. In its graphical embodiment, the data fields and link categories are superimposed onto a geometric shape. The position of the link categories around the perimeter of the shape identifies the category and relationship to other nodes. Lines between link categories link nodes. Nodes form an interlinked construct node graph. Data fields contain text, images, sounds, symbols, numbers, equations, formulas, digital 3D models and documents. Embodiments of application software are used to create, edit, view, interpret and apply the knowledge contained within a graph.

Abstract: A method may include searching compiled code for a variable name of a resource, the variable name containing a predefined string; identifying a variable name in a resource manifest of the library that matches the variable name that contains the predefined string; based on the identifying, importing the resource to a location associated with the compiled code.

Abstract: Methods and systems are disclosed for generating common objects in a universal format. A stream of data objects is received from each of a plurality of databases. Each stream of data objects includes objects represented in a disparate data type from objects in other streams. A plurality of agents are generated and configured to process data objects of a particular format. For each object, a source database of the data object is identified. An agent of the plurality of agents can be selected based on a database type of the source database. The agent generates a common object from the data object that is represented in a universal format. The common object is stored a graph database of common objects.

Abstract: Replication and failover of database data is disclosed. A method includes replicating database data stored in a primary deployment such that the database data is further stored in a secondary deployment. The method includes executing one or more updates to the database data at the secondary deployment when the primary deployment is unavailable and propagating the one or more updates to the primary deployment when the primary deployment becomes available again. The method includes executing queries on the database data at the primary deployment when the primary deployment is available.

Abstract: A graph-based program specification includes: a plurality of components, each corresponding to a processing task and including one or more ports for sending or receiving one or more data elements; and one or more links, each connecting an output port of an upstream component of the plurality of components to an input port of a downstream component of the plurality of components. Prepared code is generated representing subsets of the plurality of components, including: identifying a plurality of subset boundaries between components in different subsets based at least in part on characteristics of linked components; forming the subsets based on the identified subset boundaries; and generating prepared code for each formed subset that when used for execution by a runtime system causes processing tasks corresponding to the components in that formed subset to be performed according to information embedded in the prepared code for that formed subset.

Abstract: A system and method for global data de-duplication in a cloud storage environment utilizing a plurality of data centers is provided. Each cloud storage gateway appliance divides a data stream into a plurality of data objects and generates a content-based hash value as a key for each data object. An IMMUTABLE PUT operation is utilized to store the data object at the associated key within the cloud.

Abstract: Systems and methods for data filtering and mining using multiple-level, composite-attribute tree-node diagrams to quickly select and analyze data of interest.

Abstract: Data is obtained from a data stream managed by a data stream service prior to expiration of a data retention time. The data is archived to a data store distinct from the data stream service (e.g., in a full or compacted mode). Access to the archived data is provided via a proxy that intercepts requests directed to the streaming service. For example, the proxy or a redirect utility for the proxy may intercept a query, and for data specified in the query that is past the retention expiration time, the data is retrieved from the data store. For data specified in the query that has not yet expired, the data is retrieved from the data stream service. In either case, the system responds to the query with the retrieved data according to the access interface of the data stream service (e.g., injecting the retrieved data into a data stream).

Abstract: In some implementations, a computing system can determine how important an investment identifier is to a content item that mentions the investment identifier. For example, a content item may describe a story, event, etc., related to an investment identifier. The content item may mention the investment identifier by mentioning the investment identifier, proxies for the investment identifier, or other equivalents associated with the investment identifier. The computing system can determine locations in the content item where the investment identifier is mentioned and/or how frequently the investment identifier is mentioned. Based on the locations and/or frequency of mentions, the computing system can determine an importance score that represents how important the investment identifier is to the story described by the content item. The importance score can be stored in metadata for the content item and used when determining which content items to present to a user.

Abstract: Methods, systems, and computer program products are provided for generating and utilizing materialized graph views. A system according to one embodiment includes a graph database including a graph and schema, a workload analyzer, a view enumerator, a query rewriter and an execution engine. The workload analyzer is configured to receive and analyze queries in a query workload. The view enumerator is configured to use an inference engine to operate on facts derived from the graph and a query, and view templates comprising inference rules to enumerate candidate views. The workload analyzer is further configured to selects a candidate view to materialize, provide the selected view to the execution engine that is configured to generate the materialized view. The workload analyzer may select the at least one candidate view based on factors such as query evaluation cost estimates, candidate view performance improvement estimates, view size estimates and view creation cost estimates.

Abstract: Embodiments are provided for calculating improved search scores for records that exhibit supra-threshold slop distances. These embodiments include receiving a search string that includes two or more words and determining, based on the search string, search scores for a plurality of text-based records. Determining a search score for a particular text-based record includes: determining a slop distance for the search string within the particular text-based record; determining that the slop distance is greater than a threshold distance; responsive to determining that the slop distance is greater than the threshold distance, determining an augmented slop distance for the particular text-based record; and determining the search score based on the augmented slop distance.

Abstract: A computer-implemented method for importing external data into a content management system (CMS) may be provided. The CMS comprises a search and an authoring service. The CMS also comprises a dynamic page connector service enabling an import of external data into the content management system. The method comprises receiving address data relating to the external data, reading the external data using the address data received, selecting a page template from a plurality of predefined page templates, creating at least one new content item in the content management system comprising at least a data element of the read external data based on the selected predefined page template, and integrating in the at least one new content item data concerning a hierarchy structure between the at least one created content item and other content items.

Abstract: Solutions for automated labeling of child objects within tagged parents include: receiving a plurality of parent objects, each having a tag and including a plurality of child objects; receiving a machine learning (ML) component operable to rank the parent objects; for each parent object: generating a set of restricted objects, wherein each restricted object is missing a child object; for each of a plurality of queries, ranking, with the ML component, the restricted objects according to relevance; based at least on the query and an inverse of the rank of the restricted objects, assigning a child object label. In some examples, the object missing from the restricted object having the lowest relevance rank is assigned a label based on the query. Various advantageous uses of the assigned child labels include enhancing search result reporting, automatically generating ML training data, and automatically generating and/or modifying reports.

Abstract: An example operation may include one or more of determining data at a first node satisfies a condition, obtaining a pointer to a shared storage area for the data, controlling generation of a block including the pointer, and appending the block to a blockchain without the data, wherein the first node corresponds to first virtual node hosted by blockchain-as-a-service (Baas) provider and wherein the first virtual node receives the data from a network coupled to the Baas provider.

Abstract: Implementations of a system, method and apparatus described herein receive, for a configuration item in a configuration management database, status indicating an operational state and an automation state associated with the configuration item, and determine whether a conflict will occur with at least one of the operational state or the automation state of the configuration item as a result of a process affecting the configuration item. When the conflict will not occur, a change is made to at least one of the operational state or the automation state of the configuration item in accordance with the process. Upon a conclusion of the process, the change is removed. If the conflict will occur, the process not allowed to continue.

Abstract: Systems, methods, and software are disclosed herein for enhancing entity classification operations for digital maps. In an implementation, an entity classification system associates tiles in a grid overlaying a map with discrete positioning records produced by devices operating in areas represented in the map. For each tile in an area of interest in the grid, the system produces a scalar description based on a subset of the discrete positioning records associated with the tile. The system then performs a binary classification of each tile as a type of entity (e.g. a road, business, or residence) based on the scalar description of the tile and the scalar descriptions of other tiles in the area of interest.

Abstract: Methods for splitting a plurality of records into subsets for parallel processing by separate threads are disclosed. In one embodiment, a plurality of records are added to a database. The adding includes tracking, for each unique value found in the plurality of records within a selected one of the sequence of fields, a statistic based on the values found in the plurality of records within a next one of the sequence of fields. Then a plurality of queries are generated, each includes a row value constructor (RVC) with a logical operation, a specific one of the unique values found within the selected one of the sequence of fields, and, for that specific value, the tracked statistic. Then a plurality of threads are caused to execute that each submit one of the queries and operate on a subset of the plurality of records responsive to execution of that query.

Abstract: A method includes receiving a data set that includes a plurality of data records, where a data record includes a first data field containing a first fixed length data value and a second data field containing a first variable length data value. The method further includes accessing a compression dictionary for the second data field, where a first entry of the compression dictionary includes a key field storing a first fixed length index value and a value field storing the first variable length data value, and where the key field has a smaller data size than the value field. The method further includes creating a storage data set based on the compression dictionary and sending the storage data set to a storage sub-system for storage, where the first variable length data value of the second data field of the data record is replaced with the first fixed length index value.

Abstract: A data input sub-system of a large scale application specific computing system receives a data set that includes a plurality of records, each with a plurality of data fields, and divides the data set into a plurality of data segments. The data input sub-system further restructures records of data segments based on a key field of the plurality of data fields to produce restructured data segments and generates storage instructions for storing the restructured data segments. A data storage and processing sub-system of the computing system interprets the storage instructions to determine resources to engage and stores the restructured data segments using engaged resources. A query and results sub-system of the computing system generates an initial query plan based on a data processing request, optimizes the initial query plan to produce an optimized query plan, and sends the optimized query plan to the data storage and processing sub-system for execution.