-
公开(公告)号：US6052367A
公开(公告)日：2000-04-18
申请号：US777723
申请日：1996-12-20
摘要： Using the Internet World Wide Web (WWW) network 320, a WWW Client 310 can communicate with a WWW Server 330 to request the reconfiguration of or to generate software which controls a voice processing application. A voice response system client communicates with a voice response system server to alter the configuration of the voice response system or control the execution of software on said voice response system which enables a voice application program to be generated. The output of the voice response system ordinarily destined for display on a visual display unit of a local terminal is directed to the voice response system server. The voice response system server forwards the data to a voice response system client. The voice response system client generates data in a first format useable by said WWW client terminal from data in a second format received from said voice response system and generates data in said second format useable by said voice response system from data in said first format received from WWW client terminal, that is, the voice response system client dynamically generates HTML data from the data generated by the voice response system for transmission to and subsequent display at the WWW client terminal and visa versa.
摘要翻译： 使用互联网万维网（WWW）网络320，WWW客户端310可以与WWW服务器330进行通信，以请求重新配置或产生控制语音处理应用的软件。 语音响应系统客户端与语音响应系统服务器进行通信以改变语音响应系统的配置或控制所述语音应答系统上的软件的执行，从而能够生成语音应用程序。 通常用于在本地终端的可视显示单元上显示的语音应答系统的输出被引导到语音应答系统服务器。 语音应答系统服务器将数据转发到语音应答系统客户端。 语音应答系统客户端以所述语音响应系统接收的第二格式的数据生成所述WWW客户端终端能够使用的第一格式的数据，并以所述第一格式从所述第一格式的数据生成所述第二格式的数据， WWW客户终端，即语音响应系统客户机从语音响应系统产生的数据动态生成HTML数据，以便传送到WWW客户终端并随后在WWW客户终端显示，反之亦然。
-
公开(公告)号：US5844158A
公开(公告)日：1998-12-01
申请号：US557642
申请日：1995-11-14
CPC分类号： H04M3/487
摘要： The invention relates to a voice processing system capable of outputting voice prompts and background music. The volume of background music is progressively variable relative to the voice prompts or speech. The progressive variation is effected by multiplying the background music samples by a scaling factor and then adding together a current voice sample and the scaled background music sample. Accordingly, when the combined samples are output to the user the volume of the background music varies.
摘要翻译： 本发明涉及能够输出语音提示和背景音乐的语音处理系统。 相对于语音提示或语音，背景音乐的音量逐渐变化。 逐行变化通过将背景音乐样本乘以缩放因子，然后将当前语音样本和缩放的背景音乐样本相加在一起来实现。 因此，当将组合的样本输出到用户时，背景音乐的音量变化。
-
公开(公告)号：US06272146B1
公开(公告)日：2001-08-07
申请号：US08965365
申请日：1997-11-06
IPC分类号： H04L1240
CPC分类号： H04Q11/04 , H04Q2213/13003 , H04Q2213/1305 , H04Q2213/1307 , H04Q2213/13103 , H04Q2213/13106 , H04Q2213/13107 , H04Q2213/13109 , H04Q2213/13176 , H04Q2213/13179 , H04Q2213/13203 , H04Q2213/13204 , H04Q2213/13272 , H04Q2213/13292 , H04Q2213/13299 , H04Q2213/13378 , H04Q2213/13392 , H04Q2213/13396
摘要： A bus connection controller in a voice processing is for managing the connection of a timeslot on a time-division multiplex (TDM) bus to a port on an adapter. The voice processing system includes basic time-division multiplex (TDM) connection management to enable the coordination of connections between resources such as channels on line cards (SPacks or VPacks), and channels on digital signal processor (DSPs) cards that provide, amongst others things, voice recognition, text-to-speech, fax capabilities and so on. Problems are encountered when a telephone call in a voice processing system ends suddenly because one of the callers hangs up. If the telephony channel has connections with other channels or resources via a TDM bus, callers may hear spurious data. To address this problem each call is associated with its corresponding connection on the TDM bus and each connection is associated with its connection details including the adapters and ports involved in connecting the calls. When one of the calls ends all the relevant ports involved with the connection are immediately disconnected.
摘要翻译： 语音处理中的总线连接控制器用于管理时分复用（TDM）总线上的时隙与适配器上的端口的连接。 语音处理系统包括基本的时分多路复用（TDM）连接管理，以实现诸如线路卡（SPack或VPack）之间的信道之类的资源之间的连接的协调，以及数字信号处理器（DSP） 事物，语音识别，文字转语音，传真功能等。 当语音处理系统中的电话呼叫由于其中一个呼叫者挂断而突然结束时遇到问题。 如果电话信道通过TDM总线与其他信道或资源连接，则呼叫者可能会收到虚假数据。 为了解决这个问题，每个呼叫都与其在TDM总线上的对应连接相关联，并且每个连接与其连接细节相关联，包括连接呼叫所涉及的适配器和端口。 当其中一个呼叫结束时，连接涉及的所有相关端口立即断开连接。
-
4.发明授权Variation in playback speed of a stored audio data signal encoded using a history based encoding technique 失效使用基于历史的编码技术编码的存储的音频数据信号的播放速度的变化公开(公告)号：US06223153B1
公开(公告)日：2001-04-24
申请号：US08594054
申请日：1996-01-30
IPC分类号： G10L100
CPC分类号： G10L21/01 , G10L19/06 , G11B20/10527
摘要： The invention relates to a voice processing system capable of varying the speed of output of digitized audio data stored therein. The digitized audio data is stored using blocks of LPC coefficients. Each block is sufficient to allow twenty milliseconds of speech to be generated therefrom. Periodically, or selectably, the utilization of particular blocks is repeated resulting in a decrease in the speed of output of the speech synthesized therefrom. Alternatively, selectably blocks of LPC coefficients are omitted from use thereby producing a corresponding increase in speech output.
摘要翻译： 本发明涉及能够改变存储在其中的数字化音频数据的输出速度的语音处理系统。 数字化的音频数据使用LPC系数的块来存储。 每个块足以允许从其生成二十毫秒的语音。 周期地或可选择地重复使用特定块，导致从其合成的语音的输出速度降低。 或者，可选择地省略LPC系数的块，从而产生相应的语音输出增加。
-
公开(公告)号：US20060031360A1
公开(公告)日：2006-02-09
申请号：US11156401
申请日：2005-06-20
申请人： Andrew Banks , Michael Cobbett
发明人： Andrew Banks , Michael Cobbett
IPC分类号： G06F15/16
CPC分类号： G06F9/546
摘要： Contention in a distributed processor computer system with a replicated message environment is reduced. The system comprises processor consumers intercommunicating via a server interface that receives a message from a producer. The server favors one consumer, marks the message accordingly, communicates the marked message to the system, and delays the processing in another consumer beyond a predetermined time, for example the time normally taken to process a message.
摘要翻译： 具有复制消息环境的分布式处理器计算机系统中的竞争减少。 该系统包括通过从生产者接收消息的服务器接口相互通信的处理器消费者。 服务器有利于一个消费者，相应地标记该消息，将标记的消息传送到系统，并且将另一消费者的处理延迟超过预定时间，例如处理消息通常采取的时间。
-
公开(公告)号：US08719693B2
公开(公告)日：2014-05-06
申请号：US12035650
申请日：2008-02-22
IPC分类号： G06F17/00
CPC分类号： G06F17/3092 , G06F17/2205 , G06F17/2247
摘要： A method and apparatus are provided to create a parent XSD document that separately identifies localized data and non-localized content definitions. A tool is employed to parse the localized content definitions from the non-localized content definitions. The parsing tool generates a child XSD document pertaining to the localized content definitions identified within the parent XSD document. One or more child XML documents are created to store data pertaining to the localized content definitions of the child XSD document. Localized content is isolated in a child XML document that is governed by a corresponding child XSD document, wherein the corresponding child XSD document is derived from the parent XSD document. Just as with any other XML document, the localized content in the isolated child XML document is supported by querying and validation by XML tools.
摘要翻译： 提供了一种方法和装置来创建分别识别本地化数据和非本地化内容定义的父XSD文档。 用于从非本地化内容定义解析本地化内容定义的工具。 解析工具生成与父XSD文档中标识的本地化内容定义相关的子XSD文档。 创建一个或多个子XML文档以存储与XSD文档的本地化内容定义有关的数据。 本地化内容在由相应的子XSD文档管理的子XML文档中隔离，其中相应的子XSD文档是从父XSD文档导出的。 与任何其他XML文档一样，孤立的子XML文档中的本地化内容通过XML工具的查询和验证得到支持。
-
公开(公告)号：US07886022B2
公开(公告)日：2011-02-08
申请号：US11156401
申请日：2005-06-20
IPC分类号： G06F15/16
CPC分类号： G06F9/546
摘要： Contention in a distributed processor computer system with a replicated message environment is reduced. The system comprises processor consumers intercommunicating via a server interface that receives a message from a producer. The server favors one consumer, marks the message accordingly, communicates the marked message to the system, and delays the processing in another consumer beyond a predetermined time, for example the time normally taken to process a message.
摘要翻译： 具有复制消息环境的分布式处理器计算机系统中的竞争减少。 该系统包括通过从生产者接收消息的服务器接口相互通信的处理器消费者。 服务器有利于一个消费者，相应地标记该消息，将标记的消息传送到系统，并且将另一消费者的处理延迟超过预定时间，例如处理消息通常采取的时间。
-
8.发明授权Commitment chains for conflict resolution between disconnected data sharing applications 有权断开数据共享应用程序之间的冲突解决承诺链公开(公告)号：US08001078B2
公开(公告)日：2011-08-16
申请号：US12342954
申请日：2008-12-23
IPC分类号： G06F7/00
CPC分类号： G06F17/30356 , G06F11/1474 , G06F2201/80 , G06F2201/82 , Y10S707/99938 , Y10S707/99952 , Y10S707/99953 , Y10S707/99955
摘要： A sequence of processing transactions operating on a cached data set, which depend on each other because they operate on the same items of data from the data set. The transactions are saved until the master copy of the data becomes available. The transactions are played back against the master copy until one of the played back transactions fails because another transaction which operated on the same items of data but against a separate cached copy and originating from another application, was successfully played back on the master copy at an earlier time. At this point, all subsequent transactions which depended on the failing transaction are rolled back on the cached copy (with appropriate failure reports generated) and activity resumes from there. “Chained” (optimistic) transactions can therefore be applied to cached data and can be allowed to progress by recording their dependencies so they can be undone when required.
摘要翻译： 在缓存数据集上操作的处理事务的序列，其依赖于彼此，因为它们对来自数据集的相同数据项进行操作。 事务被保存，直到数据的主副本可用。 这些交易是以主副本进行回放，直到其中一个回放交易失败为止，因为在同一数据项上操作的另一个交易是针对另一个缓存的副本而源于另一个应用程序，因此在主副本上被成功地播放 早些时候 此时，依赖于失败事务的所有后续事务都将在缓存副本上回滚（生成相应的故障报告），并从该处恢复活动。 因此，“链接”（乐观）交易可以应用于缓存的数据，并且可以通过记录其依赖关系来允许进度，以便在需要时可以撤消。
-
9.发明授权Commitment chains for conflict resolution between disconnected data sharing applications 失效断开数据共享应用程序之间的冲突解决承诺链公开(公告)号：US07490115B2
公开(公告)日：2009-02-10
申请号：US11322031
申请日：2005-12-29
CPC分类号： G06F17/30356 , G06F11/1474 , G06F2201/80 , G06F2201/82 , Y10S707/99938 , Y10S707/99952 , Y10S707/99953 , Y10S707/99955
摘要： A sequence of processing transactions operating on a cached data set, which depend on each other because they operate on the same items of data from the data set. The transactions are saved until the master copy of the data becomes available. The transactions are played back against the master copy until one of the played back transactions fails because another transaction which operated on the same items of data but against a separate cached copy and originating from another application, was successfully played back on the master copy at an earlier time. At this point, all subsequent transactions which depended on the failing transaction are rolled back on the cached copy (with appropriate failure reports generated) and activity resumes from there. “Chained” (optimistic) transactions can therefore be applied to cached data and can be allowed to progress by recording their dependencies so they can be undone when required.
摘要翻译： 在缓存数据集上操作的处理事务的序列，其依赖于彼此，因为它们对来自数据集的相同数据项进行操作。 事务被保存，直到数据的主副本可用。 这些交易是以主副本进行回放，直到其中一个回放交易失败为止，因为在同一数据项上操作的另一个交易是针对另一个缓存的副本而源于另一个应用程序，因此在主副本上被成功地播放 早些时候 此时，依赖于失败事务的所有后续事务都将在缓存副本上回滚（生成相应的故障报告），并从该处恢复活动。 因此，“链接”（乐观）交易可以应用于缓存的数据，并且可以通过记录其依赖关系来允许进度，以便在需要时可以撤消。
-
10.发明申请公开(公告)号：US20060206534A1
公开(公告)日：2006-09-14
申请号：US11322031
申请日：2005-12-29
IPC分类号： G06F17/30
CPC分类号： G06F17/30356 , G06F11/1474 , G06F2201/80 , G06F2201/82 , Y10S707/99938 , Y10S707/99952 , Y10S707/99953 , Y10S707/99955
摘要： A sequence of processing transactions operating on a cached data set, which depend on each other because they operate on the same items of data from the data set. The transactions are saved until the master copy of the data becomes available. The transactions are played back against the master copy until one of the played back transactions fails because another transaction which operated on the same items of data but against a separate cached copy and originating from another application, was successfully played back on the master copy at an earlier time. At this point, all subsequent transactions which depended on the failing transaction are rolled back on the cached copy (with appropriate failure reports generated) and activity resumes from there. “Chained” (optimistic) transactions can therefore be applied to cached data and can be allowed to progress by recording their dependencies so they can be undone when required.
-
-
-
-
-
-
-
-
-
搜索结果
17 条记录 (耗时 0.025 秒)
