Abstract: Methods, systems, and apparatus to reconfigure a computer are disclosed. An example electronic device includes at least one memory, instructions in the electronic device, and processor circuitry to execute instructions to analyze data corresponding to a first configuration of the electronic device to detect a change associated with the electronic device, the first configuration corresponding to a respective first user profile, determine a second configuration of the electronic device based on the detected change, and adjust a configuration of the electronic device from the first configuration to the second configuration.

Abstract: Methods, apparatus, systems, and articles of manufacture are disclosed to generate command lists to be offloaded to accelerator circuitry. An example apparatus includes kernel duration model circuitry to predict a duration of execution of a first kernel based on a first source location, a first name, a first property of a first argument, or an occupancy of the first kernel. The example apparatus includes subsequent kernel model circuitry to predict a tuple and a dependency of a second kernel based on a second source location, a second name, a second property of a second argument, or a time of submission of the previous kernel. The example apparatus includes reinforcement learning model circuitry to determine whether to bundle the first kernel into a command list based on the duration of execution of the first kernel, the tuple of the second kernel, or the dependency of the second kernel.

Abstract: A packet transmission apparatus includes a processor such as a central processing unit (CPU), a first processing chip, and a second processing chip. The second processing chip is separately connected to the processor and the first processing chip. The second processing chip is disposed between the processor and the first processing chip. The first processing chip is a non-programmable chip such as an application-specific integrated circuit (ASIC) chip, and the second processing chip is a programmable chip such as a field-programmable gate array (FPGA) chip. The second processing chip supports a second function, and the second function is updatable. Both the processor and the first processing chip are configured to exchange a packet with the second processing chip. The second processing chip is configured to process a received packet based on the second function and send the processed packet to the processor or the first processing chip.

Abstract: A method of capturing a fractional snapshot of a distributed file system includes receiving a snapshot request to generate a factional snapshot of a file system. The request includes an indication of a subset of data of the file system. The method further includes identifying, by a processing device, the subset of data of the file system indicated by the snapshot request and generating the fractional snapshot comprising the subset of data of the file system indicated by the snapshot request.

Abstract: Systems, methods, articles of manufacture, and computer program products for scalable subscriptions for virtual collaborative workspaces. An indication of a process event associated with a computer-implemented process may be received. A population of subscribers subscribed to at least one property of one of the process event or the computer-implemented process may be determined. A virtual collaborative workspace for the process event may be generated, the virtual collaborative workspace operative to present context information associated with the process event to a plurality of subscribers. A message may be sent to the population of subscribers indicating the process event, the message comprising a link to access the virtual collaborative workspace. The virtual collaborative workspace may be generated for display responsive to selection of the link by the at least one of the population of subscribers.

Abstract: Examples described herein generally relate to maintaining a snapshot of a multitier distributed file system. A snapshot directory volume of a directory volume can be created at least in part by copying, to the snapshot directory volume, metadata of the directory volume. Based on a file access request, it can be determined whether the file has not been snapshotted. If not, a snapshot file record of the file, and associated with the snapshot directory volume.

Abstract: A method for facilitating real-time collaboration of document mark-up and events correlation including receiving conference files from a user device, generating a package file including the conference files and saving it to a database, processing the package file to generate a derivative conference file, generating an item file including the derivative conference file, and saving the item file to a database, the item file including a link to the package file.

Abstract: Change notify responses can be utilized to inform a remote computer that a file or directory that is being monitored has changed. A change notify response can include a path name to the file or directory being referenced. In some examples, a cache of path names can be maintained in a user space of a server implementing change notify responses. When a module that generates a change notify response does generate such a response, the module can first access the cache to determine if the relevant path name is located in the cache. Where the relevant path name is not located in the cache, the module can obtain the path name from kernel space and store it in the cache.

