Abstract: A distributed electronic storage system (DESS) comprises a plurality of computing devices communicatively coupled via one or more network links and having a file system distributed among them. The DESS comprises management circuitry that resides on the first computing device. The management circuitry is operable to generate an indication of a load on a first resource that resides on the first computing device. The management circuitry is operable to receive, via the one or more network links, an indication of a load on a second resource that resides on a second computing device of the plurality of computing devices. The management circuitry is operable to determine a condition of the DESS based on the indication of the load on the first resource and the indication of the load on the second resource.

Abstract: A method and system of audio processing encodes cochlear-simulating spike data into spectrogram data.

Abstract: A plurality of computing devices are communicatively coupled to each other via a network, and each of the plurality of computing devices is operably coupled to one or more of a plurality of storage devices. The computing devices may take snapshots to store points in time coherently for a distributed storage system.

Abstract: A computing device comprising a frontend and a backend is operably coupled to a plurality of storage devices. The backend comprises a plurality of buckets. Each bucket is operable to build a failure-protected stipe that spans two or more of the plurality of the storage devices. The frontend is operable to encrypt data as it enters the plurality of storage devices and decrypt data as it leaves the plurality of storage devices.

Abstract: A plurality of computing devices are communicatively coupled to each other via a network, and each of the plurality of computing devices is operably coupled to one or more of a plurality of storage devices. Data communication is made more efficient by removing the need to copy data in the networking stack, using hardware accelerated end-to-end checksum calculation, and supporting transmission formatting of data and header for special cases.

Abstract: Described are methods and systems for detecting fraud in documents. First images of a first set of genuine documents and second images of a second set of genuine documents are obtained. A printed feature, spacings between printed features in the first images, and positions of printed features in the second images are selected. Selected features, spacings and positions are annotated to obtain original landmark locations for each printed feature, spacing and position. Annotated features, spacings and positions are transformed to obtain transformed features, transformed spacings and transformed positions. The transformed features, spacings and positions are combined with a noise model to generate modified features, modified spacings and modified positions. Each modified feature, modified spacing and modified position comprises annotations indicating modified landmark locations. Input data for a machine learning model is generated using original landmark locations and modified landmark locations.

Abstract: A plurality of failure domains are communicatively coupled to each other via a network, and each of the plurality of failure domains is coupled to one or more storage devices. A failure resilient stripe is distributed across the plurality of storage devices, such that two or more blocks of the failure resilient stripe are located in each failure domain.

Abstract: A plurality of computing devices are communicatively coupled to each other via a network, and each of the plurality of computing devices is operably coupled to one or more of a plurality of storage devices. A plurality of failure resilient stripes is distributed across the plurality of storage devices such that each of the plurality of failure resilient stripes spans a plurality of the storage devices. A graphics processing unit is operable to access data files from the failure resilient stripes, while bypassing a kernel page cache. Furthermore, these data files may be accessed in parallel by the graphics processing unit.

Abstract: Methods and systems are provided for rapid failure recovery for a distributed storage system for failures by one or more nodes.

Abstract: A plurality of computing devices are communicatively coupled to each other via a network, and each of the plurality of computing devices is operably coupled to one or more of a plurality of storage devices. The computing devices may take snapshots to store points in time coherently for a distributed storage system.

Abstract: A distributed electronic storage system (DESS) comprises a plurality of computing devices communicatively coupled via one or more network links and having a file system distributed among them. The DESS comprises management circuitry that resides on the first computing device. The management circuitry is operable to generate an indication of a load on a first resource that resides on the first computing device. The management circuitry is operable to receive, via the one or more network links, an indication of a load on a second resource that resides on a second computing device of the plurality of computing devices. The management circuitry is operable to determine a condition of the DESS based on the indication of the load on the first resource and the indication of the load on the second resource.

Abstract: A plurality of failure domains are communicatively coupled to each other via a network, and each of the plurality of failure domains is coupled to one or more storage devices. A failure resilient stripe is distributed across the plurality of storage devices, such that two or more blocks of the failure resilient stripe are located in each failure domain.

Abstract: A cluster of one or more computing devices is operably coupled to a plurality of storage devices. Each computing device in the cluster comprises a frontend and a backend. The backend comprises a plurality of buckets. Each bucket is operable to build a failure-protected stipe that spans two or more of the plurality of the storage devices. A file system comprises one or more failure-protected stipes. A client other than the one or more computing devices in the cluster is operable to access at least a portion of the file system via a stateless mount string comprising a cryptographically-signed key.

Abstract: Methods and systems are provided for rapid failure recovery for a distributed storage system for failures by one or more nodes.

Abstract: A plurality of computing devices are communicatively coupled to each other via a network, and each of the plurality of computing devices is operably coupled to one or more of a plurality of storage devices. Each computing device is operable to compress one or more blocks of data and append a journal in front of the data. The journal and the data are written concurrently to flash memory. Each computing device is also operable to maintain a metadata registry that records changes in the flash memory. In the event of a power failure, the journal and previous journals may be used to verify the state of the metadata registry.

Abstract: A cluster of one or more computing devices is operably coupled to a plurality of storage devices. Each computing device in the cluster comprises a frontend and a backend. The backend comprises a plurality of buckets. Each bucket is operable to build a failure-protected stipe that spans two or more of the plurality of the storage devices. A file system comprises one or more failure-protected stipes. A client other than the one or more computing devices in the cluster is operable to access at least a portion of the file system via a stateless mount string comprising a cryptographically-signed key.

Abstract: A plurality of computing devices are communicatively coupled to each other via a network, and each of the plurality of computing devices comprises one or more of a plurality of storage devices. A plurality of failure resilient address spaces are distributed across the plurality of storage devices such that each of the plurality of failure resilient address spaces spans a plurality of the storage devices. Each one of the plurality of failure resilient address spaces is organized into a plurality of stripes. Each one or more stripes of the plurality of stripes is part of a respective one of a plurality of forward error correction (FEC) protection domains. Each of the plurality of stripes may comprise a plurality of storage blocks. Each block of a particular one of the plurality of stripes may reside on a different one of the plurality of storage devices.

Abstract: A distributed electronic storage system (DESS) comprises congestion management circuitry and data migration circuitry. The congestion management circuitry is operable to determine an amount of congestion in the DESS. The data migration circuitry is operable to control migration of data stored in a first tier of storage to a second tier of storage based on the amount of congestion in the DESS, characteristics of the data, and characteristics of the first tier of storage.

Abstract: A plurality of computing devices are communicatively coupled to each other via a network, and each of the plurality of computing devices is operably coupled to one or more of a plurality of storage devices. Each computing device is operable to compress one or more blocks of data and append a journal in front of the data. The journal and the data are written concurrently to flash memory. Each computing device is also operable to maintain a metadata registry that records changes in the flash memory. In the event of a power failure, the journal and previous journals may be used to verify the state of the metadata registry.

Abstract: This disclosure describes systems, methods, and devices related to non-linear spectral decomposition with peak self-normalization. A system may comprise a filter bank composed of a plurality of resonators cascaded in series. The system may comprise a controller to drive the filter bank, that may inject a first signal into a first resonator of the plurality of resonators. The controller may utilize a first characteristic frequency of the first resonator to drive the first resonator using the first signal. The controller may generate a first output signal of the first resonator. The controller may utilize the first output signal of the first resonator as a second input signal into a second resonator using a second characteristic frequency. The controller may continue to inject a preceding resonator output as input into a subsequent resonator of the plurality of resonators in series in order to get spectral decomposition with peak normalized characteristics.