Abstract: An embodiment for identifying and replacing logically neutral phrases in natural language queries may include receiving a natural language query. The embodiment may also identify one or more logically neutral or non-logically neutral anchors in the natural language query. The embodiment may also identify boundaries containing one or more logically neutral phrases. The embodiment may further include detecting semantic and logical relations between verbal phrases and functional language between and adjacent to the one or more logically neutral and non-logically neutral anchors to reintroduce non-logically neutral language back into a non-logically neutral portion of the natural language query. The embodiment may also include generating a modified natural language query by automatically removing the boundaries and optionally replacing the one or more logically neutral phrases in the natural language query.

Abstract: A computer-implemented method, a computer system and a computer program product create rules for a rule-based natural language interface for databases (NLIDB). The method may include receiving a natural language query from a user. The method may also include generating a first explanation for the natural language query using a deep learning model and a second explanation for the natural language query using the rule-based NLIDB and validating whether the first and second explanations correctly represent the natural language query. The method may further include identifying the database value in the first explanation in response to the first explanation correctly representing the natural language query and the second explanation not correctly representing the natural language query. Lastly, the method may include creating a rule in a table for the rule-based natural language interface for databases that associates the database value with the original word of the natural language query.

Abstract: An embodiment for identifying and replacing logically neutral phrases in natural language queries may include receiving a natural language query. The embodiment may also identify one or more logically neutral or non-logically neutral anchors in the natural language query. The embodiment may also identify boundaries containing one or more logically neutral phrases. The embodiment may further include detecting semantic and logical relations between verbal phrases and functional language between and adjacent to the one or more logically neutral and non-logically neutral anchors to reintroduce non-logically neutral language back into a non-logically neutral portion of the natural language query. The embodiment may also include generating a modified natural language query by automatically removing the boundaries and optionally replacing the one or more logically neutral phrases in the natural language query.

Abstract: A computer-implemented method, a computer system and a computer program product create rules for a rule-based natural language interface for databases (NLIDB). The method may include receiving a natural language query from a user. The method may also include generating a first explanation for the natural language query using a deep learning model and a second explanation for the natural language query using the rule-based NLIDB and validating whether the first and second explanations correctly represent the natural language query. The method may further include identifying the database value in the first explanation in response to the first explanation correctly representing the natural language query and the second explanation not correctly representing the natural language query. Lastly, the method may include creating a rule in a table for the rule-based natural language interface for databases that associates the database value with the original word of the natural language query.

Abstract: Methods, systems and computer readable media are provided for automatically creating a semantic model of a relational database for processing natural language queries. A computing device automatically extracts relational database metadata. The computing device prompts a user to enter textual labels for columns of the extracted metadata. The computing device automatically generates a schema annotation file based upon the relational database metadata and the textual labels for the columns. A natural language query is processed for the relational database using the schema annotation file.

Abstract: A system for responding to natural language medical queries is provided. The system includes a memory storing a computer program and a processor configured to execute the computer program. The computer program decomposes an input medical related user query into medical related sub-queries using pre-defined proxies, rephrases the sub-queries into yes-no queries answerable with a yes or a no, extracts feature values from the yes-no queries and a relational database storing clinical records, generates a feature vector from the extracted feature values, and applies the feature vector along with desired output labels to a supervised machine learning algorithm to generate a classifier configured to answer a new medical related user query.

Abstract: Methods, systems and computer readable media are provided for automatically creating a semantic model of a relational database for processing natural language queries. A computing device automatically extracts relational database metadata. The computing device prompts a user to enter textual labels for columns of the extracted metadata. The computing device automatically generates a schema annotation file based upon the relational database metadata and the textual labels for the columns. A natural language query is processed for the relational database using the schema annotation file.

Abstract: There is provided an apparatus and a processor-implemented method. The method includes aligning a reference genome with a plurality of DNA sequences. Each of the plurality of DNA sequences has a respective plurality of bases. The method further includes classifying and sorting the plurality of read sequences based on respective numbers of mismatched bases within the plurality of read sequences to obtain a plurality of re-arranged DNA sequences. The method also includes building a histogram based on respective positions of mismatched bases within the plurality of re-arranged DNA sequences. The method additionally includes coding at least some of the plurality of re-arranged DNA sequences based on the histogram.

Abstract: A method, system and apparatus of processing queries, including inputting a query as query data, generating paraphrases from the query data, and normalizing the generated paraphrases according to predefined annotations of a schema.

Abstract: A system for responding to natural language medical queries is provided. The system includes a memory storing a computer program and a processor configured to execute the computer program. The computer program decomposes an input medical related user query into medical related sub-queries using pre-defined proxies, rephrases the sub-queries into yes-no queries answerable with a yes or a no, extracts feature values from the yes-no queries and a relational database storing clinical records, generates a feature vector from the extracted feature values, and applies the feature vector along with desired output labels to a supervised machine learning algorithm to generate a classifier configured to answer a new medical related user query.

