Abstract: The invention belongs to the field of virus detection and diagnosis, and relates to an anti-AAV2 monoclonal antibody, and a preparation method and use thereof. Provided are an anti-AAV2 rabbit monoclonal antibody, and an amino acid sequence of a heavy chain variable region and a light chain variable region of the AAV2-resistant rabbit monoclonal antibody. The anti-AAV2 rabbit monoclonal antibody provided by the invention can be specifically combined with the VLP of the AAV2, and can be used for detecting an AAV virus antigen. The anti-AAV2 monoclonal antibody provided by the invention provides an effective detection tool for the detection of AAV2 in the research and development process of a gene therapy vector and the detection of AAV2 in basic science research.

Abstract: An aerosol generating apparatus and a method for counting a number of puffs of a user are provided. The apparatus includes a heater configured to heat an aerosol generating product to generate an aerosol for the user to inhale, a power source electrically connected to the heater to cause a temperature on the heater to reach a target temperature corresponding to each puff of the user, and a controller connected to the heater. The controller is configured to: during operation of the aerosol generating apparatus, detect an actual temperature of the heater, determine a temperature change speed, add 1 to a number of puffs of the user each time the temperature change speed meets a preset condition, and record the number of puffs. The temperature change speed is a change amount of the actual temperature of the heater relative to the target temperature per unit time.

Abstract: Provided is a technique relating to codon optimization.

Abstract: The present application provides a construction method for a humanized antibody sequence evaluation model and a use thereof. The construction method for a humanized antibody sequence evaluation model comprises: acquiring amino acid sequences of a plurality of human-derived antibody templates and numbering the amino acid sequences; calculating an entropy value at each number position; and constructing a humanized antibody sequence evaluation model on the basis of the entropy value.

Abstract: The present disclosure generally relates to DNA-based data storage. An exemplary method for storing input data on nucleic acid comprises: converting the input data into a set of nucleotide sequences and synthesizing a set of nucleic acids comprising the set of nucleotide sequences. The converting comprises a data processing step comprising converting the input data into a binary string, and a nucleotide encoding step comprising converting the binary string using a 5-bit transcoding framework to obtain the set of nucleotide sequences.

Abstract: The present invention relates to the technical field of molecular biology, and in particular, to a sgRNA sequencing linker and use thereof.

Abstract: A method for detecting an integration site. The method comprises: a) subjecting host DNA containing a modified nucleic acid to fragmentation to obtain linear nucleic acid fragments; b) subjecting the linear nucleic acid fragments to cyclization to obtain a double-stranded cyclized product, and then removing uncyclized linear nucleic acid fragments; c) performing rolling circle amplification by taking the double-stranded cyclized product as a template and using a primer specifically bound to the modified nucleic acid; d) subjecting the amplification product to fragmentation and establishing a sequencing library; e) subjecting the sequencing library to on-machine sequencing to obtain a sequencing result; and f) subjecting the sequencing result and an original sequence of the host DNA to alignment to determine the integration site of the modified nucleic acid in the host DNA.

Abstract: The embodiments of this application disclose a method for intelligent advertisement delivery and an electronic device. The method includes: determining a set of products designated by at least one first user that require intelligent advertisement delivery; matching product information in the determined set of products with key information associated with a product search request initiated by a second user during a process of responding to the product search request; estimating promotional performance evaluation metrics for a target product that successfully matches the key information and belongs to the set of products; performing intelligent bidding for the target product based on the estimated result, to determine, based on the intelligent bidding result, whether the target product qualifies for promotional display using a target display resource on a search result page, wherein the target display resource is designated to meet a requirement of the advertisement delivery.

Abstract: A computer-implemented method, system and computer program product for automatically drawing infographics. Variables of a dataset are received from a computing device that were selected by the user of the computing device. For those selected variables that are associated with a data model, a procedure to draw infographics for variables assigned or not assigned the role of a target using the data model associated with each of the variables assigned or not assigned the role of target, respectively, is implemented. Alternatively, if the selected variables are not associated with a data model, then such variables are assigned a level of measurement as well as assigned the role of input. Such assignments become the data model which, along with the metadata (e.g., values of the variable) obtained by parsing the original data, are used to implement the procedure to draw infographics for variables not assigned the role of a target.

Abstract: Using a set of menu to key process mappings, historical menu usage data for an application is aggregated into aggregated key process usage data. A set of key process association rules, each comprising a consequent key process given a particular antecedent key process, is generated. From the set of key process association rules and a set of ranked menus by frequency of usage within each key process, a set of model menu recommendations is generated. According to an application usage history, a menu frequency ratio, and a confidence value of a modelled next menu, the set of menu recommendations is scored. A scored menu recommendation having a rank below a threshold rank is pruned from a set of menu items of the application ranked according to their scores. The pruned set of scored menu recommendations is presented for selection instead of the set of menu items.

