Abstract: A method for accessing data stored in a database may include generating a snapshot of a definition of a data story that includes a software widget configured to receive inputs for creating, based on a portion of data stored in the database, a data presentation providing a visual representation of the data. In response to a first indication to apply a filter removing some of the data associated with the data presentation, modifying a runtime definition of the data story to reflect the application of the filter. In response to a second indication to reset the filter, restoring the data story to a state prior to the application of the filter by replacing the runtime definition of the data story with the snapshot of the definition of the data story. Related systems and articles of manufacture are also provided.

Abstract: Provided are a prediction device and the like capable of more accurately simulating an analysis target. The prediction device generates function information for a gene sequence of a living body to be an analysis target based on first model information representing a relevance between sequence information and the function information, the sequence information representing the gene sequence of the analysis target, the function information representing a function potentially expressed by the gene sequence; and generates prediction information representing observation information predicted for the analysis target based on second model information and the function information, the second model information representing a relevance among the function information of the living body, environment information representing an environment around the living body, and the observation information observed for the living body, the function information being generated for the gene sequence of the analysis target.

Abstract: The present invention discloses a gene sequencing data compression preprocessing, compression and decompression method, a system, and a computer-readable medium. The preprocessing method implementation steps include: obtaining reference genome data; obtaining a mapping relationship between a short string K-mer and a prediction character c to obtain a prediction data model P1 containing any short string K-mer in the positive strand and negative strand of a reference genome and the prediction character c in a corresponding adjacent bit. The compression and decompression methods relate to performing compression/decompression on the basis of the prediction data model P1. The system is a computer system including a program for executing the previous method. The computer-readable medium includes a computer program for executing the previous method.

Abstract: The present invention provides a novel approach to matching personality traits, as determined through observational or self-assessment reporting in combination with specific loci and identifiable variations within an individual's nucleotide sequence in the form of SNPs. The present invention further utilizes an individual's cyber footprint, in combination with SNPs and traditional assessment and self-assessment techniques, to define a testing and reinforcement mechanism for strengthening the interdependence and accuracy of each type of reporting in order to bolster the reliability of each alone and in combination.

Abstract: A method may include providing access to a first application programming interface (API) provided by a first party and a second API provided by a second party. The method may also include collecting a first set of API data sources related to the first API and a second set of API data sources related to the second API. The method may additionally include using a deep learning model to predict a privacy trustworthiness level for the first API and the second API, and disabling access to the first API based on the privacy trustworthiness level of the first API being below a threshold level.

Abstract: A method for administration through files in a storage cluster is provided. The method includes distributing user data, including files, throughout a plurality of storage nodes having non-volatile solid-state memory, through erasure coding. The plurality of storage nodes are housed within a single chassis that couples the storage nodes as the storage cluster. The method includes receiving at the storage cluster a command to write a file or read a file, the file having a filename. The method includes determining whether the filename is reserved and determining an administrative action according to the file, responsive to determining that the filename is reserved. The method includes initiating the administrative action. A storage system is also provided.

Abstract: Threads and kernels across multiple server instances may maintain static connections to a database during operation. To apply a patch or other upgrade to the database, a notification may be sent to the database system that causes the database system to redirect new incoming connection requests for the database to a backup database. A second notification may also be sent to each of the server instances where threads maintain active connections to the database. These threads may be allowed to finish executing a current job, then when entering the idle state these threads may be directed to refresh their connections. This refresh operation may be redirected to the backup database. The patch may be applied after all connections have been switched to the backup database. This process switches static connections to the backup database as quickly as possible without interrupting existing thread operations.

Abstract: A system and method for providing transactional data privacy while maintaining data usability, including the use of different obfuscation functions for different data types to securely obfuscate the data, in real-time, while maintaining its statistical characteristics. In accordance with an embodiment, the system comprises an obfuscation process that captures data while it is being received in the form of data changes at a first or source system, selects one or more obfuscation techniques to be used with the data according to the type of data captured, and obfuscates the data, using the selected one or more obfuscation techniques, to create an obfuscated data, for use in generating a trail file containing the obfuscated data, or applying the data changes to a target or second system.

Abstract: In a storage system, processing related to data replication includes associating first control information with a logical volume and a snapshot and second control information with data on a pool volume. Data of the logical volume and the snapshot is managed by associating the first control information with the second control information. A time series of the logical volume and one or more snapshots is managed using generation information associated with the first control information, for each piece of data on the pool volume. Generation information indicating a generation in which the data is created is managed in association with the second control information. Invalidation of the first and second control information asynchronously with a processing of data related to the logical volume and the snapshot is executed. Whether the invalidation is possible is determined by referring to the generation information associated with the first and second control information.

Abstract: Systems and methods are described for management of garbage collection processes in an on-demand code execution system. An on-demand code execution system may execute user-submitted code on virtual machine instances. As each virtual machine instance executes code, garbage (e.g., memory that is allocated and then not properly de-allocated) may accumulate and may reduce the computing resources that the virtual machine instance makes available for allocation to further code executions. A garbage collection schedule manager may be used to generate a system-wide garbage collection schedule and manage garbage collection processes in accordance with the schedule.

