Abstract: Embodiments of the present invention provide a method for searching for a data stream dividing point based on a server. In the embodiments of the present invention, a data stream dividing point is searched for by determining whether at least a part of data in a window of M windows meets a preset condition, and when the at least a part of data in the window does not meet the preset condition, a length of N*U is skipped, so as to obtain a next potential dividing point, thereby improving efficiency of searching for a data stream dividing point.

Abstract: The present disclosure provides compounds that may be useful for inhibiting Wnt pathway comprising compounds of the formula: (Ia) or (Ib) wherein the variables are as defined herein. In some aspects, the compounds may be used to inhibit the Wnt pathway and used to treat cancer, myocardial infarction, osteopetrosis, or used in the maturation of a precursor cell to a mature cell. Also provided herein in are pharmaceutical compositions of the compounds described herein.

Abstract: Embodiments of the present invention provide a method for searching for a data stream dividing point based on a server. In the embodiments of the present invention, a data stream dividing point is searched for by determining whether at least a part of data in a window of M windows meets a preset condition, and when the at least a part of data in the window does not meet the preset condition, a length of N*U is skipped, so as to obtain a next potential dividing point, thereby improving efficiency of searching for a data stream dividing point.

Abstract: Embodiments of the present disclosure disclose a solution for data backup and recovery in a storage system. When a source device in the storage system backs up, to a backup-end device, a data block that is written after a snapshot Sn, the source device performs a logical operation such as an exclusive-NOR or exclusive-OR operation on the written data block and an original data block, which is recorded in the snapshot Sn, of the written data block, and then compresses a data block obtained after the logical operation, which improves a compression ratio of a data block, thereby reducing an amount of data that is sent to the backup-end device, and saving transmission bandwidth. The solution may be further applied to a scenario of data recovery in a storage system.

Abstract: Embodiments of the present disclosure disclose a solution for data backup and recovery in a storage system. When a source device in the storage system backs up, to a backup-end device, a data block that is written after a snapshot Sn, the source device performs a logical operation such as an exclusive-NOR or exclusive-OR operation on the written data block and an original data block, which is recorded in the snapshot Sn, of the written data block, and then compresses a data block obtained after the logical operation, which improves a compression ratio of a data block, thereby reducing an amount of data that is sent to the backup-end device, and saving transmission bandwidth. The solution may be further applied to a scenario of data recovery in a storage system.

Abstract: A data storage method includes: separately dividing a data block and a reference data block into N equal-sized sub-data blocks, comparing a sub-data block and a reference sub-data block corresponding to a same location identifier, determining, in the N sub-data blocks, a sub-data block that can be deduplicated and a sub-data block that cannot be deduplicated, performing a deduplication operation on the sub-data block that can be deduplicated, selecting a representative sub-data block of the sub-data block that cannot be deduplicated, performing an exclusive OR operation on data of the sub-data block that cannot be deduplicated and data of the representative sub-data block, compressing a result of the exclusive OR operation using run-length encoding, and storing a compression result and location information of the sub-data block that cannot be deduplicated.

Abstract: The present disclosure directs to solutions for performing deduplication by a storage device. In the solutions, according to a duplicate data locality principle, non-duplicate data blocks whose logical addresses are contiguous are stored in contiguous physical addresses in a sequence of the logical addresses, and fingerprints of the non-duplicate data blocks whose logical addresses are contiguous are also stored in contiguous physical addresses in the sequence of the logical addresses, and in addition, a mapping from a logical address, which is of one data block in the non-duplicate data blocks whose logical addresses are contiguous, to an aggregation address is established.

Abstract: Embodiments of the present invention provide a method for searching for a data stream dividing point based on a server. In the embodiments of the present invention, a data stream dividing point is searched for by determining whether at least a part of data in a window of M windows meets a preset condition, and when the at least a part of data in the window does not meet the preset condition, a length of N*U is skipped, so as to obtain a next potential dividing point, thereby improving efficiency of searching for a data stream dividing point.

Abstract: Embodiments of the present disclosure disclose a solution for data backup and recovery in a storage system. When a source device in the storage system backs up, to a backup-end device, a data block that is written after a snapshot Sn, the source device performs a logical operation such as an exclusive-NOR or exclusive-OR operation on the written data block and an original data block, which is recorded in the snapshot Sn, of the written data block, and then compresses a data block obtained after the logical operation, which improves a compression ratio of a data block, thereby reducing an amount of data that is sent to the backup-end device, and saving transmission bandwidth. The solution may be further applied to a scenario of data recovery in a storage system.

Abstract: Embodiments of the present invention provide a method for searching for a data stream dividing point based on a server. In the embodiments of the present invention, a data stream dividing point is searched for by determining whether at least a part of data in a window of M windows meets a preset condition, and when the at least a part of data in the window does not meet the preset condition, a length of N*U is skipped, so as to obtain a next potential dividing point, thereby improving efficiency of searching for a data stream dividing point.

