38results about How to "Reduce comparison" patented technology

Embodiments disclosed herein can significantly optimize a root cause analysis and substantially reduce the overall time needed to isolate the root cause or causes of service degradation in an IT environment. By building on the ability of an abnormality detection algorithm to correlate an alarm with one or more events, embodiments disclosed herein can apply data correlation to data points collected within a specified time window by data metrics involved in the generation of the alarm and the event(s). The level of correlation between the primary metric and the probable cause metrics may be adjusted using the ratio between theoretical data points and actual points. The final Root Cause Analysis score may be modified depending upon the adjusted correlation value and presented for user review through a user interface.

The invention relates to the identification and use of gene expression profiles, or patterns, suitable for identification of populations that are positive and negative for estrogen receptor expression. The gene expression profiles may be embodied in nucleic acid expression, protein expression, or other expression formats, and may be used in the study and / or diagnosis of cells and tissue in breast cancer as well as for the study and / or determination of prognosis of a patient, including breast cancer survival.

The invention relates to the identification and use of gene expression profiles, or patterns, suitable for identification of breast cancer patient populations with different survival outcomes. The gene expression profiles may be embodied in nucleic acid expression, protein expression, or other expression formats, and may be used in the study and / or determination of the prognosis of a patient, including breast cancer survival.

The invention discloses a block level backup method based on content address storage, which comprises the steps that A, according to a size and a threshold of a predefined data segment and a source volume state bitmap, and by taking a data block as a unit, and a continuous 1 sequence in the source volume state bitmap as a basis, a source volume data area is segmented, and each single segment is named as a data segment; and B, according to a fingerprint algorithm, a data segment fingerprint is computed, an old fingerprint of each data segment is acquired by querying a fingerprint library, whether each data segment is a repeating data segment or a non-repeating data segment is determined, each non-repeating data segment is transmitted to a storage medium by a network, and the fingerprint library is updated. The invention further provides a client based on the content-addressed storage and a network storage system. With the adoption of the technical scheme, high-efficiency de-duplication can be achieved.

The invention provides a judgment method and device of a malicious order address. By means of the judgment method and device of the malicious order address, a malicious order user can be quickly judged and found, particularly, the malicious order user who frequently scrambles for an order can be quickly judged and found and intercepted, the interests of a common user are ensured, the address query time is short, and the query efficiency is high. The judgment method of the malicious order address includes the steps that order addresses are received, and the addresses with the most identical parts as the order addresses are found from an address base and used as similar addresses according to a scheduled sequence; the similarity and query time difference of the similar addresses and the order addresses are calculated, and the accumulated query times of the similar addresses are acquired, wherein the query time difference is the minimum of the differences between the current query time of the order addresses and the query time of the similar addresses; based on the similarity, the query time difference and the accumulated query times, the scores of the order addresses are calculated; the order address of which the score is greater than a preset score threshold is judged as the malicious order address.

The invention relates to a low-complexity column layered LDPC decoder realizing method. According to the method of the invention, based on conventional LDPC hierarchical decoding, an efficient external information compression method is adopted, and a lost smallest value and second smallest value are obtained through compensation calculation, and each check node only needs to store an information two-tuple set composed of a smallest value and a second smallest value of external information in a decoding process, and therefore, a decoder' demand quantity of storage resource of the external information in the decoding process can be effectively decreased, and the number of times of comparison and replacement required by compression and storage computation can be greatly decreased. The method can maintain excellent decoding performance when decreasing storage and computation resources.

The invention discloses a Chinese PINYIN quick word segmentation method based on a word search tree. The method is implemented by a computer or embedded mobile equipment and comprises the following working steps of: 1, building a Chinese character PINYIN search tree according to all the known Chinese character PINYIN lists; 2, combining the search tree with a hash table according to the built word search tree, and segmenting a string of given Chinese PINYINs; 3, working out a word segmentation result; and 4, destroying the search tree and releasing resources. Due to a public prefix of a character string, a construction space is saved, so that unnecessary character string comparison is greatly reduced; by the redundancy hash table with an index, the search efficiency is improved; and the time complexity of an algorithm is reduced to the minimum.