Abstract: Using a set of menu to key process mappings, historical menu usage data for an application is aggregated into aggregated key process usage data. A set of key process association rules, each comprising a consequent key process given a particular antecedent key process, is generated. From the set of key process association rules and a set of ranked menus by frequency of usage within each key process, a set of model menu recommendations is generated. According to an application usage history, a menu frequency ratio, and a confidence value of a modelled next menu, the set of menu recommendations is scored. A scored menu recommendation having a rank below a threshold rank is pruned from a set of menu items of the application ranked according to their scores. The pruned set of scored menu recommendations is presented for selection instead of the set of menu items.

Abstract: Using a set of menu to key process mappings, historical menu usage data for an application is aggregated into aggregated key process usage data. A set of key process association rules, each comprising a consequent key process given a particular antecedent key process, is generated. From the set of key process association rules and a set of ranked menus by frequency of usage within each key process, a set of model menu recommendations is generated. According to an application usage history, a menu frequency ratio, and a confidence value of a modelled next menu, the set of menu recommendations is scored. A scored menu recommendation having a rank below a threshold rank is pruned from a set of menu items of the application ranked according to their scores. The pruned set of scored menu recommendations is presented for selection instead of the set of menu items.

Abstract: A computer-implemented method, system and computer program product for automatically drawing infographics. Variables of a dataset are received from a computing device that were selected by the user of the computing device. For those selected variables that are associated with a data model, a procedure to draw infographics for variables assigned or not assigned the role of a target using the data model associated with each of the variables assigned or not assigned the role of target, respectively, is implemented. Alternatively, if the selected variables are not associated with a data model, then such variables are assigned a level of measurement as well as assigned the role of input. Such assignments become the data model which, along with the metadata (e.g., values of the variable) obtained by parsing the original data, are used to implement the procedure to draw infographics for variables not assigned the role of a target.

Abstract: Using a set of menu to key process mappings, historical menu usage data for an application is aggregated into aggregated key process usage data. A set of key process association rules, each comprising a consequent key process given a particular antecedent key process, is generated. From the set of key process association rules and a set of ranked menus by frequency of usage within each key process, a set of model menu recommendations is generated. According to an application usage history, a menu frequency ratio, and a confidence value of a modelled next menu, the set of menu recommendations is scored. A scored menu recommendation having a rank below a threshold rank is pruned from a set of menu items of the application ranked according to their scores. The pruned set of scored menu recommendations is presented for selection instead of the set of menu items.

Abstract: One or more computer processors determine a web segment in a web page to be displayed in a visual area and a rendering mode for the web segment. The one or more computer processors retrieve content in the web segment, wherein retrieving the content comprises: in response to the content being cached in a cache memory, retrieving, by one or more processors, the content from the cache memory. The one or more computer processors render the retrieved content to be displayed in the visual area according to the determined rendering mode for the web segment.

Abstract: An exemplary computer-implemented method for optimizing a nucleic acid sequence for expression of a protein in a host, comprises: a) receiving an initial population set, wherein the initial population set comprises a plurality of initial candidate nucleic acid sequences capable of expressing the protein (106); and b) performing, based on the initial population set, optimization of a harmony index, a codon context index, and an outlier index using a computer-assisted NS-GA-III algorithm or a variant thereof, thereby obtaining a plurality of optimized nucleic acid sequences capable of expressing the protein (108).

Abstract: A method for rapidly preparing a Sanger sequencing template, comprising: performing denaturing treatment on a sample containing circular DNAs; performing rolling circle amplification of the denaturing product; and treating the rolling circle amplification product with alkaline phosphatase to remove residual dNTP.

Abstract: The present application provides a method for quickly homogenizing circular DNA samples, comprising performing rolling circle amplification on circular DNAs in the samples, so that the concentration of the circular DNAs in the samples are homogenized.

Abstract: A parallel computing system is provided, including input ports, a first switching network, a computing array, a second switching network and output ports. The first switching network is receiving input data from the input ports, sequencing the input data according to different computing modes of the computing array and outputting sequenced input data; the computing array is performing parallel computation on the sequenced input data and outputting intermediate data; and the second switching network is sequencing the intermediate data according to different output modes and outputting sequenced intermediate data through the output ports. The present disclosure applies the switching networks to the parallel computing system and performs any required sequencing on the input or output data according to the different computing modes and output modes to complete various arithmetic operations through the computing array after the input data are input into the computing array.

Abstract: A codon optimization method based on an immune algorithm is characterized in that an immune algorithm and a genetic algorithm are successively used to respectively perform local multi-objective optimization and global multi-objective optimization on a protein coding sequence, and then an exhaustive method is used to perform fine adjustment and optimization on the sequence, so as to search the optimal expression sequence to the greatest extent. The present invention not only retains the characteristic of random global parallel search of the genetic algorithm, but also avoids premature convergence to a comparatively great extent to ensure rapid convergence to the global optimal solution.