Abstract: Provided in the present application are a composition for detecting occult blood in excreta, and a preparation method therefor and the use thereof. The composition comprises, in parts by weight, 20-80 parts of organic solvent, 0.01-50 parts of thickener, 0.01-2 parts of benzidine, 0.01-5 parts of peroxide, 0.001-0.5 parts of EDTA-2Na and 10-80 parts of water. The composition provided in the present application can quickly and effectively detect the occult blood condition of excreta, has fast color change, long color retention time and high sensitivity.

Abstract: The present application relates to a coating composition, a process for preparing the coating composition and an article containing a coating formed by the coating composition. It relates in particular to a dual-curing coating system, comprising: a film-forming resin composition comprising an aqueous dispersion of at least one carboxyl functional polymer; a first crosslinking agent comprising an epoxy silane; and a second crosslinking agent comprising an isocyanate.

Abstract: The present application relates to a two-component aqueous sealing primer for wood, comprising: Component A: a film-forming resin composition comprising at least one aqueous emulsion of cationic resin and optionally at least one additional additive; and Component B: a curing agent composition comprising at least one polyisocyanate. The formed sealing coating can substantially seal the tannin, grease, and other substances in the wood, and has good sandability.

Abstract: A system can receive an identifier for a query used by a query service of one or more query services and an identifier for the query used by an issuing computer system. The query service and the computer system that issued the query can use different schemas for query results. A mapping can be established that maps elements of one schema to the other schema. This mapping, and a mapping of the query identifiers, can be used to convert query results to a format useable by the computing system that issued the query. By converting query results from multiple query services, which may have different formats, to a common format of the issuing computing system, the use of multiple query services is facilitated.

Abstract: Techniques and solutions are described for receiving query results from one or more query services. A system implementing disclosed techniques can receive an identifier for the query used by a query service and an identifier for the query used by the issuing computer system. The query service and the computer system that issued the query can use different schemas for query results. A mapping can be established that maps elements of one schema to the other schema. This mapping, and a mapping of the query identifiers, can be used to convert query results to a format useable by the computing system that issued the query. By converting query results from multiple query services, which may have different formats, to a common format of the issuing computing system, the use of multiple query services is facilitated.

Abstract: A method of enabling compiler assisted parallelization of one or more stream processing operators in a stream processing application, which consists of a data flow graph with operators as vertices connected by streams. The method includes specifying a parallelized version of one or more of the operators, with a parameterized degree of parallelism, in the stream application, evaluating whether or not to use the parallelized operator, deciding the degree of parallelism of the parallelized operator, if there is a need for a parallelized operator.

Abstract: A method of enabling compiler assisted parallelization of one or more stream processing operators in a stream processing application, which consists of a data flow graph with operators as vertices connected by streams. The method includes specifying a parallelized version of one or more of the operators, with a parameterized degree of parallelism, in the stream application, evaluating whether or not to use the parallelized operator, deciding the degree of parallelism of the parallelized operator, if there is a need for a parallelized operator.