中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

128 records (took 0.021 seconds)

    Method for reducing congestion in packet-switched networks
    21.
    发明申请
    Method for reducing congestion in packet-switched networks 失效
    减少分组交换网络拥塞的方法

    公开(公告)号：US20030137938A1

    公开(公告)日：2003-07-24

    申请号：US10372624

    申请日：2003-02-24

    Applicant: AT&T Corp.

    Inventor： David Gerald Belanger ,  Steven Michael Bellovin ,  Ramon Caceres ,  David C. Nagel

    IPC: G01R031/08

    CPC classification number: H04L12/1496 ,  H04L12/14 ,  H04L12/1489 ,  H04L47/10 ,  H04L47/11 ,  H04L65/80

    Abstract: The present invention permits a network service provider to detect an operational conditionnullsuch as congestionnullin a packet-switched network and to alleviate such congestion by providing customer incentives to avoid use of the network. The detection mechanism triggers an incentive such as the modification of the user's access charges and the customer can be immediately notified of either the occurrence of the congestion or of information regarding the incentive. Usage of the network during congested periods can be deterred by imposing additional access charges during such periodsnullsimilarly, customers can be given a discount to encourage usage during periods of low congestion. An incentive schedule can be tailored to dynamically change the usage patterns of the customers of the network to accommodate the operational conditions in the network. The present invention has application in the Internet, where a detection/notification mechanism, for example, can be implemented in a network node such as a router or in a network endpoint such as a client machine or a proxy or mail server.

    Abstract translation: 本发明允许网络服务提供商检测分组交换网络中的诸如拥塞的操作条件，并通过提供客户奖励来避免使用网络来减轻这种拥塞。 检测机制触发诸如修改用户访问费用的激励，并且可以立即通知客户发生拥塞或关于激励的信息。 在充电期间网络的使用可以通过在这样的时间段内施加额外的接入费用来阻止，同样，在低拥塞期间，客户可以被给予折扣以鼓励使用。 可以定制奖励计划以动态地改变网络的客户的使用模式以适应网络中的操作条件。 本发明在因特网中具有应用，其中例如可以在诸如客户机或代理或邮件服务器的网络节点（例如路由器）或网络端点中实现检测/通知机制。

    Methods and apparatus for rapid acoustic unit selection from a large speech corpus
    22.
    发明申请
    Methods and apparatus for rapid acoustic unit selection from a large speech corpus 有权
    用于从大型语音语料库中快速声学单元选择的方法和装置

    公开(公告)号：US20030115049A1

    公开(公告)日：2003-06-19

    申请号：US10359171

    申请日：2003-02-06

    Applicant: AT&T CORP.

    Inventor： Mark Charles. Beutnagel ,  Mehryar Mohri ,  Michael Dennis Riley

    IPC: G10L019/10 ,  G10L019/08 ,  G10L019/04

    CPC classification number: G10L13/07

    Abstract: A speech synthesis system can select recorded speech fragments, or acoustic units, from a very large database of acoustic units to produce artificial speech. The selected acoustic units are chosen to minimize a combination of target and concatenation costs for a given sentence. However, as concatenation costs, which are measures of the mismatch between sequential pairs of acoustic units, are expensive to compute, processing can be greatly reduced by pre-computing and caching the concatenation costs. Unfortunately, the number of possible sequential pairs of acoustic units makes such caching prohibitive. However, statistical experiments reveal that while about 85% of the acoustic units are typically used in common speech, less than 1% of the possible sequential pairs of acoustic units occur in practice. A method for constructing an efficient concatenation cost database is provided by synthesizing a large body of speech, identifying the acoustic unit sequential pairs generated and their respective concatenation costs, and storing those concatenation costs likely to occur. By constructing a concatenation cost database in this fashion, the processing power required at run-time is greatly reduced with negligible effect on speech quality.

    Abstract translation: 语音合成系统可以从声学单元的非常大的数据库中选择记录的语音片段或声学单元，以产生人造语音。 选择的声学单元被选择以最小化给定句子的目标和级联成本的组合。 然而，由于级联成本（即连续的声单元对之间的不匹配度量）是计算成本高的，所以可以通过预先计算和缓存级联成本大大降低处理能力。 不幸的是，可能的顺序对声学单元的数量使得这种高速缓存变得过高。 然而，统计学实验表明，虽然约85％的声学单位通常用于通用语音，但在实践中小于1％的可能顺序的声学单元对出现。 通过合成大量语音，识别产生的声学单元序列对及其各自的级联成本，并且存储可能发生的级联成本，提供了一种用于构建有效级联成本数据库的方法。 通过以这种方式构建级联成本数据库，运行时所需的处理能力大大降低，对语音质量的影响可以忽略不计。

    Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation
    24.
    发明申请
    Hybrid coordination function (HCF) access through tiered contention and overlapped wireless cell mitigation 有权

    公开(公告)号：US20030012166A1

    公开(公告)日：2003-01-16

    申请号：US10187132

    申请日：2002-06-28

    Applicant: AT&T Corp.

    Inventor： Mathilde Benveniste

    IPC: H04Q007/24

    CPC classification number: H04W72/082 ,  H04W56/00 ,  H04W72/1231 ,  H04W74/02 ,  H04W74/06 ,  H04W84/12

    Abstract: A method and system reduce interference between overlapping first and second wireless LAN cells in a medium. Each cell includes a respective plurality of member stations and there is at least one overlapped station occupying both cells. An inter-cell contention-free period value is assigned to a first access point station in the first cell, associated with an accessing order in the medium for member stations in the first and second cells. The access point transmits a beacon packet containing the inter-cell contention-free period value, which is intercepted at the overlapped station. The overlapped station forwards the inter-cell contention-free period value to member stations in the second cell. A second access point in the second cell can then delay transmissions by member stations in the second cell until after the inter-cell contention-free period expires. The beacon packet sent by the first access point station also includes an intra-cell contention-free period value, which causes the member stations in the first cell to delay accessing the medium until polled by the first access point. After the expiration of the intra-cell contention-free period, member stations in the first cell may contend for the medium based on the quality of service (QoS) data they are to transmit, using the Tiered Contention Multiple Access (TCMA) protocol.

    Identifying changes in on-line data repositories
    26.
    发明申请
    Identifying changes in on-line data repositories 有权
    识别在线数据存储库中的更改

    公开(公告)号：US20020120648A1

    公开(公告)日：2002-08-29

    申请号：US10077444

    申请日：2002-02-15

    Applicant: AT&T Corp.

    Inventor： Thomas J. Ball ,  Frederick Douglis

    IPC: G06F015/00 ,  G06F017/24

    CPC classification number: G06F17/30899

    Abstract: A system for accessing documents contained in a remote repository, which change in content from version-to-version. The system allows users to specify lists of documents of interest. Based on the lists, the system maintains an archive, which contains a copy of one version of each listed document, and material from which the other versions can be reconstructed. The system periodically compares the archive with current versions of the documents located in the repository, and updates the archive, thereby maintaining the ability to reconstruct current versions. The system also monitors access to the versions by each user. When a user calls for a current version, the system presents the current version, and indicates what parts of the current version have not been previously accessed by the user.

    Abstract translation: 用于访问远程存储库中包含的文档的系统，内容从版本到版本更改。 系统允许用户指定感兴趣的文档列表。 基于列表，系统维护一个存档，其中包含每个列出的文档的一个版本的副本以及可以从其重建其他版本的材料。 系统会定期将存档与位于存储库中的文档的当前版本进行比较，并更新存档，从而保留重建当前版本的能力。 该系统还监控每个用户对版本的访问。 当用户呼叫当前版本时，系统显示当前版本，并指示当前版本的哪些部分以前未被用户访问过。

    System and method for storage media group parity protection
    30.
    发明申请
    System and method for storage media group parity protection 有权

    公开(公告)号：US20010018729A1

    公开(公告)日：2001-08-30

    申请号：US09852328

    申请日：2001-05-10

    Applicant: AT&T Corp.

    Inventor： Theodore Johnson

    IPC: G06F012/00

    CPC classification number: G06F11/1076 ,  G06F2211/1019 ,  G06F2211/108

    Abstract: A system and method for storage medium group parity protection stores data files and related parity information asynchronously on an array of storage media. Data files can be stored asynchronously, or synchronously in stripes as in RAIT technology, but related parity information is stored asynchronously with respect to the data files. Regions of the storage media are preferably organized into protection groups for which parity information is generated. Parity information is generated on line as data files are stored and maintained in active memory. Once a protection group is filled, the parity information is migrated to more permanent backup storage. As one example, regions of an array of N storage media can constitute a protection group, and once the regions in the protection group are filled with data, parity data for the protection group is migrated from active memory to more permanent backup storage.

Patent Agency Ranking