The invention discloses an RIB rendering compressed file FPGA compression / decompression system and hardware decompression method. The system includes a client which is used to transfer the RIB rendering compressed files to a compression module. The compression module transfers the RIB rendering compressed files to a pre-processing module from the client through WAN to compress the RIB rendering compressed files from the client to the server end. RIB rendering compressed files are transferred to FPGA hardware decompression module through the WAN after being compressed with a batch by the compression module. The compression data is read by the FPGA hardware decompression module to realize the hardware decompression of RIB rendering compressed files and output the decompression results to theserver end. The server end is used to access the rendering unit to complete subsequent rendering tasks. The system improves the speed of decompression and reduce the power consumption required for the decompression process.

Embodiments disclosed herein can significantly optimize a root cause analysis and substantially reduce the overall time needed to isolate the root cause or causes of service degradation in an IT environment. By building on the ability of an abnormality detection algorithm to correlate an alarm with one or more events, embodiments disclosed herein can apply data correlation to data points collected within a specified time window by data metrics involved in the generation of the alarm and the event(s). The level of correlation between the primary metric and the probable cause metrics may be adjusted using the ratio between theoretical data points and actual points. The final Root Cause Analysis score may be modified depending upon the adjusted correlation value and presented for user review through a user interface.

The invention permits a comparison of two technical systems, which according to conventional opinion is not possible to carry out, based on a substantially simpler, technically achievable comparison, in which part systems of one or both systems are specifically replaced. The replacements are performed in a controlled manner by monitoring a replacement condition with constraints. The monitoring of the replacement condition and the generation and monitoring of the necessary constraints occur automatically. A comparison of both systems can thus be carried out based on the replacement of the part systems without introducing a loss of precision in the comparison.

External preparations for allergic dermatitis containing Aspirin alone as the active ingredient, which exert an excellent therapeutic effects on allergic dermatitis with lower side effects; and a method for treating allergic dermatitis by using these agents for external use.

The invention discloses a method for screening a nearest neighbor by using a potential neighbor relation graph in a recommendation system. The method comprises the following steps: (1) generating an object cluster set C with a redundant feature; (2) constructing the potential neighbor relation graph corresponding to the cluster set C; (3) quantifying weight of each edge in the potential neighbor relation graph, wherein the weight of the edge represents the possibility that two adjacent objects of the edge become the nearest neighbors; (4) clipping a potential neighbor relation to weed out redundant comparisons; (5) screening the nearest neighbor of a target according to the clipped potential neighbor relation graph. According to the screening method, on the premise of guaranteeing the recommendation precision, a recommendation based on a complete large-scale data set is mapped to a recommendation of a data set with a relatively small scale, so that the scale of the recommendation system is reduced, and high efficiency of the recommendation method is guaranteed.

The invention relates to a fast-moving star tracking matching identification method of a star sensor and relates to the field of satellite autonomous navigation technologies. By utilizing the fast-moving star tracking matching identification method, the problems of small number of tracking matching fixed stars obtained by the existing identification method of tracking star of the star sensor and poor stability of a tracking method are solved. The existing method has the problem of mismatching caused by the fixed star just entering the field of view. For ensuring matching effectiveness simultaneously, the number of the tracked matching fixed stars is further increased so as to improve the stability of a star tracking algorithm. In the matching process, in order to make a smaller amount of calculation, matching number state identification and borderline state identification arrays are subjected to operation with bitwise, and if a result is 1, matching is considered to be successful. By adopting the identification method with first sorting and second two-way recursive matching, pointless comparison is reduced, mismatching caused by the star newly entering the field of view is eliminated, most important of all, the number of the tracked matching fixed starts of every step is greatly improved, and the stability of the tracking algorithm is further improved.

The invention discloses a method and a system for accelerating large-scale protein identification by using a suffix array. The method comprises the steps of: 1, establishing a corresponding suffix array according to a protein sequence in a database, and deducing a longest public prefix corresponding to the protein sequence according to the suffix array; 2, performing online enzyme digestion on the protein sequence based on the longest public prefix and an enzyme digestion rule so as to obtain a non-redundant peptide; and 3, performing peptide mapping matching identification according to a tandem mass spectrum and the non-redundant peptide, and deducing a corresponding protein sequence by utilizing the peptide obtained through identification. According to the invention, the purposes of redundant peptide removal and rapid query are achieved, and the identification speed for the protein is increased; meanwhile, the method is beneficial to lossless precision, requires less time and space and is more convenient to use.

