Abstract: Systems and methods for reconstructing a namespace in response to a loss of data are described herein. To reconstruct the namespace, metadata super segments within a set of file containers may be located in response to a determination that original namespace metadata associated with files stored within the containers is unreadable. Content handles linking the super segment to metadata for each of the files may then be reconstructed from the super segments. Both inode numbers and M-tree identifiers are also extracted from the super segments for each of the files referenced by the super segments. Then, a plurality of U-trees is assembled by aggregating and linking the inode numbers of the files referenced within the super segments based on the M-tree identifiers. Finally, the recovered namespace metadata tree data structure for all of the files within the plurality of LP containers is assembled by aggregating and linking the U-trees.

Abstract: Source file copying is described. An access object service receives a request to copy a file to a destination and identifies a similarity group identifier for a group of fingerprints corresponding to sequential segments in the file. The access object service communicates a request for the group of fingerprints to a deduplication service associated with a range of similarity group identifiers that include the similarity group identifier. The deduplication service communicates the group of fingerprints, retrieved from fingerprint storage, to the access object service, which communicates the group of fingerprints and the similarity group identifier to the destination.

Abstract: Methods and kits to assess an absorbed dose of ionizing radiation and/or the severity of tissue injury from radiation in a patient. Also, algorithms used to calculate an absorbed dose of radiation based on biomarker measurements of a plurality of biomarkers that are altered relative to a normal control in the event of radiation exposure.

Abstract: A distributed and deduplicating file system that stores backup data to object storage is described. A node, in a cluster of nodes, receives a write operation to back up a data file, and identifies backup data associated with the write operation. The node identifies deduplicated data by deduplicating the backup data. The cluster stores the deduplicated data to each of the buffers which corresponds to a node in the cluster. If the node determines that the size of information, which includes the deduplicated data, stored to each of the buffers has accumulated to become greater than or equal to an object threshold, then the node writes the information, which includes the deduplicated data, stored in each of the buffers to an object storage which stores data for the nodes in the cluster.

Abstract: A distributed and deduplicating file system that stores backup metadata to object storage is described. A node, in a cluster of nodes, receives backup data associated with a write operation to back up a data file, and identifies metadata associated with deduplicated data by deduplicating the backup data. If the access frequency associated with the metadata is greater than or equal to an access threshold, and the size of the metadata is less than or equal to a storage threshold, the cluster writes the metadata to each of the memory devices corresponding to the nodes in the cluster. If the access frequency associated with the metadata is less than the access threshold, or the size of the metadata is more than the storage threshold, the node writes information which includes the metadata to an object storage that stores data objects for the nodes in the cluster.

Abstract: Mapping information identifies ranges of files, a set of front-end microservices, and assignments of the ranges to the front-end microservices. Each front-end microservice is thereby responsible for a range of files. The files are represented by segment trees and the front-end microservices handle operations involving an upper-level of the segment trees. A file system request on a file is directed to a particular front-end microservice that is responsible for handling a particular range of files within which the file falls according to the mapping information. An indication is received from a container orchestration service that a number of front-end microservices has changed. The mapping information is updated based on the change in the number of front-end microservices.

Abstract: This invention relates to compositions and methods for modifying homeodomain-leucine zipper transcription factor (HD-Zip) genes in plants. The invention further relates to plants having improved yield characteristics produced using the methods and compositions of the invention.

Abstract: The present invention relates to a non-invasive cardiac monitoring device that records cardiac data to infer physiological characteristics of a human, such as cardiac arrhythmia. Some embodiments of the invention allow for long-term monitoring of physiological signals. Further embodiments allow for processing of the detected cardiac rhythm signals partially on the wearable cardiac monitor device, and partially on a remote computing system. Some embodiments include a wearable cardiac monitor device for long-term adhesion to a mammal for prolonged detection of cardiac rhythm signals.

Abstract: In some embodiments, a method inserts, by a first computing device, a first value for a capability in a first message that is used in a process to automatically exchange capability values with a second computing device. The first value for the capability indicates the first computing device requires a default route to reach the second computing device as a next hop for sending a packet to a destination. The first computing device sends the first message to the second computing device; and receives a second value for the capability in a second message from the second computing device. The second value indicating the second computing device will send the default route to reach the second computing device. When the default route is received from the second computing device, the first computing device stores the default route from the second computing device in a route table.

Abstract: A deduplicated file system includes a set of microservices including front-ends and back-ends. Assignments of files are balanced across front-ends. The files are represented by segment trees including multiple segment levels. Assignments of similarity groups are balanced across back-ends. Similarity groups are associated with segments at a lower-level of the segment trees that form the files. Front-ends are responsible for operations involving an upper-level of the trees. Back-ends are responsible for operations involving the lower-level of the trees. A mapping of file assignments to front-ends and of similarity group assignments to back-ends is stored. A request to perform a file system operation is received. The mapping is consulted to identify particular front and back-ends that should be responsible for handling and processing the request.