Abstract: Apparatus, methods, and computer-readable media for providing frameworks for data source representation and compression using an index file format are disclosed herein. The index file format separate information about symbols in a data file and information about the corresponding location of those symbols in the data file. The described techniques provide mechanisms for reducing the size associated with the representation of the symbols information and/or the size associated with the representation of the location information.

Abstract: Example resource lock management methods and apparatus are provided. One example method includes obtaining resource lock information of a target resource by a first node, where the resource lock information represents whether a resource lock is added to the target resource, and information about a waiting node queue that requests to add a resource lock. The first node determines, based on the resource lock information, whether a first resource lock addition condition is met. If the first resource lock addition condition is met, the first node adds the resource lock to the target resource. If the first resource lock addition condition is not met, the first node queues to wait to add the resource lock, and updates the resource lock information. The first node monitors the resource lock information until it is determined that the resource lock information meets a second resource lock addition condition, adds the resource lock to the target resource, and updates the resource lock information.

Abstract: The technology disclosed relates to a STRADL file system that transparently deploys file blocks across multiple tiers of storage. In a cloud-based storage platform, multiple storage tiers host data via file system APIs. This includes a volatile storage (VS) tier with a VS API, a reliable non-volatile storage (RNVS) tier with a RNVS API, and a highly reliable non-volatile storage (HRNVS) tier with a HRNVS API. The STRADL file system provides an intermediary file system API that presents to a host system a single interface and translates get, put, and other file system requests into commands compatible with the VS API, the RNVS API, and the HRNVS API, without host system awareness of which of the multiple tiers holds requested data and metadata.

Abstract: An information processing apparatus in which data is accessed every predetermined data amount, wherein when writing data transmitted from a host system side, in the case where the data is presumed to be continuous data constituting a single file, metadata indicating that the data from the host system side is continuous data is written along with the data.

Abstract: Embodiments of the invention are directed to a decentralized block chain regulation architecture. The invention utilizes the collective nature of block chain communication to perform key regulatory and control functions. Instead of relying on a centralized regulatory source, the present system allows the block chain structures themselves to simultaneously function as both regulated and regulatory chains for one another to form an interconnected network of decentralized, regulatory chains. Further, the system allows for control of non-compliant block chains, wherein regulatory chains may issue commands to the non-compliant chains, rewrite data, overwrite an incorrect consensus, or deactivate a chain and remove it from a block chain environment before propagation of an error.

Abstract: A system includes first and second subsystems and a third processor. The first subsystem includes a first memory and a first processor. The first memory stores data, which includes metadata associated with transmitted metadata fields. The first processor transmits the data to the second subsystem. The second subsystem includes a second memory and a second processor. The second memory stores expected metadata fields. The second processor receives the data. The third processor determines that the first subsystem transmitted the data to the second subsystem and that a mismatch exists between the transmitted and expected metadata fields. In response, the third processor prevents the second subsystem from executing an application configured to process the data using the expected metadata fields. The third processor resolves the mismatch by modifying the expected metadata fields such that they correspond to the transmitted metadata fields and allows the second subsystem to execute the application.

Abstract: Computer-implemented methods, systems and computer program products leveraging blockchain networks to securely store a tamper-proof ledger comprising an audit trail describing the completion or missed data migration tasks, based on a timeline of an end-to-end data migration task schedule. Each of the event logs and alerts from the data migration source, data migration target, and/or migration tools, including network device logs, operating system logs, user-access logs, alerts, migration tool output etc. associated with the end-to-end migration tasks is made a part of the audit trail and stored to the ledger of the blockchain. All event logs, alert or other digital assets recorded to blocks of the blockchain can be timestamped, hashed and distributed across all nodes of the blockchain network and verified as valid by each of the peer nodes. As blocks updating the audit trail are added to the blockchain, the entries cannot be modified or tampered with.

