Abstract: Provided herein are systems and methods for the detection and analysis of biomolecules. In particular, provided herein are sensor systems employing an enzyme that comprises an allosteric site that interacts with an inhibitor to determine the presence of, absence of, or amount of one or more analytes of interest in a sample. In some embodiments, the allosteric site comprises a grafted epitope that corresponds to one or more analytes of interest.

Abstract: Disclosed is a triboelectric nanogenerator-based biochemical droplet reaction device, which includes a reaction generating part and a power generation part. The power generation part includes a triboelectric component and a rectifier circuit. The triboelectric component includes a drive electrode, a substrate, a first friction electrode, a first friction material, a second friction material, and a second friction electrode arranged in sequence from top to bottom. A gap exists between the first friction material and the second friction material. The first friction electrode is connected to the first friction material. The second friction electrode is connected to the second friction material. The drive electrode, the first friction electrode, and the second friction electrode are all connected to the rectifier circuit. Also disclosed is a reaction method.

Abstract: Disclosed is a triboelectric nanogenerator-based biochemical droplet reaction device, which includes a reaction generating part and a power generation part. The power generation part includes a triboelectric component and a rectifier circuit. The triboelectric component includes a drive electrode, a substrate, a first friction electrode, a first friction material, a second friction material, and a second friction electrode arranged in sequence from top to bottom. A gap exists between the first friction material and the second friction material. The first friction electrode is connected to the first friction material. The second friction electrode is connected to the second friction material. The drive electrode, the first friction electrode, and the second friction electrode are all connected to the rectifier circuit. Also disclosed is a reaction method.

Abstract: Disclosed herein are methods, systems, and apparatus, including computer programs encoded on computer storage media, for recovering and verifying a public key. One of the methods includes accepting information encoding parameters of an elliptic curve, a published public key, a hash value of a message, a digital signature, and an identification parameter; generating a recovered public key based on the parameters of the elliptic curve, the hash value of the message, the digital signature, and the identification parameter; comparing the published public key and the recovered public key to verify the published public key.

Abstract: A computer-implemented method, non-transitory, computer-readable medium, and computer-implemented system are provided for implementing privacy protection. In an implementation, a public key pk={N, h} corresponding to a target user is obtained, where h is a generator of a predetermined cyclic group with a size of k in a random number space Z*N, a length of k is i bits, a length of N is n bits, and i<<n. A random number r is selected, so that hr belongs to the predetermined cyclic group. To-be-encrypted data m, corresponding to the target user using the public key pk and the random number r, is processed to generate a homomorphic ciphertext c=(1+N)m·(hN mod N2)r mod N2. The homomorphic ciphertext c is provided to the target user, where the homomorphic ciphertext c can be decrypted using a private key sk to obtain the data m.

Abstract: Implementations are directed to cross-asset trading in blockchain networks, and include a first node providing transaction information based on a first value, a second value, and an exchange rate of a second node, receiving, from the second node, a first evidence set, a first range proof, and a digital signature of the second node, and submitting the transaction for verification based on the first range proof, a second range proof, the first evidence set, a second evidence set, a digital signature of the first node, and the digital signature of the second node, the transaction being executed to decrease a balance of the first node by the first value, increase a first balance of the second node by the first value, decrease a second balance of the second node by the second value, and increase a balance of the third node by the second value.

Abstract: Exemplary embodiments of system, methods and computer-accessible medium can be provided for performing feedback-controlled electromagnetic radiation (EMR)-based treatment. Some exemplary embodiments include an image acquisition system configured to detect information regarding at least one portion of a tissue, and an EMR source configured to generate an EMR beam. A controller can be provided that can be configured to (i) recognize one or more targets within the portion(s) of the tissue based upon the feedback data, (ii) locate one or more coordinates within the portion(s) associated with the target(s), and (iii) control the optical arrangement to direct the EMR beam to impact the coordinate(s).

Abstract: Disclosed herein are methods, systems, and apparatus, including computer programs encoded on computer storage media, for recovering and verifying a public key. One of the methods includes accepting information encoding parameters of an elliptic curve, a published public key, a hash value of a message, a digital signature, and an identification parameter; generating a recovered public key based on the parameters of the elliptic curve, the hash value of the message, the digital signature, and the identification parameter; comparing the published public key and the recovered public key to verify the published public key.

Abstract: Implementations are directed to cross-asset trading in blockchain networks, and include a first node providing transaction information based on a first value, a second value, and an exchange rate of a second node, receiving, from the second node, a first evidence set, a first range proof, and a digital signature of the second node, and submitting the transaction for verification based on the first range proof, a second range proof, the first evidence set, a second evidence set, a digital signature of the first node, and the digital signature of the second node, the transaction being executed to decrease a balance of the first node by the first value, increase a first balance of the second node by the first value, decrease a second balance of the second node by the second value, and increase a balance of the third node by the second value.

Abstract: Implementations are directed to cross-asset trading in blockchain networks, and include a first node providing transaction information based on a first value, a second value, and an exchange rate of a second node, receiving, from the second node, a first evidence set, a first range proof, and a digital signature of the second node, and submitting the transaction for verification based on the first range proof, a second range proof, the first evidence set, a second evidence set, a digital signature of the first node, and the digital signature of the second node, the transaction being executed to decrease a balance of the first node by the first value, increase a first balance of the second node by the first value, decrease a second balance of the second node by the second value, and increase a balance of the third node by the second value.

