Abstract: Provided are a traditional Chinese medicine ointment for preventing and treating mastitis in dairy cows and a preparation method thereof, belonging to the technical field of veterinary traditional Chinese medicines. The traditional Chinese medicine ointment includes raw materials in parts by mass: 20-30 parts of dandelion, 20-30 parts of herba patriniae, 10-16 parts of Caulis Lonicerae Japonicae, 0.5-1 part of borneol, 0.03-0.05 part of polypeptide, 40-50 parts of auxiliary emulsifier, 40-50 parts of liquid paraffin and 100-130 parts of white vaseline. An amino acid sequence of the polypeptide is: Phe Phe Arg Lys Val Leu Lys Leu Ile Arg Lys Ile Trp Arg (SEQ ID NO. 1). In the application, dandelion, herba patriniae, Caulis Lonicerae Japonicae and borneol 1 are mixed, and polypeptide is added at the same time to prepare ointment.

Abstract: A method for determining parameters of a high-frequency vibrating mill with three grinding drums is disclosed. The mathematic modeling is established by applying the average parameter method and transfer function method; the synchronization-stability capability coefficient curve, and the dimensionless coupling torque maximum value diagram of the system are obtained by the characteristic analysis of synchronization and stability. Finally, the curves of rotational velocity of motors, displacements of mass bodies, and phase difference between exciters are obtained by the simulation, and the correctness of the method is verified by the comparison of characteristic analysis and simulation. The parameters of the high-frequency vibrating mill of the present invention can lower the technical requirements of exciters, reduce the loss of the exciters, increase the service life of the mill.

Abstract: The present application discloses a verification system and method for an operation result based on a reconfigurable butterfly unit. The system is applicable to a digital signal processing (DSP) chip. The DSP chip includes a reconfigurable butterfly unit. The reconfigurable butterfly unit may be reconfigured into two modes: a first verification mode and a second verification mode. The system includes: a controller, a memory, a verification unit, a first data gating unit, and a second data gating unit. The technical solution in the present application is used to overcome the disadvantage that an existing verification system and an existing verification method consume large hardware resources, thereby reducing the implementation costs of operation result verification.

Abstract: The present application discloses a verification system and method for an operation result based on a reconfigurable butterfly unit. The system is applicable to a digital signal processing (DSP) chip. The DSP chip includes a reconfigurable butterfly unit. The reconfigurable butterfly unit may be reconfigured into two modes: a first verification mode and a second verification mode. The system includes: a controller, a memory, a verification unit, a first data gating unit, and a second data gating unit. The technical solution in the present application is used to overcome the disadvantage that an existing verification system and an existing verification method consume large hardware resources, thereby reducing the implementation costs of operation result verification.

Abstract: A method for determining parameters of a high-frequency vibrating mill with three grinding drums is disclosed. The mathematic modeling is established by applying the average parameter method and transfer function method; the synchronization-stability capability coefficient curve, and the dimensionless coupling torque maximum value diagram of the system are obtained by the characteristic analysis of synchronization and stability. Finally, the curves of rotational velocity of motors, displacements of mass bodies, and phase difference between exciters are obtained by the simulation, and the correctness of the method is verified by the comparison of characteristic analysis and simulation. The parameters of the high-frequency vibrating mill of the present invention can lower the technical requirements of exciters, reduce the loss of the exciters, increase the service life of the mill.

Abstract: Exemplary methods, apparatuses, and systems parse data with a plurality of pattern matching rules. Pattern matching rules are applied in an ordered sequence and a first rule is applied to the data before a second rule is applied to the data. In response to determining the second rule matches the data, the sequence is reordered to apply the second rule prior to the first rule.

Abstract: Large amounts of unstructured or semi-structured log data generated by software and infrastructure components of a computing system are processed to identify anomalies and potential problems within the computing system. Stored log messages may be queried and analyzed according to dynamic fields constructed from the content of the log messages. As time goes on, the dynamic fields may be converted into static fields which are extracted and indexed at the time of ingestion of the log messages.

Abstract: A log analytics graphical user interface enables a user to dynamically extract and define a field from unstructured log data. The log analytics module automatically determines a definition for a field based on log text selected by the user. A portion of each log message is highlighted to reflect what the extracted field may be to assist users with understanding if input parameters are selected the intended log data. Changes to the definition of the field, by the user, may cause further highlighting that to indicate an incomplete or erroneous field definition.

Abstract: Techniques for reducing query response time are provided. In one embodiment, a computer system can organize data into a plurality of buckets, where the data is ordered according to a dimension, and where each bucket includes a subset of data that corresponds to a range within the dimension. The computer system can then precompute, for one or more buckets in the plurality of buckets, query results for one or more queries against the bucket, and can store the precomputed query results in a cache.