Abstract: Systems and methods are described for managing the application of data management actions to one or more data objects in a data store. The systems and methods extract at least a portion of a first set of data objects from a data store to a file, wherein a first data object of the first set of data objects comprises a first set of attributes and a set of data management actions. A second set of data objects is loaded into the data store. A confidence score is generated based on a comparison of the first data object of the first set of data objects and a second data object of the second set of data objects. A determination is made that the confidence score satisfies a condition. In response to the confidence score satisfying the condition, the set of data management actions is applied to the second data object.

Abstract: An information processing apparatus according to an embodiment includes: a common data model management unit that manages information indicating a common data model corresponding to a plurality of modules in common; a unique data model management unit that manages information indicating a unique data model corresponding to at least one of the modules; and a common management unit that manages a version of a module corresponding to the common data model managed by the common data model management unit, a version of a module corresponding to the unique data model managed by the unique data model management unit, and a version of a module corresponding to a newly installed data model, and verifies compatibility of the versions.

Abstract: A shared-nothing database system is provided in which parallelism and workload balancing are increased by assigning the rows of each table to “slices”, and storing multiple copies (“duplicas”) of each slice across the persistent storage of multiple nodes of the shared-nothing database system. When the data for a table is distributed among the nodes of a shared-nothing system in this manner, requests to read data from a particular row of the table may be handled by any node that stores a duplica of the slice to which the row is assigned. For each slice, a single duplica of the slice is designated as the “primary duplica”. All DML operations (e.g. inserts, deletes, updates, etc.) that target a particular row of the table are performed by the node that has the primary duplica of the slice to which the particular row is assigned. The changes made by the DML operations are then propagated from the primary duplica to the other duplicas (“secondary duplicas”) of the same slice.

Abstract: Provided are methods, systems, and computer readable media for user interaction with database methods and systems. In an aspect, a user interface can be generated to permit dynamic display generation to view data. The system can comprise a visualization component to dynamically generate one or more visual representations of the data to present in the state space.

Abstract: A database system operates by: receiving a user-generated secondary indexing hint data for a dataset from a client device, wherein the client device generated the user-generated hint data based on user input in response to at least one prompt displayed by an interactive interface displayed via a display device of the client device; generating a plurality of segments that each include distinct subsets of a plurality of rows of a dataset; automatically selecting, for each of the plurality of segments, a secondary indexing scheme from a plurality of secondary indexing options based on the user-provided secondary indexing hint data; generating a plurality of secondary indexes for each of the plurality of segments in accordance with the corresponding secondary indexing scheme; and storing the plurality of segments and the plurality of secondary indexes in memory.

Abstract: The disclosure relates to, among other things, systems and methods for mitigating the risks of errors, benign or otherwise, occurring within trusted ledgers and/or for validating the integrity of information provided by operators of trusted ledgers. Consistent with embodiments disclosed herein, trusted agents, which may comprise proxy agents and/or test agents, may be employed to examine ledgers and/or derivatives, which may be meshed with other ledgers, to ensure the integrity of information provided by ledger operators. Ledger meshing techniques are described to link ledgers in a manner that improves the ability to verify ledger entries and/or recover from data faults. Further embodiments provide for tagging processes may be performed to give semantic meaning to hashes included in trusted ledgers.

Abstract: Instances of an application pod may be deployed to many different computing environments spanning native cloud installations, SaaS providers, and on-premise data centers. In order to make uniform changes to a distribution of an application pod, a lock manager may receive and schedule lock requests from many different types of utilities. These utilities may schedule exclusive locks on the application pod throughout the different computing environments, such that patches, updates, security protocols, and other changes may be instituted without interference from changes made concurrently by other utilities. The lock manager may schedule immediate and future locks, with lock extensions and lock overrides available for flexibility.

Abstract: This specification provides data processing methods, apparatuses and devices. In embodiments of the specification, table data includes a state identifier for indicating whether a target table is in a use state or an idle state. Therefore, after an occupying-table request is received, the table data can be obtained, and the state of the target table can be determined from the state identifier in the table data. If the target table is in the idle state, the table data is locked; after the state identifier is updated to the use state, the table data is released; and occupying-table data of the target table is generated to respond to the occupying-table request.

