Abstract: A method is provided for challenge-response authentication between a verifier and a prover. In the method, a challenge is received from the verifier, the challenge for verifying an identity of the prover. The challenge is computed using a first verifier key. The prover computes a response to the challenge using a first prover key. The prover also computes a delay time for delaying transmission of the response to the verifier using a second prover key and a delay computation function. The response is transmitted by the prover to the verifier at the computed delay time. The response is verifiable by the verifier using the first verifier key. An arrival time of the response is verifiable by the verifier using a second verifier key. In another embodiment, a device for providing a delayed response is provided.

Abstract: An image processing circuitry configured to: store, based on an obtained command, a first image identifier of first image data or the first image data on a write-once-read-many memory, wherein the first image identifier is generated based on the first image data such that it is unique for the first image data.

Abstract: An apparatus configured for offloading system service tasks to a processing-in-memory (“PIM”) device includes an agent configured to: receive, from a host processor, a request to offload a memory task associated with a system service to the PIM device; determine at least one PIM command and at least one memory page associated with the host processor based upon the request; and issue the at least one PIM command to the PIM device for execution by the PIM device to perform the memory task upon the at least one memory page.

Abstract: Systems and methods for exporting data from a cloud server and/or importing data to a cloud server are disclosed. The method for exporting data includes receiving a plurality of event records. Each event record includes information about an update to application data of an application. The computer-implemented method further including storing the plurality of event records in near real-time in a predefined storage location and in response to a client export request, creating one or more backup files based on the stored event records in the predefined storage location, and allowing export of the one or more backup files to a local client storage location.

Abstract: The technology disclosed relates to systems and methods for device-dependent display of an article from a PDF file that has multiple articles and a table of contents to the articles. The system can use a library to render the article from the PDF file. The rendering can include bounding boxes positioned at on-page coordinates that can include one or more images and multiple text blocks of glyphs. The system can detect at least one table in the PDF file that includes pages numbers and multiple columns. The system includes logic to partition a contiguous sequence of text representing the table into text blocks of entries and columns. The system includes logic to merge multiple text blocks that align horizontally with a single page number into a single text block. Table of contents is displayed in a device-dependent format including the entries from the merged text blocks.

Abstract: A object data backup and restore method and system provide for identifying an object from a first entity space in a cluster of a client compute environment; generating a snapshot of the object; copying the volume data to a second entity space in the cluster; detecting that the first entity space has been deleted from the cluster; receiving a request to restore the object to a point-in-time version associated with the snapshot; and restoring, via the snapshot tool, the object using the volume data copied to the second entity space and the content data of the snapshot.

Abstract: A better compromise between encoding complexity and achievable rate distortion ratio, and/or to achieve a better rate distortion ratio is achieved by using multitree sub-divisioning not only in order to subdivide a continuous area, namely the sample array, into leaf regions, but using the intermediate regions also to share coding parameters among the corresponding collocated leaf blocks. By this measure, coding procedures performed in tiles—leaf regions—locally, may be associated with coding parameters individually without having to, however, explicitly transmit the whole coding parameters for each leaf region separately. Rather, similarities may effectively exploited by using the multitree subdivision.

Abstract: A method for placing, routing and using compute units and memory units in a reconfigurable computing grid includes receiving a placement graph for a computing task that defines a set of unplaced memory units, a set of unplaced compute units and data connections between the unplaced memory units and the unplaced compute units, the data connections comprising primary connections corresponding to the primary ports of the unplaced compute units and secondary connections corresponding to the secondary ports of the unplaced compute units. The method also includes forming a subgraph for each unplaced memory unit having a primary connection, each subgraph comprising the unplaced memory unit and each unplaced compute unit connected to the unplaced memory unit via a primary connection. The method also includes placing each formed subgraph as a cluster on the reconfigurable computing grid. A corresponding computer program product and system are also disclosed herein.

Abstract: An area of a graphical user interface that potentially comprises an actionable graphical object is identified. An actional graphical object is an object that generates an event when clicked on. For example, an actional graphical object may be a button, a menu, a menu item, a check box, a text field, a text area, a tab, and/or the like. A cursor movement is generated in the area of the graphical user interface (e.g., using a grid). The cursor movement uses a scanning process to a detect a change in a cursor type (e.g., from an arrow cursor to a link cursor). In response to detecting the change in the cursor type, the actionable graphical object is identified in the area of the graphical interface. The actionable graphical object may then be integrated into a testing process to validate the graphical user interface.