Abstract: Disclosed herein are methods, systems, and apparatus, including computer programs encoded on computer storage media, for recovering and verifying a public key. One of the methods includes accepting information encoding parameters of an elliptic curve, a published public key, a hash value of a message, a digital signature, and an identification parameter; generating a recovered public key based on the parameters of the elliptic curve, the hash value of the message, the digital signature, and the identification parameter; comparing the published public key and the recovered public key to verify the published public key.

Abstract: Disclosed herein are methods, systems, and apparatus, including computer programs encoded on computer storage media, for recovering and verifying a public key. One of the methods includes accepting information encoding parameters of an elliptic curve, a published public key, a hash value of a message, a digital signature, and an identification parameter; generating a recovered public key based on the parameters of the elliptic curve, the hash value of the message, the digital signature, and the identification parameter; comparing the published public key and the recovered public key to verify the published public key.

Abstract: A computer-implemented method, non-transitory, computer-readable medium, and computer-implemented system are provided for implementing privacy protection. In an implementation, a public key pk={N, h} corresponding to a target user is obtained, where h is a generator of a predetermined cyclic group with a size of k in a random number space Z*N, a length of k is i bits, a length of N is n bits, and i<<n. A random number r is selected, so that hr belongs to the predetermined cyclic group. To-be-encrypted data m, corresponding to the target user using the public key pk and the random number r, is processed to generate a homomorphic ciphertext c=(1+N)m·(hN mod N2)r mod N2. The homomorphic ciphertext c is provided to the target user, where the homomorphic ciphertext c can be decrypted using a private key sk to obtain the data m.

Abstract: A computer-implemented method, non-transitory, computer-readable medium, and computer-implemented system are provided for implementing privacy protection. In an implementation, a public key pk={N, h} corresponding to a target user is obtained, where h is a generator of a predetermined cyclic group with a size of k in a random number space Z*N, a length of k is i bits, a length of N is n bits, and i<<n. A random number r is selected, so that hr belongs to the predetermined cyclic group. To-be-encrypted data m, corresponding to the target user using the public key pk and the random number r, is processed to generate a homomorphic ciphertext c=(1+N)m·(hN mod N2)r mod N2 . The homomorphic ciphertext c is provided to the target user, where the homomorphic ciphertext c can be decrypted using a private key sk to obtain the data m.

Abstract: Disclosed herein are methods, systems, and apparatus, including computer programs encoded on computer storage media, for recovering and verifying a public key. One of the methods includes accepting information encoding parameters of an elliptic curve, a published public key, a hash value of a message, a digital signature, and an identification parameter; generating a recovered public key based on the parameters of the elliptic curve, the hash value of the message, the digital signature, and the identification parameter; comparing the published public key and the recovered public key to verify the published public key.

Abstract: A method and an apparatus for determining a time offset are disclosed. The method includes: obtaining, by a device at a head end, a time-domain signal based on a received signal; and then determining a time offset based on values of peak-to-average ratios of a preset quantity of symbols starting from a qth symbol in the time-domain signal, where a peak-to-average ratio of the qth symbol is greater than a preset threshold. A new method for determining a time offset is provided, and takes advantages that the time-domain signal obtained by the device at the head end has stronger capabilities of resisting interference such as frequency offset and phase noise. The method for determining a time offset can be applied both to initial ranging and periodic ranging.

Abstract: A computer-implemented method, non-transitory, computer-readable medium, and computer-implemented system are provided for implementing privacy protection. In an implementation, a public key pk={N, h} corresponding to a target user is obtained, where h is a generator of a predetermined cyclic group with a size of k in a random number space Z*N, a length of k is i bits, a length of N is n bits, and i<<n. A random number r is selected, so that hr belongs to the predetermined cyclic group. To-be-encrypted data m, corresponding to the target user using the public key pk and the random number r, is processed to generate a homomorphic ciphertext c=(1+N)m·(hN mod N2)r mod N2. The homomorphic ciphertext c is provided to the target user, where the homomorphic ciphertext c can be decrypted using a private key sk to obtain the data m.

Abstract: The present disclosure relates to compensating method for cell assembly. According to a deviation value of a key position of a measured array substrate, a compensation value of an exposure parameter of black matrix process of a color film substrate is calculated in real time by using historical measurement data of batches. The compensation value is fed back to a manufacturing apparatus in real time. The manufacturing apparatus corrects the key parameter of the apparatus timely according to the compensation value of the exposure parameter of the black matrix, to manufacture a color film substrate matching with the array substrate.

Abstract: Implementations are directed to cross-asset trading in blockchain networks, and include a first node providing transaction information based on a first value, a second value, and an exchange rate of a second node, receiving, from the second node, a first evidence set, a first range proof, and a digital signature of the second node, and submitting the transaction for verification based on the first range proof, a second range proof, the first evidence set, a second evidence set, a digital signature of the first node, and the digital signature of the second node, the transaction being executed to decrease a balance of the first node by the first value, increase a first balance of the second node by the first value, decrease a second balance of the second node by the second value, and increase a balance of the third node by the second value.

Abstract: A method and an apparatus for determining a time offset are disclosed. The method includes: obtaining, by a device at a head end, a time-domain signal based on a received signal; and then determining a time offset based on values of peak-to-average ratios of a preset quantity of symbols starting from a qth symbol in the time-domain signal, where a peak-to-average ratio of the qth symbol is greater than a preset threshold. A new method for determining a time offset is provided, and takes advantages that the time-domain signal obtained by the device at the head end has stronger capabilities of resisting interference such as frequency offset and phase noise. The method for determining a time offset can be applied both to initial ranging and periodic ranging.