Patent application number | Description | Published |
20100082671 | Joining Tables in Multiple Heterogeneous Distributed Databases - A method for joining tables in multiple heterogeneous distributed databases implemented by at least two data sources accessible to a federal database server over a network includes: transmitting from the federated database server a sub-command to a first of the data sources responsive to the federated database server receiving a data query; retrieving, with the federated database server, block data from the first data source related to the data query using block fetching according to the sub-command; transmitting, with the federated database server, at least a portion of the block data to a second of the data sources together with an instruction for the second data source to perform a join operation on the portion of the block data and a data table stored by the second data source related to the query; and retrieving a result of the join operation with the federated database server. | 04-01-2010 |
20100312563 | TECHNIQUES TO CREATE A CUSTOM VOICE FONT - Techniques to create and share custom voice fonts are described. An apparatus may include a preprocessing component to receive voice audio data and a corresponding text script from a client and to process the voice audio data to produce prosody labels and a rich script. The apparatus may further include a verification component to automatically verify the voice audio data and the text script. The apparatus may further include a training component to train a custom voice font from the verified voice audio data and rich script and to generate custom voice font data usable by the TTS component. Other embodiments are described and claimed. | 12-09-2010 |
20130054568 | Database Query - Mechanisms for performing database queries are provided. With these mechanisms, in response to a query request, a query plan intended for minimum query response time and a query plan intended for minimum query total time for the query request are obtained execution of the minimum query response time query plan and the minimum query total time query plan is started. Before the execution of the minimum query total time query plan reaches a specified point, an initial query result obtained from the execution of the minimum query response time query plan is output. In response to the execution of the minimum query total time query plan reaching the specified point, continuing the execution of the minimum query total time query plan to output remaining query results. | 02-28-2013 |
20130262105 | DYNAMIC LONG-DISTANCE DEPENDENCY WITH CONDITIONAL RANDOM FIELDS - Dynamic features are utilized with CRFs to handle long-distance dependencies of output labels. The dynamic features present a probability distribution involved in explicit distance from/to a special output label that is pre-defined according to each application scenario. Besides the number of units in the segment (from the previous special output label to the current unit), the dynamic features may also include the sum of any basic features of units in the segment. Since the added dynamic features are involved in the distance from the previous specific label, the searching lattice associated with Viterbi searching is expanded to distinguish the nodes with various distances. The dynamic features may be used in a variety of different applications, such as Natural Language Processing, Text-To-Speech and Automatic Speech Recognition. For example, the dynamic features may be used to assist in prosodic break and pause prediction. | 10-03-2013 |
20130281438 | 2,4-DIAMINO-6,7-DIHYDRO-5H-PYRROLO[2,3]PYRIMIDINE DERIVATIVES AS FAK/Pyk2 INHIBITORS - The invention relates to a novel class of 2,4-diamino-6,7-dihydro-5H-pyrrolo[2,3]pyrimidine derivatives as a FAK and/or Pyk2 inhibitor, to a process for their preparation, and to a composition thereof, as well as to use of the compounds for the inhibiting FAK and/or Pyk2 and method for the treatment of a FAK and/or Pyk2 mediated disorder or disease. | 10-24-2013 |
20140019134 | BLENDING RECORDED SPEECH WITH TEXT-TO-SPEECH OUTPUT FOR SPECIFIC DOMAINS - A text-to-speech (TTS) engine combines recorded speech with synthesized speech from a TTS synthesizer based on text input. The TTS engine receives the text input and identifies the domain for the speech (e.g. navigation, dialing, . . . ). The identified domain is used in selecting domain specific speech recordings (e.g. pre-recorded static phrases such as “turn left”, “turn right” . . . ) from the input text. The speech recordings are obtained based on the static phrases for the domain that are identified from the input text. The TTS engine blends the static phrases with the TTS output to smooth the acoustic trajectory of the input text. The prosody of the static phrases is used to create similar prosody in the TTS output. | 01-16-2014 |
20140358895 | EIGENVALUE-BASED DATA QUERY - Embodiments relate to an eigenvalue-based data query. An aspect includes receiving a query request that includes a query statement. Another aspect includes calculating eigenvalues of key component elements in the query statement. Another aspect includes matching eigenvalues of nodes in an execution plan of a historical query statement to the eigenvalues of the key component elements. Yet another aspect includes based on determining success of matching the eigenvalues of the key component elements to the eigenvalues of the nodes in an execution plan of the historical query statement, generating an execution plan of the query statement. | 12-04-2014 |