Abstract: The invention relates to the application of the ERH gene in the preparation of bladder cancer diagnosis and treatment products. The ERH gene is found to have a good correlation with bladder cancer. In addition, an RNA interference vector is constructed to perform cell function experiments to study the effect of ERH gene on the proliferation and clonality of bladder cancer cells. The present invention provides a research basis for clinical diagnosis and treatment of bladder cancer and has a good application prospect.

Abstract: A method for extracting functional ingredients of mulberry leaves using enzyme is provided. A method for preparing crude cellulase enzyme solution and crude pectinase enzyme solution includes: preparing PDA slant culture mediums; preparing fermentation mediums for producing cellulase and pectinase; preparing solid bacteria; fermentation; preparing crude cellulase enzyme solution and crude pectinase enzyme solution. A preparation method of mulberry leaf concentrate is provided and includes: enzymatic hydrolysis, enzyme inactivation and concentration. A method for preparing mulberry leaf products from mulberry leaf concentrate is provided.

Abstract: The invention relates to the application of the ERH gene in the preparation of bladder cancer diagnosis and treatment products. The ERH gene is found to have a good correlation with bladder cancer. In addition, an RNA interference vector is constructed to perform cell function experiments to study the effect of ERH gene on the proliferation and clonality of bladder cancer cells. The present invention provides a research basis for clinical diagnosis and treatment of bladder cancer and has a good application prospect.

Abstract: A method for pushing information based on a user emotion including recordings of behavior habits of the user based on a number of predefined emotions within a predefined time period can be implemented in the disclosed electronic device. Based on each predefined emotion, a proportion of each behavior habit of the user is determined at the predetermined time intervals. The device determines information to be pushed according to a current user emotion and the proportions of the behavior habits of the user corresponding to the current user emotion, and the electronic device is controlled to push the determined information.

Abstract: An apparatus for holding dental floss in tension, comprises of two components that form two sets of pivoted arms that holds the floss in tension between them; a means that host a repository of floss, such as a spool for example; and a means to anchor the dental floss that also hosts a sharp object to sever the excessive floss segment. Angular movement happens when the said two pivoted components move close to and away from each other. The said angular movement is then transformed to the horizontal sliding movement of a separate module which in turn locks the said repository of the spool, stopping it from dispensing more floss; changes the overall body length of the said apparatus; and drive a means which anchor and grip tight the floss. Together the locked repository, gripping anchor, and changing of the device length tighten the floss being held between the said two sets of the pivoted arms.

Abstract: A method for pushing information based on a user emotion including recordings of behavior habits of the user based on a number of predefined emotions within a predefined time period can be implemented in the disclosed electronic device. Based on each predefined emotion, a proportion of each behavior habit of the user is determined at the predetermined time intervals. The device determines information to be pushed according to a current user emotion and the proportions of the behavior habits of the user corresponding to the current user emotion, and the electronic device is controlled to push the determined information.

Abstract: Query requests for RDF triples are obtained, wherein the query request(s) contain(s) at least one triple pattern; for each triple pattern, the corresponding elementary pattern is determined, and each triple pattern is converted to a weighted elementary pattern. The occurrence frequency of each elementary pattern is computed based on the weighted elementary patterns; at least one elementary pattern is chosen at least according to the occurrence frequency; and the RDF triples corresponding to the chosen at least elementary pattern are prefetched into the buffer. The corresponding apparatus is also provided. With the above method and apparatus, the frequently accessed RDF triples can be determined and prefetched into the buffer, which improves the query efficiency.

Abstract: A method and system for generating a job alert. According to embodiments of the present invention, before a target job is processed, a characteristic of input and output of the target job in at least one stage is determined through analyzing a historical job, and a resource overhead associated with the processing of the target job is calculated based on the characteristic of input and output. Then, an alert for the target job is generated in response to the resource overhead exceeding a predetermined threshold. In such manner, an alert for the target job can be proactively generated before the resource overhead problem occurs, so as to enable an administrator or developer to discover a fault in advance and adopt measures actively to avoid loss and damage to the intermediate results or output data when the target job is processed.

Abstract: An information processing system, a computer readable storage medium, and a method of managing a query to find a set of JSON documents in a multi-schema JSON document store. A query engine receives a first query to find at least one JSON document in a plurality of sets of JSON documents stored in the JSON document store, each set of JSON documents being organized in a unique JSON schema version related to a unique JSON schema version of each other set of JSON documents by at least one schema change. The first query is organized in a first unique JSON schema version. A query translator translates the first query into a plurality of queries based on the plurality of schema changes. The first and the plurality of queries are executed to provide a collective set of query results.