Abstract: There is provided an apparatus and a processor-implemented method. The method includes aligning a reference genome with a plurality of DNA sequences. Each of the plurality of DNA sequences has a respective plurality of bases. The method further includes classifying and sorting the plurality of read sequences based on respective numbers of mismatched bases within the plurality of read sequences to obtain a plurality of re-arranged DNA sequences. The method also includes building a histogram based on respective positions of mismatched bases within the plurality of re-arranged DNA sequences. The method additionally includes coding at least some of the plurality of re-arranged DNA sequences based on the histogram.

Abstract: Techniques for implementing mixed-radix FFT on SIMD vector processors efficiently for the latest standard in wireless communication technology by dynamically reordering stages are provided. In one aspect, a mixed-radix FFT implementation method for vector processors is provided which includes the following steps. Input data is decomposed into segments of factors based on a size of the input data, wherein the decomposing is performed in one or more stages, and wherein at each of the stages the input data is processed in blocks using one or more FFT butterfly computations for each of the blocks. The stages in which the decomposing is performed are reordered to insure complete utilization of the vector processors. The butterfly computations for one or more of the blocks are reordered to insure that the input data have memory addresses which are next to each other and contiguous.

Abstract: Techniques for implementing mixed-radix FFT on SIMD vector processors efficiently for the latest standard in wireless communication technology by dynamically reordering stages are provided. In one aspect, a mixed-radix FFT implementation method for vector processors is provided which includes the following steps. Input data is decomposed into segments of factors based on a size of the input data, wherein the decomposing is performed in one or more stages, and wherein at each of the stages the input data is processed in blocks using one or more FFT butterfly computations for each of the blocks. The stages in which the decomposing is performed are reordered to insure complete utilization of the vector processors. The butterfly computations for one or more of the blocks are reordered to insure that the input data have memory addresses which are next to each other and contiguous.

Abstract: Techniques for implementing mixed-radix FFT on SIMD vector processors efficiently for the latest standard in wireless communication technology by dynamically reordering stages are provided. In one aspect, a mixed-radix FFT implementation method for vector processors is provided which includes the following steps. Input data is decomposed into segments of factors based on a size of the input data, wherein the decomposing is performed in one or more stages, and wherein at each of the stages the input data is processed in blocks using one or more FFT butterfly computations for each of the blocks. The stages in which the decomposing is performed are reordered to insure complete utilization of the vector processors. The butterfly computations for one or more of the blocks are reordered to insure that the input data have memory addresses which are next to each other and contiguous.

Abstract: Techniques for implementing mixed-radix FFT on SIMD vector processors efficiently for the latest standard in wireless communication technology by dynamically reordering stages are provided. In one aspect, a mixed-radix FFT implementation method for vector processors is provided which includes the following steps. Input data is decomposed into segments of factors based on a size of the input data, wherein the decomposing is performed in one or more stages, and wherein at each of the stages the input data is processed in blocks using one or more FFT butterfly computations for each of the blocks. The stages in which the decomposing is performed are reordered to insure complete utilization of the vector processors. The butterfly computations for one or more of the blocks are reordered to insure that the input data have memory addresses which are next to each other and contiguous.

Abstract: Techniques are provided for an accelerated join process in a relational database management system. The disclosed join method partitions a plurality of input records using a hash-based technique to form a plurality of partitioned blocks. The partitioned blocks are sorted to form sorted partitioned blocks. The sorted partitioned blocks are then compressed to form a plurality of compressed blocks of records. The compressed blocks of records are stored for each partition in a storage system. The compressed blocks of records associated with a pair of partitions can then be loaded into a main memory. The loaded compressed blocks of records are then decompressed and the decompressed blocks of records are merged into associated merged partitions. Finally, two of the merged partitions are joined by comparing records from each merged partition. In a multi-threaded implementation, multiple pairs of merged partitions can be joined in parallel.

Abstract: The present approach increases bandwidth by performing at least two functions at the pre-processing level. Specifically, under the present approach, program code is structured so that the segmentation and binarization functions/modules (and optionally a blob analysis function/module) are merged into a single module to reduce memory bandwidth. In addition, each image frame is segmented into a plurality of partitions (e.g., vertical strips) to enhance the reusability of the image data in LS already fetched from main memory. Each partition is then processed by a separate one of a plurality of processing engines, thereby increasing the utilization of all processing engines and allowing the processing engines to maintain good bandwidth.

Abstract: The present approach increases bandwidth by performing at least two functions at the pre-processing level. Specifically, under the present approach, program code is structured so that the segmentation and binarization functions/modules (and optionally a blob analysis function/module) are merged into a single module to reduce memory bandwidth. In addition, each image frame is segmented into a plurality of partitions (e.g., vertical strips) to enhance the reusability of the image data in LS already fetched from main memory. Each partition is then processed by a separate one of a plurality of processing engines, thereby increasing the utilization of all processing engines and allowing the processing engines to maintain good bandwidth.