Abstract: A method for efficient journal truncation is provided. A method for journal truncation includes maintaining a journal in a memory of a computing system including a plurality of records. Each record indicates a transaction in an ordered data structure. The method includes maintaining a truncation queue in the memory including one or more entries. Each entry in the truncation queue includes a physical on-disk offset associated with a different record of the plurality of records. The method includes determining to truncate the journal and truncating records, of the plurality of records, from the journal starting from a beginning record in the journal up to the record with the physical on-disk offset associated a least recent entry of the one or more entries in the truncation queue, where the truncating includes removing the records from the memory.

Abstract: A computer-implemented method of context-based constraint modification is disclosed. The method comprises receiving a data sharing request in a distributed database system to share a data model between databases. The method further comprises adjusting a data sharing constraint applicable to the data sharing request based on data related to previous data sharing processes, the data sharing constraint being related to data transmission or validation, access control, or conflict resolution. The method additional comprises determining that the data sharing request requires data merging; reading a data file containing a shareable version of at least a portion of the data model subject to the data sharing constraint; and merging the shareable version with a current data model for a database of the databases.

Abstract: Methods and systems for authentication, immutability and trusted timestamping of large audit event logs reported by electronic platforms are disclosed. In an embodiment, a method involves: audit log events aggregation into timeframe aligned data blocks, reporting of data block hashes into blockchain database for authentication, immutability and trusted timestamping. An aspect of the method involves achieving authentication, immutability and trusted timestamping guarantees for audit log events with low computational and networking overhead due to utilization of blockchain database consensus protocol only for batched event data blocks rather than for separate events. Multiple events during specific period of time are grouped into separate data block and cryptographic hash of the whole block is reported to blockchain database to ensure its authentication, immutability and trusted timestamping.

Abstract: Various embodiments are described for tracking and enabling access to information about key access patterns for database tables managed by a database service of a service provider network. Storage nodes can store data as key-value pairs (or key-document pairs), where the records or documents of a database are addressed by a unique key for each record. The storage nodes over time receive requests to perform various operations (for example, to get, put, update, or delete data in a table) associated with records stored by the storage nodes. Key access information extractors collect information regarding the keys accessed and send the information to a key tracking service. Key tracker nodes of the service can collect the data and send it to aggregator nodes. The aggregator nodes can determine a frequency with which such requests are received for keys of a partition or table to which the aggregator node is assigned.

Abstract: A data management system (DMS) may facilitate the storage tiering of snapshots on cloud environments. For example, the DMS may transmit snapshot signaling to a first cloud environment that instructs the first cloud environment to capture a first snapshot of a computing object and to store the first snapshot in a first type of cloud storage at the first cloud environment. The DMS may determine that the first snapshot has been stored in the first type of cloud storage for a duration of time that satisfies an archival threshold. Based on the archival threshold being satisfied, the DMS may transmit archival signaling that instructs the first cloud environment to store the first snapshot to a second type of cloud storage. The second type of cloud storage may be associated with a longer access latency than the first type of cloud storage.

Abstract: A better compromise between encoding complexity and achievable rate distortion ratio, and/or to achieve a better rate distortion ratio is achieved by using multitree sub-divisioning not only in order to subdivide a continuous area, namely the sample array, into leaf regions, but using the intermediate regions also to share coding parameters among the corresponding collocated leaf blocks. By this measure, coding procedures performed in tiles—leaf regions—locally, may be associated with coding parameters individually without having to, however, explicitly transmit the whole coding parameters for each leaf region separately. Rather, similarities may effectively exploited by using the multitree subdivision.

Abstract: A method for performing data backup includes: receiving a backup request specifying a file where the file is stored in a shared storage. Additionally, in response to the backup request: retrieving, by a primary data node, properties of the file; determining, by the primary data node, resource availability for plurality of secondary data nodes where the primary data node and the plurality of secondary data nodes is operatively connected to the shared storage and a backup storage; logically dividing, by the primary data node, the file into a plurality of segments using at least the properties of the file; and coordinating, by the primary data node, the backup of the file using the plurality of segments and the resource availability of the plurality of secondary data nodes.