Abstract: Data analytics is performed on a distributed document storage database by receiving a request for initiating a data analytics job; collecting statistics from the database in response to the request; using the statistics to estimate a first cost for merging an incremental data update for the job into a first resilient distributed dataset; using the statistics to estimate a second cost for newly creating a second resilient distributed dataset for the job; when the first cost is less than the second cost, reading data updates from the database and merging the data updates into the first resilient distributed dataset; and when the first cost is not less than the second cost, newly creating the second resilient distributed dataset by reading all documents from the database.

Abstract: Provided herein are methods of applying the ERH gene in the preparation of bladder cancer diagnosis and treatment products. The ERH gene is found to have a good correlation with bladder cancer. In addition, an RNA interference vector is constructed to perform cell function experiments to study the effect of ERH gene on the proliferation and clonality of bladder cancer cells. The methods disclosed herein provide a research basis for clinical diagnosis and treatment of bladder cancer and has a good application prospect.

Abstract: A method for processing a time series includes dividing, with a processing device, the time series into a plurality of windows by time; extracting at least one group of similar subsequences from a current window among the plurality of windows; and updating a candidate list on the basis of comparison between similar subsequences in each group of the at least one group with k characteristic subsequences in the candidate list; wherein the k characteristic subsequences are k characteristic subsequences with a greatest number of occurrences in at least processed parts of the time series.

Abstract: A method for processing a time series includes dividing, with a processing device, the time series into a plurality of windows by time; extracting at least one group of similar subsequences from a current window among the plurality of windows; and updating a candidate list on the basis of comparison between similar subsequences in each group of the at least one group with k characteristic subsequences in the candidate list; wherein the k characteristic subsequences are k characteristic subsequences with a greatest number of occurrences in at least processed parts of the time series.

Abstract: Data analytics is performed on a distributed document storage database by receiving a request for initiating a data analytics job; collecting statistics from the database in response to the request; using the statistics to estimate a first cost for merging an incremental data update for the job into a first resilient distributed dataset; using the statistics to estimate a second cost for newly creating a second resilient distributed dataset for the job; when the first cost is less than the second cost, reading data updates from the database and merging the data updates into the first resilient distributed dataset; and when the first cost is not less than the second cost, newly creating the second resilient distributed dataset by reading all documents from the database.

Abstract: An information processing system, a computer readable storage medium, and a method of managing a query to find a set of JSON documents in a multi-schema JSON document store. A query engine receives a first query to find at least one JSON document in a plurality of sets of JSON documents stored in the JSON document store, each set of JSON documents being organized in a unique JSON schema version related to a unique JSON schema version of each other set of JSON documents by at least one schema change. The first query is organized in a first unique JSON schema version. A query translator translates the first query into a plurality of queries based on the plurality of schema changes. The first and the plurality of queries are executed to provide a collective set of query results.

Abstract: An information processing system, a computer readable storage medium, and a method of managing a query to find a set of JSON documents in a multi-schema JSON document store. A query engine receives a first query to find at least one JSON document in a plurality of sets of JSON documents stored in the JSON document store, each set of JSON documents being organized in a unique JSON schema version related to a unique JSON schema version of each other set of JSON documents by at least one schema change. The first query is organized in a first unique JSON schema version. A query translator translates the first query into a second query based on the at least one schema change. The first and second queries are executed to provide first and second query results which are collectively returned.

Abstract: An information processing system, a computer readable storage medium, and a method of managing a query to find a set of JSON documents in a multi-schema JSON document store. A query engine receives a first query to find at least one JSON document in a plurality of sets of JSON documents stored in the JSON document store, each set of JSON documents being organized in a unique JSON schema version related to a unique JSON schema version of each other set of JSON documents by at least one schema change. The first query is organized in a first unique JSON schema version. A query translator translates the first query into a second query based on the at least one schema change. The first and second queries are executed to provide first and second query results which are collectively returned.

Abstract: Query requests for RDF triples are obtained, wherein the query request(s) contain(s) at least one triple pattern; for each triple pattern, the corresponding elementary pattern is determined, and each triple pattern is converted to a weighted elementary pattern. The occurrence frequency of each elementary pattern is computed based on the weighted elementary patterns; at least one elementary pattern is chosen at least according to the occurrence frequency; and the RDF triples corresponding to the chosen at least elementary pattern are prefetched into the buffer. The corresponding apparatus is also provided. With the above method and apparatus, the frequently accessed RDF triples can be determined and prefetched into the buffer, which improves the query efficiency.

Abstract: A method for controlling at least one peripheral device and associated electronic device and control system are provided. The method includes: detecting existence of a first mobile device by checking a wireless connection associated with the first mobile device; and when the existence of the first mobile device is detected, obtaining user data of the first mobile device through the wireless connection, and broadcasting the user data of the first mobile device to the peripheral device(s) for controlling a setting of each peripheral device.