Abstract: A computer system stores a database model of an object based on a plurality of updates to the object. Each update indicates a bound status of the update, a transaction date of the update, an effective date of the update, and a value of an attribute in the update. The computer system forms a view model of the object based on the database model of the object by reconstructing values of the attributes of the object from the plurality of updates with immutable bound statuses.

Abstract: Systems and methods are provided for managing data associated with a point-in-time architecture (PTA) databases. An exemplary method includes: receiving first data from a first PTA database and second data from a second PTA database; validating one or more parameters associated with the first data and the second data; comparing the first data and the second data with one or more reference data; predicting one or more events based on the comparing; generating a data report indicating the first data and the second data leads to the predicted one or more events; performing, based on the data report, surveillance of the first data and the second data during a surveillance period and using a surveillance protocol; receiving an update to at least one of the first data, the second data, or the one or more reference data; and updating at least one of the predicted one or more events.

Abstract: The technology described herein is generally directed towards relating inconsistent identifiers of the same entertainment data entity (such as a movie) to one another. A global identification service, given an entertainment data entity identifier, returns identifier information and related data according to other naming conventions. Canonicalization rules and standards provide a consistent identifier for variously named/identified entertainment entities. A canonicalized identifier (or another identifier) may be part of a URN-based naming convention that identifies the entertainment data entity, as well as the organization that owns the entity and an authority within the organization that is responsible for that entertainment data entity.

Abstract: Systems and methods are disclosed herein for providing a recommendation to modify deficient a deficient content item. A plurality of content items associated with a topic is retrieved. Each of the content items includes a plurality of portions each associated with a respective sub-topic. A rating for each sub-topic of the content items is calculated, and a minimum viable subset of the sub-topics is identified based on the calculated ratings. A new content item associated with the topic is accessed. A plurality of portions of the new content item is identified and a sub-topic for each identified portion is determined. An omitted sub-topic of the minimum viable subset of the sub-topics that is not included in the sub-topics of the new content item is identified, and the system interrupts upload of the new content and recommends modifying the new content item to include a portion with the omitted sub-topic.

Abstract: A data catalog system is disclosed that provides capabilities for uniquely identifying and retrieving data entities stored in diverse data sources managed by an organization. The data catalog system includes capabilities for generating a unique external identifier for a data entity (e.g., a data asset or a data object) by identifying a set of immutable configuration parameters associated with the data asset and identifying a set of data object attributes that uniquely identify data objects within the data asset. The generated unique external identifiers are stored as part of the metadata harvested by the data catalog system. The external identifiers are used to enforce a single representation of the data assets and the data objects in the data catalog system. The external object identifiers are used to perform data lookups and reconcile states of data entities during the metadata harvesting process.

Abstract: A shared-nothing database system is provided in which parallelism and workload balancing are increased by assigning the rows of each table to “slices”, and storing multiple copies (“duplicas”) of each slice across the persistent storage of multiple nodes of the shared-nothing database system. When the data for a table is distributed among the nodes of a shared-nothing system in this manner, requests to read data from a particular row of the table may be handled by any node that stores a duplica of the slice to which the row is assigned. For each slice, a single duplica of the slice is designated as the “primary duplica”. All DML operations (e.g. inserts, deletes, updates, etc.) that target a particular row of the table are performed by the node that has the primary duplica of the slice to which the particular row is assigned. The changes made by the DML operations are then propagated from the primary duplica to the other duplicas (“secondary duplicas”) of the same slice.

Abstract: A multi-version database includes user-defined blockchain containers, where each of the user-defined blockchain containers is configured based on a type of data to be stored in a corresponding user-defined blockchain container. Each of the user-defined blockchain containers includes a set of one or more fields defined by a user. A command to write data to the multi-version database is received, where the command includes an identification of a first blockchain container of the user-defined blockchain containers, an identification of at least one of the set of one or more fields of the first blockchain container, and a value to write for at least one field of the set of one or more fields. A record is generated for the first blockchain container, the record including the value to write for the at least one field. A current state of the first blockchain container is then updated to include the record.

