Abstract: A data resiliency layer provides manageable data resiliency policy options for email related applications. Through one or more APIs such applications are enabled to query whether a data resiliency policy is satisfied for a given mailbox or database at a given point in time. Email related applications may consume this information to modify their behavior such as to wait, repeat, or fail the actions at hand to the point where data committal is guaranteed to a degree specified by the data resiliency policy.

Abstract: Optimizations for data transmission may be provided. A portion of a data block may be read into a batch by a read thread on a first server. The batch may be passed to a transmission thread. The transmission thread may then transmit the first batch to a second server while the read thread asynchronously reads a second portion of the data block into another batch.

Abstract: Incremental change synchronization for moving large data sets may be provided. Source data to be moved may be identified and a snapshot of the data may be created. The data may be moved to a new datastore and a second snapshot may be created. The snapshots may be compared to identify any data elements that have been modified and the modified elements may be copied to the new datastore.

Abstract: Distributed mailbox data replication agents are employed to adjust load on mail system resources by enabling the agents to receive a throttling policy, resource capacity, and current usage information. Each agent preparing to access the resource (e.g. provide replicated data) may then throttle itself ensuring optimum resource usage. The agents may receive the information by querying the resource, which monitors accessing agents and their types, or from a shared space instead of directly from the resource.

Abstract: A data resiliency layer provides manageable data resiliency policy options for email related applications. Through one or more APIs such applications are enabled to query whether a data resiliency policy is satisfied for a given mailbox or database at a given point in time. Email related applications may consume this information to modify their behavior such as to wait, repeat, or fail the actions at hand to the point where data committal is guaranteed to a degree specified by the data resiliency policy.

Abstract: A data replication mechanism is proposed that relies on existing federation infrastructure enabling distributed authentication instead of storing and using explicit credentials for a remote forest. The data replication mechanism requests a federation token with data replication capabilities targeted to the remote forest and passes this token to the remote forest in lieu of explicit credentials.

Abstract: Described are embodiments directed to processing write requests using designated servers with global knowledge of information within a distributed system. The designated servers are used to enforce a data rule that limits the data that may be written to the distributed system. In order to ensure that data written to the distributed system is consistent with the data rule, when another server within the distributed system receives a request to write information that is subject to the data rule, it must consult with one of the designated servers before it can accept the write request. If the designated server determines that the data is consistent with the data rule, the write request is approved. Otherwise, the write request is denied.

Abstract: A data store is distributed between a server and a client. The distributed data store includes global data. A transformation is applied to the global data to generate client-specific data based on the global data. The client-specific data is stored on the client which uses the client-specific data to perform tasks relating to the client-specific data.

Abstract: A cyclic graph may be partitioned. The partitions of the cyclic graph may include an acyclic component of the cyclic graph and a set of partitioned links. The partitions of the cyclic graph may have a particular order. The elements of the cyclic graph may be serialized with a particular serialization order. The serialization order of the elements of the cyclic graph may correspond to the order of the partitions of the cyclic graph. The elements of the acyclic component of the cyclic graph may be serialized before the elements of the set of partitioned links. A computer system may include a graph synchronization component configured to partition the cyclic graph and determine the serialization order of the elements of the cyclic graph. A serialization of the cyclic graph does serialize the elements of the cyclic graph in the determined serialization order.

Abstract: Systems, methods, computer-readable media and application program interfaces are disclosed for enabling server applications to verify purported authentication information, such as passwords, provided by clients in connection with server access requests by leveraging trusted credentials maintained by separate trusted authorities. In some cases, the server applications may lack trusted credentials that may be used to verify the purported authentication information. In those cases, the server applications may identify security principal accounts managed by the separate trusted authorities for which the provided authentication information may be purported to be valid for by the requesting clients. Further, the server applications may request the separate trusted authorities to authenticate the purported authentication information before granting access to the requesting clients.

Abstract: The embodiments generally relate to systems and methods for determining changes in a directory schema. In embodiments, directory changes are recorded in a change log. The change log may have one or more entries. A determination is made as to which change log entries should be retrieved. Once retrieved, the directory schema changes are determined. In embodiments, the directory changes are then interpreted for presentation to a user.

Abstract: Described are embodiments directed to processing write requests using designated servers with global knowledge of information within a distributed system. The designated servers are used to enforce a data rule that limits the data that may be written to the distributed system. In order to ensure that data written to the distributed system is consistent with the data rule, when another server within the distributed system receives a request to write information that is subject to the data rule, it must consult with one of the designated servers before it can accept the write request. If the designated server determines that the data is consistent with the data rule, the write request is approved. Otherwise, the write request is denied.

Abstract: Embodiments of the systems and methods expose a form of backup data, referred to as snapshot data, to an online server. The snapshot data is copy of the directory system at a time in the past. The snapshot data, in embodiments, is exposed as an LDAP server database, which can be manipulated by one or more tools. Thus, the snapshot data is available to online servers to view, to compare, to restore, or to accomplish other actions on the data within the snapshot without server downtime.

Abstract: A data store is distributed between a server and a client. The distributed data store includes global data. A transformation is applied to the global data to generate client-specific data based on the global data. The client-specific data is stored on the client which uses the client-specific data to perform tasks relating to the client-specific data.

Abstract: The present invention is directed to a system and method for cross-talk cancellation for multi-lane fluorescence detectors. The invention may be implemented in accordance with a variety of systems, including systems for multi-capillary electrophoresis. The present invention is based on a special calibration procedure for determination of a channel cross-talk matrix and enables an accurate separation of the fluorescence emitted from individual capillary lanes. The proposed method for cross-talk calibration and removal is very useful for design and development of multi-lane single photon counting detection systems.

Abstract: A cyclic graph may be partitioned. The partitions of the cyclic graph may include an acyclic component of the cyclic graph and a set of partitioned links. The partitions of the cyclic graph may have a particular order. The elements of the cyclic graph may be serialized with a particular serialization order. The serialization order of the elements of the cyclic graph may correspond to the order of the partitions of the cyclic graph. The elements of the acyclic component of the cyclic graph may be serialized before the elements of the set of partitioned links. A computer system may include a graph synchronization component configured to partition the cyclic graph and determine the serialization order of the elements of the cyclic graph. A serialization of the cyclic graph does serialize the elements of the cyclic graph in the determined serialization order.

Abstract: Systems, methods, computer-readable media and application program interfaces are disclosed for enabling server applications to verify purported authentication information, such as passwords, provided by clients in connection with server access requests by leveraging trusted credentials maintained by separate trusted authorities. In some cases, the server applications may lack trusted credentials that may be used to verify the purported authentication information. In those cases, the server applications may identify security principal accounts managed by the separate trusted authorities for which the provided authentication information may be purported to be valid for by the requesting clients. Further, the server applications may request the separate trusted authorities to authenticate the purported authentication information before granting access to the requesting clients.