Abstract: Large amounts of unstructured or semi-structured log data generated by software and infrastructure components of a computing system are processed to identify anomalies and potential problems within the computing system. Stored log messages may be queried and analyzed according to dynamic fields constructed from the content of the log messages. As time goes on, the dynamic fields may be converted into static fields which are extracted and indexed at the time of ingestion of the log messages.

Abstract: Generating an inverted index is disclosed. Semi-structured data from a plurality of sources is parsed to extract structure from at least a portion of the semi-structured data. The inverted index is generated using the extracted structure. The inverted index includes a location identifier and a data type identifier for one or more entries of the inverted index.

Abstract: Exemplary methods, apparatuses, and systems receive data as input to be parsed. The data is parsed using a plurality of pattern matching rules, the plurality of pattern matching rules organized according to a hierarchy including a parent rule and one or more child rules of the parent rule. Parsing includes applying the parent rule to the unstructured data, determining the parent rule is unable to find a pattern match in the unstructured data, and bypassing the application of each child rule to the unstructured data in response to the determination that the parent rule is unable to find a pattern match.

Abstract: Techniques for scheduling query execution are provided. In one embodiment, a computer system can receive a query to be executed and can assign a priority to the query. The computer system can further divide the query into a plurality of sub-queries and can assign a sub-priority to each sub-query, where the sub-priority is based on a resource consumption metric of the query. The computer system can then select, from a plurality of sub-query pools, a sub-query pool that includes sub-queries of queries that have the same priority as the query, and can add the plurality of sub-queries to the selected sub-query pool.

Abstract: Exemplary methods, apparatuses, and systems for parsing unstructured data with a plurality of pattern matching rules are disclosed. An optimized pattern matching rule for one or more respective pattern matching rules is derived from an original pattern matching rule. The optimized pattern matching rule includes an extracted text string from the respective pattern matching rule or a less complex pattern match than the respective pattern matching rule. If the extracted text string or pattern is determined to match any of the data to be parsed, application of the original pattern matching rule is bypassed. The original pattern matching rule is applied when the one or more optimized pattern matching rules match the data.

Abstract: A log analytics graphical user interface enables a user to dynamically extract and define a field from unstructured log data. The log analytics module automatically determines a definition for a field based on log text selected by the user. A portion of each log message is highlighted to reflect what the extracted field may be to assist users with understanding if input parameters are selected the intended log data. Changes to the definition of the field, by the user, may cause further highlighting that to indicate an incomplete or erroneous field definition.

Abstract: A log analytics graphical user interface enables a user to dynamically extract and define a field from unstructured log data. The log analytics module automatically determines a definition for a field based on log text selected by the user. A portion of each log message is highlighted to reflect what the extracted field may be to assist users with understanding if input parameters are selected the intended log data. Changes to the definition of the field, by the user, may cause further highlighting that to indicate an incomplete or erroneous field definition.

Abstract: Techniques for scheduling query execution are provided. In one embodiment, a computer system can receive a query to be executed and can assign a priority to the query. The computer system can further divide the query into a plurality of sub-queries and can assign a sub-priority to each sub-query, where the sub-priority is based on a resource consumption metric of the query. The computer system can then select, from a plurality of sub-query pools, a sub-query pool that includes sub-queries of queries that have the same priority as the query, and can add the plurality of sub-queries to the selected sub-query pool.

Abstract: Techniques for reducing query response time are provided. In one embodiment, a computer system can organize data into a plurality of buckets, where the data is ordered according to a dimension, and where each bucket includes a subset of data that corresponds to a range within the dimension. The computer system can then precompute, for one or more buckets in the plurality of buckets, query results for one or more queries against the bucket, and can store the precomputed query results in a cache.

Abstract: Exemplary methods, apparatuses, and systems receive data as input to be parsed. The data is parsed using a plurality of pattern matching rules, the plurality of pattern matching rules organized according to a hierarchy including a parent rule and one or more child rules of the parent rule. Parsing includes applying the parent rule to the unstructured data, determining the parent rule is unable to find a pattern match in the unstructured data, and bypassing the application of each child rule to the unstructured data in response to the determination that the parent rule is unable to find a pattern match.

Abstract: Exemplary methods, apparatuses, and systems parse data with a plurality of pattern matching rules. Pattern matching rules are applied in an ordered sequence and a first rule is applied to the data before a second rule is applied to the data. In response to determining the second rule matches the data the second rule is determined to match the data and the sequence is reordered to apply the second rule prior to the first rule.