Abstract: A computer system stores a database of multi-dimensional variables indicating field values of rate plan objects. The database stores rules related to each rate plan object. The computer system forms a primary catalog comprising all of the multi-dimensional variables from all rate plan objects from the database. The computer system receives a first user input indicating a first plurality of field entries. The computer system forms a secondary catalog that inherits all rate plan objects of the primary catalog. The computer system identifies, in the secondary catalog, first fields values that do not correspond to the first plurality of field entries based on the rules for the rate plan objects corresponding to the first plurality of field entries. The identified first fields values are removed from the secondary catalog. A second rate plan object is formed based on the secondary catalog.

Abstract: A disparate data source aggregation system and methods are provided which may pull or retrieve talent data or features from disparate data sources, automatically correlate the data across the different data sources, build a self-adjusting system database that captures the talent data from the disparate data sources, and lets users search, query and build model insights on the aggregated data of the system database without human intervention. A method for disparate data source aggregation may include: extracting a first feature set having a first extracted feature and a second feature set having a second extracted feature; determining, if the first extracted feature of the first feature set matches the second extracted feature of the second feature set; and aggregating the first feature set with the second feature set if the first extracted feature of the first feature set matches the second extracted feature of the second feature set.

Abstract: Systems, devices, and methods discussed herein are directed to utilizing patterns and logical entities to identify and maintain relationships between data assets. In some embodiments, a query comprising a logical entity qualifier, one or more pattern identifiers that indicate a pattern, and a data set identifier may be received. The pattern is executed against a data set corresponding to the data set identifier and one or more logical entities are generated based on this execution. A logical entity may be a label that represents a set of one or more data assets in a data set. Assets that share a label can share attributes that are described by the label. The label corresponding to each logical entity may be presented, where each label represents a different set of data assets which share a common trait. In some embodiments, the user may define a pattern by which commonality may be assessed.

Abstract: A process for recommending pre-constructed queries in data analytics includes writing different records to a correlation data structure correlating different data classifications of data to different queries and, subsequent to the writing, establishing a communicative connection by a data analytics application to an underlying database. Thereafter, a data model for data in the database may be constructed in the data analytics application and at least one of the different queries may be selected in the correlation data structure that correlates to the classification of the data in the data model. Finally, the selected one of the different queries may be displayed in the data analytics application to an end user so as to provide an intelligent recommendation for the addition of the selected one of the different queries without requiring the end user to alone and without assistance discover the suitability of the selected one of the different queries.

Abstract: A method, apparatus, and computer-readable medium for dynamic hierarchical data flow mapping, including storing dynamic data flow mappings, each dynamic data flow mapping including a mapping of data from an input port corresponding to a source data container to an output port corresponding to a destination data container and a dynamic hierarchical field having a dynamic hierarchical data type, determining a rule language corresponding to each dynamic hierarchical field in the dynamic data flow mappings, the rule language defining acceptable parameters for sub-fields of that dynamic hierarchical data type, and generating static data flow mappings by resolving all dynamic hierarchical fields into static hierarchical fields during compilation of the dynamic data flow mappings with the source data container and the destination data container, the static data flow mappings being generated based at least in part on the rule language corresponding to each dynamic hierarchical field and underlying data in one or more

Abstract: Systems and methods are provided for using point-in-time architecture (PTA) databases. An exemplary method includes: entering first data, received from a first data source, into a first PTA database; receiving a first instruction to process the first data using a first statistical operation; executing the first statistical operation for the first data, resulting in first output data; filtering the first output data based on a user-selected attribute; and performing multiple stages of a data processing operation for the first output data.

