At+t Corp.

At&t Bell Laboratories

American Telephone & Telegraph Co., At&t Bell Laboratories

Lucent Technologies Inc.

At&t Intellectual Property I, LP

John Stewart Denker

Lawrence David Jackel

Richard E Howard

Yann Andre LeCun

Howard Paul Katseff

Alan H Kramer

Donnie Henderson

Alexander G Dickinson

Thomas R Wik

Robert J Hall

Charles Douglas Blewett

Christopher John Burges

Patrice Y Simard

Hans P Graf

Christopher John Watkins

Lawrence O'Gorman

Steven C Avery

Bernard Victorri

Isabelle Guyon

Wayne E Hubbard

A method and system for calculating the approximate location of a mobile station along a recurrent route is disclosed. In an embodiment for the method in accordance with the principles of the present invention, the method for storing reference data includes decoding a first unique identifier for a cell in communication with the mobile station at a first location and a first time, storing the first unique identifier and the first time, decoding, upon handoff to a next cell, at a second location and at a second time, a second unique identifier for the next cell, and storing the second cell identifier and the second time. In a method for calculating an estimated time of arrival at the endpoint of a segment for a mobile station traveling along a recurrent route of travel, the method includes detecting the startpoint of one of the plurality of segments at a first time, and calculating an estimated time of arrival at the endpoint of the segment. In an embodiment of a system in accordance with an embodiment of the invention, the system includes a mobile station, a first cellular base station, a second cellular base station, a database, and a processor.

Method and system to calculate an approximate location of a mobile station in a recurrent route

A security gateway provides a secure connection among one or more networks and a protected resource network. One of the local networks may be connected to the remote private network via a VPN IPsec tunnel. The networks may be local networks that share resources without compromising the security of the protected resource network. The local networks may have access to an untrusted network such as the Internet, sharing a single connection through the security gateway. Dynamic source network address translation is used to permit access from the network connected to the protected resource network to other, less trusted networks while concealing the actual IP addresses of hosts within that network.

Method and apparatus for securely connecting a plurality of trust-group networks, a protected resource network and an untrusted network

A system for synchronized call forwarding of an incoming call from any of a plurality of telephones includes receiving a synchronized call forwarding command at a first telephony device, sending the synchronized call forwarding command from the first telephony device to a second telephony device over a first network, receiving a telephone call at the second telephony device over a second network, and forwarding the incoming call in accordance with the synchronized call forwarding command received from the first telephony device over the second network.

Linked call forwarding

A Fax system includes a sending fax machine, an intermediate fax machine operated by a fax forwarding service, and one or more receiving fax machines. A Job ID is generated to identify a fax message. The sending fax machine sends the fax message (e.g., a document) to the intermediate fax machine, and outputs a transmission report. The transmission report lists the Job ID. The fax message is forwarded to one or more intended recipients. The fax forwarding service provides the sender with a status report listing the Job ID and indicating whether the fax message was successfully forwarded.

Job ID for fax forwarding

A call contact platform (CCP) is provisioned with handles that belong to call recipients. Each recipient can have any number of handles in the CCP and each handle is associated with conditions under which a call employing the handle may be established. Specifically, when a party supplies a handle to a telecommunication network (previously given to the party by the call recipient), the network contacts the CCP and interacts with it as required in conformance with stored instructions. If appropriate, the CCP instructs the telecommunication network to establish a connection. A recipient can also give a party a handle that includes a message, where the handle is not prestored in the CCP. After the network contacts the CCP, the party provides the message, the CCP extracts instructions from the message, or retrieves instructions with the help of the message, and, as before, causes the telecommunication network to establish a connection, if appropriate. A party can also obtain a handle for a call recipient pursuant to predefined interactions with the telecommunication network that provide information specified by the call recipient.

Method for separately permissioned communication

The protocol of the present invention includes two new first level protocols and several embodiments of a second level protocol. The two new first level protocols of the present invention include the TCP2B protocol and the TCP2E protocol. In the TCP2B protocol, both client and server indicate their support for this protocol using one or more bits in TCP header. According to the TCP2B protocol, the client retransmits its requested options in the ACK message so the server need not store the options after the connection request. In the TCP2E protocol, the server maintains a Friends Table listing addresses of device recently observed to be complying with TCP. If a client's address is on the Friends Table, the connection request is processed according to TCP. Otherwise, the server sends an ACK message to the client to prompt the client to send a reset message. The client's address can then be added to the Friends Table.

