Philip J Koopman

US Patent:

20020086676, Jul 4, 2002

Filed:

Jun 8, 2001

Appl. No.:

09/876153

Inventors:

Geoffrey Hendrey - San Francisco CA, US
Hirohisa Tanaka - Menlo Park CA, US
Philip Koopman - Pittsburgh PA, US
Joseph King - Hudson NH, US

International Classification:

H04Q007/20

US Classification:

455/445000, 455/456000, 455/518000

Abstract:

A method and system for selectively connecting proximately located telecommunications units are disclosed. The method and system may be used in a location aware telecommunications system that can determine the location of a telecommunications unit (TU) being used within the system. A first TU may be connected to a second TU when the first and second TUs are within a predetermined distance of each other and when a first user associated with the first TU may be connected to a second user associated with the second TU on a graph representing individual relationships, such as an acquaintance graph or genealogical tree. The connection may further be based on whether the first and second users have a less than a maximum threshold degree of separation within the relationship graph.

US Patent:

20020090954, Jul 11, 2002

Filed:

Jun 8, 2001

Appl. No.:

09/876146

Inventors:

Hirohisa Tanaka - Menlo Park CA, US
Geoffrey Hendrey - San Francisco CA, US
Philip Koopman - Pittsburgh PA, US
Joseph King - Hudson NH, US

International Classification:

H04Q007/20

US Classification:

455/456000, 455/041000, 455/517000

Abstract:

A method and system for connecting proximately located telecommunications units are disclosed. The method and system may be used in a location aware telecommunications system that can determine the location of a telecommunications unit (TU) being used within the system. A user may be connected to one or more other users when they have compatible attributes and when they are located within a predetermined distance of each other. The connection may be established between TUs of two or more users, based on attribute and distance information maintained by a server computer, upon the request of an initiating user's TU.

US Patent:

20020102993, Aug 1, 2002

Filed:

Jul 5, 2001

Appl. No.:

09/898496

Inventors:

Geoffrey Hendrey - San Francisco CA, US
Hirohisa Tanaka - Menlo Park CA, US
Philip Koopman - Pittsburgh PA, US

International Classification:

H04Q007/20

US Classification:

455/456000, 455/457000, 455/466000, 455/414000, 455/566000

Abstract:

Accurate location information about a mobile telecommunication transceiver is used to generate advertising content responsive to a user approaching the location of a business. This advertising content is tailored to the user's preferences and the particular business involved. Once the advertising content is delivered, the position of the user is monitored to track the effectiveness of the advertisement. If the user enters the business' store and/or makes a purchase, the advertisement is logged as having been successful. If the user does not enter the store within a predetermined period of time or moves away from the store, the advertisement is considered to have been ineffective.

US Patent:

20020111173, Aug 15, 2002

Filed:

Jun 8, 2001

Appl. No.:

09/876145

Inventors:

Geoffrey Hendrey - San Francisco CA, US
Philip Koopman - Pittsburgh PA, US
Joseph King - Hudson NH, US
Hirohisa Tanaka - Menlo Park CA, US

International Classification:

H04Q007/20

US Classification:

455/456000, 455/041000

Abstract:

A method and system for connecting proximately located telecommunications units are disclosed. The method and system may be used in a location aware telecommunications system that can determine the location of a telecommunications unit (TU) being used within the system. A user of a mobile telecommunications unit (MU) is connected to a TU when the MU is within a predetermined distance of a predetermined geographic location meeting predefined criteria. The TU to which the MU is connected may be automated or manually operated. In some embodiments, multiple MUs are connected when they are within a predetermined proximity to each other and a predefined criteria is met.

US Patent:

55352120, Jul 9, 1996

Filed:

Jan 31, 1994

Appl. No.:

8/189944

Inventors:

Philip J. Koopman - Hebron CT
David C. Brajczewski - Vernon CT

Assignee:

Otis Elevator Company - Farmington CT

International Classification:

H04L 522
H04J 306

US Classification:

370 856

Abstract:

If a transceiver has a message to send during an idle medium condition, it transmits a jam pattern onto the medium for a predetermined time (based on maximum network propagation delay). If a transceiver detects a jamming pattern, it inhibits its own transmissions and waits for the next slot progression. If multiple transceivers begin jamming within a propagation delay of each other (within the network vulnerable time), their jamming transmissions will not destructively interfere with each other. When jamming ceases, all transceivers begin a slot progression. Thus, the end of the jamming period when all transceivers have finished jamming serves as a network-wide synchronization for the start of an implicit token slot progression.

US Patent:

RE361810, Apr 6, 1999

Filed:

Nov 8, 1996

Appl. No.:

8/751932

Inventors:

Philip J. Koopman - Pittsburgh PA
Alan M. Finn - Amston CT

Assignee:

United Technologies Automotive, Inc. - Dearborn MI

International Classification:

H04L 932

US Classification:

380 23

Abstract:

An automobile door lock receiver module (30) and a plurality of keychain fob transmitter units (16) contain identification numbers, secret initial values, and secret feedback masks so as to authenticate encrypted messages from any of the assigned fobs, indicative of commands registered by closing switches on the fob. Each fob is synchronized with the receiving module by means of a truly random number concatenated with a secret initial value and encrypted, through a linear feedback shift register or other operations. A second secret initial value is encrypted and command bits are exclusive ORed into the low order bit positions; the two encrypted numbers are concatenated and encrypted to form a key word which is transmitted with the fob ID. Synchronization includes decrypting to recover the truly random number and the secret initial value concatenated therewith; the truly random number is compared with previously received random numbers in order to avoid copying of recently transmitted synchronization commands. Successive lock-related commands utilize the number encrypted from the truly random number and the second secret initial value as starting values, employing a pseudorandom number of encryption iterations.

US Patent:

56968280, Dec 9, 1997

Filed:

Sep 22, 1995

Appl. No.:

8/532337

Inventors:

Philip J. Koopman - Hebron CT

Assignee:

United Technologies Automotive, Inc. - Dearborn MI

International Classification:

H04L 900

US Classification:

380 46

Abstract:

The present invention teaches a method of generating a plurality of random numbers is disclosed. The method comprises the initial step of generating chaotic noise. Subsequently, the chaotic noise is sampled such that a plurality of samples are created. Each sample of the plurality of samples is then converted into digital data such that each converted sample corresponds with a random number of the plurality of random numbers.

US Patent:

57579237, May 26, 1998

Filed:

Apr 19, 1996

Appl. No.:

8/635145

Inventors:

Philip J. Koopman - Hebron CT

Assignee:

UT Automotive Dearborn, Inc. - Dearborn MI

International Classification:

H04L 900

US Classification:

380 46

Abstract:

The present invention teaches a method of generating a secret identification number from a random digital data stream. The method comprises the step of initially selecting a first and a second group of bytes from the random digital data stream, wherein the first and second groups of bytes have a first and second numerical value. Subsequently, a first maximal length LFSR feedback term is looked up from a list in response to said first numerical value, while a second maximal length LFSR feedback term is looked up from the list in response to said second numerical value. The method additionally comprises the step of generating a cyclic redundancy code feedback term in response to executing a cyclic redundancy code check on a third group of bytes selected from the random digital data stream. Moreover, the method comprises the step of forming the secret identification number from the first and second maximal length LFSR feedback terms, the cyclic redundancy code feedback term, and a fourth group of bytes from the random digital data stream.