Abstract: The compositions and methods described herein are directed to treating solid tumors using CAR T therapy and/or antibodies targeting GCC. The compositions include CAR comprising an extracellular domain that binds GCC.

Abstract: The present disclosure relates to compositions and methods for compositions, methods, and kits for treating cancer using chimeric antigen receptor (CAR) modified cells. Some embodiments of the present disclosure relate to an isolated nucleic acid sequence encoding CAR. The CAR may include an antigen binding domain, a transmembrane domain, a costimulatory signaling region, and a CD3 zeta signaling domain. The antigen binding domain may bind to an antigen of a non-essential organ.

Abstract: The present disclosure relates to compositions and methods for enhancing infiltration of lymphocytes into tumor tissue, enhancing anti-tumor lymphocyte activities in tumor microenvionment (TME), inhibiting regulatory lymphocyte (e.g., B and T cells) activities in TME, and/or long term benefit of cell therapies. For example, in a method of in vivo cell expansion, the method comprises administering an effective amount of cells comprising an antigen binding molecule to a subject; and administering an effective amount of presenting cells expressing a solid tumor antigen that the binding molecule binds.

Abstract: A method for blockchain generation is provided. The method includes: sending, by a client, transaction information to a first node device, where the transaction information includes basic information and digest information; receiving, by the client, an endorsement result sent by the first node device, where the endorsement result includes a signature generated after the first node device successfully performs transaction simulation; and if the endorsement result meets a preset transaction condition, sending, by the client, the digest information and the endorsement result to a second node device, so that the second node device sends, to the first node device the digest information to generate a complete blockchain. In this way, only the digest information is transmitted between the first node device and the second node device. Therefore, the second node device does not obtain the complete transaction information, so that information security is improved.

Abstract: A compressor, for use alone or as a component part of a turbocharger. The compressor comprises a compressor housing and a compressor wheel mounted in the compressor housing. An internal surface of the compressor housing defines an axial inlet. The axial inlet comprises an annular groove for reducing compressor noise.

Abstract: A consensus process recovery method and a related node, where the method includes determining, by a plurality of nodes, a target instance from one or more secondary instances, where a throughput of the target instance is higher than a throughput of a primary instance, and obtaining, by a first node and all second nodes, a consensus to replace the primary instance with the target instance as a new primary instance, where the second nodes are backup nodes running the target instance, and the first node is a primary node running the target instance.

Abstract: Methods and a system are provided. A method includes automatically detecting, by an attribute structural variation detector, attribute structural variations in record schemas of a database lacking schema enforcement. The automatically detecting step includes encoding, by an encoder, nodes in the record schemas based on respective updated node labels to obtain a plurality of codes. The encoding step comprises, for each of the plurality of codes: recording, by a label frequency counter, a frequency f1 of the record schemas that include a given label; and recording, by a label frequency counter, a frequency fc of the record schemas that use a given one of the plurality of codes to update a label of a next level. An attribute variation is detected and retrieved responsive to the frequency fc?0, and the frequency f1>(two times the frequency fc).

Abstract: A method for blockchain generation is provided. The method includes: sending, by a client, transaction information to a first node device, where the transaction information includes basic information and digest information; receiving, by the client, an endorsement result sent by the first node device, where the endorsement result includes a signature generated after the first node device successfully performs transaction simulation; and if the endorsement result meets a preset transaction condition, sending, by the client, the digest information and the endorsement result to a second node device, so that the second node device sends, to the first node device the digest information to generate a complete blockchain. In this way, only the digest information is transmitted between the first node device and the second node device. Therefore, the second node device does not obtain the complete transaction information, so that information security is improved.

Abstract: A consensus process recovery method and a related node, where the method includes determining, by a plurality of nodes, a target instance from one or more secondary instances, where a throughput of the target instance is higher than a throughput of a primary instance, and obtaining, by a first node and all second nodes, a consensus to replace the primary instance with the target instance as a new primary instance, where the second nodes are backup nodes running the target instance, and the first node is a primary node running the target instance.

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: Methods and a system are provided. A method includes automatically detecting, by an attribute structural variation detector, attribute structural variations in record schemas of a database lacking schema enforcement. The automatically detecting step includes encoding, by an encoder, nodes in the record schemas based on respective updated node labels to obtain a plurality of codes. The encoding step comprises, for each of the plurality of codes: recording, by a label frequency counter, a frequency f1 of the record schemas that include a given label; and recording, by a label frequency counter, a frequency fc of the record schemas that use a given one of the plurality of codes to update a label of a next level. An attribute variation is detected and retrieved responsive to the frequency fc?0, and the frequency f1>(two times the frequency fc).

Abstract: Methods and a system are provided. A method includes automatically detecting, by an attribute structural variation detector, attribute structural variations in record schemas of a database lacking schema enforcement. The automatically detecting step includes encoding, by an encoder, nodes in the record schemas based on respective updated node labels to obtain a plurality of codes. The automatically detecting step further includes clustering, by a clusterer, the plurality of codes into one of a used category and an unused category. The used category and the unused category respectively consist of any of the plurality of codes used or unused to update a child label. The automatically detecting step also includes, when an intersection set formed from the used and unused categories has at least one member, retrieving, by the attribute structural variation detector, the at least one member as a structural variation between at least two of the record schemas.

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 event log system and method are disclosed. The system includes a plurality of worker nodes to receive and store event log records from a plurality of log sources, and a coordinator node to maintain information about mapping from the plurality of log sources to the plurality of worker nodes. Each worker node comprises an IngestKV module to temporarily store event log records from the log sources and a TimeRangeKV module to permanently store the event log records.

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: Automatically moving NoSQL data store to a relational database system. Based on discovered data structure schema of a NoSQL file and query plans, attribute usage and association relationships may be determined. Trunk tables may be defined based on trunk part of the data structure schema determined based on the attribute usage. Trunk tables may be validated and relational database tables are generated that correspond to the trunk tables. NoSQL trunk template is generated based on the trunk tables. The relational database tables are loaded with data filtered from the NoSQL file according to the NoSQL trunk template.

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: Automatically moving NoSQL data store to a relational database system. Based on discovered data structure schema of a NoSQL file and query plans, attribute usage and association relationships may be determined. Trunk tables may be defined based on trunk part of the data structure schema determined based on the attribute usage. Trunk tables may be validated and relational database tables are generated that correspond to the trunk tables. NoSQL trunk template is generated based on the trunk tables. The relational database tables are loaded with data filtered from the NoSQL file according to the NoSQL trunk template.