Abstract: Embodiments are described for a multi-domain and multi-tier architecture for clustered network file systems. This system allows a user to create sub-cluster of physical nodes, called domains, and file system resources for the data placed in a domain are allocated only from the nodes in the domain. It limits the impact of system failures to the files within a domain. A file system redirection service manages a global namespace spanning the domains and redirects file accesses to the appropriate domain where it is stored. In each domain, there are different classes of storage, tiers, with different cost and performance characteristics. Files can be placed on a set of tiers depending on a storage level agreement (SLA) specified for a file. Tier examples include a higher performance tier consisting of SSDs and a lower performance tier of HDDs.

Abstract: Metadata of a file system is maintained in a key value store. The metadata includes a namespace represented as a B+ tree having pages written to the key value store. Identifiers to the pages include a snapshot identifier and a page number. The identifiers are stored as keys in the key value store. The snapshot identifiers are used to track pages that are shared between first and second snapshots. Upon a request to write to an existing page, a determination is made from the snapshot identifiers as to whether the existing page belongs to the first or second snapshot. If the existing page belongs to the second snapshot, the write to the existing page is allowed. If the existing page belongs to the first snapshot, a copy on write (COW) is performed to generate a new page for the write.

Abstract: Techniques and architecture are described for protecting non-http and TCP/UDP applications in a zero trust network access (ZTNA)/web virtual private network (VPN) environment by establishing a secure communication channel between a native application and an application server providing an application service. More particularly, the present disclosure describes techniques and architecture that leverage the firewall wherein a thin client on a client device enables a client desktop, establishes a secure channel from a native application, e.g., the client desktop, to the firewall, and acts as a proxy.

Abstract: A cluster service receives a cluster message based on a removal of a first service from membership in a first node in a cluster, and requests a shared storage to generate and then provide a new access key, thereby enabling the shared storage to use the new access key to validate requests to access resources stored by the shared storage. The cluster service receives the new access key from the shared storage, and sends the new access key in at least some cluster messages to at least a second service in a second node in the cluster of nodes. The second service creates a key based on the new access key. The second service uses the key to create a request to access a resource stored by the shared storage, sends the request to the shared storage, and then accesses the resource, which was previously accessed by the first service.

Abstract: A fencing service receives a cluster message based on a first service's removal from membership in a first node in a cluster, and generates an access key based on a generation identifier in the cluster message. The fencing service sends the access key to a shared storage, thereby enabling the shared storage to create signing keys based on the access key, and which are used to validate signed requests to access resources stored by the shared storage. A second service in a second node in the cluster receives the cluster message, and generates the access key based on the generation identifier. The second service accesses a resource previously accessed by the first service, by generating a signing key based on the access key and a request to access the resource stored by the shared storage, and then sending the request signed by the signing key to the shared storage.

Abstract: Embodiments for a system and method for secure authentication of backup clients in a way that eliminates the need to create users for backup client authentication anywhere in the backup ecosystem, and which eliminates the need for credentials, such as passwords that need protection, updating and synchronization. Such embodiments use a short-term token, such as a JSON web token, for both client and server authentication within the system, and verifies that the tokens grant access using the public key corresponding to the private key assigned to the directory objects by the creator of the directory objects.

Abstract: This invention relates to compositions and methods for modifying IDEAL PLANT ARCHITECTURE 1 (IPA1) genes, or orthologues thereof, encoding SQUAMOSA PROMOTER BINDING PROTEIN-LIKE (SPL) transcription factors in plants. The invention further relates to plants and/or parts thereof comprising one or more mutations in endogenous IPA1 genes, or orthologues thereof, produced using the methods and compositions of the invention.

Abstract: In some embodiments, a method inserts, by a first computing device, a first value for a capability in a first message that is used in a process to automatically exchange capability values with a second computing device. The first value for the capability indicates the first computing device requires a default route to reach the second computing device as a next hop for sending a packet to a destination. The first computing device sends the first message to the second computing device; and receives a second value for the capability in a second message from the second computing device. The second value indicating the second computing device will send the default route to reach the second computing device. When the default route is received from the second computing device, the first computing device stores the default route from the second computing device in a route table.

Abstract: Embodiments for performing load balancing in a filesystem of a distributed network comprising worker nodes accessing shared resources that are controlled by distributed locks to grant and prevent access from clients, by assigning a range of directory entries to each worker node, and providing feedback from each worker node to a load balancer to expose an internal state of acquired resources and other parameters of each worker node. In response to periodic updates of the directory ranges to be collocated, the system maintains directory ranges in each worker so that complete subtrees of the directory tree fit in a single range assigned to a worker. Upon receipt of a client request to access a data asset, the load balancer selects the most optimum worker to satisfy the request based on the worker internal states and other parameters.

Abstract: In one example, a method for writing data includes receiving a write request and performing a first type of logging process in connection with the write request, and creating a corresponding first logging record. Additionally, a second type of logging process is performed in connection with the write request, and a corresponding second logging record created, where the second type of logging process is different from the first type of logging process. Next, a determination is made, as between the two logging records, which of the logging records requires the least amount of non-volatile random access memory (NVRAM), and the logging record that requires the least amount of NVRAM is written to the NVRAM.