343 results about "Complete sequence" patented technology

A system for visually representing user behavior within an interactive voice response (IVR) system of a call processing center generates a complete sequence of events within the IVR system for plural calls to the call processing center, the plurality of calls being recorded from end to end. A call flow of the IVR system is modeled as a non-deterministic finite-state machine, such that a start state of the finite-state machine represents a first prompt of the IVR system, other states of the finite-state machine represent subsequent prompts at which a branching occurs in the call flow of the IVR system, exit conditions are represented as end states, and transitions of the finite-state machine represent transitions between call flow states triggered by data inputted by a user or by internal processing of the IVR system. The complete sequences of events for the plural calls are provided to the finite-state machine to produce a two-way matrix of several counters. The data from the two-way matrix is represented as a state-transition diagram.

The conditions under which oligonucleotides hybridize only with entirely homologous sequences are recognized. The sequence of a given DNA fragment is read by the hybridization and assembly of positively hybridizing probes through overlapping portions. By simultaneous hybridization of DNA molecules applied as dots and bound onto a filter, representing single-stranded phage vector with the cloned insert, with about 50,000 to 100,000 groups of probes, the main type of which is (A,T,C,G)(A,T,C,G)N8(A,T,C,G), information for computer determination of a sequence of DNA having the complexity of a mammalian genome are obtained in one step. To obtain a maximally completed sequence, three libraries are cloned into the phage vector, M13, bacteriophage are used: with the 0.5 kb and 7 kbp insert consisting of two sequences, with the average distance in genomic DNA of 100 kbp. For a million bp of genomic DNA, 25,000 subclones of the 0.5 kbp are required as well as 700 subclones 7 kb long and 170 jumping subclones. Subclones of 0.5 kb are applied on a filter in groups of 20 each, so that the total number of samples is 2,120 per million bp. The process can be easily and entirely robotized for factory reading of complex genomic fragments or DNA molecules.

Methods and apparatus are provided for optimizing the reintroduction of a network node into a network. Information about neighboring nodes is stored in persistent memory. The network node can then be reinitialized and reintroduced into the network. Upon reintroduction, the network node can transmit heartbeat messages such as Hello messages to its neighboring nodes using information stored in persistent memory. A link state packet request message such as a Complete Sequence Numbers Packet referencing dummy link state information is transmitted to a neighboring node. A partial packet request message such as a Partial Sequence Numbers Packet referencing the dummy link state packet from the neighboring node can acknowledge that the Complete Sequence Numbers Packet has been received.

The present invention addresses scalability and end-to-end reliability in overlay multicast networks. A simple end-system multicast architecture that is both scalable in throughput and reliable in an end-to-end way is used. In this architecture, the transfers between nodes use TCP with backpressure mechanisms to provide data packet transfers between intermediate nodes having finite-size forwarding buffers. There is also a finite-size backup buffer in each node to store copies of packets which are copied out from the receiver window to the forwarding buffers. These backup buffers are used when TCP connections are re-established to supply copies of data packets for the children nodes after their parent node fails, maintaining a complete sequence of data packets to all nodes within the multicast overlay network. The architecture provides end-to-end reliability, tolerates multiple simultaneous node failures and provides positive throughput for any group size and any buffer size.

Methods are provided for adding a terminal sequence tag to nucleic acid molecules for use in RNA or DNA amplification. The tag introduced may be used as a primer binding site for subsequent amplification of the DNA molecule and / or sequencing of the DNA molecule and therefore provides means for identification and cloning of the 5′-end or the complete sequence of mRNAs.