The invention discloses a command line analysis method and device. The command line analysis method comprises the following steps that selectable keywords input by a user are obtained; hash values of the selectable keywords are obtained through calculation according to a hash algorithm formula; corresponding element positions in a hash array are indexed according to the hash values; whether matched keywords which are the same as the selectable keywords are included in the element positions or not is judged, if not, the user is informed of input errors, and if yes, actions corresponding to the selectable keywords are executed. The hash algorithm is used for replacing a common processing method for character string comparison and analysis in sequence according to keywords, the character string comparison is reduced, and the performance of the command line analysis process is improved.

The invention discloses an article similarity detection method and device. The method comprises the following steps of: extracting text features of a to-be-detected first article and a to-be-detected second article by using a neural network model; determining the similarity of the text features of the first article and the second article; and under the condition that the text features of the first article and the second article are similar, performing sentence granularity comparison on the first article and the second article to determine the similarity of the first article and the second article. In addition, the similarity detection result of the first article and the second article can be uploaded to a block chain system for evidence storage.

The invention relates to an associated equipment information display method based on a screen household appliance, which is applied to a kitchen household appliance and comprises the following steps:acquiring distance information between a user and the household appliance; determining associated equipment information according to the food material information of the household appliance and the distance information, and displaying the associated equipment information on a display screen; wherein the food material information comprises the types of food materials and the cooking or processing types of the food materials by the household appliance. By adopting the technical scheme, the push associated equipment information can be displayed through the display screen of the household appliance, so that a user can obtain proper household appliance information, and the use experience of the user is improved.

The invention provides a method for searching for webpage incompatible labels in a parallel mode based on MapReduce. The method is used for fast locating the incompatible labels. The method enables codes to be scanned to be divided into n blocks, a Map function is used on m computers for searching for the incompatible labels in the code blocks, and a used incompatible label base is a Trie structure organization. When the incompatible labels are found, the line numbers, the column numbers and the code block numbers of the labels are recorded. Finally, gathering processing is carried out on recorded results though a Reduce operation, and the positions of all the incompatible labels are returned to a user. The method can be used for the multi-platform deployment of a large-scale Web application programme, the incompatible labels can be fast located, an engineer is assisted in fast locating the incompatible labels needing to be processed in source codes, and deployed Web application is made to normally displayed on different browsers.

The invention relates to a fast-moving star tracking matching identification method of a star sensor and relates to the field of satellite autonomous navigation technologies. By utilizing the fast-moving star tracking matching identification method, the problems of small number of tracking matching fixed stars obtained by the existing identification method of tracking star of the star sensor and poor stability of a tracking method are solved. The existing method has the problem of mismatching caused by the fixed star just entering the field of view. For ensuring matching effectiveness simultaneously, the number of the tracked matching fixed stars is further increased so as to improve the stability of a star tracking algorithm. In the matching process, in order to make a smaller amount of calculation, matching number state identification and borderline state identification arrays are subjected to operation with bitwise, and if a result is 1, matching is considered to be successful. By adopting the identification method with first sorting and second two-way recursive matching, pointless comparison is reduced, mismatching caused by the star newly entering the field of view is eliminated, most important of all, the number of the tracked matching fixed starts of every step is greatly improved, and the stability of the tracking algorithm is further improved.

The invention discloses a method for screening a nearest neighbor by using a potential neighbor relation graph in a recommendation system. The method comprises the following steps: (1) generating an object cluster set C with a redundant feature; (2) constructing the potential neighbor relation graph corresponding to the cluster set C; (3) quantifying weight of each edge in the potential neighbor relation graph, wherein the weight of the edge represents the possibility that two adjacent objects of the edge become the nearest neighbors; (4) clipping a potential neighbor relation to weed out redundant comparisons; (5) screening the nearest neighbor of a target according to the clipped potential neighbor relation graph. According to the screening method, on the premise of guaranteeing the recommendation precision, a recommendation based on a complete large-scale data set is mapped to a recommendation of a data set with a relatively small scale, so that the scale of the recommendation system is reduced, and high efficiency of the recommendation method is guaranteed.

