Abstract: Interactive assistances for executing natural language queries to data sets may be performed. A natural language query may be received. Candidate entity linkages may be determined between an entity recognized in the natural language query and columns in data sets. The candidate linkages may be ranked according to confidence scores which may be evaluated to detect ambiguity for an entity linkage. Candidate entity linkages may be provided to a user via an interface to select an entity linkage to use as part of completing the natural language query.

Abstract: Multiple stage filtering may be implemented for natural language query processing pipelines. Natural language queries may be received at a natural language query processing system and processed through a query language processing pipeline. The query language processing pipeline may filter candidate linkages for a natural language query before performing further filtering of the candidate linkages in the natural language query processing pipeline as part of generating an intermediate representation used to execute the natural language query.

Abstract: Multiple stage filtering may be implemented for natural language query processing pipelines. Natural language queries may be received at a natural language query processing system and processed through a query language processing pipeline. The query language processing pipeline may filter candidate linkages for a natural language query before performing further filtering of the candidate linkages in the natural language query processing pipeline as part of generating an intermediate representation used to execute the natural language query.

Abstract: Interactive assistances for executing natural language queries to data sets may be performed. A natural language query may be received. Candidate entity linkages may be determined between an entity recognized in the natural language query and columns in data sets. The candidate linkages may be ranked according to confidence scores which may be evaluated to detect ambiguity for an entity linkage. Candidate entity linkages may be provided to a user via an interface to select an entity linkage to use as part of completing the natural language query.

Abstract: Multiple stage filtering may be implemented for natural language query processing pipelines. Natural language queries may be received at a natural language query processing system and processed through a query language processing pipeline. The query language processing pipeline may filter candidate linkages for a natural language query before performing further filtering of the candidate linkages in the natural language query processing pipeline as part of generating an intermediate representation used to execute the natural language query.

Abstract: Techniques for generation of synthetic queries from customer data for training of document querying machine learning (ML) models as a service are described. A service may receive one or more documents from a user, generate a set of question and answer pairs from the one or more documents from the user using a machine learning model trained to predict a question from an answer, and store the set of question and answer pairs generated from the one or more documents from the user. The question and answer pairs may be used to train another machine learning model, for example, a document ranking model, a passage ranking model, a question/answer model, or a frequently asked question (FAQ) model.

Abstract: Techniques for generation of synthetic queries from customer data for training of document querying machine learning (ML) models as a service are described. A service may receive one or more documents from a user, generate a set of question and answer pairs from the one or more documents from the user using a machine learning model trained to predict a question from an answer, and store the set of question and answer pairs generated from the one or more documents from the user. The question and answer pairs may be used to train another machine learning model, for example, a document ranking model, a passage ranking model, a question/answer model, or a frequently asked question (FAQ) model.

Abstract: Combinations of Bruton's tyrosine kinase (Btk) inhibitors, e.g., 1-((R)-3-(4-amino-3-(4-phenoxyphenyl)-1H-pyrazolo[3,4-d]pyrimidin-1-yl)piperidin-1-yl)prop-2-en-1-one, with immunotherapy are provided. Also provided are methods of treating cancers, and autoimmune disorders by administering combinations of Bruton's tyrosine kinase (Btk) inhibitors, e.g., 1-((R)-3-(4-amino-3-(4-phenoxyphenyl)-1H-pyrazolo[3,4-d]pyrimidin-1-yl)piperidin-1-yl)prop-2-en-1-one, and an immune checkpoint inhibitor.

Abstract: Combinations of Bruton's tyrosine kinase (Btk) inhibitors, e.g., 1-((R)-3-(4-amino-3-(4-phenoxyphenyl)-1H-pyrazolo[3,4-d]pyrimidin-1-yl)piperidin-1-yl)prop-2-en-1-one, with immunotherapy are provided. Also provided are methods of treating cancers, and autoimmune disorders by administering combinations of Bruton's tyrosine kinase (Btk) inhibitors, e.g., 1-((R)-3-(4-amino-3-(4-phenoxyphenyl)-1H-pyrazolo[3,4-d]pyrimidin-1-yl)piperidin-1-yl)prop-2-en-1-one, and an immune checkpoint inhibitor.

Abstract: A device, system, and method are disclosed. In one embodiment the device receives a user key from a user application. The device then creates a management engine key by applying a management engine key creation algorithm to the user key. Then the device sends the management engine key to a remote server. Later, the device retrieves a server key from the remote server. The device next performs a hash combination of the user key, the management engine key, and the server key to create a super key. Once the super key has been created, the device authenticates the super key, and if the super key is valid, the device then sends a management engine certification to the user application.