Abstract: A computer-implemented method for displaying real-time code of embedded code in a browser-window of a software-application. The computer-implemented method includes collecting processes related to software applications running on an OS by using an API. For each process: searching for browser windows including elements used to collect or manipulate data on the browser-window to yield a list of browser-windows; receiving a selection of a browser-window; casting elements used to collect or manipulate data on the browser-window of the selected browser-window into a related object that is implementing an interface and storing it with an associated address of the browser-window in a database; and presenting real-time code of the elements used to collect or manipulate data on the browser-window to enable errors inspection therein and real-time updates of the code of the elements used to collect or manipulate data on the browser-window, via the interface of the related object.

Abstract: Provided herein are systems and methods for global data objects on a data platform where the global data objects are accessible at an organization level. In particular, an organization-level global data object provided by various embodiments can be used as a generic organization object that is owned by a specific organization, and can be managed (e.g., created, deleted, or modified) by use of a leader-based model.

Abstract: Disclosed is an encoding system and associated methods for generating a graph-integrated tree-based representation of data that provides for direct lateral traversals of nodes in a each layer of the tree-based representation. The encoding system organizes data from a dataset to a tree-based representation with multiple layers and multiple nodes in each layer. The encoding system detects the nodes in each layer, and defines a graph structure that links the nodes in each layer for direct lateral access. The encoding system searches the tree-based representation in response to a query for a particular subset of the data by performing a single downward traversal to a particular layer with individual nodes that satisfy part of the query, and by laterally traversing the nodes in the particular layer using the graph structure to directly access a second node in the particular layer from a first node in the particular layer.

Abstract: A better compromise between encoding complexity and achievable rate distortion ratio, and/or to achieve a better rate distortion ratio is achieved by using multitree sub-divisioning not only in order to subdivide a continuous area, namely the sample array, into leaf regions, but using the intermediate regions also to share coding parameters among the corresponding collocated leaf blocks. By this measure, coding procedures performed in tiles—leaf regions—locally, may be associated with coding parameters individually without having to, however, explicitly transmit the whole coding parameters for each leaf region separately. Rather, similarities may effectively exploited by using the multitree subdivision.

Abstract: One or more computing devices may comprise congestion management circuitry, one or more client file system request buffers, and DESS interface circuitry. The one or more client file system request buffers is/are operable to queue first client file system requests of a first priority level and second client file system requests of a second priority level, where the first priority level is higher priority than the second priority level. The DESS interface circuitry is operable to determine a choking level according to the load on a plurality of DESS resources. Individual load values of the DESS resources are mapped to a composite load value using a first function. The composite load value is mapped to a congestion contribution using a second function. And, the congestion contribution is mapped to a choking level using a third function.

Abstract: Techniques described herein relate to a method for managing migrations of applications. The method may include identifying, by a verification manager associated with an execution environment, an application potential migration event associated with an application; in response to identifying the application potential migration event: obtaining application configuration information associated with the application; making a determination that the application configuration information indicates the execution environment is capable of hosting the application; generating potential migration information associated with the execution environment and the application; and sending an affirmation and the potential migration information to the application.

Abstract: Provided herein are systems and methods for global data objects on a data platform where the global data objects are accessible at an organization level. In particular, an organization-level global data object provided by various embodiments can be used as a generic organization object that is owned by a specific organization, and can be managed (e.g., created, deleted, or modified) by use of a leader-based model.

Abstract: A multi-lender architecture evaluates applicant data against lending rule sets of multiple lenders. Rule sets provided by different lenders may be expressed differently. The multi-lender architecture transforms the rules in each rule set and represents the rules in a normalization grid. The normalization grid allows a single algorithm to evaluate the rules of different lenders.

Abstract: A better compromise between encoding complexity and achievable rate distortion ratio, and/or to achieve a better rate distortion ratio is achieved by using multitree sub-divisioning not only in order to subdivide a continuous area, namely the sample array, into leaf regions, but using the intermediate regions also to share coding parameters among the corresponding collocated leaf blocks. By this measure, coding procedures performed in tiles—leaf regions—locally, may be associated with coding parameters individually without having to, however, explicitly transmit the whole coding parameters for each leaf region separately. Rather, similarities may effectively exploited by using the multitree subdivision.