Abstract: Embodiments of the present invention provide a method for searching for a data stream dividing point based on a server. In the embodiments of the present invention, a data stream dividing point is searched for by determining whether at least a part of data in a window of M windows meets a preset condition, and when the at least a part of data in the window does not meet the preset condition, a length of N*U is skipped, so as to obtain a next potential dividing point, thereby improving efficiency of searching for a data stream dividing point.

Abstract: A de-duplication-based remote replication method and an apparatus are provided in a system including a primary end device and a disaster recovery end device, and both the primary end device and the disaster recovery end device store a first snapshot; the primary end device obtains a second snapshot of the primary end device, and sends the first data block, the fingerprint of the first data block, and metadata of the added data blocks to the disaster recovery end device when a fingerprint of a first data block in the added data blocks is different from the fingerprints of the data blocks in the first snapshot.

Abstract: Embodiments of the present invention provide a method for searching for a data stream dividing point based on a server. In the embodiments of the present invention, a data stream dividing point is searched for by determining whether at least a part of data in a window of M windows meets a preset condition, and when the at least a part of data in the window does not meet the preset condition, a length of N*U is skipped, so as to obtain a next potential dividing point, thereby improving efficiency of searching for a data stream dividing point.

Abstract: The present invention provides methods of increasing nitrogen utilization efficiency (NUE) in a transgenic plant comprising the introduction of a nucleic acid encoding a dep1 polypeptide into a plant to produce a transgenic plant that expresses the nucleic acid to produce the dep1 polypeptide, thereby resulting in an increased NUE as compared with a control plant. Also provided are methods of increasing NUE in a plant comprising reducing the amount and/or activity of a DEP1 polypeptide.

Abstract: Embodiments of the present invention provide a metadata querying method and apparatus. The method includes: sampling at least one piece of first metadata from to-be-searched-for metadata; using at least a part of feature values in each piece of the sampled first metadata as an index, and searching a sparse index table preset in a memory for a corresponding container identifier; selecting, according to the number of times that a same container identifier is found, a container corresponding to a container identifier that meets a set condition; loading metadata in the selected container into a metadata cache; and searching the metadata cache for a data block that is the same as the to-be-searched-for metadata. In the embodiments of the present invention, querying performance can be improved and occupied memory space can be reduced.

Abstract: Embodiments of the present invention provide a method for searching for a data stream dividing point based on a server. In the embodiments of the present invention, a data stream dividing point is searched for by determining whether at least a part of data in a window of M windows meets a preset condition, and when the at least a part of data in the window does not meet the preset condition, a length of N*U is skipped, so as to obtain a next potential dividing point, thereby improving efficiency of searching for a data stream dividing point.

Abstract: Some embodiments of the present invention can include herbicide-resistant proteins, coding genes, and uses thereof. Certain herbicide-resistant proteins can comprises: (a) a protein consisting of an amino acid sequence shown in SEQ ID NO: 2; or (b) a protein consisting of an amino acid sequence at least 90% identical to that set forth in SEQ ID NO: 2. Other herbicide-resistant proteins of this disclosure can be suitable for expression in plants, can have resistance to herbicides (e.g., to phenoxy auxinherbicides), or both.

Abstract: Some embodiments of the present invention can include herbicide-resistant proteins, coding genes, and uses thereof. Certain herbicide-resistant proteins can comprises: (a) a protein consisting of an amino acid sequence shown in SEQ ID NO: 2; or (b) a protein consisting of an amino acid sequence at least 90% identical to that set forth in SEQ ID NO: 2. Other herbicide-resistant proteins of this disclosure can be suitable for expression in plants, can have resistance to herbicides (e.g., to phenoxy auxinherbicides), or both.

Abstract: Involved is a method for controlling the pest Sesamia inferens, comprising a step of contacting Sesamia inferens with Cry1F protein. Sesamia inferens is controlled by the Cry1F protein having pesticidal activity against Sesamia inferens, which is produced in the plants. Compared with the agricultural control, chemical control and biology control currently used in prior art, the present invention can protect the whole plant during whole growth period from the harm of Sesamia inferen. Furthermore, it causes no pollution and no residue and provides a stable and thorough control effect. Also it is simple, convenient and economic.

Abstract: Embodiments of the present invention provide a metadata querying method and apparatus. The method includes: sampling at least one piece of first metadata from to-be-searched-for metadata; using at least a part of feature values in each piece of the sampled first metadata as an index, and searching a sparse index table preset in a memory for a corresponding container identifier; selecting, according to the number of times that a same container identifier is found, a container corresponding to a container identifier that meets a set condition; loading metadata in the selected container into a metadata cache; and searching the metadata cache for a data block that is the same as the to-be-searched-for metadata. In the embodiments of the present invention, querying performance can be improved and occupied memory space can be reduced.