The invention discloses cathelicidin-BF and a gene and application thereof, which belong to the field of biomedicine. The cathelicidin-BF is straight chain polypeptide and contains thirty amino acid residues, the molecular weight is 3,637.54Da, and the isoelectric point is 11.79. The complete sequence of the cathelicidin-BF is lysine-phenyl alanine-phenyl alanine-arginine-lysine-leucine- lysine-lysine-serine-valine-lysine-lysine-arginine-lactamine-lysine-glutamic acid-phenyl alanine- phenyl alanine-lysine-lysine-proline-arginine-valine-isoleucine-glycin-valine-serine-isoleucine- praline-phenyl alanine. The gene for encoding the cathelicidin-BF consists of 750 ribonucleotides, wherein 484th to 573rd ribonucleotides are used for encoding a mature peptide part. The cathelicidin-BF has small molecular weight, strong sterilization effect, and quick action time, and has quite strong killing function to a plurality of kinds of clinical drug-fast bacteria. In addition, the cathelicidin-BF also has the advantages of broad-spectrum antibiotics, salt independence and so on.

The invention discloses a DNA sequence data compression system which is a DNA sequence data lossless compression system based on an MA-ARV codebook. In the invention, a similar repeating segment of an MA-ARV code vector can be searched on a complete sequence, and a cultural meme heuristic optimization algorithm method (MA) is used for optimizing a construction process of the compression codebook so as to more comprehensively utilize the repeating characteristic of DNA sequence data and effectively eliminate redundancy.

The invention relates to a method for information storage with DNA (Deoxyribonucleic Acid). The method comprises the following steps: (1) converting binary information of an original document of a computer into quaternary information, encoding, converting into a DNA complete sequence, wherein binary codes 00, 01, 10 and 11 are respectively and correspondingly converted into four deoxyribonucleotides of A, T, C and G; (2) separating the DNA complete sequence into a plurality of DNA fragments, and organizing and establishing an output DNA sequence which is 90-110nt in length and comprises an interpolation nucleotide encoding sequence consisting of DNA fragments, side primer sequences at two ends, and index encoding sequences on the inner sides of the primer sequences; (3) according to the output DNA sequence, synthesizing an artificial DNA sequence, and storing the artificial DNA sequence. The method provided by the invention has the remarkable advantages of being good in universality, being capable of simplifying calculation, improving continuity, storage efficiency and density of DNA information storage, reducing fault rates, lowering sequence synthesis and detection cost, and the like.

The conditions under which oligonucleotides hybridize only with entirely homologous sequences are recognized. The sequence of a given DNA fragment is read by the hybridization and assembly of positively hybridizing probes through overlapping portions. By simultaneous hybridization of DNA molecules applied as dots and bound onto a filter, representing single-stranded phage vector with the cloned insert, with about 50,000 to 100,000 groups of probes, the main type of which is (A,T,C,G)(A,T,C,G)N8(A,T,C,G), information for computer determination of a sequence of DNA having the complexity of a mammalian genome are obtained in one step. To obtain a maximally completed sequence, three libraries are cloned into the phage vector, M13, bacteriophage are used: with the 0.5 kb and 7 kbp insert consisting of two sequences, with the average distance in genomic DNA of 100 kbp. For a million bp of genomic DNA, 25,000 subclones of the 0.5 kbp are required as well as 700 subclones 7 kb long and 170 jumping subclones. Subclones of 0.5 kb are applied on a filter in groups of 20 each, so that the total number of samples is 2,120 per million bp. The process can be easily and entirely robotized for factory reading of complex genomic fragments or DNA molecules.

The invention provides a stroke and phonetic text input entry system that has substantially the same definition of stroke match as that used in T9, where the input is a phrasal input rather than a character input. The invention solves the problem of Chinese phrasal stroke and phonetic text input by allowing users to enter an arbitrary number of strokes for each character in a phrase, where each character is separated by a delimiter. In this way, the invention provides a system that is easily learned and efficiently applied. Thus, the invention makes it possible for users to enter multiple characters while keeping their single character input habits. Each Chinese character has a standard stroke sequence in Guo Biao (GB), which is the standard for mainland China, or multiple sequences for BIG5 Chinese Character Encoding for Traditional (Complex) Characters, which is the de facto standard in Taiwan but not used in mainland China. With the invention, users do not have to enter the complete sequence for a single character, but instead can stop at any point and enter a delimiter which indicates the end of the previous character and the start of the next character. The whole stroke sequence entered by the user can then be split into a few groups that are separated by zero or more delimiters. Phrases can then be identified by user entry of groups of characters. The presently preferred phrase matching criteria are as follows: the first stroke group matches the leading stroke sequence of the first character of the phrase; the second stroke group matches the leading stroke sequence of the second character of the phrase, etc; the phrases that match the entered stroke sequence are presented to the user for selection. A user interface design for Chinese phrasal stroke text input is also provided.