Abstract: There is provided an information processor, an information processing method, and a recording medium to automatically estimate a sense of values of a community. The information processor includes a control unit that performs a control. The control unit acquires sensor data obtained by sensing a member who belongs to a specific community, and automatically estimate a sense of values of the member who belongs to the specific community, on the basis of the acquired sensor data.

Abstract: A method of maintaining an index of time-series data records held in a data store comprises identifying one or more time-series data records not currently indexed in a binary tree structure and corresponding with a time range, and creating a new leaf node. Start-time and end-time fields of the new leaf node are populated with values encompassing the time range corresponding with identified time-series data records. The binary tree structure is updated such that the new leaf node is added as a first or second child node of a parent node representing a time range encompassing the values of the start-time and end-time fields of the new leaf node. Existence of the new leaf node in the binary tree structure is thereby indicative of existence of the one or more identified time-series data records in the data store.

Abstract: The technology disclosed relates to systems and methods for device-dependent display of an article from a PDF file that has multiple articles and a table of contents to the articles. The system can use a library to render the article from the PDF file. The rendering can include bounding boxes positioned at on-page coordinates that can include one or more images and multiple text blocks of glyphs. The system can detect at least one table in the PDF file that includes pages numbers and multiple columns. The system includes logic to partition a contiguous sequence of text representing the table into text blocks of entries and columns. The system includes logic to merge multiple text blocks that align horizontally with a single page number into a single text block. Table of contents is displayed in a device-dependent format including the entries from the merged text blocks.

Abstract: Techniques are disclosed relating to tree data structures capable of storing information indicative of database keys. A computer system may operate a database. The computer system may store a multi-level tree data structure usable to perform key lookups for the database. In various cases, the multi-level tree data structure may be stored in system memory as a plurality of subtree data structures each comprising a set of linked nodes. A given one of the plurality of subtree data structures may be stored as a respective continuous block of information in system memory. The computer system may access the respective continuous block for a first particular subtree data structure encompassing a particular range of levels in the multi-level tree data structure. The accessing may be performed without accessing one or more other subtree data structures encompassing one or more levels within the particular range of levels.

Abstract: An improved data storage system and apparatus including an improved storage controller that provides storage compute functionality that enables the acceleration of datacenter software, and that enables easier deployment of application software portions onto storage devices, in a manner that supports runtime performance acceleration of network-latency-throttled applications. Mechanisms and methods are provided for server hosted applications to initiate deployment of, initiate execution of, and interoperate with a multitude of softwares on a multitude of storage devices, where these softwares execute proximate to storage contents on the storage devices.

Abstract: A system for performing digital rights protected content playing includes a computing platform having a hardware processor and a memory storing a software code. The hardware processor executes the software code to receive, from a first user, metadata identifying one or more content segment(s), determine whether the first user has a right to access the content segment(s), produce a playlist using the metadata when the first user has the right, and output the playlist to the first user and/or a second user. The hardware processor may further execute the software code to receive the playlist from the second user, determine each content segment identified by the playlist that the second user has a right to access, generate a content compilation that omits any content segment identified by the playlist to which the second user lacks the right, and playout the content compilation to the second user.

Abstract: Systems and methods described herein include receiving, at a network device, a message including an identifier associated with a subscriber and an identifier associated with a rating group associated with one or more data flows and determining a data quota and one or more usage monitoring thresholds associated with the subscriber. The data quota indicates a first amount of data associated with the rating group that the subscriber is authorized to use during a time period and the one or more usage monitoring thresholds indicate one or more second amounts of data associated with the rating group and one or more service flows that the subscriber is authorized to use during the time period. The network device transmits the data quota and the one or more usage monitoring thresholds, receives data usage information, and processes the data usage information.