Communications protocol with improved security

A method and system for forming an interpretation of an input expression, where the input expression is expressed in a medium, the interpretation is a sequence of symbols, and each symbol is a symbol in a known symbol set. In general, the system processes an acquired input data set representative of the input expression, to form a set of segments, which are then used to specify a set of consegmentations. Each consegmentation and each possible interpretation for the input expression is represented in a data structure. The data structure is graphically representable by a graph comprising a two-dimensional array of nodes arranged in rows and columns and selectively connected by directed arcs. Each path, extending through the nodes and along the directed arcs, represents one consegmentation and one possible interpretation for the input expression. All of the consegmentations and all of the possible interpretations for the input expression are represented by the set of paths extending through the graph. For each row of nodes in the graph, a set of scores is produced for the known symbol set, using a complex of optimally trained neural information processing networks. Thereafter the system computes an a posteriori probability for one or more symbol sequence interpretations. By deriving each a posteriori probability solely through analysis of the acquired input data set, highly reliable probabilities are produced for competing interpretations for the input expression.

System and method for automated interpretation of input expressions

In order for neural network technology to make useful determinations of the identity of letters and numbers that are processed in real time at a postal service sorting center, it is necessary for the neural network to 'learn' to recognize accurately the many shapes and sizes in which each letter or number are formed on the address surface of the envelope by postal service users. It has been realized that accuracy in the recognition of many letters and numbers is not appreciably sacrificed if the neural network is instructed to identify those characteristics of each letter or number which are in the category 'invariant.' Then, rather than requiring the neural network to recognize all gradations of shape, location, size, etc. of the identified invariant characteristic, a generalized and bounded description of the invariant segments is used which requires far less inputting of sample data and less processing of information relating to an unknown letter or number.

Training system for neural networks

High-efficiency clock generator circuits having single or complementary outputs for driving capacitive loads. The clock generator has therein at least one pair of complementary FET switches, coupled between the output of the generator and power supply rails, and an inductor. The generator is operated at a frequency approximately equal the resonant frequency of the inductor combined with the capacitance of the load. Energy normally stored in the load and dissipated in the FETs as in conventional clock generators is instead stored in the inductor and returned to the loads for reuse.

Low power clock circuit

An energy efficient logic gate circuit design that provides a substantially constant load to a clock source regardless of logic signal inputs to, or outputs from, the gate. The gate provides two complementary outputs and utilizes cross-coupled transistors to ensure that the outputs remain valid (complementary) after the logic inputs become invalid. Two blocks, each having a node coupling to the clock source and performing complementary logic functions, in combination with diodes for recharging the outputs of the gate, present the constant load to the clock source.

Low energy differential logic gate circuitry having substantially

An adiabatic dynamic non-inverter circuit is a mechanism by which a logic level signal and its inverse are simultaneously available in dynamic logic circuitry without significant power dissipation. The principles of this non-inverter circuit are used to create an exclusive-or gate which also does not dissipate significant power. Both of these circuits employ simplified circuit topologies.

Adiabatic dynamic noninverting circuitry

Power dissipation in precharge paths used in adiabatic dynamic logic circuitry is reduced by a precharge boost circuit which decreases the impedance between a clock node and an output node in such logic circuitry and thereby increases the charging current from a clock signal generator. In one example, a diode used to precharge an output node in adiabatic dynamic logic circuitry is selectively shorted by a controllable switch selectively connected in parallel with the diode when the output node is to be precharged.

Adiabatic dynamic precharge boost circuitry

A method for improved thinning or skeletonizing handwritten characters or other variable-line-width images. The method scans a template set over the image to be thinned. Each template has a specific arrangement of dark and light pixels. At least one of those templates includes either more than three pixels per row or more than three rows of pixels. An odd number is good choice. Moreover, the templates are chosen so that each template can unconditionally delete image pixels without consideration of the effect of such deletions on the behavior of the other templates. Thus the templates are independent of each other.

Growing community of inventors

Leonardo, NJ, United States of America

John Stewart Denker