The invention discloses a fast image splicing method of matching strategy fusion and low errors. The method includes: S1, acquiring a plurality of to-be-spliced sequence images, and carrying out preprocessing and calibration of overlapped areas between the images thereon; S2, extracting SIFT feature points In the overlapped area, and calculating SURF feature descriptors; S3, completing feature rough-matching, utilizing rough-matching information to complete sequence image sorting, then adopting a random sample consensus algorithm to refine matching results, and fitting homography transformation matrices between the images; S4, selecting an image of a middle position of the sequence images to use the same as a reference image, and establishing a projection transformation model of any otherimage to the reference image; and S5, using the projection transformation model and combining multiple threads to project all the images to reference-image coordinate space after brightness correction, and synthesizing a high-quality panoramic-image after image fusion. The method greatly increases a correct-matching rate, can fast synthesize the high-quality panoramic-image of low errors, and hashigher practical values.

The present invention relates to a data structure and a method for, in a datastructure, managing sequences of symbols (e.g numbers or words). A solution with a double set of records is employed where the first set of records is defined by a linked list of records which are array records of pointers with one element for each symbol (e.g digit or letter). The second set of records is defined by strings where the complete sequences of symbols are stored. The managing of the data structures would suitably comprise storing, deleting and finding / searching the sequences of symbols.

A moving radar (405) generates a synthetic aperture image from an incomplete sequence of periodic pulse returns. The incomplete sequence of periodic pulse returns has one or more missing pulses. The radar converts the incomplete sequence of pulse returns into a digital stream. A computer (403) processes the digital stream by computing an along track Fourier transform (402), a range compression (408), an azimuth deskew (410) and an image restoration and auto focus (412). The image restoration and autofocus (412) utilizes a low order autofocus (501), a gap interpolation using a Burg algorithm (503), and a high order autofocus (505) for generating an interpolated sequence. The interpolated sequence contains a complete sequence of periodic pulse returns with uniform spacing for generating the synthetic aperture image. The image restoration and autofocus (412) computes a linear prediction coefficients estimate using the Burg Algorithm (606). The linear prediction coefficients estimate (606) is used to compute a weighted forward-backward interpolation to generate the complete sequence of periodic pulse returns (608).

The invention discloses a simple, convenient, efficient and universal plant chloroplast genome sequencing method. The method comprises the following steps: directly performing high-flux sequencing by adopting genome DNA (Deoxyribonucleic Acid); capturing chloroplast reads by using a biology bioinformatics method; then, assembling and splicing to obtain a chloroplast genome complete sequence. Compared with the conventional method, the method has the advantages that a high-flux sequencing library is built directly by taking leaf genome DNA as a template, so that the efficiency and universality of the method are improved greatly; complicated PCR (Polymerase Chain Reaction) product sequencing and splicing and assembling of clone segments are not required, and splicing is directly performed from the start by using the reads obtained after high-coverage sequencing, so that test steps are reduced greatly, the test flow is simplified, and the method is simple, convenient, rapid and efficient.

The invention discloses an amplification primer for a grouper catostomidae mitochondrial genome complete sequence and a design method thereof, relates to groupers, and particularly relates to 16 pairs of amplification primers mainly used for specifically amplifying most grouper catostomidae mitochondrial genome complete sequences and a design method thereof. The invention provides an amplification primer for a grouper catostomidae mitochondrial genome complete sequence, a design method thereof and application thereof. The amplification primer for the grouper catostomidae mitochondrial genome complete sequence consists of 16 pairs of single-chain oligonucleotides, wherein each pair consists of one light-chain primer and one heavy-chain primer. The amplification primer for the grouper catostomidae mitochondrial genome complete sequence can be used in the aspects of variety authentication, geographical population authentication, germplasm resource evaluation and the like.