Abstract: An isolated oligonucleotide comprising at least one ditag, wherein the ditag comprises two joined first and second sequence tags, wherein the first tag comprises the 5?-terminus sequence and the second tag comprises the 3?-terminus sequence of a nucleic acid molecule or a fragment thereof. The ditag analysis is useful for gene discovery and genome mapping.

Abstract: A device, system, and method are disclosed. In one embodiment the device receives a user key from a user application. The device then creates a management engine key by applying a management engine key creation algorithm to the user key. Then the device sends the management engine key to a remote server. Later, the device retrieves a server key from the remote server. The device next performs a hash combination of the user key, the management engine key, and the server key to create a super key. Once the super key has been created, the device authenticates the super key, and if the super key is valid, the device then sends a management engine certification to the user application.

Abstract: A method of identifying at least a nucleic acid molecule fragment to which a protein of interest binds, comprising: (i) preparing at least one nucleic acid molecule fragment to which a protein binds; (ii) isolating the 5? terminus and the 3? terminus of the nucleic acid fragment(s) and linking the 5? terminus and 3? terminus to create the at least one ditag; (iii) sequencing the ditag; and (iv) mapping the ditag sequence(s) to the genome.

Abstract: A method and system for providing error resiliency in processing a multimedia bitstream. The bitstream includes a start code pattern and the method and system detect the start code pattern and track its location to prevent the bitstream processor from overrunning the start code pattern of a subsequent block of multimedia data and corrupting the subsequent block of data. A shift length limiter receives a location of the start code pattern and the location of a current bit pointer. The shift length limiter calculates the number of bits between the start code pattern location and the current bit pointer location. When the shift length limiter receives a bit shift request, the shift length limiter prevents shifting if the number of bits in the bit shift request exceeds the calculated number of bits between the start code pattern location and the current bit pointer location.

Abstract: The present invention provides a method of manipulating nucleic acids. In particular, of length-controlled concatenating of nucleotide fragments, the method comprising: (a) providing at least two nucleotide fragments, wherein each fragment has one ligatable end and one non-ligatable end; and (b) allowing the two fragments to ligate at the ligatable ends to form an oligonucleotide comprising at least two concatenated nucleotide fragments. The present invention also provides an isolated oligonucleotide comprising at least two nucleotide fragments, wherein each fragment has at least one ligatable end and and one non-ligatable end, and the fragments are ligated at the ligatable ends to form the oligonucleotide.

Abstract: A method of identifying at least a nucleic acid molecule fragment to which a protein of interest binds, comprising: (i) preparing at least one nucleic acid molecule fragment to which a protein binds; (ii) isolating the 5? terminus and the 3? terminus of the nucleic acid fragment(s) and linking the 5? terminus and 3? terminus to create the at least one ditag; (iii) sequencing the ditag; and (iv) mapping the ditag sequence(s) to the genome.

Abstract: A partitioning mechanism is executed on a server that receives a request to determine the connection information that is then used by the server to connect to a back-end data server from which to access the data relating to the request. The partitioning mechanism is directed to horizontally scaling the back-end data storage for web servers by enabling a deterministic partitioning resolution to take place on each web server rather than using a single server to provide the connection information to each of the web servers. The partitioning policy may also be individually developed for each application.

Abstract: Systems and methods for intermediate buffering of data for the purpose of controlling its delivery to the consumer. The systems and methods for buffering data can arbitrate between the incoming data flow from the generating component and the outgoing data flow to the consumer. In doing so, the systems and methods for buffering of data seek to honor the delivery demands and/or constraints of the consumer, while avoiding the loss of the data generated by the producer. The delivery demands of the consumer may include requirements pertaining to maximum acceptable incoming data rate, the desired incoming data rate, incoming data aggregation, the desired freshness of the data, and tolerance for event loss. The generation component constraints may include the space limitations on buffering data within the data buffer.

Abstract: An isolated oligonucleotide comprising at least one ditag, wherein the ditag comprises two joined first and second sequence tags, wherein the first tag comprises the 5?-terminus sequence and the second tag comprises the 3?-terminus sequence of a nucleic acid molecule or a fragment thereof. The ditag analysis is useful for gene discovery and genome mapping.