利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

7 条记录 (耗时 0.026 秒)

    Universal directory service
    1.
    发明授权
    Universal directory service 失效
    通用目录服务

    公开(公告)号：US6065016A

    公开(公告)日：2000-05-16

    申请号：US689212

    申请日：1996-08-06

    申请人： Peter H. Stuntebeck ,  Andrew Frederick Bulfer

    发明人： Peter H. Stuntebeck ,  Andrew Frederick Bulfer

    IPC分类号： G06F13/00 ,  H04M3/42 ,  H04M3/493 ,  H04M7/12 ,  G06F17/30

    CPC分类号： H04M3/4931 ,  H04M2201/40 ,  H04M2201/60 ,  H04M3/42229 ,  H04M7/12 ,  Y10S707/99943

    摘要： A universal directory service (UDS) provides the communication addresses of individuals associated with numerous different institutions, and can be accessed via more than one communication channel. A UDS server communicates with one or more data sources to provide directory information to a user. The UDS also provides supplemental information such as company name, logo, and specialty. The UDS can be accessed via numerous communication channels including the internet, on-line service providers, wireless devices, modem, dedicated access channels, voice access via an attendant, and voice access via a speech recognition and synthesis system.

    摘要翻译： 通用目录服务（UDS）提供与许多不同机构相关联的个人的通信地址，并且可以通过多个通信信道来访问。 UDS服务器与一个或多个数据源进行通信，向用户提供目录信息。 UDS还提供公司名称，标识和专业等补充信息。 UDS可以通过包括因特网，在线服务提供商，无线设备，调制解调器，专用接入信道，通过话务员的语音接入以及通过语音识别和合成系统进行语音接入的许多通信信道来访问。

    Method of routing universal international free telephone phone numbers
    4.
    发明授权
    Method of routing universal international free telephone phone numbers 失效
    通用国际免费电话电话号码路由方法

    公开(公告)号：US06052457A

    公开(公告)日：2000-04-18

    申请号：US109517

    申请日：1998-07-02

    申请人： Kathryn M. Abdelaal ,  Andrew Frederick Bulfer ,  Peter H. Stuntebeck ,  Roy Philip Weber

    发明人： Kathryn M. Abdelaal ,  Andrew Frederick Bulfer ,  Peter H. Stuntebeck ,  Roy Philip Weber

    IPC分类号： H04Q3/42 ,  H04Q3/66 ,  H04M7/00

    CPC分类号： H04Q3/42 ,  H04Q3/66 ,  Y10S379/912

    摘要： A method of handing off a Universal International Telephone Number to the correct international carrier for handling regardless of which carrier is given the call by the local exchange carrier. If a call destined for termination in the United States is handed off to the wrong international carrier, that carrier routes the call to its international gateway as if it were destined for another country. The international gateway then routes the call to the proper international carrier with all of the routing features and billing schedules of the customer intact.

    摘要翻译： 将通用国际电话号码移交给正确的国际运营商进行处理的方法，无论本地交换运营商是否向哪个运营商发出呼叫。 如果将美国终止的电话转交给错误的国际运营商，那么该运营商将呼叫转移到其国际网关，就像运往另一个国家一样。 然后，国际网关将呼叫路由到正确的国际运营商，其所有路由功能和客户的计费表都保持不变。

    Telephone network service for converting speech to touch-tones
    5.
    发明授权
    Telephone network service for converting speech to touch-tones 失效
    用于将语音转换成触摸音的电话网络服务

    公开(公告)号：US06208966B1

    公开(公告)日：2001-03-27

    申请号：US08867773

    申请日：1997-06-02

    申请人： Andrew Frederick Bulfer

    发明人： Andrew Frederick Bulfer

    IPC分类号： G10L1500

    CPC分类号： H04M3/493 ,  H04M1/271 ,  H04M3/42204 ,  H04M3/533 ,  H04M2201/40 ,  H04M2201/60 ,  H04Q1/45

    摘要： A telecommunications network service for converting spoken words to individual DTMF (e.g., touch-tone) signals to be furnished to an automated system responsive to touch-tone control thereof. In accordance with one illustrative embodiment of the invention, a telephone user speaks an utterance comprising a word representing a digit, letter, the “*” key (e.g., the word “star”) or the “#” key (e.g., the word “pound”). The illustrative network service performs conventional, speaker independent speech recognition on the utterance to identify the spoken word and then generates the touch-tone signal which corresponds to the spoken word so identified (e.g., a digit, letter or special character as found on a conventional touch-tone telephone). This generated DTMF signal is then transmitted to an automated system such as a voice messaging system or telephone answering machine to control the operation thereof. The network service of the present invention may be advantageously employed when the telephone being used by the caller is a rotary or dial pulse type telephone, or in other circumstances where it may be preferable to speak rather than to press the keys of a telephone keypad.

    摘要翻译： 一种电话网络服务，用于将口语单词转换为单独的DTMF（例如，触摸音）信号，以响应于其触摸音控制而提供给自动系统。 根据本发明的一个说明性实施例，电话用户讲话包括表示数字，字母，“*”键（例如，单词“星”）或“＃”键（例如，字 “磅”）。 说明性网络服务在话语上执行常规的，与说话者无关的语音识别以识别口语单词，然后产生对应于如此识别的口语单词（例如，在常规语音中发现的数字，字母或特殊字符）的触摸音信号 按键式电话）。 然后将该生成的DTMF信号发送到诸如语音消息系统或电话应答机之类的自动化系统以控制其操作。 当呼叫者使用的电话是旋转或拨号脉冲型电话时，或者在其他可能更好地说话而不是按电话键盘的键的情况下，可以有利地采用本发明的网络服务。

    Network routing and control arrangement
    6.
    发明授权
    Network routing and control arrangement 失效
    网络路由和控制布置

    公开(公告)号：US3935394A

    公开(公告)日：1976-01-27

    申请号：US512256

    申请日：1974-10-04

    申请人： Andrew Frederick Bulfer

    发明人： Andrew Frederick Bulfer

    IPC分类号： H04Q3/545 ,  H04Q3/54

    CPC分类号： H04Q3/54591

    摘要： A system is disclosed for selecting and establishing connections through a two-stage concentrator network utilizing path selection circuitry adapted to minimize blocking. This circuitry operates to select a path through the second-stage switch which is the least congested (i.e., has the most idle output lines). More specifically, "congestion" information is generated from "outlet" information specifying the idle/busy status of the outlets or terminals of the second-stage switches. This congestion information is logically combined with link information, specifying the idle/busy status of link paths interconnecting the stages, to ascertain if a path is available through one of the least congested second-stage switches. If a path is available, an idle outlet is selected on a least-congested second-stage switch, and then a connection is completed to the selected idle outlet.FIELD OF THE INVENTIONThis invention pertains to selecting and establishing paths through connecting networks and, more specifically, to arrangements for controlling the establishment of paths through two-stage concentrator networks.BACKGROUND OF THE INVENTION AND PRIOR ARTWhen a system ascertains that a connection must be established from a communication path through a network, it is desirable if the connection is completed over a path which tends to minimize the blocking potential for future connections. It is apparent that each time one connection is completed through the network, this increases the probability that future connections will be blocked. However, certain path selection and routing arrangements tend to minimize this blocking and thereby, tend to increase the capacity of a network.Conceptually, there are two distinct phases in the completion of a connection through a network. The first phase is known as a path hunt. In the path hunt phase, all accessible idle paths through the network are ascertained. In other words, all paths which could be utilized to complete a connection are ascertained. The second phase is known as routing and entails the selection of one of the available paths ascertained in the first phase. The connection is then established through the network over the one selected path.In prior art systems, several routing techniques have been utilized. One technique is known as "random-selection" routing and, in this technique, a selected path is chosen at random from all available usable paths. This technique is effective in that it tends to equalize the wear of equipment in the network.In another prior art routing technique, herein termed a "most-busy" technique, connections are completed through the most-congested switches or nodes which can handle the connection. For a discussion of this technique see, for example, page 1373 et seq. of the November, 1966, issue of Bell System Technical Journal. This technique is intuitively based upon the supposition that since the probability of completing a call through a highly congested switch is very low, if a path is now available through such a switch, the path should be utilized because for a succeeding call the probability of using this switch is also very low.Still another prior art routing technique is known as "sequential hunt" or "packing" and entails the selection of the first available usable route in a predetermined sequence of all possible routes.It is an object of this invention to optimally route and establish connections through a two-stage concentrator network in a manner to minimize blocking for future connections.SUMMARY OF THE INVENTIONI have discovered that connections can be optimally established to minimize blocking in a two-stage concentrator network by utilizing the paths through the least congested second-stage switches. The least-congested switches are defined to be those with the greatest number of idle outlets or terminals.More specifically, in accordance with this one illustrative embodiment of my invention, each stage of the two-stage network comprises a plurality of switches which are interconnected by links. A link map is generated which specifies the idle links associated with each of the first-stage switches. A second outlet map is generated which specifies the idle outputs for each of the second-stage switches. A "congestion" map is also generated which indicates the number of idle outlets for each second-stage switch.When a service request is detected over a communication line terminated in the network, information is obtained specifying the idle-busy status of the links connected to the first-stage switch on which this line is terminated. This obtained information is then logically compared with congestion information retrieved from the congestion map to ascertain the least congested second-stage switch over which the connection cannot be established. More specifically, a logical comparison is instituted to ascertain if the connection can be established over the second-stage switches with N idle outlets, in which N denotes the number of outlets on each second-stage switch. If not, a second logical comparison is instituted to ascertain if the connection can be established over the second-stage switches with N-1 idle outlets. If necessary, further successive comparisons are instituted until finally a comparison is instituted to ascertain if the connection can be established over the second-stage switches with one idle outlet. Upon ascertaining that a "least congested" second-stage switch can be utilized, an idle outlet on that switch is then selected.Based upon information identifying the first-stage switch, the derived information specifying the selected least-congested second-stage switch and the derived information specifying the selected outlet on the selected second-stage switch, the network is controlled to physically establish the connection through the network.In accordance with a feature of my invention, connections are established through the least-congested second-stage switches of a two-stage concentrator to minimize blocking.In accordance with another aspect of my invention a congestion map is derived from a map specifying the idle outlet status of the second-stage switches.In accordance with another aspect of my invention a sequence of logical comparisons are instituted to identify the class of second-stage switches with the most idle outlets having idle usable links connected thereto.

    摘要翻译： 公开了一种用于通过使用适于最小化阻塞的路径选择电路的两级集中器网络来选择和建立连接的系统。 该电路用于选择通过最不拥塞（即具有最多空闲输出线）的第二级开关的路径。 更具体地，从指定第二级交换机的出口或终端的空闲/繁忙状态的“出口”信息生成“拥塞”信息。 该拥塞信息与链接信息逻辑组合，指定互连级的链路路径的空闲/忙碌状态，以确定通过最不拥塞的第二级交换机之一路径是否可用。 如果路径可用，则在最不拥塞的二级交换机上选择空闲出口，然后连接到所选择的空闲出口。

    Security for controlled access systems
    7.
    发明授权
    Security for controlled access systems 失效
    受控访问系统的安全

    公开(公告)号：US5736932A

    公开(公告)日：1998-04-07

    申请号：US675029

    申请日：1996-07-03

    申请人： Andrew Frederick Bulfer ,  Charles Arthur Witschorik

    发明人： Andrew Frederick Bulfer ,  Charles Arthur Witschorik

    IPC分类号： H04L9/32 ,  H04L29/06 ,  H04W8/26 ,  H04W12/06 ,  H04W12/08 ,  H04W74/00 ,  H04Q1/00

    CPC分类号： H04L63/0853 ,  H04L63/104 ,  H04L63/18 ,  H04W12/06 ,  H04W12/08 ,  H04W74/00 ,  H04W8/26

    摘要： In order to gain access to a secured system, a user must be able to enter valid user identification information and must also have a remote wireless communication device such as a pager or cellular telephone having a number that is substantially unique to that user. When the user requests access to the secured system, the system places a call to the user's remote wireless communication device and sends that device revalidation information such as a random number generated by the secured system. The user must return the revalidation information to the secured system to gain access. In an alternative embodiment, another person (a user-approver) has the remote wireless communication device and must return the revalidation information to the secured system if the user-approver approves the user's request for access.

    摘要翻译： 为了获得对安全系统的访问，用户必须能够输入有效的用户识别信息，并且还必须具有远程无线通信设备，例如具有该用户基本上唯一的号码的寻呼机或蜂窝电话。 当用户请求访问安全系统时，系统向用户的远程无线通信设备发出呼叫，并发送该设备重新验证信息，例如由安全系统生成的随机数。 用户必须将重新验证信息返回给安全系统才能访问。 在替代实施例中，如果用户批准者批准用户的访问请求，另一个人（用户批准者）具有远程无线通信设备，并且必须将重新验证信息返回给安全系统。