The invention discloses a polychronic time sequence similarity analysis method based on a weighting BORDA counting method. The method comprises the steps of conducting PCA processing on polychronic sequences to be inquired and inquired sequences, reserving front p-dimensional principal component sequences with the characteristic value contribution rate reaching a certain threshold value (such as 80% and 95%), forming the p-dimensional principal component sequences, selecting a unitary time sequence similarity analysis method from existing time sequence similarity analysis methods according to the specific analysis requirements (such as sequence form similarity and distorted time shafts), utilizing the selected time sequence similarity analysis method for conducting unitary time sequence similar analysis on each-dimensional sequences of the p-dimensional principal component sequences, obtaining unitary similar (sequences) subsequences of the each-dimensional sequences, trimming the unitary similar (sequences) subsequences, generating polychromic candidate similar (sequences) subsequences, and utilizing the weighting BORDA counting method for conducting voting ranking on the candidate similar (sequences) subsequences to obtain the final similar (sequences) subsequences. The method is suitable for k-neighbor similarity inquiry of the complete sequences and the subsequences.

Methods are provided for adding a terminal sequence tag to nucleic acid molecules for use in RNA or DNA amplification. The tag introduced may be used as a primer binding site for subsequent amplification of the DNA molecule and / or sequencing of the DNA molecule and therefore provides means for identification and cloning of the 5′-end or the complete sequence of mRNAs.

The invention provides an SNP (single nucleotide polymorphism) marker (comprising SNP1 and SNP4) for evaluating growth performance of ctenopharyngodonidella and a primer pair for amplifying a gene segment where an SNP locus is positioned by virtue of methods of molecular genetics and molecular biology. SNP1 is positioned at the 940th locus in a promoter of a complete sequence of a MyoD (myogenic determining factor) gene of the ctenopharyngodonidella, and a base T is inserted or deficient at the position; SNP4 is positioned in a 107th locus in a first intron of the complete sequence of the MyoD gene of the ctenopharyngodonidella, and a base at the position is A or T. The growth performance of the ctenopharyngodonidella is determined by detecting haplotypes of the two SNP loci. The adopted haplotypes are mutated according to bases generated in the MyoD gene, so that genetic exchange and further phenotype verification are avoided. By virtue of the haplotypes of the SNP marker, rapidly growing ctenopharyngodonidella can be simply and rapidly identified, and rapidly growing ctenopharyngodonidella of a new line can also be guided to be bred.

The invention discloses a tobacco PDS gene fragment-containing cucumber mosaic virus RNA2 attenuated mutant type plasmid vector and application thereof. The plasmid vector contains a CMVFny strain RNA2 complete sequence, and a tobacco PDS gene 199bp fragment is inserted behind a 2a protein termination codon. The plasmid vector and a wild CMVFny RNA1 and wild CMVFny RNA3-containing plasmid are inoculated to nicotiana benthamiana through an agrobacterium infiltration method, so that weakly pathogenic symptoms can be displayed, and the capacity of inducing gene silencing can be judged with nakedeyes without depending on an instrument; great convenience is provided for deep researches on attenuated vaccines.

The invention discloses an event whole sequence with an integration site of a foreign vector transferred by transgenic paddy rice TT51-1 and application of the event whole sequence, relating to safety evaluation and detection of transgenic paddy rice in the biological engineering technical field. The invention uses transgenic insect-resistant rice variety TT51-1 as a material, extracts a gene group DNA as a template, and divides into four sections to enlarge TT51-1 event whole sequence containing a side paddy rice gene group sequence which is shown in SEQ NO.1, and the whole sequence is formed commonly by a basic group of between first and 673rd from the paddy rice gene group, a basic group of between 674th and 9364th from a vector sequence and a basic group of between 9365th and 10536th from the paddy rice gene group; the whole sequence is applicable to carrying out detection, monitoring and safety management of the transgenic paddy rice TT51-1(including parent strain, hybridism F1 and later generation) and products (including plant, tissue, paddy, rice and products thereof).