Abstract: In various embodiments, methods and systems for providing access to file systems are provided. An SFA-based operation having an operation modifier for a file in a file system is received. The SFA-based operation is defined based on a file-representational state transfer (REST) interface. The SFA-REST interface comprises integrated functionality of an SFA protocol and REST protocol. The SFA-based operation is executed using the operation modifier. A REST-based operation for the file in the distributed file storage is received. The REST-based operation is defined based on the SFA-REST interface. The operation modifier is referenced in order to execute the REST-based operation. The REST-based operation based on the SFA-REST interface. A schema can be implemented for accessing the file system. The schema includes tables to store files, the table comprises fields corresponding to elements of a SFA-REST interface. A snapshot component can be implemented to backup file shares in the file system.

Abstract: In response to receiving a flow of data, one or more operators in a parallel region included in a distributed data processing system for stream processing the flow of data are initialized. In response to identifying a change to the flow of data or a change to the distributed data processing system, at least one of the flow of data and a size of the parallel region included in the distributed data processing system are dynamically adjusted. The flow of data is processed via the dynamically adjusted one of the flow of data and the parallel region included in the distributed data processing system.

Abstract: Presented herein are methods, non-transitory computer readable media, and devices triggering a metadata recovery process within a network storage system, which include: dividing metadata into metadata segments, wherein each of the metadata segments is tasked to perform a specific file system operation function, validating each of the metadata segments during the specific file system operation function; upon failure to validate at least one of the metadata segments, triggering an automatic repair process while maintaining the operation function tasked to the metadata segment, and upon finalizing the automatic repair process, resuming the specific file system operation function tasked to the metadata segment.

Abstract: Implementations are described for selectively publishing an event responsive to an operation on a database in a transaction. Publishing the event is delayed or not delayed respectively, responsive to determining that a value of an attribute for the event indicates that publishing the event is to be delayed, or not to be delayed, until the transaction is rolled back or committed. If publishing the event is delayed, the event is published if the transaction is committed and discarded if the transaction is rolled back. If publishing the event is not delayed, the event is published. Optionally, if the event is published, the event is published in a database or a datastore respectively, responsive to determining whether another value of another attribute for the event indicates that the event is to be published in a database or a datastore.

Abstract: Generating unique document identifiers from content within a selected page region is disclosed. A selection of a first region within a first page of the documents is received from a user, and is defined by a set of first boundaries relative to the first page. A text string of a first base selection page content within the first region is retrieved from the first page. Then the retrieved text string is assigned to a page location index associated with the first page. A text string of a first replicated selection page content is retrieved from a second page. The first replicated selection page content is included in the same first region defined by the set of first boundaries relative to the second page. The retrieved text string of the first replicated selection page content is assigned to a page location index of the second page.

Abstract: Methods, non-transitory machine readable media, and computing devices that ensure correctness of file system analytics are disclosed. With this technology, a first generation number for a volume is incremented in response to a modification of a rule set that defines properties of objects of a file system associated with the volume. A determination is made when a second generation number in a first inode for a first one of the objects matches the first generation number. The first inode is identified based on a traversal of a directory tree associated with the file system. The modified rule set is applied to the properties for the first one of the objects to obtain values, when the second generation number fails to match the first generation number. Analytics data is output after the traversal has completed. The analytics data is generated in response to a query and is based on the values.

Abstract: Provided are a data archiving method and apparatus capable of providing a remote near-line data archiving function by receiving remote function invoking from a target system in which data is stored, providing the target system with a first function for archiving, in a storage system, at least some of the data stored in the target system over a network in response to the remote function invoking, and providing the target system with a second function for the query of the data archived in the storage system over the network.

Abstract: A system and method allows a matching system to mediate requests for information among different computer systems without storing information that can be used to log into those computer systems.

Abstract: A method includes executing an instruction to execute a query for a data block, the data block associated with a corresponding memory level of a logarithmic number of memory levels (li) of memory, each memory level (li) including physical memory (RAMi) residing on memory hardware of a distributed system. The method also includes retrieving a value associated with the data block from an oblivious hash table using a corresponding key, and extracting un-queried key value pairs from the oblivious hash table associated with un-queried data blocks after executing a threshold number of queries for data blocks. The method also includes a multi-array shuffle routine on the extracted key value pairs from the oblivious hash table to generate an output array containing the un-queried key value pairs.