Abstract: Systems and methods for query decomposition for scalability of continuous query processing are disclosed. In some examples, it is determined whether a query is fully stateful. If it is, the query may be divided into two functions, an aggregate function and a global function. The aggregate functions may be distributed across multiple distributed nodes and executed in parallel. The global function may then receive the results from the distributed nodes and join the results to achieve the fully stateful result.

Abstract: A method for managing the configuration of an in-memory database running in a cluster of computing nodes may include receiving a configuration request to configure an instance of the in-memory database. The configuration request may include an identifier of a configuration profile specifying a value for each of one or more parameters of the in-memory database. The presence of the instance of the in-memory database and the configuration profile specified in the configuration request may be verified. Upon verifying the presence of the in-memory database and the configuration profile, the instance of the in-memory database may be configured based the configuration profile. The configuring may include setting, to the value specified in the configuration profile, the one or more parameters of the in-memory database. Related systems and articles of manufacture, including computer program products, are also provided.

Abstract: A method for managing the configuration of an in-memory database running in a cluster of computing nodes may include receiving a configuration request to apply, to an instance of an in-memory database running on a cluster of computing nodes, one or more temporary changes to a configuration of the in-memory database. In response to the configuration request, an indication to deprecate the configuration profile may be added to a configuration profile associated with the instance of the in-memory database. The configuration profile may be deprecated based at least on the configuration profile being associated with the indication. The deprecating including restoring, to a state prior to the application of the one or more temporary changes, the configuration of the in-memory database. Related systems and articles of manufacture, including computer program products, are also provided.

Abstract: A method for execution by a database system includes determining physical network topology data of a plurality of nodes of the database system utilized to facilitate query executions. Initial route selection data indicating a set of initial relay nodes for each of a plurality of pairs of the plurality of nodes is based on the physical network topology data by selecting one of a plurality of possible initial route options for the each of the plurality of pairs of the plurality of nodes. The initial route selection data is sent to the plurality of nodes. A query resultant is generated by facilitating execution of a query, via the plurality of nodes, by facilitating routing of data blocks between at least one of the plurality of pairs of the plurality of nodes via a set of intermediate nodes selected based on the initial route selection data in accordance with a dynamic data block routing scheme.

Abstract: A method for execution by a node of a database system includes receiving a first data block, determining data block processing instruction data for the first data block is not indicated in previously received data blocks, and adding the first data block to an unknown purpose data block cache. Prior to elapsing of a storage time window for storage of the first data block, at least one second data block is received that indicates data block processing instruction data for the first data block. The first data block is processed by applying the data block processing instruction data. A third data block is received and is added to the unknown purpose data block cache. The third data block is removed from the unknown purpose data block cache based on elapsing of a storage time window for storage of the third data block.

Abstract: A database object used in a plurality of database operations is determined. A live range of the database object is computed. The computing of the live range includes determining occurrences of the database operations to the database object. Based at least in part on the live range of the database object, a memory is determined to be optimally assigned to store the database object based on at least one characteristic of the memory. A first time to allocate the database object to the memory is determined. A second time to deallocate the database object from the memory is determined. An output file comprising a first instruction to store the database object in the memory at the first time and a second instruction to deallocate the database object from the memory at the second time is written.

Abstract: Techniques are provided for processing a graph query by exploiting an in-memory graph index and minimizing the number of storage accesses needed to project properties of generated paths. A predefined number of paths from a graph query runtime is accumulated, using different data structures, before executing storage accesses necessary to retrieve all properties needed. A first data structure stores all paths from the graph query runtime that hit cache(s) entirely. A second data structure stores paths that do not hit caches at any level or only a subset of the levels does. Once any of these data structures are full, result rows are produced based on the two data structures prior to extracting more paths from the graph query runtime.

Abstract: The methods and computer systems for storing a query plan in a cache. The method can include: determining a use frequency of the query plan; determining a target storage layer for storing the query plan based on the determined use frequency, wherein the cache includes at least two storage layers and each of the storage layers is associated with a compression level of query plans; processing the query plan according to the compression level of the target storage layer; and storing the processed query plan in the target storage layer.