A networking device such as a router may include, in one embodiment, a database storing a plurality of link state entries, and a cache operatively coupled with the database, the cache storing entries relating to the link state entries of the database. The networking device may also include a module for sending, over a network, packets including link state data, the module operatively coupled with the cache. In one example, the module accesses the cache to create one or more packets including link state data. Embodiments of the invention may be used for forming CSNP packets (complete sequence number packets) without the need for having to repeatedly walking a link state database in order to form the CNSP packets.

The invention discloses preparation of novel duck reovirus recombinant sigma B protein antigen, and application of the novel duck reovirus recombinant sigma B protein antigen in detection of a novel duck reovirus antibody. With RNA (ribonucleic acid) of the novel duck reovirus (NDRV) as a template, a nucleotide complete sequence of an NDRV S3 gene coding region can be amplified through a reverse-translation polymerase-chain reaction, is directionally subcloned to a fusion expression vector of the prokaryotic expression vector pET-30a-C(+) of escherichia coli, and transformed into the host cell of the Escherichia coli BL21 (DE3), and is subjected to inducible expression with IPTG (isopropyl-beta-d-thiogalactoside), purification of Ni-NTA Agarose, inclusion body refolding to obtain the expressed NDRV alpha B recombinant protein antigen. The expression mode of the protein is fusion protein (His-alpha B) with molecular weight being about 44kU; and immunoblotting assays prove that the protein has immunoreactivity similar to natural protein..

The invention discloses an event whole sequence with an integration site of a foreign vector transferred by transgenic paddy rice TT51-1 and application of the event whole sequence, relating to safety evaluation and detection of transgenic paddy rice in the biological engineering technical field. The invention uses transgenic insect-resistant rice variety TT51-1 as a material, extracts a gene group DNA as a template, and divides into four sections to enlarge TT51-1 event whole sequence containing a side paddy rice gene group sequence which is shown in SEQ NO.1, and the whole sequence is formed commonly by a basic group of between first and 673rd from the paddy rice gene group, a basic group of between 674th and 9364th from a vector sequence and a basic group of between 9365th and 10536th from the paddy rice gene group; the whole sequence is applicable to carrying out detection, monitoring and safety management of the transgenic paddy rice TT51-1(including parent strain, hybridism F1 and later generation) and products (including plant, tissue, paddy, rice and products thereof).

The invention provides a bidirectional LSTM and CNN model for predicting DNA-protein binding. The model includes an input layer, a BLSTM layer, a convolutional layer, a maximum pooling layer, a full connection layer, and an output layer. Each input sequence is expressed as a four-line binary matrix by the input layer through single thermal coding. In the BLSTM layer, each LSTM model in a previouslayer will receive information of interest on DNA from an input sequence, and encode and interpret contributions from past historical information to a hidden state; then, the BLSTM module is propagated to the next BLSTM module, wherein a matrix scanned and input by each convolution kernel in the convolution layer is used for motif discovery, and information with different intensities is associatedwith potential sequence patterns; the maximum pooling layer is used for maximizing an output signal of each convolution kernel to form a complete sequence; the output layer performs non-linear conversion to determine DNA-protein binding feature information.

The present invention discloses a numeric control code compiler, and also discloses a method for creating numeric control system software by using said numeric control code compiler. It is characterized by that it includes the following several steps: (1), constructing PIDP_NC code compiler; (2), in upper-position machine adopting PIDP_NC code compiler to compile NC program into object code file with specific data format and complete sequence execution signification; (3), upper-position machine can feed the PIDP object codes into lower-position machine circulation buffer zone in batches according to sequence; and (4), lower-position machine can read out PIDP object codes from circulation buffer zone according to sequence, identify the data in PIDP and judge the significance correspondent to NC command, at the same time obtain correspondent data and call correspondent motion control function according to significance of command so as to implement processing control.

