3results about How to "Shorten read time" patented technology

This application relates to the field of in vitro bioassay technology, and discloses a method for preparing a colloidal gold assay reagent, its product, and its application. The method for preparing the colloidal gold assay reagent comprises five steps: colloidal gold preparation, antibody labeling, double blocking, centrifugal purification, and dilution and reconstitution. In particular, the double blocking process involves a first blocking agent selected from one or more of bovine serum albumin, ovalbumin, and casein; and a second blocking agent selected from one or more of lysine, glycine, alanine, serine, threonine, valine, and asparagine. This allows the prepared colloidal gold assay reagent to achieve high sensitivity and excellent C / T line color development when applied to FSH detection, reducing false positives caused by nonspecific adsorption and improving the accuracy of test results. Its limit of detection (LOD) is as low as 10 mIU / mL, solving the problems of low sensitivity and uneven C / T line color development in existing FSH assays.

The invention belongs to the field of high-performance storage systems and computer system structures, and particularly discloses an LSM tree reading optimization design method based on a partition ordered hash table, which is characterized in that a hash table is maintained in a memory, the table is used for caching a key read from a disk recently, and a file number and a file size corresponding to the key are recorded; when a user initiates a query request, if a target key is not hit in both the memtable and the immutable memtable, a traditional LSM tree mechanism can directly enter a disk for layer-by-layer query, but in the method, the table can be queried in a memory preferentially. According to the method, the key and the file number and the file size of the corresponding stable are maintained in real time by utilizing the hash table of the partition; whenever a new stable is generated, the system checks whether a key in the new stable is overlapped with an existing key in the hash table, and if the key in the new stable is overlapped with the existing key in the hash table, the file number and the file size of the corresponding key in the hash table are updated. In this way, the target stable can be directly positioned during query, layer-by-layer traversal is not needed, and therefore the reading speed is effectively increased.

This invention discloses a method for pairing quantum keys and quantum ciphertext data packets. A first terminal assembles identification information into the front end of each quantum ciphertext data packet, and the front end of the quantum key corresponding to all quantum ciphertext data packets is assembled with the same identification information. A second terminal establishes a hash list, storing the assembled quantum ciphertext data packets and quantum keys in the hash list using the identification information, and then performs pairing and decryption. This invention improves the efficiency of pairing and decryption by adding an entry code (RID) and a message sequence number (MsgID) before transmitting the quantum ciphertext data packets and quantum keys, and then classifying and storing them in the hash list according to the message sequence number (MsgID). By finding quantum ciphertext data packets and quantum keys with the same entry code (RID) and message sequence number (MsgID) at the first terminal, pairing and quantum decryption are performed, saving a significant amount of reading time.