Abstract: Disclosed herein are systems and methods for selective scanning of external partitions. In an embodiment, a database platform receives a query directed at least in part to an external table stored on an external data storage platform. The external table is partitioned into partitions corresponding to storage locations in the external data storage platform. The database platform prunes, using external-table metadata that is stored by the database platform and that maps the partitions of the external table to the storage locations in the external data storage platform, those partitions that do not potentially contain data that satisfies the query. The database platform identifies data that satisfies the query by scanning any one or more of the partitions of the external table that were not pruned, and responds to the query at least in part with the identified data that satisfies the query.

Abstract: The present disclosure involves systems, software, and computer implemented methods for compressed columnar data search using fingerprints. One example method includes compressing columnar data that includes dividing the columnar data into multiple data blocks and generating a fingerprint for each data block, storing the compressed columnar data and the generated fingerprints in an in-memory database, receiving a query for the columnar data, for each in-memory data block stored in the in-memory database, determining whether the in-memory data block satisfies the query and in response to a determination that the in-memory data block does not satisfy the query, pruning the in-memory data block from the multiple data blocks to generate an unpruned set of data blocks, decompressing the unpruned set of data blocks, and performing a query search on the decompressed unpruned set of data blocks for the received query.

Abstract: A computer is to obtain specification concept graphs of nodes spec1, spec2, . . . , specm including concept nodes and relation nodes according to at least one of a plurality of digitized data from a plurality of computerized data sources forming a first set of evidences U and obtain concept graphs of nodes c?1, c?2, . . . , c?n including concept nodes and relation nodes for corresponding obtained plurality of information and knowledge (IKs) ?1, ?2, . . . , ?n forming a second set of evidences U. A subset of concept graphs of nodes is selected from c?1, c?2, . . . , c?n according to a computable measure of consistency, inconsistency and/or priority threshold between c?j in c?1, c?2, . . . , c?n to specification concept graph speck in spec1, spec2, . . . , specm. Knowledge fragments are generated for corresponding subset of concept graphs c?i1, c?i2, . . .

Abstract: Machine learning techniques are disclosed that allow device contact list information to be leveraged in building better models that provide more accurate assessment of user transaction risks. A computing device may receive a contact list that includes a first set of user device identifiers and generates a contact graph for that user by associating the user device identifier with the first set as first-degree contacts. The computing device may then determine that a portion of the first set of the user device identifiers are stored in a contact database (e.g. on a server) and generate a user score based on user information associated with the first set, the contact graph, and a contact graph model. The computing device may provide the user score to a transaction assessment service as in input for the transaction assessment service deciding whether particular electronic transactions are approved for processing by an electronic service provider.

Abstract: Pipeline-based techniques for system configuration management are provided. For example, a method comprises, in a pipeline-based system comprising a set of one or more pipelines, for a given one of the set of one or more pipelines, collecting a set of one or more configuration datasets respectively associated with a set of one or more elements of an information processing system, wherein each of the configuration datasets of the collected set of one or more configuration datasets is specific to the respective element of the information processing system from which it is collected; executing a set of one or more configuration checks on the set of one or more configuration datasets; receiving a set of one or more output results from the executed one or more configuration checks; and generating at least one report from the one or more output results.

Abstract: According to at least one exemplary embodiment, a method, system and computer program product for an online social media platform may be shown and described. The platform may provide a service for creating and securing content. The content may be created by a user. In an exemplary embodiment, the content may be released upon or after the death of the user. In an exemplary embodiment, the content may be the user's last will, memories, sentiments, or some words for living survivors, groups, or the general public. Users may publicly leave user content or a video, or may designate the content to only be accessible privately to a selected group of people. An ancestry log or family tree may be formed from the stored content. The ancestry log may be publicly viewable, or viewing may be restricted to relatives or other designated recipients.