The invention discloses lactobacillus rhamnosus, cultivation of the lactobacillus rhamnosus and a microcapsule method. The bacterial strain is preserved in China General Microbiological Culture Collection Center (CGMCC); a registering number is CGMCC NO.3994; a Latin name of the bacterial strain is Lactobacillus rhamnosus LC-STH-13; morphological characteristics are gram-positive bacteria, short-rod bacterial thallus, no motion, no gemma, circular bacterial colony, milk white, tidy edges, smooth surfaces and protuberant cores. The invention further discloses a 16S ribosome DNA (Deoxyribose Nucleic Acid) (16S rDNA) complete sequence of the lactobacillus rhamnosus. The lactobacillus rhamnosus has the advantages that a culture is short in growth cycle, high in breeding speed and- produced lactic acid concentration. The lactobacillus rhamnosus can -colonize and survive in an intestinal tract, improves a mucosal barrier function of a gastrointestinal tract, has a function of improving the gastrointestinal tract, and restrains the colonization of harmful bacteria; and after being embedded by a microcapsule, the lactobacillus rhamnosus has stronger ability to resist the poor environment.

The invention belongs to the technical field of polypeptide drugs in biochemistry and particularly relates to applications of odorrana grahami polypeptide AH90 and CW49 for promoting skin regeneration. The polypeptide AH90 which has the molecular weight of 2657.18 Da, the isoelectric point of 10.26 and the complete sequence primary structure of ATAWDFGPHGLLPIRPIRIRPLCG is used as a drug to be applied to treatments of body-surface traumas, burns and skin ulcer, reduction of scar formation and acceleration of scar repair. The polypeptide CW49 which has the molecular weight of 1210.43 Da, the isoelectric point of 8.29 and the complete sequence primary structure of APFRMGICTTN is used as a drug to be applied to treatments of body-surface traumas, burns and skin ulcer, reduction of scar formation and acceleration of scar repair. The odorrana grahami polypeptide AH90 and CW49 for promoting skin regeneration can promote skin regeneration and reduce epidermis proliferation thickness during the skin regeneration and can be used for preparing drugs for treating body-surface traumas, burns and skin ulcer, reducing scar formation and accelerating scar repair.

The invention relates to rana pleuraden antioxidant peptide and genes and an application thereof, belonging to the technical field of biomedical science. The rana pleuraden antioxidant peptide is thesingle chain polypeptide through genetic encoding of Chinese amphibians rana pleuraden, wherein, the molecular weight is 1653.88 daltons, the isoelectric point is 8.22, and the complete sequence of the rana pleuraden antioxidant peptide is NH2-GIRPTYNRQCEIGF-COOH; the gene for encoding is composed of 316 nucleotides, wherein, the encoding mature part is the 130-171th nucleotide. The synthetic ranapleuraden antioxidant peptide features strong antioxidant activity, can be applicable to the preparation of medicines of skin antioxidant protection and free radicals in vivo elimination, and has theadvantages of simple sequence and convenient synthesis.

The invention belongs to the technical field of iron core production equipment and relates to a complete-sequence iron core lamination robot gripper which comprises a top plate, wherein a connector for being connected with an arm of a robot is arranged at the top part of the top plate; a slide rail is arranged on the lower surface of the top plate; a screw rod is arranged at the middle part of the slide rail; two sliding blocks are arranged on the slide rail and fixedly connected with two clamping teeth respectively; a motor is installed at the end part of the top plate; the output end of the motor is connected with the screw rod; the screw rod drives the two sliding blocks to move towards opposite directions; and a lifting device is arranged between the two clamping teeth. The complete-sequence iron core lamination robot gripper has compact, reasonable and efficient layout, can efficiently complete iron core lamination work with high quality, is high in automation degree, improves the production efficiency, solves the problem about low efficiency, poor performance and rusted iron cores caused by artificial lamination, improves the production efficiency and the quality of a product and reduces used persons.