Abstract: According to one embodiment, a memory system includes a controller which controls garbage collection for preparing one or more free blocks by writing valid data read from N blocks to one or more blocks of less than the N. The controller calculates a performance ratio between writing of data in response to a request from a host device and writing of data for the garbage collection in accordance with a data writable capacity remaining in a nonvolatile memory, calculates an average performance ratio from calculated performance ratios of M generations including a calculated latest performance ratio, and adjusts a performance cycle of the garbage collection by applying one of the calculated latest performance ratio and the calculated average performance ratio.

Abstract: A file system permission setting method and apparatus, where an access control list (ACL) permission for a parent node is set such that all child nodes of the parent node inherit the ACL permission for the parent node when a semantic type identifier of an access permission for the parent node is a permission root type.

Abstract: Systems, methods, and computer readable media are disclosed for generating one or more improved NFTs are described. For example, a software application embedded with a mobile device may enable a user to search a public and/or private database of videos, select a video from the database, record a selfie-video, audio, or other narration of the video to create a narration file, and create and publish an NFT based on the narration file without leaving the application embedded with the mobile device (e.g., without navigating to a separate token creation platform).

Abstract: Resource provisioning systems and methods are described. In an embodiment, a system includes a plurality of shared storage devices collectively storing database data, an execution platform, and a compute service manager. The compute service manager is configured to determine a task to be executed in response to a trigger event and determine a query plan for executing the task, wherein the query plan comprises a plurality of discrete subtasks. The compute service manager is further configured to assign the plurality of discrete subtasks to one or more nodes of a plurality of nodes of the execution platform, determine whether execution of the task is complete, and in response to determining the execution of the task is complete, store a record in the plurality of shared storage devices indicating the task was completed.

Abstract: A transitive closure data structure is constructed for a pair of features represented in a vector space corresponding to an input dataset. The data structure includes a set of entries corresponding to a set of all possible paths between a first feature in the pair and a second feature in the pair in a graph of the vector space. The data structure is reduced by removing a subset of the set of entries such that only a single entry corresponding to a single path remains in the transitive closure data structure. A feature cross is formed from a cluster of features remaining in a reduced ontology graph resulting from the reducing the transitive closure data structure. A layer is configured in a neural network to represent the feature cross, which causes the neural network to produce a prediction that is within a defined accuracy relative to the dataset.

Abstract: A system for providing data protection services for user data generated by an application, includes persistent storage for storing user data backups and a manager. The manager is programmed to identify a backup generation event for user data based on a protection policy, in response to identifying the backup generation event, obtain user data associated with the backup generation event from the application, select a calendar of calendars included in the user data, obtain user metadata associated with the calendar, and generate a user data backup using the user data and the user metadata, in which the user data backup comprises calendar events of the calendar and portions of the user metadata associated with the calendar events.

Abstract: According to one or more embodiments, lookup, insertion, and deletion operations are allowed to continue during actions required for collision remediation. When relocation operations are used to resolve a collision, information encoded in header portions of the hash table entries that store the key-value pairs indicates when the associated key-value pairs are undergoing relocation. This information facilitates continued access to the RKVS during the relocation process by allowing other processes that access the RKVS to handle relocations without failure. Furthermore, when hash table expansion is needed in order to resolve a collision, a second, larger, hash table is allocated, and lookup operations continue on both the old hash table and the new hash table. One or more embodiments further prevent insertion, lookup, and deletion failures in the RKVS using flags, encoded in header information in hash table entries, that reflect the state of the respective key-value pairs in the store.

Abstract: Techniques are disclosed relating to the distribution of database key permissions. A database system may distribute first permission information to a plurality of database nodes that identifies a distribution of key range permissions to ones of the plurality of database nodes. A given key range permission being distributed to a given database node may permit that database node to write records whose keys fall within a key range associated with the given key range permission. The database system may receive, from a first database node, a request for a first key range permission provisioned to a second database node. The database system may modify the first permission information to derive second permission information that provisions the first key range permission to the first database node instead of the second database node. The database system may distribute the second permission information to ones of the plurality of database nodes.

Abstract: According to various embodiments, with respect to a target set of files being managed (e.g., protected by data snapshots), each file in the target set of files is classified into one of two or more filesets (discontiguous filesets), where each of these filesets comprises one or more files that are related to each other by one or more factors, such as frequency of file change or purpose of existence (e.g., used by a software application). Once classified, files within the target set of files can be uniquely processed by a data management operation (e.g., incremental data snapshot process) according to their association to a discontiguous fileset.

Abstract: A method for referencing and updating objects in a shared resource environment. A reference counter counts is incremented for every use of an object subtype in a session and decremented for every release of an object subtype in a session. A session counter is incremented upon the first instance of fetching an object type into a session cache and decremented upon having no instances of the object type in use in the session. When both the reference counter and the session counter are zero, the object type may be removed from the cache. When the object type needs to be updated, it is cloned into a local cache, and changes are made on the local copy. The global cache is then locked to all other users, the original object type is detached, and the cloned object type is swapped into the global cache, after which the global cache in unlocked.