A low-complexity column layered LDPC decoder implementation method, which adopts an efficient outer information compression and storage method on the basis of conventional LDPC layered decoding and compensates for the minimum and sub-minimum values ​​of the loss. , in the decoding process, each check node only needs to store the information tuples consisting of the minimum value and the second smallest value of the external information, which effectively reduces the storage resource requirements of the decoder for external information during the decoding process, and greatly reduces the The number of comparisons and replacements required for compressing storage computing is reduced, and the method can maintain excellent decoding performance while reducing storage and computing resources.

The invention provides a method for searching for webpage incompatible labels in a parallel mode based on MapReduce. The method is used for fast locating the incompatible labels. The method enables codes to be scanned to be divided into n blocks, a Map function is used on m computers for searching for the incompatible labels in the code blocks, and a used incompatible label base is a Trie structure organization. When the incompatible labels are found, the line numbers, the column numbers and the code block numbers of the labels are recorded. Finally, gathering processing is carried out on recorded results though a Reduce operation, and the positions of all the incompatible labels are returned to a user. The method can be used for the multi-platform deployment of a large-scale Web application programme, the incompatible labels can be fast located, an engineer is assisted in fast locating the incompatible labels needing to be processed in source codes, and deployed Web application is made to normally displayed on different browsers.

The invention discloses a column aggregation method of HBASE. Based on the HBase server query mechanism, the system architecture of the method is provided with an aggregation scanner module, and the description information of the aggregation table is expanded, and column aggregation attributes are added therein; in the query When merging, the multi-version data of the same cell is aggregated and calculated according to the column aggregation attribute to realize the aggregation on the cell; when the data is merged, the HBase server will have multiple versions according to the column aggregation attribute information in the aggregation table description. The data is aggregated and the result is retained, and the non-result data is cleared after the merge operation is completed. Compared with the prior art, the method disclosed in the present invention has better improvements in terms of real-time performance, performance and resource usage of aggregation table query.

The invention discloses a DNS cache processing method, which comprises the following steps of: storing a corresponding relationship between domain names and IP (Internet Protocol) addresses of DNS caches by adopting a dictionary tree structure, representing the domain names by using character strings corresponding to node paths, and storing the IP addresses corresponding to the domain names by using the positions of nodes; when the data is inserted, creating a node according to a character path in the domain name character string, and storing an IP address corresponding to the domain name intothe node corresponding to the domain name; and when the IP address corresponding to the domain name is queried, searching the node in the tree according to the character string path in the domain name character string, and obtaining the corresponding IP address stored in the node position after the node is found. According to the DNS cache processing mode provided by the invention, the storage space occupation can be greatly reduced while the stable and efficient query efficiency is obtained. According to the method, meaningless character string comparison is reduced, and the query efficiencyis high; the storage space does not need to be pre-allocated, and the occupied space is small; hash processing is not carried out on the data, and no conflict is generated.

The invention discloses a component abnormity information searching method for a monitoring log, and belongs to the field of software engineering. The method comprises the steps of 1, generating a monitor log and exporting to a txt file by a module of the component abnormity information searching method for the monitoring log; 2, sequentially matching each piece of abnormity information with the monitor log from the back to front, and recording the movement distance of the abnormity information as move; 3, looking up a character TSd which firstly appears to be dissimilar with TSm-1 and has the maximal digital distance with the TSm-1, finding the next MLd backwards from a character in the MLd flush with the TSd, and recording the movement distance of the abnormity information as move'; and 4, comparing the move with the move', judging the final movement distance of the abnormity information and moving the abnormity information, and continuing the matching operation. The method provided by the invention has the advantage of less matching times under the condition of ensuring matching accuracy; and the validity of the provided method and the advantage of less matching time are verified through experimental comparison with the existing Sunday character string matching method.

The invention discloses a method for recommending e-commerce commodities based on big data and multiple tags. The recommendation method includes the following steps: Step S1: Collect the search keyword of the commodity input by the user as the first keyword, and collect the purchased products in the user's history. The keyword of each product is the second keyword; step S2: judge whether there is a second keyword and the first keyword as matching keywords, if there is a second keyword and the first keyword as matching keywords, set the last The product corresponding to the second keyword is the product to be matched, and the product searched by the user inputting the first keyword is the search product, and the search product is marked according to the sales page content of the product to be matched and the search product; Step S3: from the marked search The products selected from the products are recommended to users first.