Abstract: A computer-implemented method and system for arranging, in an ordered hierarchy, attached files as transferred during a discourse history. The computer implemented method includes accessing discourse data associated with a history of discourse communications. In embodiments, the discourse data includes a plurality of discourse attachments transferred in accordance with the history, and the discourse attachments include multiple versions of at least one discourse attachment within the plurality. The method further includes deriving a discourse attachment arrangement (DAA) component based at least in part on the discourse data. The method includes outputting, based at least in part on the DAA component, the multiple versions of the at least one discourse attachment arranged in a hierarchical order.

Abstract: The present invention relates to a computer-implemented method for the signed registration of a file, preferably a PDF-based document, by a user in a blockchain, said method comprising the steps of: (a) receiving said file from said user; (b) processing said file and calculating a hash for said file, said step (b) comprising the sub-steps (b.i) processing said file by creating and/or revising a file identifier comprised in said file so that it is unique with respect to the blockchain, obtaining a uniquely identified file; (b.ii) calculating the hash of said uniquely identified file comprising said file identifier with a cryptographic hash function; (b.iii) optionally, determining if the hash obtained in step (b.ii) is unique with respect to the blockchain and if so, ending step (b); if not, resuming from step (b.i); (c) establishing a file reference taking into account said hash; and (d) registering said file reference in the blockchain.

Abstract: An embodiment involves persistent storage and one or more processors. The persistent storage may contain a plurality of hardware models specifying types of computing devices, wherein the hardware models include attributes representing manufacturer names, product names, and model numbers of the computing devices. The processors may be configured to: obtain, from the persistent storage, a hardware model; calculate a hash value over attributes of the hardware model; compare the hash value to hash values in a curated list, the curated list including normalized hardware models that map the hash values to normalized manufacturer names, normalized product names, or normalized model numbers; determine that the hash value matches a particular hash value for a normalized hardware model; and update, in the persistent storage, the hardware model to include at least one of a normalized manufacturer name, a normalized product name, or a normalized model number associated with the normalized hardware model.

Abstract: Disclosed are various examples for remotely managing passwords using local security policies. A client device can be enrolled with a management service. The management service then transmits a password policy requiring a password hint to be defined by the user. A management component executed on the client device can then enforce the password policy by requiring a user to define a password hint in order to access enterprise resources.

Abstract: A system and method allows a matching system to mediate requests for information among different computer systems without storing information that can be used to log into those computer systems.

Abstract: A document management apparatus provides an electronic document management service for managing electronic documents by storing the electronic documents in plural folders. The document management apparatus includes a processor configured to cause a learner to learn such that the learner specifies a folder in which an electronic document is stored, based on content of the electronic document stored in the folder and a service attribute assigned to the electronic document by the electronic document management service, and specify a storage destination folder in which a new electronic document is to be stored, based on content of the new electronic document and a service attribute of the new electronic document.

Abstract: Provided is an edit unit that checks, as time data, a designated time received in an input unit, against a map data DB to identify map data corresponding to the designated time. Upon the receipt of the designated time in the input unit, a map-data generating unit redoes the update of the map data, identified by the edit unit, using measurement data newly acquired after the designated time is received in the input unit.

Abstract: Techniques are described herein that are capable of selecting checkpoints of a database job. For instance, at compile time, temporal indicators associated with the query plans of the database job are determined. Each temporal indicator indicates first and second subsets of stages of the respective query plan. Values of attributes of each stage in at least each first subset are predicted using a machine learning technique. At the compile time, candidate stage(s) for each query plan are identified based on the respective candidate stage being a child of stage(s) in the corresponding second subset or not being a child of another stage in the respective query plan. The candidate stage(s) for each query plan are selectively chosen as respective checkpoint(s) based on whether the values of the attributes of each stage in at least the first subset of the stages of the respective query plan satisfy one or more criteria.

Abstract: The described technology is generally directed towards distributing data fragments and coding fragments of a protection group among storage entities (e.g., nodes or disks) based on affinity levels (e.g., maintained in an affinity matrix) that represent dependency relationships between the storage entities with respect to storing protection groups. The technology operates to distribute a protection group's components such that the affinity level between any pair of storage entities is approximately the same as any other pair. In the event of a storage entity failure, as a result of the affinity-based distribution of the protection group components needed for data recovery, a larger number of the other storage entities can be involved in the data recovery (relative to the number likely involved without affinity-based distribution). This tends to assure a better load balance and faster data recovery.