Abstract: In generation of an intonation pattern of a speech synthesis, a speech synthesis system is capable of providing a highly natural speech and capable of reproducing speech characteristics of a speaker flexibly and accurately by effectively utilizing FO patterns of actual speech accumulated in a database. An intonation generation method generates an intonation of synthesized speech for text by estimating, based on language information of the text and based on the estimated outline of the intonation, and then selects an optimum intonation pattern from a database which stores intonation patterns of actual speech. Speech characteristics recorded in advance are reflected in an estimation of an outline of the intonation pattern and selection of a waveform element of a speech.

Abstract: An aspect of the present invention is to easily verify data integrity in data transmission and reception by means of an ad-hoc radio connection. A requester and requested end of an establishment of a cipher communication path are defined as source A and destination B, respectively. A predetermined verification data generation algorithm ID1 is arranged in advance between source A and destination B. Source A sends its own public key Kp to destination B, and at the same time generates verification data Xp based on Kp using ID1 and outputs Xp to its own verification image display section. On the other hand, destination B receives data Kx that is transmitted from source A as Kp, then generates verification data Xx based on Kx using ID1 and outputs Xx to its own verification image display section. A verifier determines that data integrity is secured if Xp and Xx displayed in the verification image display sections of source A and destination B match.

Abstract: A voice processing system is provided in which sets of engines running on a plurality of servers are configured differently from one another. The sets of engines may be configured to achieve different trade-offs between performance of a task and resources required to perform the task. In the voice processing system, a task routing server is provided that assigns different sets of sub-tasks to different sets of task engines. The number of engines used to perform a task and the number of engines in each set are adjusted. By adjusting the parameters settings for the set of engines based on the type of application, the particular requirements of the application, or the nature and importance of the subtasks, for example, advantages such as improvement of resource utilization and the hardware and software costs reduction may be obtained.

Abstract: A system and method wherein a mobile user, or a user interacting with a mobile program, can at any time initiate a program status request. The program status request initiates the sequence of events whereby the current location of the program is determined and/or the current user location is made available to the program without the necessity of either entity changing location. Further, the agent script for the program maintains a composite data structure which includes an input buffer for storing input variables, an output buffer for storing output values to be displayed to the user, a program state data structure, and an optional bag buffer for temporarily storing input variables which the program will need in the course of future execution. By maintaining such a composite data structure, it is assured that all necessary information can be provided at a program location regardless of whether the program or the user has relocated.

Abstract: A system and method whereby a gang scheduling entity assembles a schedule of application tasks to be run on a plurality of distributed parallel processors for pre-set time intervals. The scheduling information, including an ordered set of applications and the length of the time interval, are provided to each of the node level schedulers for the relevant processors, and the node level schedulers assure that the tasks of the applications are executed, with context switching between tasks being controlled at the node level. Tasks from multiple applications can be scheduled simultaneously, with time sharing and space sharing being utilized in the schedule. The inventive system is dynamically scalable, with the gang scheduling entity restructuring the matrix schedule should dynamic re-partitioning result in addition or deletion of processors.