Note: Descriptions are shown in the official language in which they were submitted.
CA 02363940 2001-08-24
WO 00/50974 ~- PCT/LTS00/05093
GLOBAL LY TIME-SYNCHRONIZED Y TEMS DEVICES AND METHODS
BACKGROUND OF INVENTION
The present invention relates generally to improvements in the
operation and performance of client-server type internetworked computer
systems of global extent, such as the Internet, and more particularly to a
novel Internet-based information system and method which enables millions
of time-constrained competitions, contests or transactions, among the mass
population, in a fundamentally fair and secure manner, using globally time-
synchronized client subsystems and information servers having extreme
accurate client-event resolution independent of variable network latency.
While the role of cooperation has a secure place in the history of
mankind, so too does the role of competition. Few will disagree that, over
the course of time, human beings have competed in widely diverse ways for
both tangible and intangible objects of need and desire. Such objects of
need or desire have included: food; shelter; land; rewards; prizes; natural
resources; sexual partners; fame; fortune; diversion or recreation, such as
sport; and ultimately, survival.
While the nature of man does not appear to have changed
fundamentally over the course of time, it is clear that his choice of tools a
n d
weapons have changed in step with his increase in technological skill a n d
knowledge.
For example, in the late 1960's, the globally-extensive information
infrastructure, now referred to as the Internet, was developed by the United
States Government as a tool for national defense and survival in world of
Page 1 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
intense global competition and military struggle. Ironically, some thirty
years later, with the technological development of the HyperText Transport
Protocol (HTTP), the HyperText Markup Language (HTML), and the Domain
Name System (DNS), a globally-extensive hyper-linked database referred to
as the World Wide Web (WWW) has quickly evolved upon the infrastructure
of the Internet. By virtue of the WWW, billions and even trillions of
information resources, located on millions of computing systems at different
locations on Earth, have been linked in complex ways serving the needs a n d
desires of millions of information resource users under the domains .net,
.edu, .gov, .org, .com, .mil, etc. of the DNS.
The overnight popularity and success of the WWW can be attributed
to the development of GUI-based WWW browser programs which enable
virtually any human being to access a particular information resource (e.g.
HTML-encoded document) on the WWW by simply entering its Uniform
Resource Locator (URL) into the WWW browser and allowing the HTTP t o
access the document from its hosting WWW information server a n d
transport the document to the WWW browser for display and interaction.
The development of massive WWW search engines and directory services
has simplified finding needed or desired information resources using GUI-
enabled WWW browsers.
Without question, a direct consequence of the WWW, the GUI-based
WWW browser, and underlying infrastructure of the Internet (e.g, high-
speed IP hubs, routers, and switches) has been to provide human beings
with a new set of information-related tools that can be used in ever
expanding forms of human collaboration, cooperation, and competition
alike.
Over the past several years, a number of WWW-enabled applications
have been developed, wherein human beings engage in either a cooperative
or competitive activity that is constrained or otherwise conditioned on the
variable time. Recent examples of on-line or Web-enableri forms of time-
constrained competition include: on-line or Internet-enabled purchase o r
sale of stock, commodities or currency by customers located a t
geographically different locations, under time-varying market conditions;
Page 2 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
on-line or Internet-enabled auctioning of property involving competitive
price bidding among numerous bidders located at geographically different
locations; and on-line or Internet-enabled competitions among multiple
competitors who are required to answer a question or solve a puzzle o r
problem under the time constraints of a clock, for a prize and/or an award.
In each of the above Internet-supported applications or processes,
there currently exists an inherent unfairness a m o ng the competitors due t o
at least six important factors, namely: (1) the variable latency of (or delay
in) data packet transmission over the Internet, dependent on the type of
connection each client subsystem has to the Internet infrastructure; (2) the
variable latency of data packet transmission over the Internet, dependent o n
the volume of congestion encountered by the data packets transmitted from
a particular client machine; (3) the vulnerability of these applications t o
security breaches, tampering, a nd other forms of manipulation by computer
and network hackers; (4) the latency ~f information display device used i n
client subsystems connected to the Internet; (5) the latency of information
input device used in client subsystems connected to the Internet; and (6) the
latency of the central processing unit (CPU) used in the client machine.
Regarding the first unfairness factor, it is important to point out that
the network latency over the Internet varies over the course of the day a n d
in response to network usage. Expressed differently, the time for a
transmitted data packet to travel between a first client computer to a
particular information server on the Internet will be different from the time
for a transmitted data packet to travel between a second client computer t o
the same information server on the Internet. This time variance in the
network latency on the Internet, referred to as the "variable network
latency", must necessarily be modeled a non-deterministic process subject to
the laws and principles of random (e.g. stochastic) processes. This has a
number of important consequences for Internet-supported forms of time-
constrained competition.
For example, in connection with Internet-supported competitions (e.g.
games) involving a plurality of competitors or competitors, US Patent No.
5,820,463 attempts to compensate for network latency by measuring the
Page 3 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
average latency between all the client machines and then inserting
intentional communication delays to make the average overall latency the
same for all communications links. However, while this system equalizes the
communication latency on average, it is wholly incapable of compensating
for the random components of network latency (i.e. variable network
latency) of the Internet. Consequently, even when practicing the methods
disclosed in US Patent No. 5,820,463, the variable network latency of the
Internet nevertheless introduces inherent sources of error into time-
constrained competitions, thereby putting certain competitors at an unfair
disadvantage, i.e. by virtue of their client computer connection to the
Internet in relation to the information server supporting the time-
constrained competition.
Regarding the second unfairness factor, it is important to point o a t
that when Internet-supported competition involves a small number of
competitors (e.g. 100 or less), the network latency should not be greatly
affected by the competitors themselves, but rather will be more dependent
on the types of connections the competitor's client machines have with the
Internet and on network traffic and congestion as a whole. However, d a ri n g
Internet-supported competition involving massive numbers of competitors,
as would exist during Web-based securities and commodities trading, a n d
Web-based auctions, involving thousands or even millions of human beings
are all competing simultaneously. Because of the simultaneous start time
and the expected distribution of responses, the system will be subject to two
intense impulses of traffic, one slightly before the competition start, and
the
other at the mean response time. It is necessary for the time-constrained
competition system to be able to adequately handle this intense bandwidth.
As larger numbers of competitors are becoming involved in a time-
constrained competition, it becomes more likely that there will be a tie
between two or more competitors. Typically, it is preferable to avoid ties
and be able to identify a single competitor as the winner. A time-
constrained competition system intended to manage extremely large
numbers of competitor must be able to resolve the time of the responses
Page 4 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
produced by such competitors in order to avoid or reduce the occurrence of
ties.
Regarding the third unfairness factor, it is important to point out that
each of the above-described time-constrained forms of Internet-supported
competition are highly vulnerable to security breaches, tampering, a n d
other forms of intentional network disruption by computer and network
hackers. Although the use of a local clock insures fairness, it also raises a
potential security problem with the system. Theoretically, an unscrupulous
competitor could intercept and modify communications between the client
and server, thereby falsifying the time-stamps and gaining an unfair
advantage over other competitors. Alternatively, an unscrupulous
competitor could modify the local clock, either through software o r
hardware means, or interfere with the clock synchronization procedure,
again gaining an unfair advantage over other competitors. The ordinary
encryption/decryption techniques suggested in US Patent No. 5,820,463 are
simply inadequate to prevent cheating or violation of underlying rules of
fairness associated with such time-constrained forms of Internet-supported
or Internet-enabled competition.
Regarding the fourth unfairness factor, it is important to point out
that different types of information display devices have faster refresh rates.
In the time-constrained competitions described above, the most common
information display device used on client subsystems is the cathode ray tube
(CRT) display monitor. In a CRT display monitor, the images presented t o
the user are drawn by an electron beam onto the screen from top to bottom,
one scanline at a time. When the electron beam reaches the bottom, i t m a s t
then travel back to the top of the monitor in order to prepare to output the
first scanline again. The period in which the beam returns to the top of the
screen is known as the retrace period. The overall frequency of the screen
refreshing and retrace cycle is determined by the frequency of the vertical
synchronization pulses in the video signal output by the computer. This
frequency is often referred to as the vertical sync rate. In most monitors
this rate ranges from 60 to 150 Hz. Unless the vertical redraw time i s
synchronized with the desired competition "start-time" in time-constrained
Page 5 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
competition at hand, a random error in the start time is created due to the
uncertainty of the actual time the query, bid, price or other information
element will be displayed on the display screen of a particular client system
used to participate in the time-constrained competition at hand. This
"information display latency" error can be as much as ten milliseconds o r
more depending on the vertical sync rate, and is in addition to any other
errors in the start-time caused by network latency, computer processing
time, and other factors.
US Patent 5,775,996 addresses the problem of information display
latency by providing a method and apparatus for synchronizing the video
display refresh cycles on multiple machines connected to an information
network. This method involves using methods similar to NTP (network
timekeeping protocol) or other clock synchronization algorithms in order t o
synchronize both the phase and frequency of the vertical refresh cycle o n
each display. First, the monitors are set to the same frequency using
standard video mode setting functions available in the operating system.
Next, the phase of the cycle is adjusted by repeatedly switching in and out of
"interlaced" mode. Since the interlaced modes have different timings than
the standard modes, switching briefly into an interlaced mode will affect the
phase of the refresh cycle.
This prior art method has a drawback in that it may be undesirable t o
modify the refresh rate on a competitor's client machine, since that is i n
part a personal preference, and typically under the control of the user. All
the client machine video-driver cards may not be physically capable of
operating at the same refresh rates, particularly if they are not operating a
t
the same resolution. Also, the monitors themselves may not be capable of
operating at a particular refresh rate, and it may be necessary to operate a t
an undesirable "lowest common denominator" frequency, or not at all. This
problem is compounded as more users and client machines are involved.
Another problem with this prior art display synchronization method
is that interlaced video modes are not possible on all video driver cards. In
addition, switching into interlaced modes may temporarily disrupt the
display as the monitor adjusts to handle the new input. Many display
Page 6 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
monitors will produce an annoying clicking noise as the video mode is
changed.
Regarding the fifth "unfairness factor", it must be pointed out that
different types of information input devices have faster information input
rates. In the time-constrained competitions described above, the most
common information input device used on today's client subsystems is the
manually-actuated keyboard. In response to manual keystrokes by the
competitor at his or her client machine, and electronic scanning operations,
the keyboard generates a string of ASCII characters that are provided a s
input to the client system bus and eventually read by the CPU in the client
machine. Only when the desired information string is typed into the client
machine, and the keyboard return key depressed, will the keyed-in
information string be transmitted to the information server associated with
the time-constrained competition. Those with physical handicaps, and those
using low-speed information input devices, will have their responses,
commands and/or instructions transmitted with greater latency, a n d
therefore arriving at the information server at a later time, assuming all
other factors maintained constant for all competitors. In short, depending
on the type of input device used, a competitor participating in an Internet-
supported time-constrained competition can be put at a serious
disadvantage in comparison with those using high-speed information input
devices and high-speed processors. When competing against androidal
competition (e.g. thinking machines), as currently used in electronic-based
securities and commodity trading, and electronic-based auctions, human
competitors are placed at a great disadvantage in rapidly changing markets
and fast-paced auctions.
Regarding the sixth unfairness factor, it must be pointed out that a
further source of latency exists within each client machine due to the fact
that the central processor unit (CPU) employed therein: services interrupts
posted by competing peripheral devices connected to the client system bus;
executes program instructions at a rate set by its clock speed; and has
limited memory resources available at any instant in time. These factors
operate to further add a degree of delay in when the data packets associated
Page 7 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
with the competitor's response is transmitted to the information server
supporting the time-constrained competition. Notably, the longer this
"processor latency" is, the latter the competitor's response will arrive at
the
information server supporting the time-constrained competition.
Consequently, the six "unfairness" factors discussed above
compromises the integrity any form of time-constrained competition
supported on or otherwise enabled over the Internet. Thus must b a
satisfactorily resolved in order ensure fundamental principles of fairness
and fair play that have come to characterize the systems of government,
justice, securities, commodities and currency market trading,
sportsmanship, and educational testing, in the United States of America and
abroad.
Thus there is a great need in the art for an improved way and means
of fairly and securely enabling time-constrained competitions for high stakes
among millions of competitors scattered around the globe, while avoiding
the shortcomings and drawbacks of prior art methodologies including.
prcrr nSU~R OF THE INVENTION
Accordingly, a primary object of the present invention is to provide
an improved system and method of fairly and securely enabling time-
constrained competitions over the Internet while avoiding the shortcomings
and drawbacks of prior art methodologies.
A further object of the present invention is to provide a novel system
and m ethod of serving and receiving information over the Internet i n
connection with time-constrained competitive processes so that principles of
fairness and fair play which have come to characterize the systems of
government, justice, securities, commodities and currency market trading,
sportsmanship, and educational testing, in the United States of America a n d
countries abroad, are secured in an economically feasible manner for the
betterment of human society.
A further object of the present invention is to provide a novel system
and method of serving and receiving information over the Internet i n
connection with time-constrained competitive processes, which avoids the
Page 8 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
problems of network latency, ensures microsecond "start-time" accuracy,
and can determine winners in the competition within microsecond "finish
time" accuracy.
Another object of the present invention is to provide an Internet-
based system for enabling time-constrained competition among a massive
number of competitors while compensating for the variable network
communication latencies experienced by client machines used by the
competitors.
Another object of the present invention is to provide an Internet-
based system for fairly and securely enabling time-constrained competitions
over the Internet. wherein a simultaneous start-time is produced for each
and every competitor involved in a particular competition regulated by the
system.
Another object of the present invention is to provide an Internet-
based system for fairly and securely enabling time-constrained competitions
using Internet information servers to synchronize the initial display of a n
invitation to respond (e.g. stock offer, query or problem) on a client
machine by shifting the phase of the display refresh cycle.
Another object of the p resent invention is to provide an Internet-
based system for fairly and securely enabling time-constrained competitions
over the Internet, wherein the time delay between a displayed invitation t o
respond (e.g. stock price, bid offer, or query) and the transmitted response
is precisely measured using the PentiumTM instruction counter in the client
machine.
Another object of the present invention is to provide an Internet-
based system for fairly and securely enabling time-constrained competitions
over the Internet, wherein client-event timing accuracy is markedly
improved by using a globally-synchronized hardware timing device at each
client machine to time-stamp each competitor's response to an invitation to
respond (ITR) displayed on the display screen of the client machine.
Another object of the present invention is to provide an Internet-
based system for fairly and securely enabling time-constrained competitions
over the Internet, wherein each client machine deployed therein is protected
Page 9 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
against intentional tampering through any means by the competitor using
the client machine, or by any third party desiring to gain an unfair
advantage over other competitors.
Another object of the present invention is to provide an Internet-
based system for fairly and securely enabling time-constrained competitions
over the Internet, which employs a digital signature method to protect
against intentional tampering through any means by a competitor or third
party, either intended to disrupt the operation of the competition a n d
otherwise interfere with the enjoyment of other competitors or spectators.
Another object of the present invention is to provide an Internet-
based system for fairly and securely enabling time-constrained competitions
over the Internet, wherein the digital signature method employs a secret
key, stored within a global synchronization unit (GSU) in each client
machine, in order to create the signature for both time-space stamping a n d
to a hash value generated from the data.
Another object of the present invention is to provide an Internet-
based system for fairly and securely enabling time-constrained competitions
over the Internet, wherein the digital signature can be used to prove that the
data (i.e. time-space stamp plus a hash of input data) has not been altered,
and to prove that it originated from the holder of the secret key (located
within the GSU).
Another object of the present invention is to provide an Internet-
based system for fairly and securely enabling time-constrained competitions
over the Internet, wherein each client machine employs a GSU, which
combines GPS and digital data signature technology to provide a secure a n d
verifiable time-space stamp on each client machine response.
Another object of the present invention is to provide an Internet
based system for fairly and securely enabling time-constrained competitions
over the Internet, which is scalable or extensible and capable of
simultaneously supporting a multiplicity of competitions, each involving a
virtually unlimited number (e.g. millions) of competitors.
Another object of the present invention is to provide an Internet
based system for fairly and securely enabling time-constrained competitions
Page 10 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
over the Internet, which protects against clock device tampering at each
client machine by utilizing and comparing multiple clock systems employed
in each client machine.
Another object of the present invention is to provide an Internet-
based system for fairly and securely enabling time-constrained competitions
over the Internet, wherein each client machine in the system is provided
with a client-based hardware extension to improve clock accuracy a n d
precision and therefore improve client- event response characteristics at
each such client machine.
Another object of the present invention is to provide an Internet-
based system for fairly and securely enabling time-constrained competitions
over the Internet, wherein each client machine in the system is provided
with a client-based hardware extension to improve security by means of
hardware encryption and decryption.
Another object of the present invention is to provide an Internet-
based system for fairly and securely enabling time-constrained competitions
over the Internet, wherein varying degrees of simultaneity can be offered,
insuring that the start time on all client machines is simultaneous within
tens of milliseconds at the least precise level, to on the order of within a
few
microseconds when all of the measures provided for are used.
Another object of the present invention is to provide an Internet-
based system for fairly and securely enabling time-constrained competitions
over the Internet, wherein one or more a globally-time synchronized
Internet-based information servers simultaneously and securely
communicate with millions of globally-time synchronized client machines
engaged in a predetermined competition supported over the Internet.
Another object of the present invention is to provide an Internet-
based method for fairly and securely enabling time-constrained
competitions over the Internet, w herein one or more a globally-time
synchronized Internet-based information servers simultaneously a n d
securely communicate with millions of globally-time synchronized client
machines engaged in a predetermined competition supported over the
Internet.
Page I 1 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/LJS00/05093
Another object of the present invention to provide an Internet-based
system, wherein each client machine is provided with a hardware device
which can precisely time and space stamp an event, and thus securely
generate an event only when specific time and space criteria are satisfied,
and also verify the authenticity of previously generated time and space
stamps produced by the hardware device.
Another object of the present invention is to provide a novel method
of time-space stamping which can be used to authenticate electronic-
commerce transactions between a vendor, bank and customer with
microsecond time accuracy.
Another object of the present invention is to provide a novel system
and method for electronically filing legal documents, such as patent
applications, property transfer documents and court/litigation documents,
with governmental or judicial institutions using the http, file transfer
IS protocols (ftp), electronic data interchange (EDI) techniques, and/or any
other file transmission protocols supported over the Internet.
Another object of the present invention is to provide a novel global
time-synchronization unit for connection to or embedding within any client
machine that is to be used in connection with the Internet-supported system
and method of the present invention.
Another object of the present invention is to provide a novel global
time-synchronization unit for connection to or embedding within any
Internet information server that is to be used in connection with the
Internet-supported system and method of the present invention.
Another object of the present invention is to provide an improved
system and method of receiving information from securities (e.g. stocks and
bonds), commodities and/or foreign currency information servers,
representing real-time or "live" market conditions, and simultaneously
disseminating such information to globally-synchronized client machines
located world-wide to enable secure "on-line" electronic-based securities
trading operations, commodities trading operations, and foreign currency
trading operations in a fundamentally fair manner.
Page 12 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
Another object of the present invention is to provide an improved
system and method for electronic-based on-line securities trading,
commodities trading, and foreign currency trading i n a secure a n d
fundamentally fair manner using client machines globally-synchronized
with corresponding Internet-based securities trading servers, commodities
trading servers, and foreign currency trading servers, respectively, so that
each market competitor is informed about incremental changes in market
conditions at substantially the same time and therefore is permitted t o
respond to such market condition changes (e.g. changes in stock, commodity
or currency prices) at substantially the same time in accordance with
principles of fundamental fairness and fair pl ay .
Another object of the present invention is to provide an improved
system and method of simultaneously disseminating securities, commodities,
and/or foreign currency information (e.g. real-time price quotes) using
globally time-synchronized information servers and client machines.
Another object of the present invention is to provide an Internet-
based system and method which enables competitors to trade securities,
commodities and/or foreign currencies using real-time pricing information
that is disseminated to all competitors of a given level of service at
substantially the same instant in time using a network of globally time-
synchronized information servers and client machines.
Another object of the present invention is to provide an Internet-
based information network, wherein competition supporting information
servers (e.g. market price advertising servers and order execution servers)
are time-synchronized with a plurality of globally-distributed time-
synchronized client machines that can be preprogrammed so respond t o
real-time securities prices within micro-second client event accuracy b y
transmitting time and space stamped orders to purchase and/or sell
securities, commodities and/or foreign currencies.
Another object of the present invention is to provide an Internet-
based information network comprising server and client computer systems,
wherebetween competition-promoting/supporting processes (e.g. bidding
processes) are carried out among individuals over the Internet, and accurate
Page 13 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
time-stamping operations are performed at both the client and server ends
of the network so that the response (i.e. bid) of each individual can b a
reliably accepted based upon its submission-time at the client computer
system, and not upon the receipt-time thereof at the server computer
system.
Another object of the present invention is to provide an Internet-
based method of supporting competitive processes over the Internet using a
network of server and client computer systems, wherebetween competition-
promoting/supporting processes (e.g. bidding processes) are carried out
among individuals over the Internet, wherein accurate time-stamping is
performed at both the client and server ends of the competition-supporting
process, so that the response (i.e. bid) can be reliably accepted based a p o
n
its submission-time at the client computer system, and not upon the receipt-
time thereof at the server computer system.
Another object of the present invention is to provide a novel method
of and system for tracking animate and inanimate objects through the
space-time continuum.
Another object of the present invention is to provide such a system,
wherein objects to be tracked carry or support wireless GSU-enabled client
network devices, of various form factors, which transmit digitally-signed
data packets to TS-stamping based tracking servers for decryption, a n d
object tracking and monitoring operations.
Another object of the present invention is to provide a n
Internet-based system and method of reliably tracking the space-time
trajectory of mobile objects using globally time-synchronized clocks,
global positioning subsystems, and digital signature techniques
carried out with hardware chips embedded within miniature wireless
network devices carried by the objects being tracked.
Another object of the present invention is to provide such
system and method, where time-space (TS) coordinate data is stored
aboard the device as it is generated and then periodically downloaded
to the TS-stamping based tracking server, eliminating the amount of
time that the client network device has to be on-line.
Page 14 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
Another object of the present invention is to provide a wireless
GSU-enabled client network device which has one or more
biophysiological sensors, to enable remote monitoring of the vital
signs of a living object being tracked.
Another object of the present invention is to provide a GSU-
enabled client network device having input sensors and input devices
selected from the group consisting of: temperature sensors, humidity
sensors, light level sensors, chemical sensors, and other physical
property sensors, CCD image capturing devices, sound sensing/pickup
and recording devices, fingerprint sensing/detection devices and
other biometric sensing d evices, vibration sensors, radiation sensors,
gaslvapor sensors, speech recognition devices, keypad input devices,
graphics input devices, devices for detecting tampering of the GSU-
enabled device and/or removal of the GSU from its associated object,
and t he like.
Another object of the present invention is to provide a novel
Internet-based method of and system for securing a region of physical
space, wherein a GSU-enabled client network device is provided with a
CCD-based digital video camera or scanner for capturing images of a
field of view of the camera or scanner, as well as an sound recording
device for recording sound within and about the field of view of the
camera, wherein each captured image frame is accurately space-time
stamped, and recorded on videotape or other digital recording
medium.
Another object of the present invention is to provide a novel
Internet-based method of and system for securing a computers
communications network by embodying a GSU chip of the present
invention into each network computing device so that its access to a
particular communications/computer network (i.e. subnetworK~ o r
WWW site can be securely enabled a TS-stamping tracking server only
upon the generation of a unique time-space stamp by GSU-chip,
achieved when the GSU-enabled network computing device is
Page 15 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
physically present at a predetermined location over a particular time
interval.
Another object of the present invention is to provide such a n
Internet-based method of and system for securing a computers
communications network by embodying a GSU chip, wherein a GSU-
enabled network computing device which is used to access a
particular communications (sub)network or WWW site, is partially
enabled by the enabled the TS-stamping tracking server when the
GSU-enabled network computing device is present outside of the
predetermined location, or predetermined time interval, so that the
TS-stamping tracking server can track to the exact location of the GSU-
enabled computing device and authorities apprehend the personal
using the same without authorization.
Another object of the present invention is to provide a novel
Internet-based method and system for enabling "location-and time"
based decryption of messages by using a GSU-enabled client
computing device of the present invention which is enabled by a TS-
stamping tracking server to decrypt certain messages stored on a
computer network only at certain times/places (i.e. ranges of TS
coordinate data), and at no others, for reasons that need only b a
known to the author of such messages.
Another object of the present invention is to provide a novel
Internet-based method and system for enabling the embedding of a
message within a transportable GSU-enabled computing device so that
the message can only be decrypted in a specific location at a specific
time period.
Another object of the present invention is to provide a novel
Internet-based method of and system for enabling the reception of
secure radio communications by using a GSU-enabled client
computing device of the present invention equipped, with radio
communications capabilities, which is enabled by a TS-stamping based
tracking receiver to only decrypt an particular incoming radio
Page 16 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
message or messages at a particular location at a particular period of
time, and at no other space-time instant.
Another object of the present invention is to provide a novel
Internet-based method of and system for displaying information clues
or instructions at particular instances along the space-time
continuum, wherein a wireless GSU-enabled client network device
(realized for example in the form of a watch or other portable casing
having an integrated display screen and keypad) cooperates with a
TS-stamping based tracking server through a global communication
network so as to enable the GSU-enabled client network device t o
display information clues andlor instructions only when the GSU-
enabled device is present within specific location over a particular
time interval (i.e. intersects a prespecified region along the space-time
continuum.
Another object of the present invention is to provide a novel
Internet-based method of and system for collecting space-time
coordinates of an athlete or animal at particular instances along the
space-time continuum, wherein a wireless GSU-enabled client network
device affixed (i.e. strapped) to the body of a human athlete (e.g.
skier, runner or swimmer) or animal participating in sports
competition, cooperates with a TS-stamping based tracking server
through a global communication network so as to enable the GSU-
enabled client network device to collect TS coordinate data during the
competition, TD data is collected from the GSU-enabled device carried
by the athlete on a real-time basis as the athlete or animal travels
from point to point, along a predetermined course, and where
collected TS data can be remotely analyzed to determine t h a
performance of the athlete in the competition and determination of a
winner.
Another object of the present invention is to provide a novel
Internet-based method of and system for enabling t he operation of
set-top cable television boxes, and other digital media content
delivery devices, in compliance with license agreements, wherein a
Page 17 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
GSU-enabled network computing device is embedded within each set-
top cable television box, and other digital media content delivery
device, in a media content delivery system, and one or more TS-
stamping based tracking servers are used to track and control such
media content delivery devices so that the media content delivery
devices are enabled into operation only when such devices are in fact
used in accordance with the conditions of use set forth in the license
agreement with the customer (i.e. when used within the particular
location specified in the license agreement and during the time
duration thereof).
Another object of the present invention is to provide a novel
Internet-based method of and system for enabling/controlling the
operation any portable host system or device which is restricted t o
operate within a set of space-time constraints, by embedding a GSU-
enabled device within each such portable host system or device, a n d
using one or more TS-stamping based tracking servers to track a n d
enable the operation of each such portable host system or device only
when such systems and devices are in fact used in accordance with t h a
conditions of use set forth in the license agreement.
2Q Another object of the present invention is to provide a novel
Internet-based method of and system for enabling/controlling the
operation any portable host system, by embedding a GSU-enabled
device within each such portable host system or device, and using o n a
or more TS-stamping based tracking servers to track and enable o r
otherwise control particular functions within the host system based o n
its time-space coordinates.
These and other objects of the present invention will become apparent
hereinafter and in the Claims to Invention.
BR_IRF DESCRIPTION OF THE DRAWINGS
Page 18 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
In order to more fully appreciate the objects of the present invention,
the detailed description of the illustrated a m bodiments should be read i n
conjunction with the accompanied figures and drawings:
FIG. 1 is a schematic representation of a generalized embodiment of
the Internet-based system of the present invention, showing the major
physical components thereof comprising a primary server 100 with an
embedded GPS (global positioning system) receiver 170, one or more web
servers 110, a login server 120, a competitor database 30, an invitation to
respondlresponse database 40, one or more competition-promoting servers
50 with embedded GPS receivers 170, and one or more client machines 1 60
with embedded Global Synchronization Units (GSU) 175, all components
being interconnected with a globally-extensive network (e.g. the Internet)
190;
FIG. 2 is a schematic representation of a contest-based embodiment of
the system of the present invention, showing the major physical components
thereof comprising a primary server 100 with embedded GPS (global
positioning system) receiver 170, one or more web servers 110, a login
server 120, a contestant database 130, an query/answer database 140, one
or more game servers 150 with embedded GPS receivers 170, and one o r
more client machines 160 with embedded Global Synchronization Units
(GSU) 175, all components being interconnected with a network 190;
FIG. 2A is a schematic representation of the components directly
involved in the querylresponse portion of the contest supported by the
system of FIG. 2, showing the virtual network connections between the
primary server 100 and a set of game servers 150, as well as between each
game server and an associated set of client machines 160;
FIG. 2B is a schematic representation of the components used t o
distribute and present the HTML and associated web content to contestants
using the system of FIG. 2, showing a plurality of mirrored web servers 1 10
each connected to a contestant database 130 and each serving a set of client
machines 160, and each client machine being equipped with a web browser
320;
Page 19 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
FIG. 2C is a schematic representation of the connectivity between the
login server 120 and the client machines 160, wherein each client machine
is provided with a contest client 340, and the login server is connected t o
the contestant database 130;
FIG. 2D is a schematic representation of some of the major
components of a client machine 160 employed in the system of the present
invention. shown comprising a global positioning subsystem 170 and
various hardware and software layers, including client software such as a
web browser 320, contest client application 340, contest plug-in 330, a n d
contest hooks and drivers 3 5 0
FIG. 2D1 is a schematic representation of a client machine 160
equipped with a GSU 175 and connected through the Internet to a server
equipped with a GPS clock unit 170;
FIG. 2D2 is a schematic representation of a basic global
synchronization unit (GSU) 175 employed in the system of the present
invention, shown comprising a GPS antenna 730, GPS receiver 700, central
processor 750, host computer interface 720, GPS disciplined high-frequency
clock 710, encryption and decryption module 740, and non-volatile memory
760;
FIG. 2D3 is a schematic representation of some of the major
components of a client machine 160 employed in the system of the present
invention, shown comprising a global synchronization unit 175 and various
hardware and software layers, including client software such as a contest
client application 340, contest plug-in 330, and contest hooks and drivers
350;
FIG. 2D4 is a schematic representation of a client machine 160
equipped with an enhanced GSU 177 and connected through the Internet to
a server equipped with a GPS clock unit 170, where input and output
devices are connected to the client machine 160 through the enhanced GSU
177;
FIG. 2D5 is a schematic representation of an enhanced global
synchronization unit (GSU) 177 employed in the system of the present
invention, shown comprising a GPS antenna 730, GPS receiver 700, central
Page 20 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
processor 750, host computer interface 720, GPS disciplined high-frequency
clock 710, encryption and decryption module 740, non-volatile memory
760, input device monitor and passthrough module 770, and an output
passthrough and signal generation module 780;
FIG. 2E is a schematic representation of some of the major
components of a game server employed in the system of the present
invention, shown comprising various hardware and software layers
including a game server daemon 270 and GPS receiver 170;
FIG. 2F is a schematic representation of some of the major
components of a web server I10 employed in the system of the present
invention, including web server software 360 providing support for HTML,
Java, and other standard protocols and web technologies;
FIG. 2G is a schematic representation of some of the major
components of the primary server 100 employed in the system of the
present invention, including the primary server daemon 250, a contest
management interface 260, a high precision clock or timer 200, high
performance network interface 210, and a GPS receiver 170;
FIG. 2H is a schematic representation of some of the major
components of the login server 120 employed in the system of the present
invention, including the login server daemon 370 and a high performance
network interface 210:
FIG. 3A is a schematic representation of the flow of data and messages
between a web server 110 and a client machine 160 employed in the system
of the present invention, wherein the data flow includes web site content
transmitted from the web server to the client machine, encrypted
registration information posted to the web server from the client machine,
preliminary contestant username and password sent to the client machine,
and contest software downloaded from the web server to the client machine;
FIG. 3B is a schematic representation of the flow of data and messages
between the primary server 100 and the login server 120 employed in the
system of the present invention, wherein the data flow includes a list of
game servers sent from the primary server to the login server;
Page 21 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
FIG. 3C is a schematic representation of the flow of data and messages
between a game server 150 and the login server 120 employed in the system
of the present invention, wherein the data flow includes a request for game
server status by the login server, and the request includes the login server's
public key for encryption, and wherein the data flow also includes a n
encrypted reply by the game server to the login server containing status a n d
loading information about the game server, as well as the game server's
public key for encryption use by the login server and client machine,
wherein the data flow also includes an encrypted contestant login request
from the login server to the game server and a corresponding encrypted
reply from the game server to the login server containing a game server
access code;
FIG. 3D is a schematic representation of the flow of data and messages
between the login server 120 and a client machine 160, this data includes a n
encrypted contestant login request from the client machine to the login
server, a message containing an encrypted contestant id sent from the login
server to the client machine, and an encrypted message from the login
server to the client machine containing a game server address a n d
associated game server access code;
FIG. 3E is a schematic representation of the flow of data and messages
between a game server 150 and a client machine 160, wherein the data flow
includes a message from the client machine to the game server containing a
contestant ID, a game server access code, and a client machine public key,
an additional message from the game server to the client m ac h i n a
containing the game server public key, an additional message from the game
server to the client machine containing and encrypted query and start-time,
a further message from the game server to the client machine containing a n
encrypted query decryption key, a further message from the client machine
to the game server containing a response notification hash, a further
message from the client machine to the game server containing the
encrypted response d ata and security verification hash, a further message
from the game server to the client machine containing the security log
request, a further message from the client machine to the game server
Page 22 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
contamng the encrypted security log, a final message from t he game server
to the client machine containing the contest results;
FIG. 3F is a schematic representation of the flow of data and messages
between the primary server 100 and a game server 150, wherein the data
flow includes a message from the game server to the primary server
containing the game server public key, an additional message from the
primary server to the game server containing the primary server public key,
a further encrypted message from the primary server to the game server
containing the encrypted query, encrypted start-time, and encrypted
answer, a further message from the game server to the primary server
containing the encrypted preliminary results for the contest, a further
message from the primary server to the game server containing a n
encrypted security analysis request, a further message from the game server
to the primary server contains the encrypted security analysis results, a
final
message from the primary server to the game server containing the
encrypted contest results;
FIG. 3G is a schematic representation of the flow of data and messages
between the primary server 100 and a web server 110, wherein the data
flow includes game announcements delivered via ftp from the primary
server to the web (http) server, and additional data delivered via ftp from
the primary server to the web server includes contest results and contestant
standings;
FIG. 4 is a flowchart of the high level operations performed by t h a
contest-based system of FIG. 2 so as to enable a contestant to participate in
a
simultaneous, secure, mufti-player time-constrained contest;
FIG. 4A is a flowchart describing in greater detail a method for
registering and downloading contest software in the system of FIG. 2;
FIG. 4B is a flowchart describing in greater detail a method for the
contestant to log on to the game server of FIG. 2;
FIG. 4C is a flowchart describing in greater detail a method for
downloading an encrypted query and start-time to the client machine 160;
FIG. 4D1 is a flowchart describing in greater detail a method for
characterizing the client machine local clock 290 and synchronizing t h a
Page 23 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
client machine display update cycle in connection with a system of the
present invention incorporating a basic GSU 175 in the client machine 160;
FIG. 4D2 is a flowchart describing in greater detail a method for
characterizing the client machine local clock 290 and synchronizing t h a
client machine display update cycle in connection with a system
incorporating an enhanced GSU 175 in the client machine 160;
FIG. 4D3 is a flowchart describing in greater detail in which a m a t h o d
for characterizing the client machine local clock 290 and synchronizing the
client machine display update cycle in connection with a system that does
not include a global synchronization unit;
FIG. 4E1 is a flowchart describing in greater detail a method for
presenting the query to the contestant at the contest start-time i n
connection with a system incorporating a basic GSU 175 in the client
machine 160;
FIG. 4E2 is a flowchart describing in greater detail a method for
presenting the query to the contestant at the contest start-time i n
connection with a system incorporating an enhanced GSU 175 in the client
machine 160;
FIG. 4E3 is a flowchart describing in greater detail a method for
presenting the query to the contestant at the contest start-time i n
connection with a system that does not include a global synchronization
unit;
FIG. 4F1 is a flowchart describing in greater detail a method for the
contestant to submit a time-stamped response to the previously presented
query in connection with a system incorporating a basic GSU 175 in the
client machine 160;
FIG. 4F2 is a flowchart describing in greater detail a method for the
contestant to submit a time-stamped response to the previously presented
query in connection with a system incorporating an enhanced GSU 175 in
the client machine 160;
FIG. 4F3 is a flowchart describing in greater detail a method for t h a
contestant to submit a time-stamped response to the previously presented
Page 24 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/IJS00/05093
query is outlined for a system that does not include a global synchronization
unit;
FIG. 4G is a flowchart describing in greater detail a method for fairly
judging the contest and determining the winners of that contest is outlined;
FIG. 5 is a schematic representation of a financial trading-based
embodiment of the system of the present invention, showing the major
physical components thereof comprising a primary server 100 equipped
with GPS (global positioning system) receiver 170, one or more web servers
1 10, a login server 120, a t rader database 35, a real-time market state
server
45, one or more real-time price-quotation and trading (Q & T) servers 55, as
well as between each RTPQ&T server and an associated set of client
machines 160;
FIG. SB is a schematic representation illustrating the connectivity
between the login server 120 and the client machines 160, wherein each
client machine is provided with trading client software 345, and wherein the
login server is also connected to the trader database 3 5 ;
FIG. 6 is a schematic representation of an auction-based embodiment
of the system of the present invention (i.e. auction-supporting system),
showing the major physical components thereof comprising a primary
server 100' with embedded GPS (global positioning system) receiver 170,
one o r more web servers 1 10, a login server 120', a bidder database 130', a
n
auction database 140', one or more auction servers 150' with embedded GPS
receivers 170, and one or more client machines 160 with embedded Global
Synchronization Units (GSU) 175, all components being interconnected with
a network 190;
FIG. 6A is a schematic representation of the components directly
involved in the bid/counter-bid portion of the auction supported by the
system of FIG. 6, showing the virtual network connections between t h a
primary server 100' and a set of auction servers 150', as well as between
each auction server and an associated set of client machines 160;
FIG. 6B is a schematic representation of the components used t o
distribute and present the HTML and associated web content to contestants
using the system of FIG. 2, showing a plurality of mirrored web servers 1 10
Page 25 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
each connected to a contestant database 130 and each serving a set of client
machines 160, and each client machine being equipped with a web browser
320;
FIG. 6C is a schematic representation of the connectivity between the
login server 120' and the client machines 160, wherein each client machine
is provided with a bidding client 340, and the login server is connected t o
the bidder database 130';
FIG. 6D is a schematic representation of some of the major
components of a client machine 160 employed in the system of the present
invention, shown comprising a global synchronization unit 175 and various
hardware and software layers, including client software such as an auction
client application 340', auction plug-in 330', and auction hooks and drivers
350';
FIG. 6E is a schematic representation of some of the major
components of an auction server employed in the system of the present
invention, shown comprising various hardware and software layers
including an auction server daemon 270' and GPS receiver 170;
FIG. 6F is a schematic representation of some of the major
components of a web server 110 employed in the system of the present
invention, including web server software 360 providing support for HTML,
Java, and other standard protocols and web technologies;
FIG. 6G is a schematic representation of some of the major
components of the primary server 100' employed in the system of Fig. 6,
including the primary server daemon 250, an auction management interface
260', a high precision clock or timer 200, high performance network
interface 210, and a GPS receiver 170;
FIG. 6H is a schematic representation of some of the major
components of the login server 120' employed in the system of Fig. 6,
including the login server daemon 370 and a high performance network
interface 210;
FIG. 7A is a schematic representation of the flow of data and messages
between a web server I10 and a client machine 160 employed in the system
of Fig. 6, wherein the data flow includes web site content transmitted from
Page 26 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
the web server to the client machine, encrypted registration information
posted to the web server from the client machine, preliminary bidder
username and password sent to the client machine, and auction software
downloaded from the web server to the client machine;
FIG. 7B is a schematic representation of the flow of data and messages
between the primary server 100 and the login server 120' employed in t h a
system of Fig. 6, wherein the data flow includes a list of auction servers
sent
from the primary server to the login server;
FIG. 7C is a schematic representation of the flow of data and messages
between an auction server 150' and the login server 120' employed in the
system of Fig. 6, wherein the data flow includes a request for auction server
status by the login server, and the request includes the login server's public
key for encryption, and wherein the data flow also includes an encrypted
reply by the auction server to the login server containing status and loading
information about the auction server, as well as the auction server's public
key for encryption use by the login server and client machine, wherein the
data flow also includes an encrypted bidder login request from the login
server to the auction server and a corresponding encrypted reply from the
auction server to the login server containing a auction server access code;
FIG. 7D is a schematic representation of the flow of data and messages
between the login server 120' and a client machine 160, this data includes
an encrypted bidder login request from the client machine to the login
server, a message containing an encrypted bidder identification sent from
the login server to the client machine, and an encrypted message from t h a
login server to the client machine containing an auction server address and
associated auction server access code;
FIG. 7E is a schematic representation of the flow of data and messages
between an auction server 150' and a client machine 160, wherein the data
flow includes a message from the client machine to the auction server
containing a bidder ID, an auction server access code, and a client machine
public key, an additional message from the auction server to the client
machine containing t he auction server public key, an additional message
from the auction server to the client machine containing and encrypted
Page 27 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
minimum and start-time, a further message from the auction server to the
client machine containing an encrypted bid decryption key, a further
message from the client machine to the auction server containing a response
notification hash, a further message from the client machine to the auction
server containing the encrypted response data and security verification
hash, a further message from the auction server to the client machine
containing the security log request, a further message from the client
machine to the auction server containing the encrypted security log, a final
message from the auction server to the client machine containing the
auction results;
FIG. 7F is a schematic representation of the flow of data and messages
between the primary server 100' and an auction server 150', wherein the
data flow includes a message from the auction server to the primary server
containing the auction server public key, an additional message from the
primary server to the auction server containing the primary server public
key, a further encrypted message from the primary server to the auction
server containing the encrypted auction, encrypted start-time, a n d
encrypted answer, a further message from the auction server to the primary
server containing the encrypted preliminary results for the contest, a
further message from the primary server to the auction server containing a n
encrypted security analysis request, a further message from the game server
to the primary server contains the encrypted security analysis results, a
final
message from the primary server to the auction server containing the
encrypted auction results;
FIG. 7G is a schematic representation of the flow of data and messages
between the primary server 100' and a web server 110, wherein the data
flow includes auction announcements delivered via ftp from the primary
server to the web (http) server, and additional data delivered via ftp from
the primary server to the web server includes auction results and bidder
standings;
FIG. 8A is a schematic representation describing the data fields of the
Login Information Structure maintained within the log-in server of the
system of Fig. 6 ;
Page 28 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
FIG. 8B is a schematic representation describing the data fields of the
Auction Information Structure maintained within the auction server of the
system of Fig. 6;
FIG. 8C is a schematic representation describing the data fields of the
Bid Information Structure maintained within the auction database in the
system of Fig. 6;
Fig. 9 is a flowchart of the high level operations performed by the
auction-based system of FIG. 6 so as to enable a bidder to participate in a
simultaneous, secure, mufti-player time-constrained auction;
FIG. 9A is a flowchart describing in greater detail a method for
registering and downloading auction software in the system of FIG. 6;
FIGS. 9B 1 and 9B2, taken together, is a flowchart describing in greater
detail a method for the bidder to log on to the auction server of FIG. 6;
FIGS. 9C1 and 9C2, taken together, is a flowchart describing in greater
detail a method for downloading an encrypted auction information a n d
start-time to the client machine 160;
FIG. 9D is a flowchart describing in greater detail in which a method
for characterizing the client machine local clock 290 and synchronizing the
client machine display update cycle in connection with a system that does
not include a global synchronization unit (GSU);
FIGS. 9E1 and 9E2, taken together, is a flowchart describing in greater
detail a method for presenting the auction information to the bidder at the
auction start-time in connection with a system incorporating an enhanced
GSU 175 in the client machine 160, and also a method for the bidder t o
submit a time-stamped response to the previously presented auction
information in connection with a system incorporating an enhanced GSU
175 in the client machine 160;
FIG. 10 is a schematic representation of a modified embodiment of the
Internet-based contest-promoting system of the present invention, wherein
one or more remote administration consoles 600, contest database 660, a n d
a remote administration server 610 are provided for remotely creating a n d
administering contests over the Internet;
Page 29 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
FIG. l0A is a schematic representation of the components shown i n
FIG. 10 directly involved in the remote administration of contests, showing
the virtual network connections between the primary server 100 and a
remote administration server 610, between the remote administration server
610 and a contest database 660, contestant database 130, and query answer
database 140, as well as between the remote administration server 610 and
one or more remote administration consoles 600;
FIG. lOB is a schematic representation of some of the major
components of a remote administration console 600 employed in the system
of FIG. 10, showing various hardware and software layers, including the
administration software being comprised of a remote administration client
application 650 and a remote administration plug-in 640;
FIG. lOC is a schematic representation of some of the major
components of a remote administration server 610 employed in the system
of FIG. 10, showing various hardware and software layers, including t h a
remote administration web server 620 and the remote administration
daemon 630;
FIG. 1 1 is a schematic representation of a subsystem for providing t h a
competition-promoting systems of the present invention with a television-
based spectator interface, showing comprising a web server 110, a video-
enabled client machine 900, a web-to-video processor 910, taped video
content playback unit 960, live video source (e.g. camera) 950, a real-time
video compositor 920, broadcasting equipment 930, and television viewers
940;
FIG. 11A is a schematic representation showing an exemplary layout
for displaying contest live video, contestant images, and live contest
queries,
results, scores and statistics on a television-based spectator interface;
FIG. 12 is a schematic representation showing the basic components of
a television-based client machine according to the present invention, shown
comprising a set-top client machine 970 connected to the user's television
set 990 using a standard NTSC or PAL cable, and a remote-control i n p a t
device 980 for controlling the client machine;
Page 30 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
FIG. 12A is a schematic representation showing the major components
of the set-top client machine 970 of FIG. 12, shown comprising a GPS
receiver 170, clock and timer hardware 290, a television tuner with
IntercastTM decoding capability 977, a modem 976, an infrared input port
975, NTSC or PAL audio/video output 974, embedded device drivers 97 3
and embedded operating system with Java capability 972 running on a
microprocessor, and a firmware contest client 971 ;
FIG. 13 is a schematic representation showing examples of input
devices that can be connected to a global synchronization unit (GSU) of the
present invention for performing time and space stamping;
FIG. 14 is a schematic representation showing examples of
applications that can benefit from inclusion of an embedded global
synchronization unit (GSU) in accordance with the principles of the present
invention;
FIG. 15 is a schematic representation showing examples of different
configurations of a global synchronization unit, including both internal a n d
external units with a variety of interface options;
FIG. 16 is a schematic representation of the time-space (TS) stamping
based system for tracking mobile objects, including human beings and
articles of property, relative to a globally-defined coordinate reference
system, employing ultra-compact and miniaturized global synchronization
unit (GSU) enabled client computing/network devices constructed i n
accordance with the principles of the present invention;
FIG. 16A is a schematic representation of some of the major
components of a wireless GSU-enabled client network device in the mobile
object tracking system of FIG. 16, shown comprising a global
synchronization unit (GSU) 175 and various hardware and software layers,
including client software such as a tracking client application 340' a n d
tracking hooks and drivers 350';
FIG. 16A1 is a perspective view of a GSU-enabled client network device
of the present invention, shown realized in the form of a wireless security-
tag/address-label having a spring-biased surface-sensing pin provided o n
Page 31 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
the underside of its casing for establishing contact with a package surface
when the tag is affixed to the package for object tracking purposes;
FIG. 16A2 is a perspective view of a shipped package to which the
GSU-enabled client network device of FIG. 16A 1 is affixed for enabling real-
time object tracking operations as the package is routed to its destination;
FIG. 16B is a schematic representation of some of the major
components of a time-space (TS) stamping based tracking server employed
in the system of FIG. 16, shown comprising various hardware and software
layers including a TS-stamping based tracking server daemon 270' and GPS
receiver 170;
FIG. 16C is a schematic representation of some of the major
components of the Web-Based Owner/Object Registration Information Server
I10' employed in the system of FIG. 16, including web server software 360'
providing support for HTML, Java, and other standard protocols and web
technologies;
FIG. 16D is a schematic representation of some of the major
components of the Web-Based Object Trajectory Information Server 1 10"
employed in the system of FIG. 16, including web server software 360"
providing support for HTML, Java, a nd other standard protocols and web
technologies;
FIG. 17A is a schematic representation of an exemplary locus of time-
space coordinates collected by the TS-Stamping Based Tracking Server of the
system of FIG. 16 during a mobile object tracking process carried out i n
accordance with the principles of the present invention;
FIG. 17B is a schematic representation of an exemplary locus of time-
space coordinates collected by the TS-Stamping Based Tracking Server of t h a
system of FIG. 16 during an object movement detection process carried o a t
in accordance with the principles of the present invention;
FIG. 18 is a schematic representation of a database table for storing
data relating to the owner of one or more objects, objects owned o r
controlled by registered owners, and time-space data generated by a mobile
GSU-enabled client network device carried by a registered object, a n d
collected by the TS-Stamping Based Tracking Server shown in FIG. 16;
Page 32 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
FIG. 19A is a schematic representation of some of the major
components of an alternative embodiment of a GSU-enabled client network
device carried by a living being (e.g. animal or person) which is being
tracked using the time, space and biophysiological stamping (TSB) Based
Object Tracking System of FIG. 16, shown comprising a global
synchronization unit 175, a biophysiological signal sensor (e.g. pulse sensor,
EKG sensor, and/or other biophysiological signal sensor) and various
hardware and software layers, including client software such as a tracking
client application 340' and tracking hooks and drivers 350';
FIG. 19B is a schematic representation of a wrist-mounted GSU-
enabled client network device for use with the TSB-Stamping Based Object
Tracking Server shown in FIG. 20, over the network of Fig. 16, wherein a
biophysiological signal sensor is incorporated into the GSU-enabled client
network device for real-time sensing of biophysiological signals produced
from the living being (e.g. animal or person) on which it is carried, and a
fractal-based antenna structure is a mbedded within the housing of the GSU-
enabled client network device;
FIG. 20 is a schematic representation of some of the major
components of a TSB-Stamping Based Tracking Server employed with the
GSU-enabled client network device of FIG. 19B, shown comprising various
hardware and software layers including a TSB-Stamping Based Tracking
Server daemon 270' and GPS receiver 170;
FIG. 21 is a schematic representation of an exemplary locus of time,
space and biophysiological (TSB) coordinates collected by the TSB-Stamping
Based Tracking Server shown in FIG. 20 during the process of tracking a
living being carrying the GSU-enabled client device of FIGS. 19A and 19B i n
accordance with the principles of the present invention;
FIG. 22 is a owner/object database table, maintained within the Web
enabled Owner/Object RDBMS, for storing time, space and biophysiological
data generated by a GSU-enabled client network device shown in FIGS. 19A
and 19B and collected by the TSB-Stamping Based Tracking Server shown i n
FIG. 20, operating within the system shown in FIG. 20;
Page 33 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
FIG. 23A is a schematic representation of an Internet-based method of
and system for securing a region of physical space, wherein a GSU-enabled
client network device is provided with a CCD-based digital video camera o r
scanner for capturing images of a field of view (FOV) of the camera o r
scanner, as well as a sound recording device for recording sound (tracks)
within and about the field of view of the camera, wherein each captured
image frame is accurately space-time stamped, and recorded on videotape o r
other digital recording medium;
Fig. 23B is a data table describing the information fields maintained i n
the Image RDBMS employed in the system of Fig. 23A, wherein TS-stamped
images and associated sound recording tracks are stored for analysis and
usage in various security operations;
Fig. 24A is a schematic representation of an Internet-based method of
and system for securing a computer communications network by embodying
a GSU chip of the present invention into each network computing device so
that its access to a particular communications/computer network (i.e.
subnetwork) or WWW site can be securely enabled a TS-stamping tracking
server only upon the generation of a unique time-space stamp by the GSU-
chip, achieved when the GSU-enabled network computing device is
physically present at a predetermined location over a particular time
interval;
Fig. 24B is a schematic representation of an exemplary locus of time-
space coordinates collected by the TS-Stamping Based Tracking Server of the
system of FIG. 24A, and the predetermined TS-region over which the GSU-
enabled network computing device is enabled by the TS-Stamping Based
Tracking Server to access a prespecified communication subnetwork o r
WWW server in accordance with the principles of the present invention;
Fig. 25A is a schematic representation of an Internet-based method of
and system for securing a computers communications network b y
embodying a GSU chip, wherein a GSU-enabled network computing device
which is used to access a particular communications (sub)network or WWW
site, is partially enabled by the TS-stamping tracking server when the GSU-
enabled network computing device is present outside of the predetermined
Page 34 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
location, or predetermined time interval, so that the TS-stamping tracking
server can track to the exact location of the GSU-enabled computing device
and authorities can apprehend the person using the same without
authorization;
Fig. 25B is a schematic representation of an exemplary locus of time-
space coordinates collected by the TS-Stamping Based Tracking Server of the
system of FIG. 25A, and the predetermined TS-region over which the GSU-
enabled network computing device is enabled by the TS-Stamping Based
Tracking Server to decrypt and display encrypted message prestored on the
GSU-enabled network computing device in accordance with the principles of
the present invention;
Fig. 26A is a schematic representation of an Internet-based method
and system for enabling "location-and time" based decryption of messages
by using a GSU-enabled client computing device of the present invention
which is enabled by a TS-stamping tracking server to decrypt certain
messages stored on a computer network only at certain times/places (i.e.
ranges of TS coordinate data), and at no others, for reasons that need only
be known to the author of such messages;
Fig. 26B is a schematic representation of an exemplary locus of time-
space coordinates collected by the TS-Stamping Based Tracking Server of the
system of FIG. 26A, and the predetermined TS-region over which the GSU-
enabled network computing device is enabled by the TS-Stamping Based
Tracking Server to decrypt and display encrypted radio messages being
received by the GSU-enabled network computing device in accordance with
the principles of the present invention;
Fig. 27A is a schematic representation of an Internet-based method of
and system for displaying information clues or instructions at particular
instances along the space-time continuum, wherein a wireless GSU-enabled
client network device (realized for example in the form of a watch or other
portable casing having an integrated display screen and keypad) cooperates
with a TS-stamping based tracking server through a global communication
network so as to enable the GSU-enabled client network device to display
information clues and/or instructions only when the GSU-enabled device is
Page 35 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
present within a specific location over a particular time interval (i.e.
intersects a prespecified region along the space-time continuum);
Fig. 27B is a schematic representation of an exemplary locus of time-
space coordinates collected by the TS-Stamping Based Tracking Server of the
system of FIG. 27A, and the predetermined TS-region over which the GSU-
enabled network computing device is enabled by the TS-Stamping Based
Tracking Server to decrypt and display encrypted messages prestored i n
memory in the GSU-enabled network computing device in accordance with
the principles of the present invention;
Fig. 28A is a schematic representation of an Internet-based method of
and system for enabling the operation of set-top cable television boxes, a n d
other digital media content delivery devices, in compliance with license
agreements, wherein a GSU-enabled network computing device is embedded
within each set-top cable television box, and other digital media content
delivery device, in a media content delivery system, and one or more TS-
stamping based tracking servers are used to track and control such media
content delivery devices so that the m edia content delivery devices are
enabled into operation only when such devices are in fact used i n
accordance with the conditions of use set forth in the license agreement with
the customer (i.e. when used within the particular location specified in t h a
license agreement and during the time duration thereof).
Fig. 28B is a schematic representation of an exemplary locus of time-
space coordinates collected by the TS-Stamping Based Tracking Server of the
system of FIG. 28A, and the predetermined TS-region over which the GSU-
enabled media content delivery device is enabled operational by the TS-
Stamping Based Tracking Server in accordance with the principles of the
present invention;
Fig. 29A is a schematic representation of an Internet-based method of
and system for enabling/controlling the operation any portable host system
or device which is restricted to operate within a set of space-time
constraints, by embedding a GSU-enabled device within each such portable
host system or device, and using one or more TS-stamping based tracking
servers to track and enable the operation of each such portable host system
Page 36 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
or device only when such systems and devices are in fact used in accordance
with the conditions of use set forth in the license agreement; and
Fig. 29B is a schematic representation of an exemplary locus of time-
space coordinates collected by the TS-Stamping Based Tracking Server of the
system of FIG. 29A, and the predetermined TS-region over which the GSU-
enabled media content delivery device is rendered o perational by the TS-
stamping based tracking server, in accordance with the principles of the
present invention.
REST MnDFS FOR C'ARRYTNC' O T THE PRESENT INVENTION
Referring to the figures in the accompanying Drawings, the preferred
embodiments of competition-enabling (i.e. competition-promoting) system
and method of the present invention will now be described in great detail,
wherein like elements will be indicated using like reference numerals.
In FIG. 1, a generalized internetworked-based competition-promoting
system is shown for fairly and securely enabling one or more time-
constrained competitions among a plurality of competitors simultaneously
presented with the same set of data (i.e. in a globally time-synchronized
manner) which, in general, may be informative or may take the form of a
question to be answered, or a problem, puzzle or riddle to be solved.
Hereinafter, this data shall be referred to as an Invitation-to-Respond, o r
ITR, which is transmitted to each of the competitors participating in the
competition promoted by the system hereof in a regulated manner. I n
general, the competitors can be human beings, programmed computers, o r
sophisticated androidal machines as taught, for example, in WIPO
International Publication No. WO 98/49629 published on November 5, 1998
incorporated herein by reference. In response to each ITR presented to the
competitors, each competitor is allowed to respond to the ITR by submitting
an appropriate response or undertaking a particular action. In accordance
with the principles of the present invention, the timing of each competitor's
response is critical to ensuring fairness in the competitive activity i n
Page 37 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/iJS00/05093
question, and thus precisely measured, securely recorded and analyzed in a
manner which will be described in greater detail hereinafter.
In general, the competition-promoting system and method of the
present invention can be applied to a variety of different competitive
activities with only slight modifications required from embodiment t o
embodiment of the present invention. Typical applications of the present
invention include multi-player timed problem-solving games, puzzles, o r
contests; on-line real-time auctions, on-line real-time trading of securities
(e.g. stocks and bonds), commodities, and foreign currencies; on-line real-
time auctions; on-line educational testing; on-line career testing; on-line
aptitude testing; on-line intelligence quotient (IQ) testing; and other real-
time activities wherein simultaneous presentation of information to a
plurality of c ompetitive entities or accurate presentation of IRQs to a n d
collection of responses thereto from one or more human subjects, is critical
to the competitive or otherwise time-constrained activity at hand, in order
to ensure fundamental principles of fairness and fair play expected b y
participants, spectators, and sponsors alike. As used hereinafter and in the
Claims to Invention, the term "competition" shall be understood to embrace
all such network-enabled activities.
Overview Of The Generalized Embodiment Of The System Of The Present
Invention
As shown in FIG. I, the competition-promoting system of the present
invention comprises an integration of subcomponents, such as for example:
a primary server 100; one or more web servers 110; a login server 120; a
competitor database 30; an Invitation-To-Respond/Response (ITR/Response)
database 40; one or more competition-promoting servers 50; and a plurality
of client machines 160. As shown in FIG. 1, each client machine 1 60
includes a global synchronization unit 175 (GSU), whereas each competition-
promoting server 50 includes a standard GPS receiver 170. As shown in FIG.
1, the global positioning system employed by the competition-enabling
system comprises a plurality of GPS receivers 170 operating in conjunction
with an array of GPS satellites 180 occupying a geodesic orbit in a manner
Page 38 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
well known in the satellite art. All of the computer and database
components of the competition-enabling system are interconnected through
some sort of internetworked computer communications network 190 such as
the Internet.
Overall regulation of the competitive activity enabled by the system
and method of the present invention is carried out by a computer or set of
computers which hereinafter shall be referred to collectively as the "primary
server". The primary server provides certain functionality to the system
including, for example: acting as a source of Invitations-to-Respond a n d
other competition related data; providing a master clock for the system; a n d
performing functions or operations involving data received from multiple
client machines connected to the system.
In the illustrative embodiments, the single primary server 100
communicates indirectly with the client machines 160 through a number of
competition-promoting servers 50. These servers relay Invitations-To-
Respond and other data to the client machines 160, and receive responses
thereto from those client machines. Preliminary processing and sorting of
the client machine responses is performed by the competition-promoting
servers 50, and these pre-processed results are then passed back to the
primary server 100.
Each competitor interacts with the competition-promoting system
through a client machine 160. Each competitor uses a single client machine
to receive and view the Invitations-To-Respond (ITR), as well as to enter a n
d
transmit the responses thereto. The client machine typically consists of a
standard personal computer, augmented by the addition of several software
and hardware components, including a global synchronization unit (GSU)
175 constructed in accordance with the principles of the present invention.
The global synchronization unit 175 is installed in the client machine t o
provide precisely time-stamp client-responses, referred to as client-events,
traceable to internationally standardized reference clocks. The GSU within
each client machine performs decryption operations, generates digitally-
signed time and space stamps of various internal and external events at the
Page 39 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
client machine, and supports timed decryption and presentation of data to
the competitor.
As shown in FIG. l, the last primary computer-based component of the
competition promoting system hereof is the login server 120. The primary
function of the login server 120 is to accept login requests from each
competitor's client machine and assign an appropriate competition-
promoting server to that client machine. The login server 120 also provides
a single, well-known address for each client machine to use to contact t h a
assigned competition-promoting server when initializing a session in the
competitive activity. The login server also serves to intelligently distribute
the processing and communications load among the competition-promoting
servers.
As shown in FIG. 1, two database systems are used by the competition-
promoting system of the present invention. The first database is the
competitor database 30 which records information about each competitor,
such as his or her identity, preferences, contact information, and any other
data deemed necessary for the proper operation of the competition. The
second database is the Invitation-to-Respond/Response database 40 which
stores or generates Invitations-To-Respond (ITRs) appropriate to the
particular competition being promoted, and transmits those ITR's to the
client machine, through the other servers in the system. The ITR/Response
database 40 may also contain canonical responses for comparison with the
actual responses generated by the competitors, as well as other information
necessary for t he conducting of the competition.
The final component of system shown in FIG. 1 which deserves
mention is the communications network 190. In general, the
communications supported by the communications network 190 could b a
carried out using a variety of different communications methods. In
general, each computer or device in the system will establish a connection o r
connections to one or more of the other computers through the network
190. In practice, these connections will be "virtual" connections through a
general network such as the Internet, rather than as a direct point-to-point
physical connection. In the illustrative embodiments disclosed herein, the
Page 40 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/IJS00/05093
communications network 190 is a packet-switched data communications
network running the popular Transmission Control Protocol/Internet
Protocol (TCP/IP). Thus each server computer connected to t h a
communications network 190 will have a statically assigned IP address, while
each client machine connected thereto will have either a statically o r
dynamically assigned IP address in a manner welt known in the art.
Contest-Enablinb~ystem And Method Of The Present Invention
Referring to FIGS. 2 through 4G, a contest-supporting (i.e. contest-
enabling) system and method will now be described in accordance with the
principles of the present invention.
In this particular embodiment of the present invention, the primary
goal of the Internet-based system and method is to enable thousands a n d
even millions of contestants to participate in a mufti-player internetworked
problem-solving contest that is regulated in a secure and fundamentally fair
manner. In general, the contest will involve a mass population of players,
or contestants who simultaneously attempt to solve some problem or set of
problems in a time-constrained manner. The contestants are evaluated a n d
ranked according to the solution provided as well as the time taken to
submit the solution. Each contestant in the contest will interface to the
contest process through a client machine capable of displaying images, text,
video, play audio streams in a globally time-synchronized manner, or is
otherwise provided with some other means for presenting a question o r
problem to the contestant in a like manner in accordance with the principles
of the present invention. The question or problems thus presented to each
competitor will be referred to as a query, although, in a more general sense
of the present invention, can be understood as an Invitation-To-Respond
(ITR), as discussed hereinabove. Each client machine also accepts an answer
or solution from the contestant as response to the query previously
presented. The contestant's answer or solution will be referred to as the
response, as in the general sense of the present invention. Therefore, each
client machine in the contest-supporting system hereof is a device that
Page 41 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
presents (e.g. visually and/or audibly displays) queries and accepts
responses from one registered contestant who is participating in the contest.
The contest-promoting system of the present invention also includes a
means for controlling and measuring certain time-based elements of the
contest (i.e. competition). For example, such elements include the ability to
specify the precise instant at which a query is presented to the contestants
on all or some subset of the client machines. Hereinafter, this instant of
time shall be referred to as the "start-time", analogous to the "start-line"
in a
race, which is the same for each contestant in accordance with the principles
of the present invention. In addition, the contest-promoting system of the
present invention also includes means for precisely determining the length
of time between the start-time and the instant each contestant submits its
response which, hereinafter, shall be referred to as the "finish-time"
analogous to the "finish-line" in the race. Hereinafter, this length of time,
measured between the start-time and the finish-time, shall be referred to as
the "response-time" of the particular contestant or competitor.
The contest-promoting system and method of the present invention
enables the simultaneous presentation of queries (i.e. ITRs) to each a n d
every client machine registered to compete in the contest at hand. Unlike
the prior art method of using the receipt of a query decryption key to
trigger the display process at each client machine, as disclosed in US Patent
No. 5,695,400, the present invention teaches the use of a local clock to
determine the exact instant to display the query (i.e. ITR) to the contestant.
In the illustrative embodiment of the present invention, the local clock is
contained in an embedded or peripheral device known as the global
synchronization unit (GSU) 175. The GSU at each client machine
incorporates a global positioning system (GPS) receiver to provide a precise
timing reference that is accurate to within 1 microsecond of international
atomic clock standard time. The GSU can be programmed to decode a n d
present the query (i.e. ITR) in a secure manner at the precise moment
desired. In an alternative embodiment of the present invention, a similar
functionality can be provided at each client machine, but at lower precision
and security levels by using a standard timer, counter, or clock on the client
Page 42 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
machine. In this alternative, less accurate timing method, the local clock is
characterized, or analyzed to determine the functional relationship between
the local clock time and the global time as determined by a single master
clock for the entire contest system. Using this function, the global time may
be determined from the local clock reading. In addition, the display update
cycle on each client machine is skewed so that a display update completes
exactly at the desired "start time" which is determined to be the same for
each every contestant, regardless of their location on the planet.
Characterization of the local clock may be performed using an accurate
clock (perhaps GPS-based) connected to the client machine, or it may b a
done using security enhanced versions of the methods and algorithms used
in NTP, the network time protocol.
The contest-promoting system and method of the present invention
also provides extensive security measures to detect and discourage cheating
by dishonest players. Security is crucial in large contests involving
significant rewards for winners. Security for the system is provided through
the use of encryption of the majority of messages between the various
computers in the system, as well as by monitoring and logging the contest-
related activities of participating client machines. Additional details
regarding this aspect of the system will be described hereinafter.
Having provided an overview on the contest-promoting system of the
present invention, it is appropriate to now describe in greater detail the
structure and function of the components of this system.
As shown in FIG. 2, the contest-promoting system of the illustrative
embodiment comprises an integration of components, namely: a primary
server 100; one or more web servers 110; a login server .120; a contestant
database 1 30; a query/answer database 140; one or more game servers 150;
and a plurality of client machines 160. As shown in FIG. 2, each client
machine is equipped with a global synchronization unit 175 (GSU), whereas
the primary server 100 and each game server I 5 0 is equipped with a
standard GPS receiver 170. As shown, the contest-promoting system of the
illustrative embodiment employs a global positioning system comprising GPS
receivers 170 operating in conjunction with an array of GPS satellites 1 $ 0
Page 43 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
occupying a geodesic orbit in a manner well known in the satellite art. All of
the computer and database components of the system are interconnected
through some sort of communications network 190 such as the Internet,
supporting a networking protocol such as TCP/IP.
Overall regulation of the contest activity enabled by the system a n d
method of the present invention is carried out by a computer or set of
computers which hereinafter shall be referred to collectively as the "primary
server". The primary server provides certain functionalities to the system
including, for example: acting as a source of queries and their correct
answers; providing a master clock for the system; determining the overall
ranking of contestants; selecting the winner of the contest.; and informing
the contestants and possibly the general public of the identity of the wining
contestant.
As shown in FIG. 2G, the primary server 100 in the contest-promoting
system comprises a number of software and hardware components. As
shown in FIG. 2G, the structure of the primary server 100 is described using
the layered structure of a standard general purpose computer, wherein t h a
hardware components are shown at the lowest level, with successive layers
of software functionality disposed above them. Each 1 ayer of components
utilizes and builds upon the services and capabilities of the lower layers,
most often only directly interfacing with the layer immediately below it. In
the primary server 100, the low level hardware includes a GPS receiver 170,
and high precision clock and timing hardware 200 synchronized to a global
time reference using the GPS receiver. In addition, the high performance
network interface hardware 210 is used to connect the primary server 100
to the communications network 190. These hardware components are i n
addition to the standard I/O and other hardware 220 typically provided o n
a high-end network server, such as the SUN EnterpriseTM server running the
SolarisTM platform, by Sun Microsystems, Inc. of Palo Alto, California. Above
the hardware level are standard and customized device drivers 230 that
control and communicate directly with the hardware. The device drivers are
used by the operating system 240 and higher-level applications so that
direct hardware programming is not necessary. At the top level of FIG. 2G
Page 44 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
are two contest-related applications. The first application is the primary
server daemon 250. This piece of software manages the sequence of
operations for the contest as a whole, as well as managing the
communication of queries, responses, and other information with the game
servers. The other top level application running on the primary server 100
is the contest management interface 260. This application provides the user
interface to the human operators of the contest. This software allows t h a
operators to enter new questions and answers in to the Query/Answer
Database 140, to set up and schedule contests, to set prize levels, to specify
qualifications for entering the contests, to collect and view usage
statistics,
and to monitor ongoing contests. The contest management interface
application communicates with the primary server daemon 250 i n
performing most of its tasks.
As illustrated in FIG. 2A, the single primary server 100 communicates
indirectly with the client machines 160 through a number of game servers
150. These game servers relay queries to the client machines, and receive
responses from those client machines. Preliminary judging and sorting of
the responses is performed by the game servers 170, and these pre-
processed results are then passed back to the primary server 100.
As shown in FIG. 2E, the game server 150 has a layered architecture
similar to the primary server 100, comprising: hardware components
including a GPS receiver 170; high precision timing hardware 200; a high
performance network interface 210; in addition to the standard hardware
components 220. These hardware components are controlled through t h a
use of a set of standard and customized device drivers 230. Many of these
device drivers are provided by the hardware manufacturers, while some are
specifically written or modified to handle the precise timing operations
needed by the contest-promoting system of the present invention. The
major application running on the game servers is the game server daemon
270. The game server daemon 270 receives, processes and responds to data
from the primary server 100, the login server 120, and from its client
machines 160.
Page 45 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
Each contestant interacts with the contest system through a client
machine 160. Each contestant uses a single client machine 160 to receive
and view the contest queries as well as to enter and transmit their responses
containing their answers to those queries. In the illustrative embodiment,
each client machine may be realized as a standard personal computer,
augmented by the addition of several software and hardware components.
In FIG. 2D3, the basic components of each client machine 160 is shown. As
shown in FIG. 2D3, each client machine 160 would initially comprise the
standard hardware and software components typically associated with any
personal computer. These components would include the operating system
240, standard device drivers 280, clock or timer hardware 290, input
hardware, such as the keyboard, mouse, a microphone, etc. 300, output
hardware, such as a video display and/or speakers 310. In addition to this
hardware, each client machine would also require some sort of "web
IS browser" 320 such as Netscape Navigator or Microsoft's Internet Explorer.
This web browser is used to contact the "Contest WWW Site", to register with
the contest system, and to download the other software components
therefrom. These other components might include a contest plug-in 3 3 0
that would enhance the user's experience at the contest web site, in addition
to the contest client 340, which is the primary interface between the
contestant and the contest system. Each contest client receives and presents
queries to the human contestant, as well as accepting the contestant's
responses and sending them to the servers. Each contest client
communicates through contest hooks and drivers 350 with the underlying
input, output, and timing hardware, in order to handle the timing aspects of
the game (i.e. contest). The hooks and drivers 350 are responsible for clock
and display synchronization, as well as for generating time-stamps
associated with various events during the game. The global synchronization
unit 175 is installed in the client machine to provide precisely timed events,
traceable to internationally standardized reference clocks. The GSU 1 7 5
performs decryption operations, time-stamping of client-machine/contestant
responses, and supports timed query presentation.
Page 46 of 238
CA 02363940 2001-08-24 pCT~S00/05093
WO 00/50974
When not actually playing a game, the contestant interacts with the
contest web site through a web browser. The contest web site is "served" t o
that browser from one or more web servers 110. The web servers handle
advertising, support, registration, downloading, and other similar tasks. As
shown in FIG. 2F, the web server 110 comprises a number of major
components comprising a standard I/O 220; a high performance network
interface 210; standard device drivers 280; and the operating system 240.
These components cooperate to support the operation of the web server
software 360. The web server software 360 consists of an HTTP daemon,
along with various scripts and utility programs used to handle
user/contestant registration and to perform contest web site updates as new
contests or results information become available.
As shown in FIG. 2, the last primary computer-based component of the
contest-promoting system is the login server 120. The function of the login
server 120 is to accept login requests from each contestant's client machine,
and assign an appropriate game server to that client. The login server 120
provides a single, well-known address for the client machines to contact
when initializing a new game. The login server also serves to intelligently
distribute the processing and communications load among the game servers.
As shown in FIG. 2H, the login server 120 comprises a number of major
components, namely: a standard I/O 220; a high performance network
interface 210; standard device drivers 280; and the operating system 240.
These components cooperate to support the operation of the login server
daemon 370, which handles the login requests and server assignment
functionality within the contest-promoting system.
As shown in FIG. 2, the contest-promoting system of the illustrative
embodi ment employs two database systems. The first database system is t h a
contestant database 130. The contestant database records information
about the user, such as their identity, preferences, contact information, a n
d
contest results and standing. The second database is the query/answer
database 140. The query/answer database stores the problems and
solutions for the game contests. These problems and solutions are originally
created and stored in the database by the contest operators. They are then
Page 47 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
accessed and distributed by the primary server 100 to the contestant's client
machines 160 during the contest.
As shown in FIG. 2, the final component contest-promoting system
that deserves mention is the communications network 190. In general,
communications over the network could be carried out using a variety of
different communications methods. In general, each computer or device will
establish a connection or connections to one or more of the other computers
through the network 190. In practice, these connections will be "virtual"
connections through a general network such as the Internet, rather than as a
direct point-to-point physical connection. The topography of the primary
virtual connections between the various contest system components are
depicted in FIGS. 2A, 2B, and 2C, while the information flows transmitted
through those connections are detailed in FIGS. 3A through 3G.
Virtual Communication Links And Hierarchies In The Contest Promoting
~vstem Of The Present Invention
Typical games implemented using the contest-promoting system of
the present invention could involve thousands or even millions of
contestants distributed over and possibly above the planet Earth. Because of
the huge bandwidth required to handle transmission of the queries a n d
responses from all of the client machines employed in the contest, the
system of the present invention utilizes a hierarchy of servers illustrated i
n
FIG. 2A. As shown in FIG. 2A, the primary server 100 acts as the root node
of a tree-type interconnection of computers. The "leaves" of t he tree
structure are formed by the client machines 160 connected to the system.
Between these devices lies a layer of game servers 150 which act a s
intermediaries (or "branch structures") between the primary server 100 a n d
the client machines 160. Each game server communicates directly with the
primary server 100 and with a set of client machines associated with that
particular game server 150. In a large contest involving many thousands of
contestants, there might be hundreds or thousands of game servers
deployed in the system, each handling hundreds or thousands of client
machines. These game servers could be distributed over the country or over
Page 48 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
the world, with each game server handling client machines in a certain
region, thereby greatly reducing the communications loading on central
"trunk" network links. As shown in FIG. 2A, there are also communication
links between the primary server 100 and the contestant database 130 a n d
the query/answer database 140. In this illustrative embodiment of the
contest-promoting system hereof, each game server 150, client machine 160,
and primary server 100 is equipped with a GPS receiver that is used to
synchronize the local clock and the display of each client machine
participating in the contest-promoting system.
Network traffic bandwidth associated with the higher level servers i n
the hierarchical configuration shown in FIG. 2 is reduced by performing
some data processing on the game servers 150 themselves, rather than
performing all computations on the primary server 100. For example, if a
single winning contest, or a certain number (e.g. n) of winners are to b a
chosen in each contest, then each game server 150 can compare each
response it receives and only transmit the "n" best responses onto the next
higher level server. Also, management of time synchronized messaging with
each client machine can be carried out by the game server 150 associated
with that client machine, rather than by the primary server 100. Such
techniques will serve to reduce the loading on the primary server 100. If the
performance of all contestants is to be rated and sorted, then each game
server 150 can sort the contestants playing on the client machines
connected to that game server 150. Thereafter, these sorted lists of client
machines can be easily and efficiently sorted by the primary server 100
using an insertion sort or method that takes advantage of the pre-sorted
groups of contestants.
It is recognized that real world contests involve much more than the
actual queries and responses that make up the core elements of the game.
Many other steps and processes are necessary or desirable both from the
point of view of the contestant, as well as from the point of view of the
person or company running the contest. While the purpose of the contest
from the point of view of the contestant is to have fun, to learn, or to win
prizes, the purpose of the contest from the point of view of the contest
Page 49 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
operator may include other goals. For example, such goals may include:
selling products; advertising; collecting marketing information or other
statistical information; promoting their company or institution; educating a
group of people; and so on. The basic query, response, and judging
activities constitute the contest itself, while the other activities referred
to
above will be referred to as the non-contest activities. These non-contest
activities can be divided into two major categories; those activities that
directly support the operation of the contest; and those activities that are
ancillary to the contest.
Non-contest activities that directly support the operation of the
contest include one-time or rarely performed activities, as well as activities
that must be performed immediately before or after each contest. One-time
activities include contestant registration, system testing and qualification,
and downloading plugins or other client-machine based components. Those
periodic activities that must be performed before or after each contest
include login, server assignment, and viewing contest results.
Registration is used to collect and record information about each
contestant desiring to participate in a scheduled contest (e.g. listed on the
Contest WWW Site) . This information can include the name, address,
telephone number(s), E-mail a d dress, and any other information required o r
desired of each contestant by the contest organizer and/or sponsor(s). The
contestant chooses or is assigned an identification number (or "handle")
and a password, in order to protect their access to the contest process. At
registration time, a number of tests may be performed on the contestant's
system. These tests could be used to qualify the client machine to be used
by the contestant, by determining whether it meets certain requirements
necessary to successfully participate in the contest. In addition, data
produced as a result of these tests may be recorded, either on the client
machine or on one of the servers. This data could be used, in conjunction
with other information collected during and/or after the contest, to help
determine whether the contestant participated fairly in the competition.
Another activity which is also performed before the contest is downloading
any programs, installable components, and plugins, as well as any data
Page 50 of 238
CA 02363940 2001-08-24 pCT~S00/05093
WO 00/50974
required by them. These programs, components, and plugins, along with a
browser or other programs already present on the contestants system will b a
used to present advertising and other information and content to the
contestant, as well as to perform all operations of t he contest on the client
machine.
As shown in FIG. 2B, a number of system components are used t o
distribute and present HTML (or XML) encoded documents (with or without
Java or Active-X applets) and associated web content to the contestants. As
shown, such system components include a plurality of mirrored web servers
1 10, wherein each web server 1 10 is connected to a contestant database I 3 0
and each serves a set of Web-enabled client machines 160 equipped with
web browsers 320. A master web server 110 stores and provides the web
site content to a set of client machines, utilizing HTTP, FTP, and other
standard Internet protocols. In order to avoid overloading a single web
server with many thousands or millions of connections, a number of mirror
web servers 110 are used. The master web server transmits copies of t h a
entire contest web site to the mirror web servers, which then are each able
to serve a large number of client machines 160. As shown, each of the web
servers I10 shares a common networked contestant database 130 which
contains registration and other information. In addition to providing the
contest "web site", the web servers also distribute the contest client
software
(340) using the HTTP or F'TP protocols. Before downloading contest client
software, each contestant/user is required to register on the web server 1 10.
Registration involves filling out a web-based (e.g. HTML-encoded or XML-
encoded) form containing the necessary personal and client machine
information and submitting that form to the web server. Client machine
qualification may be tested using either browser plug-ins or stand alone test
programs downloaded from the web server.
In an extremely large mufti-player contest, it is clear that multiple
game servers will be necessary to h andle communication with all the client
machines involved during the contest. When a client machine initially
connects to the contest-promoting system of the present invention, it will b a
done through a login server 120 located at some well-known Internet
Page 51 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
address. The login server will choose which game server should be utilized
by this contestant's client machine. This choice will be based on a variety of
information, including the location of the client machine, the characteristics
of the connection to the client machine, and the number and characteristics
of the connections already assigned, or anticipated to be assigned, to the
game servers in the system. Load balancing algorithms will be used t o
distribute the connections to the game servers, thereby minimizing the
possibility of overwhelming any one server, and insuring consistent
connections for all the game clients.
FIG. 2C depicts the connections between the client machines 160,
login server 120, and the contestant database 130. Except in extremely
large configurations, it is probable that only a single login server would b a
needed, and all client machines would receive their game server assignments
from that server. If a single login server is insufficient, then a
hierarchical
configuration similar to the one shown for the game servers in FIG. 2B could
be used. As shown in FIG. 2C, each client machine is running the contest
client 340, and it is this software that the contestant interfaces with when
logging in to through the login server. In order to check passwords and the
status of the contestant, the login server accesses the contestant database
130.
Global Synchronization Unit IGSUI Of The Present Invention
While an optional component of the contest-promoting system
described above, the global synchronization unit (GSU) 175, when used i n
each client machine 160, will greatly enhance the precision and security of
the overall system. In general, the GSU 175 is a standalone system with
important capabilities and many potential applications b eyond the contest-
promoting system of the present invention herein disclosed. The basic
purpose of the GSU 175 is to either (i) perform actions in response t o
precise time and space conditions, or (ii) generate secure and verifiable time
and space-stamped records of client-machine inputs and any other events
captured by devices attached or otherwise connected to the GSU of the
present invention.
Page 52 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
In general, the GSU 175 has the ability to trigger or generate an event
at a specific time instant or over a specific time interval. This event could
b a
the display of an image, the start of a video or audio clip, the decryption of
data, or the running of a program on the host machine. One purpose of this
capability is to allow the synchronization of events on multiple client
machines, each of which is equipped with a GSU. In situations requiring
high security, data used in the generation of the event may be downloaded
into the GSU in an encrypted form. This data is then decrypted and t h a
event-triggered by the GSU at the precise instant desired.
In addition to triggering events based on time or time interval
conditions, the GSU of the present invention can also trigger events at a
client machine based on their location or velocity of the GSU, or on any
combination of time, space, and velocity conditions thereof. In all cases, the
GSU is configured through the host computer interface to perform a specific
action when those conditions are satisfied.
Another major functionality of the GSU is to perform time and space
stamping of external events. These events could be as simple as a
communication line being asserted on the GSU input, or as complex as a set
of patterns of inputs on a number of different inputs. The trigger for a time
and space stamping action could constrained by timing, location, a n d
velocity conditions of the GSU. In fact, the space and time stamp generation
could even be triggered solely by internal information, for example,
generating a time/space stamp upon the arrival of the GSU at a specific
location, or at a predetermined time. In accordance with the principles of
the present invention, a time/space stamp generated by the GSU 1 7 5
includes the location, exact time (e.g. to within +/- 1 microsecond), a n d
security information including, but not limited to, a hash or CRC (cyclic
redundancy check) value derived from the input data associated with the
event. The hash value will allow the data to be verified in the future t o
insured that it has not been altered since the time/space stamp was
generated. The time/space stamp also will have an associated CRC value o r
digital signature to insure that the time/space stamp itself is genuine a n d
unmodified.
Page 53 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
The GSU of the present invention also provides the ability to
authenticate digitally signed time and space stamps that it has previously
generated, and to verify that data associated with that time and space stamp
has not been modified since the stamp was created.
Applications of the GSU include, by are certainly not limited to:
managing and judging geographically distributed race-based (i.e. time-
constrained) contests; notarization of data; time-space stamping of executed
legal documents (e.g. contracts, property transactions, patent applications,
security interests, etc.) and transmitting the same to a centralized server
for
public recordation and/or filing in accordance with governmental or legal
regulations; controlling, distributing, and authorization of lottery tickets
and
the like; and any other task in which precise, secure, and verifiable timing
of
events and triggering of timed events are required.
The Structure And Function Of The Basic GSU Of The Present Invention
IS
FIG. 2D1 depicts one context of operation for a basic GSU. This figure
shows a client machine 160 with attached input and output devices. This
client machine is connected (using a direct hardware connection or infrared
or radio frequency link) to a global synchronization unit (GSU) 175. In
addition, the client machine 160 is connected through the Internet or other
communication means 190 to a server equipped with a GPS Clock 170. In
this context, the server could send an encrypted request to the client
machine 160 to perform an action (for example displaying an image) at a
specific time, as required in the contest-promoting system described
hereinabove. This encrypted request is then loaded into the GSU 175 where
it is decrypted and the desired event time recorded. At, or at some
predetermined time before, the desired display time, the GSU 175 decrypts
the image to be displayed and downloads the decrypted image back onto the
client machine 160 for display. This method prevents access by the client
machine or its operator to the image data before the allotted time.
An alternative function performed by the GSU in the context of FIG.
2D1 would be the ability to time and space stamp an input or event
captured or generated by the client machine. In this case, data associated
Page 54 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
with the client input or client event data would be uploaded to the GSU 175.
The GSU uses digital signature techniques to create (i.e. compute) a digital
signature for the set of data comprising: the client input event data; and the
time and location data of the GSU at the time of data upload. Notably, t h a
time of the client input or client event will be expressed in terms of a
globally time-synchronized time measure, whereas the location of the client
input or client event would be expressed in terms of a globally referenced
space/location measure. The set of data and the computed digital signature
applied thereto produces a digitally signed data package. The digitally
signed data package is then be sent over the network to a server to serve a s
a record of the event taking place. At a later time, this record could be used
to prove that the data existed at or before the time recorded in the time-
stamp, and the location of the GSU when the record was generated.
As shown in FIG. 2D2, a basic global synchronization unit (GSU) 1 7 5
comprises several required and optional components. The required
components include a GPS Receiver 700 and an associated antenna 730. The
GPS receiver 700 is connected to a central processor 750 that can store
events and desired trigger time/locations, perform encryption and
decryption functions, and calculate digital signatures verifying the
authenticity of data including, for example, time and space information
provided by the GPS receiver 700. Access to the central processor 750 is
provided through a host computer interface 720, which could utilize
standard or proprietary hardware and communication protocols to provide
such access. Standard interface specifications that might be utilized therein
include bus-based connections such as ISA, SCSI, or PCI; port-based
connections such as USB, RS232, or PCMCIA; or other communication
methods such as infrared or radio frequency links. In addition to these core
components, the GSU of the present invention may also contain a number of
optional components such as a high-frequency GPS disciplined clock 710,
interfaced with the central processor 750, for providing much higher
resolution time-stamps; a stand-alone encryption and decryption module
740, interfaced with the central processor 750, for providing enhanced
speed and security; and/or non-volatile memory 760, interfaced with the
Page 55 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
central processor 750, for recording time-stamps for later comparison and
verification purposes. As discussed above, FIG. 2D3 shows the GSU in the
context of a client machine for use in a time-constrained competition against
others, as in the case of a contest, or against oneself under the constraint
of
a clock as the case of testing, or against changing supply and demand
conditions in a market as in the case of real-time securities, commodities, o
r
currency trading, or other forms of real-time and non-real-time auctio n
processes.
The Structure And Function Of The Enhanced GSU Of The Present Invention
FIG. 2D4 depicts one context of operation for an enhanced version of
the GSU. As shown therein, a client machine 160 is connected to the GSU
177 using either a direct hardware connection or infrared or radio
frequency link known in the art. Instead of being directly connected to t h a
client machine, the input and output hardware for the client machine is
routed through the GSU 177. As shown, the client machine 160 is connected
through the Internet or other communication means to an information
server equipped with a GPS Clock 170. In this context, the server could send
an encrypted request to the client machine 160 to perform an action (for
example displaying an image) at a specific instant of time. This encrypted
request is then loaded into the GSU 177 where it is decrypted and the
desired event time recorded. At the desired display time, the GSU 177 can
directly override the video output from the client machine 160, replacing it
or overlaying it with the decrypted image. The enhanced GSU 177, b y
directly controlling the client machine display, can provide even more
precise output event timing. In addition, security is enhanced because the
decrypted image data is never actually sent to the client machine 177.
An alternative function which can be performed by the enhanced GSU
177 of the present invention, in the context of FIG. 2D4, would be the ability
to time and space stamp an input or event captured or generated by input
devices to the GSU 177 without the delays and security risks incurred b y
first passing the data inputs to the client machine 160. Thus, the enhanced
GSU 177 provides much higher precision of data event timing at a client
Page 56 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
machine because the data inputs are fed directly through, and directly
monitored by, the GSU 177.
As shown in FIG. 2D5, the enhanced GSU 177 of the present invention
comprises several required and optional components. As shown therein the
required components include a GPS Receiver 700 and an associated antenna
730. The GPS receiver 700 is connected to a central processor 750 that can
store events and desired trigger time/locations, perform encryption and
decryption functions, and calculate digital signatures verifying the
authenticity of data including, for example, time and space information
provided by the GPS receiver 700. Access to the central processor 750 is
provided through a host computer interface 720, which could utilize
standard or proprietary hardware and communication protocols to provide
such access. Standard interface specifications that might be utilized include
bus-based connections such as ISA, SCSI, or PCI; port-based connections such
as USB, RS232, or PCMCIA; or other communication methods such as
infrared or radio frequency links.
Unlike the basic GSU 175 described above, the enhanced GSU 177 also
includes at least one of the following two components: an input device
passthrough monitoring module 770; and an output passthrough and signal
generation module 780, as shown in FIG. 2D5.
The function of the input device passthrough monitoring (IPM)
module 770 is to provide a "passthrough" (e.g. input and output port) for a
specific input device or class of input devices. The IPM module 770 will
monitor the data passing through, and generate digital signatures or CRC
values of the data when requested by the central processing unit 750. In
addition, the IPM module 770 could be programmed by the central
processing unit 750 to trigger the acquisition of a time/space stamp or other
event upon the receipt of a specific input or pattern of input of data into t
h a
IPM module 770. The IPM module 770 could be manufactured to interface
with any type of input device, including a mouse, keyboard, microphone,
video camera, scanner, barcode reader, pressure tablet, a voice recognition
system, or any other analog or digital data input device.
Page 57 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
The function of the output passthrough and signal generation (OPSG)
_ module 789 is to provide a passthrough (e.g. input and output port) for a
specific output device or class of output devices. The OPSG module 780 will
have the ability to block signals from the host computer passing through the
GSU 177, and to insert or overlay its own signals for presentation on t h a
output device. For example, the OPSG module 780 could be used for the
video display device. The host computer video output would be connected
to the GSU 177, and another cable connected from the GSU 177 to the
display device. The GSU could then "take over" the display device a n d
display its own images or videos on the display device. Typically this
capability would be activated in response to a timed event, in order to
simultaneously display output on multiple GSU-equipped client machines
(e.g. e.g. operating within a competition-supporting system of the present
invention). OPSG modules 780 could be created to interface with a number
of different output devices, including video displays, speakers, or printers.
In addition to these required core components, the enhanced GSU 1 77
may also contain a number of optional components such as, for example: a
high-frequency GPS disciplined clock 710, interfaced with the central
processor 750, for providing much higher resolution time-stamps; a stand-
?0 alone encryption and decryption module 740, interfaced with the central
processor 750, for providing enhanced speed and security; and/or non-
volatile memory 760, interfaced with central processor 780, for recording
time-stamps for later comparison and verification purposes.
v v
Of The Present Invention
In FIG. 4, the high level operations performed by the contest-
promoting system of FIG. 2 are described. Collectively, these operations
enable a contestant to compete many other contestants, in a secure a n d
fundamentally fair time-constrained contest, wherein each contestant is
provided with a common "start-time" regardless of the location of his or her
client machine on the infrastructure of the Internet, for the type of
interconnection provided thereto (e.g. POTS line, ISDN, frame-relay or T 1
Page 58 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
line). The flowchart of FIG. 4 sets forth the seven basic steps or operations
carried out by the contest-promoting system of FIG. 2. These operations are
indicated at Blocks A through G in FIG. 2. As a overview of the method
hereof, these operations will be first briefly described below, and
thereafter,
each operation will be described in greater detail with reference to FIGS. 4A
through 3G, respectively.
As indicated at Block A in FIG. 4, the first major operation carried out
by the contest-promoting system hereof involves registration of each user as
a contestant, and the creation of a globally-synchronized and secure
networked client machine through which the contestant may participate in a
time-constrained question and answer type contest, while competing against
large numbers of other contestants for potentially high stakes.
As indicated at Block B in FIG. 4, the second major operation carried
out by the contest-promoting system hereof involves the contestant using
the contest client software on the client machine to log on to the game
server 150, and the establish a communication channel therewith.
As indicated at Block C in FIG. 4, the third major operation carried out
by the contest-promoting system hereof involves transmitting the query a n d
start-time from the primary server to the client machine.
As indicated at Block D in FIG. 4, the fourth major operation carried
out by the contest-promoting system hereof involves characterization of the
client machine's local clock with the master clock on the primary server, a n
d
the synchronization of the client machine display update cycle with t h a
desired start-time for the contest.
As indicated at Block E in FIG. 4, the fifth major operation carried out
by the contest-promoting system hereof involves presenting the query to the
contestant precisely at the start-time, as determined by a local clock that is
characterized with respect to a global master clock located on the primary
server.
As indicated at Block F in FIG. 4, the sixth major operation carried out
by the contest-promoting system hereof involves accepting the contestants
response, attaching a time-stamp to that response, and transmitting the
response and time-stamp to the servers.
Page 59 of 238
CA 02363940 2001-08-24
WO UO/50974 PCT/US00/05093
As indicated at Block G in FIG. 4, the seventh major operation carried
out by the contest-promoting system hereof involves judging the responses
from all the contestants and determining the winner. In addition, each
contestants standing or rank is d etermined for the contest.
T~Pra;ls Relating The Operation Specified In Block A In Fig,. 4
In FIG. 4A, the suboperations are shown for carrying out the method
of registering and downloading of contest software indicated at Block A i n
FIG. 4 .
As indicated at Block A in FIG. 4A, a potential contestant browses t h a
contest WWW site ("the contest web site"). In general, the contest web site
will include information about the contest, including descriptions of the
contest client software, contestant qualifications, contest regulations,
instructions on how to play, information about different varieties of the
contest, lists of prizes and awards offered, advertising, lists of contest
sponsors, lists of previous winners, and the standings or ranks of other
contestants. FIG. 3A indicates the flow of information between the user's
client machine 160 and the web server 110 containing HTML (and/or XML)
encoded documents comprising the contest web site. In this figure, as well
as in FIGS. 3B through 3G, the large a crows extending from one computer t o
another represent a message or group of messages containing related
information. Messages indicated by 400 in FIG. 3A contain the web content
being delivered to the client machine 160 from the web server 110.
In addition to the informational content of the contest web site,
provision will also be made to allow the user to register to become a
contestant. As indicated at Block B in Fig. 4A, upon deciding to enter t h a
contest, the user fills out an on-line registration form, using either
standard
HTML (or XML) forms, or forms generated by Java or Active-X applets, or b y
a CGI script in a manner well known in the art. During the registration
process indicated at Block B in Fig. 4A, there may also be a qualification
procedure, wherein the user performs some test either of their own abilities
and/or of the capabilities of their computing system. These tests could b a
administered through forms along with the registration process, or could
Page 60 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
involve the user downloading and r a n ning customized plug-in modules o r
_ stand-alone applications on his or computing system. Message 405 in FIG.
3A contains registration information being transmitted from the client
machine 160 to the web server 110. This information is encrypted using
standard secure HTTP methods known in the art. ,
As indicated at Block C of FIG. 4A, the web server 110 creates a record
in the contestant database 130 for this user upon completing receipt of the
registration information therefrom. The registration information is stored in
this record, establishing the user as a contestant permitted to participate i
n
one or more on-line mufti-player contests to be promoted (i.e. enabled) the
system of the present invention.
As indicated at Block D of FIG. 4A, a contestant ID is then assigned t o
the new contestant. This ID code uniquely identifies the contestant for all
time, unlike a username, password, e-mail address or other information that
may be changed in the future by this player/contestant. The contestant ID
is recorded in the contestant database 130, and is used internally by the
contest software of the system.
As indicated at Block E in FIG. 4A, the contestant is assigned a
username and a temporary password for use when playing the contest. The
username may be assigned by the system, or it may be chosen by the user as
a part of the registration procedure. The password is generated randomly,
and will most likely be changed by the contestant after logging into the
system the first time. The username and password are stored in the
contestant database 130.
As indicated at Block F in FIG. 4A, an e-mail message containing the
username and temporary password are sent to the contestant. This e-mail
message from the web-server 110 to the client machine 160 is depicted a s
Message 410 in the data flow process shown in FIG. 3A.
As indicated at Block G in FIG. 4A, the contestant logs onto a secure,
members-only area of the contest web-site using his or her username and
temporary password. This area allows the contestant to view and update his
or her personal information (e.g. username, password, e-mail address,
residence address and telephone numbers, and so on).
Page 61 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
As indicated at Block H in FIG. 4A, the contestant downloads the
contest software from the web server 110 to his or her client machine 160,
i.e. from the members-only area of the contest web site. This contest
software download is accomplished using HTTP, FTP, or other file transfer
protocol, as represented by Message 415 shown in the information flow
proceeds of FIG. 3A.
As indicated at Block I of FIG. 4A, the contestant installs the client
software on his or her machine. This procedure will involve either executing
the downloaded installation file, or initially decompressing the downloaded
file and then executing a setup application contained within the compressed
archive. The installation procedure will install the contest client 340
application, as well as one or more customized device drivers 350 required
by the contestant's client machine. The device drivers will be used to
communicate directly with the local clock and any timing hardware (GPS,
etc) used in the client machine. Upon successful installation of the client
software, the contestant's computing system will become a fully enabled
"client machine", and thus ready to participate in a contained competition
in accordance with the principles of the present invention.
Details Relating The Operation Specified In Block B In Fig' 4
In FIG. 4B, the suboperations are shown for carrying out the method
of logging a contestant onto the game server I50 indicated at Block B in FIG.
4. In general, this procedure involves a number of "behind-the-scenes"
activities by the various server systems, in addition to the actual log o n
process. Initially, all servers and clients in the system are provided with
the
address of the login server 120 as well as with the login server's encryption
"public key", which is used to send secure message to the login server.
As indicated at Block A in FIG. 4B, the primary server 100 transmits a
list of all the participating game servers to the login server 120. This
message, shown as 420 in FIG. 3B, is encrypted using the login server's
public key. The login server 120 decrypts and stores this message using its
private key.
Page 62 of 238
CA 02363940 2001-08-24
WO DO/50974 PCT/US00/05093
As indicated at Block B in FIG. 4B, the login server sends a status
request message to each of the game servers. In FIG. 3C, this status request
message is indicated by Message 425.
As indicated at Block C in FIG. 4B, each game server 150 sends a reply
in response to the status request message (i.e. Message 425), containing
information about the status of the game server, including current loading,
indications of maximum server capacity, geographical area of coverage, a n d
other information. In addition, this reply contains the game server's public
encryption key. The entire reply, indicated by Message 430 in FIG. 3C, is
IO encrypted using the login server's public key. Status request message 4 2 5
and response message 430 occur during the initialization of the contest
system, as well as periodically throughout the operation of each contest
enabled by the system hereof.
As indicated at Block D in FIG. 4B, the contestant must log on to the
system using the contest client application when the contestant decides t o
participate in a particular contest. During this stage of the process, the
contest client machine 160 requests a username and password from the
contestant for the convenience of the contestant. This username a n d
password may be stored locally on the client machine to avoid t h a
contestant having to re-enter the username and/or password every time h a
or she plays a game or participates in a contest.
As indicated at Block E in FIG. 4B, the contest client software 3 4 0
transmits the username and password to the login server 120. The
username, password, and the client machine's public key are first encrypted
using the login server's public key, and the resulting login request,
indicated
as Message 435 in FIG. 3D, is sent from the client machine 160 to the login
server 1 2 0.
As indicated at Block F in FIG. 4B, the login server 120 decrypts t h a
login request, obtaining the username and password. The username a n d
password are obtained by performing a lookup operation in the contestant
database 130, thereby obtaining a contestant ID.
Page 63 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
As indicated at Block G in FIG. 4B, the contestant ID is transmitted t o
the client machine 160, as Message 440 shown in FIG. 3D. The client
machine 160 stores this ID for later use.
As indicated at Block H in FIG. 4B, the login server 120 selects a n
appropriate game server 150 for this contestant, based on loading,
geographical location, and other factors.
As indicated at Block I of FIG. 4B, upon selecting a game server, the
login server 120 sends a login request, indicated as Message 445 in FIG. 3C,
containing the contestant ID and the client machine address to the selected
game server. This message 445 is encrypted using the game server's public
key. If the login request is granted, then the game server 150 creates a
message containing a game server access code, indicated as Message 450 i n
FIG 3C, encrypted using the login server's public key.
As indicated at Block J in FIG. 4B, this message (containing the game
server access code) is sent from the game server 150 to the login server 120.
Notably, the game server access code is a key created using the contestant ID
and the client machine address. This code will only allow the specified
contestant to log in using that code.
The login server decrypts Message 450, and then creates a new
message, indicated as Message 455 in FIG. 3D, containing the game server's
address and the game server access code. As indicated at Block K in FIG. 4B,
Message 455 is encrypted using the client machine's public key, and sent
from the login server 120 to the client machine 160.
The client machine decrypts Message 455 containing the game server
address and the game server access code using its private decryption key.
The client machine then creates a message, indicated as Message 460 in FIG.
3D, containing the contestant ID, the game server access code, and a client
machine public encryption key. As indicated at Block L in FIG. 4B, Message
460 is sent from the client machine 160 to the game server 150 specified b y
the game server address received from the login server 120. The game
server 150 responds with Message 463 containing the game server public
key. At this point, the client machine 160 has successfully logged on to t h a
game server 150 chosen for the client machine by the login server 120.
Page 64 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
Details Relating The Operation Specified In Block C In Fig. 4
In FIG.4C, the suboperations are shown for carrying out the method
of downloading an encrypted query and start-time to the client machine
indicated at Block C in FIG. 4.
All of the contest questions and answers originate with the
game/contest designers who typically will be human beings, although n o t
necessarily the case for all types of time-constrained competitions.
As indicated at Block A in FIG. 4C, human operators enter t h a
questions and associated answers relating to a particular contest into the
query/answer database 140.
As indicated at Block B in FIG. 4C, at some point before the contest
begins, the game server 150 sends to the primary server 100, a message,
indicated as Message 465 in FIG. 3F, containing its public encryption key.
Similarly, as indicated at Block C in FIG. 4C, the primary server sends to the
game server 150, a message indicated as Message 470 in FIG. 3F, containing
its public encryption key.
As indicated at Block D in FIG. 4C, when a particular contest i s
created, the human operators, accessing the system through the contest
management interface 260, select queries from the database to be used i n
the contest. For each query, the operator assigns a desired start-time.
Selecting queries and assigning start-times could also be done automatically
by the contest management interface software.
As indicated at Block E in FIG. 4C, for each query and start-time, the
primary server generates a unique set of query encryption and d ecryption
keys.
As indicated at Block F in FIG. 4C, using the query encryption key, t h a
primary server 100 encrypts the query.
As indicated at Block G in FIG. 4C, the primary server 100 creates a
message, indicated as Message 475 in FIG. 3F, containing the encrypted
query, the query decryption key, and the desired start-time.
As indicated at Block H in FIG. 4C, the entire Message 475 is encrypted
using the game server's public encryption key.
Page 65 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
As indicated at Block I in FIG. 4C, the entire Message 475 is sent from
the primary server 100 to the game server 150.
As indicated at Block J in FIG. 4C, upon receiving the Message 475
from the primary server 100, the game server 150 decrypts the Message 4 7 5
and creates a new message, indicated as Message 480 in FIG. 3F.
As indicated at Block K in FIG. 4C, this new Message 480 is encrypted
by the game server using the client machine's public key.
As indicated at Block L in FIG. 4C, the resulting encrypted Message
480 is sent to the client machine.
IO As indicated at Block M in FIG. 4C, the client machine decrypts the
Message 480, and stores the encrypted query contained within, along with
the start-time on the client machine 160.
At this point, the client machine 160 creates and begins appending
data to a security verification log file. This encrypted file will contain a
variety of information about the timing of the query/response process.
Among other data, the security verification log will record the arrival-time
(in local time) of the encrypted query from the game server 150.
perails Relating The Operation Specified In Block D In FIG. 4 When Using
Basic GSU Of The Present Invention
In FIG.4D, the suboperations are shown for carrying out the method
of characterizing the client machine's local clock and synchronizing the
client machine display update cycle indicated at Block D in FIG. 4 for a
system that utilizes a basic GSU 175. When using a GSU, there is no need t o
characterize the local clock, and the only procedure necessary is to adjust
the display refresh cycle such that a cycle completes precisely at the desired
start-time.
The GSU of the present invention is used to measure the video refresh
rate of the video display adapter. Almost every video display adapter used
in personal computers has a set of registers used to control and monitor the
scanning and refresh periods and rates. One standard function is the ability
to query the adapter to determine whether it is currently in a vertical
retrace period or not. By using this function over a period of time, a n d
Page 66 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
recording the local clock time each time the display enters vertical retrace,
the period and phase of the display update cycle is determined with respect
to local clock time. By reading the display adapter registers, it is simple t
o
determine the 'difference between the time the last line of the displayed
image is drawn and the beginning of the next vertical retrace. The instant
that the last line of the display is drawn in any display update period will b
a
referred to as the display time ( td). Using this calculated period and phase,
the display times are extrapolated forward in time to find the display time
closest to the desired start-time. As indicated at Block A in FIG. 4D1, the
error (Ed) between the display time (td) and the desired local clock start
time
(ts,) is calculated. Throughout this process, the times associated with each
vertical retrace are appended to the security verification log.
Since it is desired to have the client machine display the query
simultaneously on all client machines (i.e. at the common start-time), the
error term Ed is minimized by shifting the phase of the display update cycle.
A value of 0 for Ed indicates that the display will complete drawing the given
image at the precise moment of the start-time. The phase of the display
update cycle is adjusted by increasing or decreasing the display update
period over a number of update cycles. This period is typically determined
by several registers on the display adapter, controlling the so-called
"vertical
total", "horizontal total", and the "dot clock". The vertical total is the
total
count of lines, both displayed and non-displayed (within the vertical
blanking and retrace period), that make up one display update cycle.
Similarly, the horizontal total measures t he number of pixels, both displayed
and within the horizontal blanking and retrace period. The dot clock
frequency determinesthe number of pixelsper second renderedto the
display. By adjustingany one of these values temporarily,the period
three
of the dis play updatecycle may be changed,again temporarily.Although
i t
might be possible align td with ts, single update it is
to within a cycle,
probably not desirable to make such modification display
a large to the
update period, since this can cause m onitor clicking and may temporarily
disrupt the displayed image. Instead, the display update period is modified
only slightly (perhaps adjusting the vertical total by one or two lines), a n
d
Page 67 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
the period is left adjusted until enough phase shift accumulates to reduce Ed
to near zero, at which time the display update period is restored to its
original value. As indicated at Block B in FIG. 4D1, the client machine
adjusts the display update cycle over a number of cycles in order to
minimize Ed and completely display the query at the desired start-time.
Note that depending on the accuracy of the clocks, the frequency drift
of the clocks and the refresh update cycle, and the distance into the future
that the display time is extrapolated, it may be necessary to repeat the
alignment procedure to reduce these errors. The display time alignment
procedure should be considered an ongoing process, perhaps being
performed concurrently with other steps in the contest process. As always,
information about this process is recorded in the security verification log,
providing a continuous trace of the operations taking place and the timing
of those operations.
Details Relating The Operation Specified In Block D In FIG. 4 When Using The
Enhanced GSU Of The Present Invention
In FIG. 4D, the suboperations are shown for carrying out the method
of synchronizing the client machine display cycle indicatedat Block
update
D in FIG. 4, for a system that an enhancedGSU 177. Whenusing
utilizes a n
enhanced GSU 177, there is no need to characterizethe local In
clock.
addition, the display monitor is connected directly to the GSU 177, with the
video signal from the client machine being passed through the GSU. The
enhanced GSU can override the signal from the client machine, replacing i t
with its own video signal, which is automatically synchronized with the GSU
clock. As indicated at Block A in FIG. 4D2, there are no steps required b y
the client machine to achieve this synchronization.
In FIG. 4D, the suboperations are shown for carrying out the method
of characterizing the client machine local clock and synchronizing the client
Page 68 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
machine display update cycle indicated at Block D in FIG. 4, for a system
that does not utilize a global synchronization unit.
As indicated at Block A in FIG. 4D3, the local clock is "characterized".
This process of characterization can be understood as follows. Given a n
abstract idealized "universal clock time", t , a local clock t, = f(t) (e.g. t
h a
system timer, real time clock, or for greater precision, the CPU clock cycle
counter), and a global clock t~ = g(t) maintained on the primary server, t h a
local clock is said to be "characterized" when it is expressed as a function
of
the global clock value, t, = f(g-'(t~)). Characterization of the local clock
with
respect to the global clock will be defined as determining some function h(x)
= f(g-'(x)). Over reasonable time periods, and assuming fairly high quality
timing hardware, h(x) will be well approximated by a linear function. The
simplest method of determining this function is to use standard curve-fitting
techniques. If the global clock on the primary server 100 is a GPS-based
time reference, the local clock may be characterized very precisely by also
using a GPS reference in the client machine. The GPS hardware can easily
produce an extremely accurate and stable I Hz signal. This signal is
connected to one of the CPU IRQ lines. This causes the CPU to enter a n
interrupt service routine every second. At the instant the interrupt is
triggered, the CPU can record the reading of the local clock (CPU cycle
counter register). After collecting a number of such samples, the function
h(x) may be approximated to a high degree of accuracy.
The statistical information collected in order to determine the clock
characterization function is appended to the security verification log.
As indicated at Block B in FIG. 4D3, after determining h(x), the client
machine then uses this function to calculate the local clock time ( ts,)
corresponding to the desired global clock start-time ( tss) for the contest.
Next the video display update cycle is measured using the local clock.
Almost every video display adapter used in personal computers has a set of
registers used to control and monitor the scanning and refresh periods a n d
rates. One standard function is the ability to query the adapter t o
determine whether it is currently in a vertical retrace period or not. By
using this function over a period of time, and recording the local clock time
Page 69 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
each time the display enters vertical retrace, the period and phase of the
display update cycle is determined with respect to local clock time. By
reading the display adapter registers, it is simple to determine the
difference
between the time the last line of the displayed image is drawn and the
beginning of the next vertical retrace. The instant that the last line of the
display is drawn in any display update period will be referred to as the
display time (td). Using this calculated period and phase the display times
are extrapolated forward in time to find the display time closest to the
desired start-time.
As indicated at Block C in FIG. 4D3, the client machine calculates t h a
error (Ed) between the desired local clock start-time ( ts,) and the closet
display update cycle (i.e. display time (td)). Throughout this process, the
times associated with each vertical retrace are appended to the security
verification log.
Since it is desired to have the client machine display the query
simultaneously on all client machines, the error term Ed is minimized b y
shifting the phase of the display update cycle. A value of 0 for Ed indicates
that the display will complete drawing the given image at the precise
moment of the start-time. The phase of the display update cycle is adjusted
by increasing or decreasing the display update period over a number of
update cycles. This period is typically determined by several registers o n
the display adapter, controlling the so-called "vertical total", "horizontal
total", and the "dot clock". The vertical total is the total count of lines, b
o t h
displayed and non-displayed (within the vertical blanking and retrace
period), that make up one display update cycle. Similarly, the horizontal
total measures the number of pixels, both displayed and within the
horizontal blanking and retrace period. The dot clock frequency determines
the number of pixels per second rendered to the display. By adjusting any
one of these three values temporarily, the period of the display update cycle
may be changed, again temporarily. Although it might be possible to align
td with ts, within a single update cycle, it is probably not desirable to make
such a large modification to the display update period, since this can cause
monitor clicking and may temporarily disrupt the displayed image. Instead,
Page 70 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
the display update period is modified only slightly (perhaps adjusting the
vertical total by one or two lines), and the period is left adjusted until
enough phase shift accumulates to reduce Ed to near zero, at which time the
display update period is restored to its original value. This alignment of the
display update cycle with the desired start-time satisfies the criteria set
forth
at Block D in FIG. 4D3.
Note that depending on the accuracy of the clocks, the frequency drift
of the clocks and the refresh update cycle, and the distance into the future
that the display time is extrapolated, it may be necessary to repeat the
alignment procedure to reduce these errors. The display time alignment
procedure should be considered an ongoing process, perhaps being
performed concurrently with other steps in the contest process. As always,
information about this process is recorded in the security verification log,
providing a continuous trace of the operations taking place and the timing
of those operations.
Details Relating The Qperation Spgcified In Block E In FIG. 4 When Usina The
Basic GSU Of The Present Invention
In FIG.4E1, the suboperations are shown for carrying out the method
of presenting the query to the contestant at the contest start-time indicated
at Block E in FIG. 4, for a system that utilizes a basic GSU 175. At this
point,
the encrypted query and start time has been stored on the client machine,
and the display time has been aligned with the desired start-time.
As indicated at Block A in FIG. 4E1, the client machine uploads the
encrypted query and start time to the GSU 175.
As indicated at Block B in FIG. 4E1, a short time prior to the desired
start-time, the GSU 175 decrypts the query. This query is then downloaded
to the client machine.
As indicated at Block C in FIG. 4E1, the query is then rendered to a n
off-screen memory area in preparation for display on the screen.
As indicated at Block D in FIG. 4El,during the vertical retrace period
that is one cycle before the display time, the off-screen image is flipped t o
Page 71 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
the display, using hardware page-flipping techniques, or by blitting the
image to the screen during the retrace period.
As indicated at Block E in FIG. 4E1, with the query image now residing
in the currently displayed video memory, the client machine display draws
the query onto the screen, reaching the bottom of the display at the start-
time for the contest.
Finally, the client machine records the local time at the moment the
vertical retrace begins, which should be simultaneous with the desired start-
time. This time is also stored in the security verification log.
After the image is displayed, the client machine is primarily waiting
for the contestant to enter their answer or response to the query that was
presented. However, during this time, the client machine is not idle, b a t
rather continues to monitor the various clocks and timing systems on the
client machine (e.g. system timer, real time clock, CPU cycle counter,
vertical
retrace signal, etc). Information about the clocks is stored in the security
verification log.
l~Pta;is Relating The Operation Specified In Block E In FIG. 4 When Usint The
Enhanced GSU Of The Present Invention
In FIG.4E2, the suboperations are shown for carrying out the method
for presenting the query to the contestant at the contest start-time indicated
at Block E in FIG. 4, for a system that utilizes an enhanced GSU I 77. At this
point, the encrypted query and start time has been stored on the client
machine.
As indicated at Block A in FIG. 4E1, the client machine uploads the
encrypted query and start time to the GSU 177.
As indicated at Block B in FIG. 4E2, the GSU d ecrypts the query
immediately prior to the desired start-time. The query is then rendered b y
the GSU into its own display memory.
As indicated at Block C in FIG. 4E2, the GSU overrides the display,
using its own synchronized refresh rate, and presents the query precisely a t
the desired start-time.
Page 72 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
petails Relating, The Operation S~cified In Block E In FIG. 4 When Not Using
The GSU Of The Present Invention
In FIG. 4E3, the suboperations are shown for carrying out the method
of presenting the query to the contestant at the contest start-time indicated
at Block E in FIG. 4, for a system that does not utilize a global
synchronization unit. At this point, the encrypted query has been stored o n
the client machine, the start-time is known in terms of the local clock, a n d
the display time has been aligned with the desired start-time.
As indicated at Block A in FIG. 4E3, the game server transmits t h a
query decryption key to the client machine. This query description key is
shown as Message 485 in FIG. 3E. The timing of this message is important,
since it must be sent early enough to allow the client machine time t o
decrypt and display the message before the desired start-time. On the other
hand, if the query decryption key is sent too early, it compromises the
security of the system since an unscrupulous user could use the key t o
decrypt the query and view it ahead of the start-time, thereby gaining a n
advantage over other users. Extensive testing will be used to determine the
best timing for this message.
As indicated at Block B in FIG. 4E3, the client machine decrypts the
query upon receipt of the query decryption key. In addition, the local clock
time of the receipt of the query decryption key is recorded in the security
verification log.
As indicated at Block C in FIG. 4E3, the query is then rendered to a n
off-screen memory area, in preparation for display on the screen.
As indicated at Block D in FIG. 4E, during the vertical retrace period
that is one cycle before the display time, the off-screen image is flipped to
the display, using hardware page-flipping techniques, or by butting (i.e.
copying) the image to the screen during the retrace period.
As indicated at Block E in FIG. 4E3, with the query image now residing
in the currently displayed video memory, the client machine display draws
the query onto the screen, reaching the bottom of the display at the start-
time for the contest. Finally, the client machine records the local time at t
h a
Page 73 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
moment the vertical retrace begins, which should be simultaneous with the
desired start-time. This time is also stored in the security verification log.
After the image is displayed, the client machine is primarily waiting
for the contestant to enter their answer or response to the query that was
presented. However, during this time, the client machine is not idle, b a t
rather continues to monitor the various clocks and timing system on the
computer (system timer, real time clock, CPU cycle counter, vertical retrace
signal, etc). Information about the clocks is stored in the security
verification log.
Details Relating_ The Operation Specified In Block F In FIG 4 When Usin~ The
Basic GSU Of The Present Invention
In FIG.4F, the suboperations are shown for carrying out the method
of submitting a time-stamped contestant response to a previously presented
query indicated at Block F in FIG. 4, for a system that utilizes a basic GSU
175.
As indicated at Block A in FIG. 4F1, the response is entered into the
client machine using any of several different methods depending on the
specific contest being administered. For example, the response could consist
of a single letter typed on the keyboard, a mouse click, a typed in sentence,
a recorded audio segment, or other input. For timing purposes, however, it
is necessary for the client machine to have a clear indication of the instant
that the contestant submits this response. The response submission is
typically indicated by either a mouse click at a certain location, or by a
certain keypress (the <enter> key for example).
As indicated at Block B in FIG. 4F, the response submission a n d
response is immediately sent to the GSU, which generates digitally signed
time and space stamp for the response. This time and space stamp is
appended to the security verification log.
As indicated at Block C in FIG. 4F1, the time and space-stamp is sent
from the client machine 160 to the game server 150.
As indicated at Block D in FIG. 4F1, the game server 150 requests the
actual (i.e. full) response from the client machine by sending a response
Page 74 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
request message, indicated as Message 495 in FIG. 3E. In many cases, if the
response time contained within the Response Notification Message
disqualifies the contestant from any chance at winning, then it will not b a
necessary to request the complete response, thereby greatly reducing the
bandwidth requirements for this phase of the contest.
As indicated at Block E in FIG. F, if requested, the client machine
encrypts the response, the response time-stamp, and a hash-value of the
security verification log in order to create a message, indicated as Message
500 in FIG. 3E.
As indicated at Block F in FIG. 4F1, Message 500 is then sent to the
game server 150 and the security verification log is closed and write-
protected.
T7Prait~ RPlarin~ The Ot~eration Specified In Block F In FIG. 4 When Using The
Enhanced GSU Of The Present Invention
In FIG. 4F2, the suboperations are shown for carrying out the method
of the contestant submitting a time-stamped response to the previously
presented query indicated at Block F in FIG. 4, for a system that utilizes a n
enhanced global synchronization unit 177. With the enhanced GSU 177, the
input device is connected directly to the GSU 177.
As indicated at Block A in FIG. 4F2, the contestant uses the input
device to enters the response into the client machine 160 through the GSU
passthrough connection.
As indicated at Block B in FIG. 4F2, the GSU 177 automatically
generates a digitally signed time and space stamp for the response. This
time and space-stamp is appended to the security verification log.
As indicated at Block C in FIG. 4F2D, the time and space stamp is from
the client machine to the game server 150.
As indicated at Block D in FIG. 4F2, the game server 150 requests t h a
actual response from the client m achine 160 by sending a response request
message, indicated as Message 495 in FIG. 3E. In many cases, if the response
time constrained within the response notification message disqualifies the
contestant from any chance at winning, it will not be necessary to request
Page 75 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
the complete response, thereby greatly reducing the bandwidth
requirements for this phase of the contest.
As indicated in Block E in FIG. 4F2, if requested, the client machine
encrypts the response, the response time-stamp, and a hash-value of the
security verification log to create a message, indicated as Message 500 i n
FIG. 3E.
As indicated at Block F in FIG. 4F?, Message 500 is sent to the game
server 150 and the security verification log is closed and write protected.
Details Relating The Oczeration Spgcified In Block F In FIG. 4 When Not Using
The GSU Of The Present Invention
In FIG.4F, the suboperations are shown for carrying out the method
of contestant submitting a time-stamped response to the previously
presented query indicated at Block F in FIG. 4, for a system that does n o t
utilize a global synchronization unit (GSU).
As indicated at Block A in FIG. 4F3, the contestant enters a response
into the client machine using any of several different methods depending o n
the specific contest being administered. The response submission is
detected by a customized low-level device driver, preferably by "hooking"
an interrupt caused by the device.
As indicated at Block B in FIG. 4F3, the interrupt handler in the client
machine records the local time "time-stamp" corresponding to the moment
the response was submitted. This local time is appended to the security
verification log.
Immediately upon receipt of the response submission, after recording
the time-stamp, the client machine calculate a hash or CRC (cyclic
redundancy check) value using the contestant's response and the time-
stamp. The hash value is appended to the security verification log.
As indicated at Block C in FIG. 4F3, a message containing the hash
value and the response time, indicated as Message 490 in FIG. 3E, is
immediately sent from the client machine 160 to the game server 150. This
"response notification hash" Message is particularly useful when large
responses, such as those generated from a microphone, are obtained, since
Page 76 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
the tiny packet-size will be less subject to a delay due to the bandwidth of
the network. The time of receipt of the response notification hash by the
game server 150 can serve as an estimate of the actual response time for
later security verification .
As indicated at Block D in FIG. 4F3, the game server 1750 requests t h a
actual (i.e. full) response from the client machine by sending a response
request message, indicated as Message 495 in FIG. 3E. In many cases, if the
response time contained within the response notification Message
disqualifies the contestant from any chance at winning, it will not b a
necessary to request the complete response, thereby greatly reducing t h a
bandwidth requirements for this phase of the contest.
As indicated at Block E in FIG. 4F3, if requested, the client machine
encrypts the response, the response time-stamp, and a hash-value of the
security verification log to create a message, indicated as Message 500 i n
FIG. 3 E.
As indicated at Block F in FIG. 4F3, Message 500 is then sent to the
game server and the security verification log is closed and write protected:
perail.~ Relating The Operation Specified In Block G In FIG. 4
In FIG.4G, the suboperations are shown for carrying out the method
of fairly judging the contest and determining the winners of that contest
indicated at Block G in FIG. 4.
As indicated at Block A in FIG. 4G, as responses are received by each
game server from its client machines, the responses are compared with the
correct answers in database 140. Of those responses containing correct
answers, the time-stamps are compared to rank the responses from fastest to
slowest.
As indicated at Block B in FIG. 4G, the sorted preliminary results are
then encrypted using the primary server's public key.
As indicated at Block C in FIG. 4G, the encrypted preliminary results
(i.e. rankings), indicated as Message 505 in FIG. 3F, as sent from the game
server 150 to the primary server 100.
Page 77 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/LJS00/05093
As indicated at Block D in FIG. 4G, the encrypted preliminary results
_ from each game server are decrypted by the primary server 100. Using a n
insertion sort or other similar method, the pre-sorted preliminary rankings
from the games servers are merged into a single sorted list of responses.
As indicated at Block Ein FIG.4G, from the presorted list, the primary
server 100 calculates the overall ranking of the contestants and identifies
the winner or winners) of the contest.
As indicated at Block F in FIG. 4G, for each winning response, t h a
primary server 100 sends a security analysis request, indicated as Message
510 in FIG. 3F, to the game server that is connected to the corresponding
client machine of the contestant who submitted that response.
As indicated at Block G in FIG. 4G, in response, each game server
sends the security log, indicated as Message 515 in FIG. 3E, to t h a
corresponding client machine.
As indicated at Block H in FIG. 4G, the client machine transmits to the
game server, the security verification log, indicated as Message 520 in FIG.
3E, encrypted using the game server's public key.
As indicated at Block I in FIG. 4G, the game server decrypts a n d
verifies the integrity of the security verification log using the hash-value
of
the security verification log.
As indicated at Block 3 in FIG. 4G, the game server uses the content o f
the security verification log to attempt to detect fraudulent activities. The
response notification hash is used to make sure the response sent is
consistent with the response entered at the response notification time. In
addition, all of the various timing measurements can be analyzed for
consistency and compared to the corresponding transmission and receipt
times of messages by the game server.
As indicated at Block K in FIG. 4G, the game server compiles t h a
results from all the requested security logs for its client machines a n d
transmits this message, indicated as Message 525 in FIG. 3F, to the primary
server 100.
Page 78 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
As indicated at Block L in FIG. 4G, upon receiving the compiled results
from all the game servers, the primary server either accepts, rejects, or
flags
the winning responses for further analysis by other means.
As indicated at Block M of FIG. 4G, a revised list of winners is created
by the primary server based on these changes.
As indicated at Block N in FIG. 4G, this revised list is encrypted using
the game server's public key and the resulting message, indicated as
Message 530 in FIG. 3F, is sent back to the game server 150.
As indicated at Block O in FIG. 4G, each game server in turn transmits
the contest results, indicated as Message 535 in FIG. 3E, to each of the
client
machines 160.
As indicated at Block P of FIG. 4G, a message containing the contest
results, indicated as Message 540 in FIG. 3G, is sent from the primary server
100 to the web server 110 for posting on the contest web site.
,Alternative Embodiments Of The System And Method Of The Present
Invention Using Network Clock Synchronization
In the illustrative embodiment of the system of the present invention
described above, a global time reference is accessed (by each of the client
machines) through the use of global positioning system (GPS) receivers
located in both the client machines (within the GSUs) as well as in the
primary server 100. The GPS system receives time signals from GPS
satellites 180 which, in turn, receive their time signals from an atomic
clock.
The GPS receivers offer the most precisely synchronized time signal
available for use in a distributed system of this type.
However, in particular applications, it may not be economically
feasible to equip every client machine with a GSU. In such cases, a n
alternative method of distributing the master clock time to the clients must
be used when characterizing the local clocks on the client machines or when
synchronizing the client machine display update cycle.
A solution to this problem is to transmit the master clock time signals
from the primary server 100, over the network 190, to the client machines
160. There is a standard method for distributing time signals over the
Page 79 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
Internet which is embodied in the network time protocol well known in the
art. The network time protocol, or NTP, compensates for network latency
when distributing the time signals by performing statistical analysis of the
network latencies between the computers, and then taking that latency into
account when transmitting the time from one machine to another. The
techniques used in NTP can easily be adapted for use in characterizing the
client machine's local clock, instead of using the GPS for that purpose. The
characterized local clock can then be used for synchronizing the display and
for causing the presentation of the query at the desired start-time. Although
the generic NTP protocol could be used, in the case of the contest system
security considerations dictate that additional encryption and other security
measures be taken to minimize the chance of tampering with the system.
An alternative way of providing a much more accurate start-time than
that achieved using the method proposed in US Patent 5,820,463, would b a
to use NTP to characterize the local clock, and then use that local clock t o
trigger display of a query results. This is because the prior art method of US
Patent No. 5,820,463 bases the start-time on the timing and latency of a
single message containing the decryption key, while the improved method of
the present invention bases its start-time on the local clock, which has been
characterized using many repeated messages, thereby minimizing the effects
of random fluctuations in individual message latencies. The preferred
embodiment of the present invention incorporating GPS entirely eliminates
the effects of (variable) network latency, by bypassing the Internet through
the use of satellite transmissions, wherein the latencies caused by the
distance to t he satellite are automatically compensated for.
In summary, the system and method of the present invention
described hereinabove include a number of measures to ensure the fairness
of the contest and the security of the contest against dishonest contestants
and malicious third parties. Encryption is used extensively for most
messages passing between machines. Confidential message protocols,
combined with encryption prevent hackers from intercepting and modifying
messages, thereby disrupting the contest or giving an unfair advantage t o
any contestant. In addition, extensive logging of all aspects of the timing
Page 80 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
procedure allows post contest analysis to detect any inconsistencies that
might indicate tampering. The client software can also generate self-
checking. Cheating will be greatly discouraged by the knowledge that the
contestant can be disqualified for any discrepancy in this log.
In addition, the system and method of the present invention can also
verify that the original, unmodified client software is being executed during
each competition. The system and method of the present invention may
also use a challenge-response verification scheme, in which the game server
sends a series of messages to the client machine software, and verifies
whether the responses to those messages are as expected. The challenges
and responses will include a variety of methods, varying over time, t o
prevent a hacker from recording the "correct" answers to queries. The
responses could include pseudo-random numbers, generated using a
method known by both the client and server, in which it is extremely
difficult to predict the next number, or to reverse-engineer the algorithm
used to generate those numbers. The challenge-response verification
messages can be used at any point during the contest, for example during
the time the system is waiting for a query, or waiting for a response from the
contestant, or after the submission of the response.
An extremely motivated hacker might be able to circumvent some of
the defenses presented above by completely disassembling the client
software, thereby understanding the encryption and obscuration methods
used. Therefore, the system and method of the present invention may also
include another layer of security through the use of just-in-time downloaded
code fragments or through the use of encrypted code fragments with just-in-
time downloaded decryption keys. In accordance with this method, crucial
parts of the client software, particularly those used for secure
communications (encryption and decryption), those used for clock
manipulation and monitoring, and those used to perform self-checking o n
the program.
Clearly the embodiment that incorporates a GSU 175, and i n
particular the enhanced GSU 177 has much stronger security, since t h a
encryption and decryption on the client machine may be performed entirely
Page 81 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
within the GSU hardware. Additionally, as time-stamping and query
presentation timing are performed in hardware, many of the opportunities
to trick the system are avoided. For the h ighest level of security, the GSU
itself will be physically sealed with tamper-evident devices, and in the event
of a large prize award, the GSU will be examined as part of the requirements
when claiming the prize.
$emote Creation An Administration Of Contests Within The Contest-
Promoting_ S~ytem Of The Present Invention
IO The contest-promoting system of FIG. 2 described hereinabove utilizes
a "centralized" contest creation and administration subsystem, wherein the
contest management interface software 260 1 ocated on the primary server
100 is used by the contest administrators to enter questions and answers
into database 140, to design and specify contests, to schedule contests, a n d
to monitor and control those contests.
In order to provide contest administrators greater flexibility in contest
creation, management and execution, the contest-promoting system of FIG. 2
can be modified to further include additional components and processes
depicted in FIGS. 6 through 6C which collectively enable contests to b a
created and administered from any number of remote administration
consoles 600 located anywhere around the globe. This feature of the
present invention has a number of important advantages. For example,
remote contest creation and administration creates additional opportunities
and potential business models. In particular, administration of tests and
quizzes in educational settings is an ideal application for a remotely
administered time-constrained contests (or tests) carried out using the
contest-promoting system of the present invention. Often, teachers,
professors, and other educators wish to control the content and format of
the testing and evaluation tools they provide. Using the contest-promoting
system shown in FIG. 10, the educator can easily set up a remote
administration console 600, and then use that console to design, test,
schedule, and administer a test to their students.
Page 82 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
As shown in FIG. 10, the remotely-administered contest-promoting
system of the present invention is similar to the centrally-administered
contest-promoting system of FIG. 2 and therefore includes: the primary
server 100; client machines 160; game server 150; login server 120; web
server 110; contestant database 130; login server 120; and the network 190.
In addition, as shown in FIG. 10A, the remotely administered contest-
promoting system of the present invention further includes: the remote
administration server 610; the remote administration consoles 600; and the
contest database 660.
As shown in FIG. IOB, the remote a d ministration console 600 is a
general purpose personal computer (PC) utilizing standard components such
as, for example: the operating system 240; device drivers 280; network
interface 215; standard I/O hardware 220; and clock and timer hardware
290. In a ddition, remote administration console 600 is provided with
several software applications, such as a web browser 320, a remote
administration plug-in 640, and a remote administration client application
650. The remote administration software, consisting of the remote
administration plug-in 640 and the remote administration client 650, is
downloaded and installed following a procedure similar to that used t o
obtain the contest client software for the client machines. Users m a s t
register on a web site to obtain authorization to administer contests using
the system. This procedure follows an outline similar to that presented i n
FIG. 4A. However, in this case, the web site accessed is the remote
administration web .site served by the remote administration server 610.
The remote administration client software 650 is an application o r
group of applications which perform a number of different tasks, including
designing and entering queries and answers, testing the contest, scheduling
contest times, identifying those contestants eligible to participate in t h a
contest, and submitting the completed contest to the remote administration
server. The remote administration plug-in 640, in conjunction with the web
browser 320, may be used to monitor the contest and to view and download
contest results.
Page 83 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
As shown in FIG. IOC, the remote administration server 610 is a high
performance server using a standard operating system 240, device drivers
230, standard I/O hardware 220, and a high performance network interface
210. On this system, two primary applications are run, namely: the remote
administration web server 620; and the remote administration daemon 630.
The remote administration web server 620 supports the contest
management web site, which provides information to users wanting to create
and manaee their own contests or tests. The remote administration daemon
630 communicates with the remote administration clients 650 running o n
an arbitrary number of remote administration consoles 600. The remote
administration daemon 630 collects information about requested contests
and their schedules. Information about the scheduling, participants, a n d
references to questions and answers are stored in the contest database 660,
for later use by the primary server 100. The remote administration server
also accesses the contestant database 130 to verify contestants and record
performance data about the contestant or test taker. The actual queries a n d
answers are stored in the query/answer database 140. Virtual network
connections between the remote administration components are shown i n
FIG. 1 OA.
1 ive Television Broadcasting Of ontests For The Enjoyment Of Snectators
S,~~ported Bv The System Of The Present Invention
In virtually every contest, sport and public entertainment event, there
is some form of product and/or service advertising aimed at the spectators,
and not the contestants. Thus, from an economic standpoint, the contest-
promoting system of the present invention also includes several provisions
which allow as many spectators as possible to view the contest and its
associated advertising. Although the Internet is growing at an amazing pace,
the number of participants is still small compared to the vast numbers of
people who own television sets and regularly view television. In order to
reach this additional audience, the contest-promoting system of the present
invention is particularly adapted to enable spectators to view television
broadcasts of Internet-based contests enabled by the system hereof.
Page 84 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/IJS00/05093
As shown in FIG. 11, the contest-promoting system of the present
invention depicted in FIGS. 2 through 4G and 6 through 6C, also comprises a
number of system components which are configured so that live video,
taped video program content, and real-time information and results can be
combined and distributed "on the fly" to spectators viewing one or more
contests on standard television sets throughout the world. As shown in FIG.
11, these additional system components include: the web server 110; video-
enabled client machines 900, web-to-video processor 910, real-time video
compositor 920; taped video content playback unit 960; live video sources
(e.g. cameras) 950; broadcasting equipment 930; and television viewers 940.
In order to enhance and dramatize the contest for the viewers, live
video images are captured by each video-enabled client machine 900. In
general, each video-enabled client machine 900 is equivalent to a client
machine 160 with the addition of a video camera and associated video
compression and transmission software. The video camera and software is
readily available as part of commercially available video conferencing
systems well known in the art.
In addition to delivering video images of the contestants, the system
also allows both live video 950 and taped video content 960 to b a
incorporated into the complete video broadcast. This content could include
advertising, information related to the contest, as well as a live MC or host
for the contest.
The function of the web-to-video processor 910 is to filter, format a n d
render (i) data generated by the primary server 100 and distributed
through the web servers 110, and (ii) data transmitted by the video-enabled
client machine 900. The contest creators or administrators can create a
specially designed "web-page" containing all of the information to be shown
in the live broadcast. This page can include dynamic elements such as
JavaTM or ActiveXTM components so as to continually update and refresh
queries, answers, scores, contestant information, and other data. The web-
to-video processor 910 is provided with an HTML (or XML) rendering engine
along with a Java virtual machine (JVM) and other dynamic web
technologies.
Page 85 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
As shown in FIG. 11, video streams from the live video camera 950,
taped video playback unit 960, and from the web-to-video processor 910 are
combined and laid out by the real-time video compositor 920, resulting in a
single unified view depicting the various aspects of the contest currently i n
progress. FIG. 11A shows just one possible video display layout for a contest
between two teams of three people, wherein live video is displayed in the
top-center of the display screen, and the formatted output of the web server
100 is displayed along the bottom of the display screen.
During the operation of the contest, the real-time video compositor
920 sends the final video signal to standard broadcasting equipment 930,
which transmits the video signal to the spectators television sets 940 via
cable, satellite, and/or radio waves.
Co_n_rc t-P_rnmnr_ing~ystem Of The Present Invention Em~ving Television-
Based Client Machines
The system components shown in Figs. 7 and 7A and described
hereinabove enable spectators to passively observe Internet-based contests
while viewing conventional televisions sets 940. In an alternative
embodiment of the present invention depicted in FIG. 12, additional system
components are provided to enable contestants to actively participate in t h a
contest through a television-based client machine. As shown in FIGS. 8 a n d
8A, a television-based client machine 970 in accordance with the present
invention comprises the following the components: a set-top client machine
970; a IR-based remote-control input device 980; and a standard television
set 990. As shown, the set-top client machine 970 is connected to the user's
television set 990 using a standard NTSC or PAL cable. In addition, the set
top client machine 970 has connections to an antenna or cable, as well as t o
the Internet using a modem 976 over a telephone line to an Internet service
provider.
The set-top client machine 970 receives and processes contest data,
including queries through both the modem as well as through the incoming
video signal. The video signal will contain live video in standard format,
Page 86 of 238
WO00/50974 CA 02363940 2001-08-24 pCT~JS00/05093
and could optionally contain additional data broadcast during the vertical
blanking interval, perhaps using the IntercastTM format.
As shown in FIG. 12A, the set-top client machine 970 comprises a
number of major components, namely: a GSU 175 or enhanced GSU 17;,
clock and timer hardware 290; a television tuner with IntercastTM decoding
capability 977; a modem 976; an infrared input port 975; NTSC or PAL
audio/video output 974; embedded device drivers 973; and embedded
operating system with Java capability 972 running on a microprocessor, a n d
a firmware contest client 971. Like the computer-based client machine 160,
the set-top client machine 970 uses the GPS receiver in the GSU to discipline
the local clock of the client machine. This clock is used to trigger the
display of queries on the television screen, as well as to measure the elapsed
time taken by the user when answering queries (or submitting responses t o
ITRs).
The television-based client machine 970 has a number of advantages
over the computer-based client machine 160. First, the bandwidth
requirements on the modem Internet connection are greatly reduced since
much of the content is delivered through the television signal. Second, the
set-top client machine 970 can be made much more inexpensively as
compared to a general purpose computer. For the end-user, the set-top box
970 could be even provided at a reduced fee or even for no cost by their
cable television provider, since the set-top box also functions as a tuner. An
additional advantage with the set-top configuration is the ease of making t h
a
system secure. Unlike a general purpose computer, programming a n d
development tools and interfaces would be proprietary, limiting the ability
of hackers to develop programs to compromise the system. Also, programs
would be stored in tamper-resistant EPROM, making it almost impossible for
a hacker to disassemble the program to learn its vulnerabilities.
One disadvantage to the set-top based version is the difficulty i n
achieving microsecond accuracy synchronization. Normally in a television
system, the display refresh timing is determined by the incoming NTSC o r
PAL signal. In order to precisely synchronize the refresh rate would require
at least one frame of video memory storage, which would be used to buffer
Page 87 of 238
WO 00/50974 CA 02363940 2001-08-24 pCT~JS00/05093
the incoming data. Most likely only one frame of storage would be needed,
since the television signal will be fairly well synchronized due to the real-
time nature of television broadcast, in contrast to the packed-based, store-
and-forward architecture of the Internet.
Alternative Applications For The GSLI Of The Present Invention
The global synchronization unit (GSU) of the present invention
clearly has important capabilities and numerous applications beyond those
relating to online contests and games, financial and commodity trading
operations, on-line real-time auctions, and other forms of time-constrained
competition over the Internet. As discussed above, the GSU, enables a
number of functions that transcend those provided by a standard clock o r
even a GPS device. These functions fall into three basic categories: time a n
d
space synchronized generation of output events; time and space stamping of
IS input events; and verification of previously generated time and space
stamps.
The first category of functionality is the generation of output events
in response to specific time and space conditions. The GSU core processor
750 can receive instructions, through a local user interface or through a n
interconnection to another device or computer, that set up time and space
constraints along with associated actions that are to be performed when the
time and space constraints are satisfied. In the case of the contest
application, the constraint was to perform the action at the instant of the
desired start-time. The action performed in this case was the decryption
and display of the contest query. The GSU 175 can be programmed t o
generate an number of different output actions in response to the time-
space conditions. However, using the security and encryption capabilities of
the GSU, the nature of these actions may be concealed until the action is
actually performed. Applications for this capability could range from the
serious, for example the secure delivery of sensitive messages or data that
may only be revealed at a certain time or location; to the frivolous, such as
a
scavenger hunt game in which additional clues are revealed by the GSU as
the player reaches each sub-goal location.
Page 88 of 238
CA 02363940 2001-08-24
WO 00/50974 PCTNS00/05093
The second category of functionality is the creation of time and space
stamps which record and authenticate input events. The GSU core processor
is commanded, again either through a local operator interface or through a
connection to another device or computer to generate a time and space
stamp. This stamp may or may not be associated with additional input
device data. When associated with additional input data, the GSU
encryption capabilities can be used to generate a digital signature on the
combined time, location, and input data. This digital signature can later b a
used to verify that the data d id indeed exist at that time and location, a n
d
IO that the data has not been altered since that time. Of course, this method
cannot be used to verify whether or not the data existed before the specified
time, or whether the data existed in other locations, but it does establish a
n
upper-bound on the creation time, and prove that the data was available a t
a particular location.
The final major capability of the GSU hardware is the ability to
authenticate and verify digitally signed time and space stamps that i t h a s
created in the past. Depending on the specifics of the digital signature a n d
time and space-stamping methods used, it may also be possible to verify
time and space stamps using other GSU's or other hardware or software
systems. In essence, the GSU can serve as both a notary as well as a witness
to claims about the timing and location of events.
FIG. 13 shows just a few of the potential inputs to a GSU (175 or 1 77)
that might benefit from its time and space stamping capabilities. These
inputs range from those with very specific purposes, such as water level
sensors, burglar alarms, and police radar, to very general purpose inputs
with a wide range of applications, such as still image and video cameras,
microphones, and chemical "sniffers". Other possible inputs include: bar-
code readers, document scanners, fingerprint readers, iris-scanners, vehicle
counters, optical sensors for race finish lines, temperature sensors, a n d
signature capture devices. The applications for a GSU having these inputs
are virtually limitless, and the input devices shown are only a representative
sample of the possible inputs.
Page 89 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
FIG. 14 shows examples of devices into which GSU components of t h a
present invention can be embodied and provide beneficial results
A Web-enabled handheld computer with an embedded GSU, a n d
possibly wireless Internet access, could be carried by a delivery person for
time and space stamping package deliveries. By attaching a digital still
camera to the input of the GSU, an image of the person receiving the
package could be taken and incorporated into the record of the transaction.
The time and space stamp placed on the captured image would be digitally
signed by the GSU to allow verification of the image at a later time. GSU
equipped digital cameras, along with tamper-resistant and tamper-evident
mechanical seals could be used to provide legal documentation of any
number of transactions or events. Employees of insurance companies could
utilize such devices to document accident damage. Similarly, bar-code
scanners, document scanners, and police radar units could all be equipped
with GSU's to provide enhanced security and authenticity.
As shown in FIG. 15, the basic GSU unit 175 and enhanced GSU 1 7 7
can be built in a number of different configurations for use as peripheral
devices to general purpose personal or business computers. These devices
could connect to the client computer using PCMCIA slots, ISA/PCI or SCSI
interfaces, or through serial or parallel port connections. Alternatively,
GSUs 1 7 5 and 177 can also be realized as single Application Specific
Integrated Circuit (ASIC) devices, wherein analog and digital circuits are
embodied in a manner known in the ASIC chip manufacturing art.
('1 1;,'_ Tinie Synchronized Securities/C~~'~'~~;r~PC/m,rrPncy Price
Ou~tation And Tradin~~ystem Of The Present Invention
As described hereinabove, the present invention enables simultaneous
presentation of data to multiple users connected over a network to a central
computer or computers. Additionally, the present invention also enables
secure and precise calculation of time and space stamps for events that
occur at a client machine. These stamps are digitally signed so that they
may be authenticated and to make them resistant to forgery. Based on these
Page 90 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
inventive features, the present invention can be applied to the buying a n d
selling of financial securities, commodities, and other items of value over
the
Internet, including articles and goods being auctioned off at on-line auction
sites on the WWW.
In particular, the present invention can provide traders (persons
involved in the buying and selling of financial securities or otherwise
profiting from the fluctuation in prices of those securities) with the ability
t o
conduct financial trades in a manner that p r ovides greater fairness a n d
security than those currently afforded them.
One important aspect of securities trading is the ability to view a n d
monitor price quotes for securities and to view and monitor information
about trades and other transactions involving those securities. Typically,
traders subscribe to a service that provides price quotes for offers to b a y
and sell securities. Depending on the level of service they have purchased,
the quotes will be delivered with some predetermined delay (ranging from
"real-time" to twenty minutes or so). Prior art real-time trading o r
auctioning systems do not compensate for network latency when producing
these delayed quotes or bids, and therefore the trader (or bidder) will
actually receive them some random a mount time after the specified delay.
Using similar components, protocols, and procedures as provided for the
contest-based system described above, the principles of the present
invention can be applied in order to produce a competition-promoting
system which enables the simultaneous display of price quotes (as well as
bids) to millions of competitors world over, for any given delay so as long as
the specified delay is greater than the worst case latency expected for t h a
client machines of these competitors.
In addition, the Internet-based competition-promoting system of the
present invention can also enable secure time and space-stamping of client
machine-based activities such as the submission of offers to buy or sell
securities, options or the like, as well as bids to buy goods being auctioned
off at on-line auction sites. When using the hardware-based GSU hereof,
each client machine in the system is enabled to generate a digitally-signed
time and space stamp for each transaction, thereby allowing the client's
Page 91 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
transactions to be processed (i.e. executed and cleared) in a secure a n d
fundamentally fair manner.
As shown in FIG. 5, the financial securities/commodities price-
quotation/trading system of the illustrative embodiment comprises a
number of subcomponents, namely: a primary server 100; one or more web
servers 110; a login server 120; a trader database 35; a real-time market
state server 45; one or more real-time price-quotation and trading servers
55; and a plurality of client machines 160. In many respects, the system of
FIG. 5 is similar to the system of FIG. 2, except that certain components are
modified appropriately to the nature of securities, commodities or currency
markets) involved. Like reference numerals indicate like components in the
systems.
Overall operation of the price-quotation/trading system is controlled
and directed by a computer or set of computers or devices that will b a
referred to collectively as the primary server 100. The primary server
provides certain functionality to the system, communicating with the real-
time market state server 45, distributing quote and other market data to the
real-time price-quotation and trading servers 55, providing a master clock
for the system, and collecting and performing preliminary processing o n
quotation and trade requests.
The primary server 100 is substantially similar to that provided for
the contest-based embodiment of the invention, shown in FIG. 2G. However,
the contest management interface 260 will be replaced by a financial
securities trading management interface, with functionality appropriate t o
this application, such as the ability to assign certain rights to traders, t o
change trader quote delays, and other such activities.
The single primary server 100 communicates indirectly with the client
machines through a number of real-time price-quotation and trading servers
55. These servers relay quotes and other financial data to the client
machines 160, and receive trade requests from those client machines.
Preliminary verification and sorting of the trades is performed by the real-
time price-quotation and trading servers 55, and these pre-processed results
are then passed back to the primary server 100. The hardware and software
Page 92 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
architecture of the real-time price-quotation and trading servers 55 are
similar to the game servers 150 depicted in FIG. 2E. This figure shows a
layered architecture similar to the primary server 100, with hardware
components including a GPS receiver 170, high precision timing hardware
200, and a high performance network interface 210 in addition to the
standard hardware components 220. These hardware components are
controlled through the use of a set of standard and customized device
drivers 230. Many of these device drivers are provided by the hardware
manufacturers, while some are specifically written or modified to handle the
precise timing operations needed by the financial trading system. The
major application running on the real-time price-quotation and trading
servers is the financial trading system daemon. This software receives,
processes and responds to data from the primary server, the login server,
and from its client machines.
The trader interacts with the system through a client machine 160.
Each trader uses a single client machine to receive and view security prices
and other financial data as well as to enter and transmit requests (i.e.
orders
or offers) to buy or sell securities or options. Each client machine 160
consists of a standard personal computer, augmented by the addition of
several software and hardware components. The critical hardware
component on the trader's client machine is the global synchronization unit
(GSU) 175. The GSU decrypts and displays quotes precisely at the specified
delay, and also time and space stamps the trader's requests (i.e. orders) t o
buy and sell securities, options or the like. These time and space stamps are
digitally signed to provide a secure record of the requested transaction.
When not actually performing trades, the trader interacts with a
financial information providing web site through a web browser. The
contest web site is "served" to that browser from one or more web servers
110. The web servers handle advertising, support, registration,
downloading, and other similar tasks.
Another key component of the price-quotationltrading system shown
in FIG. 5 is the login server 120. The login server accepts login requests
from the trader's client machines and assigns an appropriate real-time price-
Page 93 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
quotation and trading server to that client machine. The login server
provides a single, well-known address for the client machines to contact
when initializing a new trading session. The login server also serves t o
intelligently distribute the processing and communications load among the
real-time price-quotation and trading servers. FIG. 5B shows the virtual
network connections between the login-server and the trader's client
machines.
FIG. 5 also depicts a trader database 35. The trader database records
information about the users, such as their i dentity, preferences, contact
information, and a history of past transactions.
The real-time market state server 45 acts as the interface between the
trading system of the current invention and the actual stock-exchange (or
commodity-exchange or currency-exchange) computers that provide the
price quotes and process orders to trade (e.g. execute orders by matching
offers to buy with offers to sell). This server 45 collects requested
information and translates them into the proper form for transmission to
the primary server 100. In addition, the real-time market state server 4 5
accepts client time-stamped trade requests (i.e. orders to buy and sell) from
the primary server 45, reformats them into the proper protocols, a n d
transmits them to the appropriate stock-exchange (or commodity-exchange
or currency-exchange) computers. Finally, the results of the trades are
collected and sent back to the primary server 100 for distribution to the
client machines through the real-time price-quotation and trading servers
55. By carrying out accurate time-stamping at both the client and server
ends of the trading process, each order to trade (i.e. buy or sell) carries
two
time-stamps (i.e. one produced at the client machine and one at the server)
and therefore can be reliably accepted and executed based upon t h a
submission-time of the order at the client machine and not upon the receipt-
time thereof at the server. Consequently, this enables, in theory a n d
practice, order execution subsystems to execute orders for trade based o n
the time of order placement at the client machine, and not when they are
received at the server, or when they are delivered to the order execution
subsystem at some later time.
Page 94 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
Moreover, the client machine placing an order for a trade (i.e.
message) will receive a receipt of the time-stamp of when the order to trade
was actually received at the server. Also, time stamping of orders to trade a
t
the server (e.g. maintained in a stock brokerage house) could also prohibit
or dissuade stock brokerages from delaying the transmission of such order
messages to order execution subsystems (e.g. electronic communication
networks ECNs) over which orders to buy a particular security are matched
with orders to sell the particular security, as oftentimes occurs when a
market begins to lose value and the stock brokerage firm will try to sell off
or buy positions on its own account, before executing the orders for trade of
its customers/clients.
As with the other preferred embodiments, the components of FIG. 5
are interconnected through the Internet or other network, as indicated b y
network 190.
Notably, the general operations depicted in FIG. 4 and carried out b y
the system of FIG. 2 are also carried out by the price-quotation/trading
system of FIG. 5, with various modifications of course to accommodate the
different application at hand. Collectively, these operations enable a
competitor (i.e. market participant or trader) to participate against millions
of competitors, in a secure and fundamentally fair time-constrained
competition to buy and sell limited economic resources in a generally "free"
market, wherein prices are set by supply and demand forces, rather than b y
governmental fiat or regulation. By virtue of the present invention, each
competitor, connected to the price-quotation/trading system by an on-line
connection established by a client machine, receives updated price
quotations at a common "start-time" regardless of the location of his or h a r
client machine on the infrastructure of the Internet, or on the planet Earth.
Thus, trader/competitors in Tokyo, Japan and New York, New York, will
receive real-time price quotes on market activity at the same globally-
synchronized time. Also, the GSU in each trader's client machine securely
places a time and space stamp on each trader's trade, to ensure that such
geographically distributed and differently Internet-connected traders are
able to compete under fundamentally fair and network-secure conditions.
Page 95 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
Further, as the server ????????? By carrying out accurate time-stamping a t
both the client and server ends of the bidding process, the bid can b a
reliably accepted based upon the submission-time and not upon the receipt-
time.
In the system of FIG. 5, the operation indicated at Block A in FIG. 4
would be modified so that each trader or competitor registers with the
system as a trader, and downloads price-quotation/trading software to
create a globally-synchronized and secure-networked client machine.
In the system of FIG. 5, the operation indicated at Block B in FIG. 4
would be modified so that each trader logs on to the price-quotation/trading
server 55, and establishes a communication channel therewith.
In the system of FIG. 5, the operation indicated at Block C in FIG. 4
would be modified so that the system periodically transmits the price
quotation updates and the start-time from the primary server 100 to each
client machine 160.
In the system of FIG. 5, the operation indicated at Block D in FIG. 4
would be modified so that system characterizes the client machine's local
clock with the master clock on the primary server 100, (i.e. if an enhanced
GSU 177 is not provided), and the synchronization of the client machine
display update cycle with the desired start-time for the price quotation
update.
In the system of FIG. 5, the operation indicated at Block E in FIG. 4
would be modified so that the system presents the price quotation updates
to each trader precisely at the same globally-synchronized start-time, e.g. as
determined by a local clock that is characterized with respect to a global
master clock located on the primary server 100.
In the system of FIG. 5, the operation indicated at Block F in FIG. 4
would be modified so that the GSU-enabled client machine accepts the
trader's response (e.g. offer/order to buy and/or sell a particular amount of
stock, commodity or currency for a particular price), attaches a time a n d
space stamp to that response, and transmits the response and time stamp t o
the servers 55 in the system.
Page 96 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
In the system of FIG. 5, the operation indicated at Block G in FIG. 4,
would be modified so that the real-time market state server 45 receives
information regarding the orders during the past price-quote/trade cycle,
and thus updates the same.
During the next subsequent price-quotation display time (i.e. next
start-time) in the market competition, updated price quotations are
simultaneously displayed/presented to each of the on-line traders in a
globally time-synchronized manner. In response thereto, each trader can
respond to such changing market conditions by placing trade orders which
are time and space stamped at the originating client machine, in a globally
time-synchronized manner. By virtue of the system of the present invention,
such orders are fairly and securely executed (i.e. matched with
corresponding unfilled orders in the marketplace) in accordance with
conventional time-prioritized procedures and practices of the market.
A system similar to that described above can be constructed a n d
deployed in order to improve the operation of on-line real-time auctions i n
fundamentally fair and secure manner, thus eliminating any advantages
held by those bidders having faster computers and/or Internet connections.
On-T ine Auction System And Method Of The Present Invention
Referring to FIGS. 6 through 9E, an on-line auction-supporting system
and method will now be described in accordance with the principles of the
present invention.
In this particular embodiment of the present invention, the primary
goal of the Internet-based system and method is to enable thousands a n d
even millions of bidders to participate in a multi-bidder, time-sensitive,
internetworked real-time auction that is regulated in a secure and
fundamentally fair manner. In general, the auction will involve a large
population of bidders who simultaneously attempt to bid on some article of
merchandise, commerce, antique, or other good put up on the "auction
block" in a time-constrained manner.
In general, the auction consists of a large number of bidders
attempting to bid upon an item of merchandise that has been offered for
Page 97 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
sale. Each bidder in the auction will interface with the auction through a
client machine 160. The client machine displays images, text, video, plays
audio, or uses other means to present auction information for the item of
merchandise that is being offered for sale. The client machine also accepts
bids from the bidder based upon the information previously presented.
Therefore, the client machine is a device that presents auction information
and accepts bids from one bidder who is participating in the auction.
The auction-supporting system has the capacity to control a n d
measure certain time-based elements of the auction. These elements
include: the ability to specify the precise instant at which the auction will
start and the bidders will be allowed to submit bids, referred to as the
"start-
time"; the ability to specify the precise instant at which a bid is submitted,
referred to as the submission-time; the ability to specify the precise instant
at which the server receives the bid, referred to as the "reception-time". In
addition, the system is capable of precisely determining the length of time
between the submission-time and the reception-time. referred to as the
"response-time".
In accordance with the principles of the present invention, the system
ensures that the submission-time of each bid is accurately time-stamped a t
the client machine and the reception-time of each bid is accurately time-
stamped at primary server 100'. The system contemplates that the network
latency, as measured by the response-time, may vary based on a number of
factors including, for example: client machine hardware, network
connectivity, traffic on the network and others. By carrying out accurate
time-stamping at both the client and server ends of the bidding process, the
bid can be reliably accepted based upon the submission-time and not upon
the receipt-time. Thus the system and method of the present invention
compensates for (i.e. levels out) any differences between network latencies
of competing bidders and ensures that no one is disadvantaged based upon
the response-time of their client machine used during the auction process.
Also, each client machine configured in the system of the present invention
receives verification of the receipt of the bid, wherein the verified receipt
contains both the submission-time and reception-time. If the GSU-enabled
Page 98 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
client machine does not receive a bid verification, it will automatically
resubmit the bid. Notably, the measured response-times of the clients also
provides a measure of the network latencies and allows the server t o
continue accepting bids after the "close of bidding" for a period of time
greater than the longest measured network latency. The submission-time of
any bid received after the close of bidding is verified to ensure that the bid
was submitted prior to the close of bidding.
In the preferred embodiment, the local clock associated with each
client machine is characterized using a GPS receiver installed therein. GPS
receivers can provide a clock reading as well as an extremely precise a n d
accurate 1Hz signal. This signal is sampled and the local clock read
repeatedly. By analyzing the relationship between the local clock and the
1Hz signal over time, the relationship between the two clocks can be
determined using standard curve-fitting methods.
Preferably, each client machine is provided with GSU, including a GPS
receiver module as described in detail hereinabove. However, in the
absence of a GPS receiver module on the client machine, other techniques
may be used to characterize the local clock on the client machine. In
particular, the methods and algorithms based on the standard NTP (i.e.
network time protocol) can be used. As discussed above, these algorithms
are typically used to synchronize clocks over networks, and automatically
measure and compensate for network latency. NTP could be used directly,
or more likely would be modified to increase the accuracy.
The auction-supporting system of the present invention also employs
extensive security measures to detect and discourage cheating by dishonest
bidders. Security is crucial in large auctions involving significant items of
value. Security for the system is provided by encrypting the majority of
messages between the various computers in the system, as well as b y
monitoring and logging the auction-related activities on each client machine.
Security is also provided by means of a unique identification for each client
machine. The login for each bidder is associated with the unique
identification selected from a limited number of client machines. This
feature of the system ensures that only the registered bidder can place bids
Page 99 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
from a client machine and provides a method of determining if someone
else is using a bidder's login. The security measures also include the ability
to pre-quality bidders based upon their credit rating and available credit
limit. This feature of the system will prevent bidders not capable of paying
for an item, from bidding on it o r bidding more than they are able to afford
to pay, and ruining the auction process supported by the system.
In the preferred embodiment, encryption measures within the system
are enabled by encryption hardware installed in the client machine. The
benefit of the encryption hardware is the ability to quickly encrypt a n d
decrypt messages to and from the server with which each client machine
cooperates. In addition, the encryption hardware can be encoded with the
unique identification number. In the absence of encryption hardware,
other techniques may be used to encrypt and decrypt messages between the
clients and servers of the system. In particular, the methods and algorithms
of the standard SSL (secure socket layer) can be used. These algorithms are
typically used to encrypt and decrypt messages between a web browser a n d
a web server over the Internet. In terms of the unique identification, a n
identification can be generated and stored on the client machine i n
encrypted form as an alternative.
The auction-supporting system of the present invention can duplicate
the characteristics of a live auction unlike current online auctions. The
present invention can also be used for auctions with set finish times like
current online auctions, but with the added benefit of correcting for latency
and confirming the receipt of bids. In addition, the present invention has
the ability to pre-qualify bidders for financial capability.
In the preferred embodiment of the system, the encryption hardware
and the GPS receiver are coupled together on a single ASIC in a tamper-
resistant and temper-evident package, referred to as the GSU (i.e. global
synchronization unit). The benefit of this design is the increased security
that a single GSU will provide. The single ASIC is significantly more
difficult
to circumvent or reprogram because of the integrated design. In addition,
the encryption capabilities of the GSU make it possible to control the
updating of the software that runs on the unit itself and can prevent
Page 100 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
dishonest bidders from forging time-stamps or altering the unique
identification.
In a more preferred embodiment of this system, the encryption
hardware, GPS receiver and fractal antenna are integrated into a single ASIC
in a tamper-resistant and tamper-evident package. The fractal antenna
employs a recursive design, as well known in the antenna arts. In addition,
the single ASIC design is intrinsically more resistant to attempts t o
circumvent the security features. Preferably, the GSU can be realized i n
numerous form factors including, for example, a computer mouse, a
keyboard, and advertising product designs such as a Coke bottle, Pepsi can,
or other well-known product forms.
Having provided an overview on the auction-supporting/promoting
system of the present invention, it is appropriate to now describe in greater
detail the structure and function of the components thereof.
As shown in FIG. 6, the auction-supporting system of the illustrative
embodiment comprises an integration of components, namely: a primary
server 100'; one or more web servers 110'; a login server 120'; a bidder
database 130'; a auction database 140'; one or more auction servers 150';
and a plurality of client machines 160. As shown in FIG. 6, each client
machine is equipped with a global synchronization unit 175 (GSU), whereas
the primary server 100' and each auction server 150' is equipped with a
standard GPS receiver 170. As shown in FIG. 6, the auction-supporting
system of the illustrative embodiment employs a global positioning system
comprising GPS receivers 170 operating in conjunction with an array of GPS
satellites 180 occupying a geodesic orbit in a manner well known in t h a
satellite art. All of the computer and database components of the system are
interconnected through some sort of communications network 190 such as
the Internet, supporting a networking protocol such as TCP/IP.
Overall regulation of the auction activity enabled by the system and
method of the present invention is carried out by a computer or set of
computers which hereinafter shall be referred to collectively as the "primary
server" denoted by reference numeral 100'. The primary server provides
certain functionalities to the system including, for example: acting as a
Page 101 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
source of descriptions for products and objects to be sold by way of
- auctioning processes well known in the art; providing a master clock for the
system; determining the overall ranking of bidders; selecting the highest
bidder in the auction (i.e. contest); and informing the bidders (i.e.
contestants) a nd possibly the general public of the identity of the wining
bidder.
As shown in FIG. 6G, the primary server 100' in the auction-promoting
system comprises a number of software and hardware components. As
shown in FIG. 6G, the structure of the primary server 100 is described using
the layered structure of a standard general purpose computer, wherein the
hardware components are shown at the lowest level, with successive layers
of software functionality disposed above them. Each layer of components
utilizes and builds upon the services and capabilities of the lower layers,
most often only directly interfacing with the layer immediately below it. In
the primary server 100', the low level hardware includes a GPS receiver 170,
and high precision clock and timing hardware 200 synchronized to a global
time reference using the GPS receiver. In addition, the high performance
network interface hardware 210 is used to connect the primary server 100'
to the communications network 190. These hardware components are i n
addition to the standard I/O and other hardware 220 typically provided o n
a high-end network server, such as the SUN EnterpriseTM server running the
SolarisT"' platform, by Sun Microsystems, Inc. of Palo Alto, California. Above
the hardware level are standard and customized device drivers 230 that
control and communicate directly with the hardware. The device drivers are
used by the operating system 240 and higher-level applications so that
direct hardware programming is not necessary. At the top level of FIG. 6G
are two auction-related applications. The first application is the primary
server daemon 250'. This piece of software manages the sequence of
operations for the auction (i.e. contest) as a whole, as well as managing the
communication of queries, responses, and other information with the game
servers. The other top level application running on the primary server 100
is the auction management interface 260'. This application provides the
user interface to the human operators of the auction. This software allows
Page 102 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
the operators to enter new bids into the Auction Database 140', to set a p
and schedule auctions, to set bid levels (e.g. starting bids on particular
items
scheduled for auction), to specify qualifications (e.g. financial
qualifications)
for participating in particular auctions, to collect and view usage
statistics,
and to monitor ongoing auctions. The auction management interface
application 260' communicates with the primary server daemon 250' i n
performing most of its tasks.
As illustrated in FIG. 6A, the single primary server 100' communicates
indirectly with the client machines 160 through a number of auction servers
150'. These auction servers 150' relay current bids to the client machines,
and receive responses (e.g. counter bids) from those client machines.
Analysis and sorting of the response bids is performed by the auction
servers 150, and these pre-processed results are then passed back to t h a
primary server 100'.
As shown in FIG. 6E, the auction server 150' has a layered architecture
similar to the primary server 100', comprising: hardware components
including a GPS receiver 170; high precision timing hardware 200; a high
performance network interface 210; in addition to the standard hardware
components 220. These hardware components are controlled through t h a
use of a set of standard and customized device drivers 230. Many of these
device drivers are provided by the hardware manufacturers, while some are
specifically written or modified to handle the precise timing operation s
needed by the auction-supporting system of the present invention. The
major application running on the auction servers is the auction server
daemon 270'. The auction server daemon 270' receives, processes a n d
responds to data from the primary server 100, the login server 120, a n d
from its client machines 160.
Each bidder interacts with the auctions-supporting system through a
client machine 160. Each bidder uses a single client machine 160 to receive
and view the starting/minimum bid, current bids, as well as to enter and
transmit their counter-bids to current bids. In the illustrative embodiment,
each client machine may be realized as a standard personal computer,
augmented by the addition of several software and hardware components.
Page 103 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
In FIG. 6D, the basic components of each client machine 160 is shown. As
shown in FIG. 6D, each client machine I 60 would initially comprise t h a
standard hardware and software components typically associated with a n y
personal computer. These components would include the operating system
240, standard device drivers 280, clock or timer hardware 290, input
hardware, such as the keyboard, mouse, a microphone, etc. 300, output
hardware, such as a video display and/or speakers 310. In addition to this
hardware, each client machine would also require some sort of "web
browser" 320 such as Netscape Navigator or Microsoft's Internet Explorer.
This web browser is used to contact the "Auction WWW Site", to register with
the auction-supporting system, and to download the other software
components therefrom. These other components might include a auction
plug-in 330 that would enhance the user's experience at the auction web
site, in addition to the auction client 340, which is the primary interface
between the bidder and the auction system. Each auction client machine
receives and presents bids to the human bidder, as well as accepting the
bidder's responses (i.e. counter bids) and sending them to the servers. Each
auction client machine communicates through auction hooks and drivers
350' with the underlying input, output, and timing hardware, in order t o
handle the timing aspects of the auction (i.e. contest). The hooks a n d
drivers 350' are responsible for clock and display synchronization, as well as
for generating time-stamps associated with various events during the
auction. The global synchronization unit (GSU) 175 is installed in the client
machine to provide precisely timed events, traceable to internationally
standardized reference clocks. The GSU 175 of each client machine
performs decryption operations, time-stamping of client-machine/contestant
responses, and supports timed query presentation.
When not actually participating in an auction, the bidder interacts
with the auction web site through a web browser. The auction web site is
"served" to that browser from one or more web servers 110. The web
servers handle advertising, support, registration, downloading, and other
similar tasks. As shown in FIG. 6F, the web server 110 comprises a number
of major components comprising a standard I/O 220; a high performance
Page 104 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
network interface 210: standard device drivers 280; and the operating
system 240. These components cooperate to support the operation of t h a
web server software 360. The web server software 360 consists of a n HTTP
daemon, along with various scripts and utility programs used to handle
user/bidder registration and to perform auction web site updates as new
bidders or auction results information become available.
As shown in FIG. 6, the last primary computer-based component of the
auction-promoting system is the login server 120. The function of the login
server 120' is to accept login requests from each bidder's client machine,
and assign an appropriate auction server 150' to that client machine. The
login server 120' provides a single, well-known address for the client
machines to contact when initializing a new auction. The login server also
serves to intelligently distribute the processing and communications load
among the auction servers I50'. As shown in FIG. 6H, the login server 1 20'
comprises a number of major components, namely: a standard I/O 220; a
high performance network interface 210; standard device drivers 280; a n d
the operating system 240. These components cooperate to support the
operation of the login server daemon 370, which handles the login requests
and server assignment functionality within the auction-promoting system.
As shown in FIG. 6, the auction-promoting system of the illustrative
embodiment employs two database systems. The first database system is the
bidder database 130'. The bidder database records information about the
users, such as their identity, preferences, contact information, and auction
results and standing. The second database is the auction database 140'.
The auction database 140' stores the various bids made by the bidders
during auctions. The starting/minimum bids for each auction are originally
set and stored in the database by the auction operators (and/or the owners
of the object to be auctioned). They are t hen accessed and distributed b y
the primary server 100 to the bidder's client machines 160 during the
auction process.
As shown in FIG. 6, the final component of the auction-supporting
system that deserves mention is the communications network 190. In
general, communications over the network could be carried out using a
Page 105 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
variety of different communications methods. In general, each computer o r
device will establish a connection or connections to one or more of the other
computers through the network 190. In practice, these connections will b a
"virtual" connections through a general network such as the Internet, rather
than as a direct point-to-point physical connection. The topography of the
primary virtual connections between the various auction system
components are depicted in FIGS. 6A, 6B, and 6C, while the information
flows transmitted through those connections are detailed in FIGS.7A
through 7G.
Virtual Communication Links And Hierarchies In The Action Suo~ortin~
Svstem Of The Present Invention
Typical auctions implemented using the auction-supporting system of
the present invention could involve thousands or even millions of bidders
distributed over and possibly above the planet Earth. Because of the huge
bandwidth required to handle transmission of the queries and responses
from all of the client machines employed in the auction, the system of the
present invention utilizes a hierarchy of servers illustrated in FIG. 6A. As
shown in FIG. 6A, the primary server 100' acts as the root node of a tree-
type interconnection of computers. The "leaves" of the tree structure are
formed by the client machines 160 connected to the system. Between these
devices lies a layer of auction servers 150' which act as intermediaries (or
"branch structures") between t he primary server 100' and the client
machines 160. Each auction server communicates directly with the primary
server 100' and with a set of client machines associated with that particular
auction server 150'. In a large auction involving many thousands of
bidders, there might be hundreds or thousands of auction servers deployed
in the system, each handling hundreds or thousands of client machines.
These auction servers could be distributed over the country or over the
world, with each auction server handling client machines in a certain region,
thereby greatly reducing the communications loading on central "trunk"
network links. As shown in FIG. 6A, there are also communication links
between the primary server 100' and the bidder database 130 and t h a
Page 106 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
auction database 140. In this illustrative embodiment of the auction-
_ supporting system hereof, each game server 150', client machine 160, and
primary server 100' is equipped with a GPS receiver that is used t o
synchronize the local clock and the display of each client machine
participating in the auction-supporting system.
Network traffic bandwidth associated with the higher level servers i n
the hierarchical configuration shown in FIG. 6 is reduced by performing
some data processing on the auction servers 150' themselves, rather than
performing all computations on the primary server 100'. For example, if a
single winning bidder, or a certain number (e.g. n) of bidders are to b a
chosen in each auction, then each auction server 150' can compare each b i d
it receives and only transmit the "n" highest bids (i.e. prices) onto the next
higher level server. Also, management of time synchronized messaging with
each client machine can be carried out by the auction server 150' associated
with that client machine, rather than by the primary server 100'. Such
techniques will serve to reduce the loading on the primary server 100'. If
the performance of all bidders is to be rated and sorted, then each auction
server 150' can sort the bidders playing on the client machines connected t o
that auction server 150' . Thereafter, these sorted lists of client machines
can be easily and efficiently sorted by the primary server 100 using a n
insertion sort or method that takes advantage of the pre-sorted groups of
contestants.
It is recognized that real world auctions involve much more than the
actual bidding process that makes up the core elements of the auction.
Many other steps and processes are necessary or desirable both from the
point of view of the bidder, as well as from the point of view of the person
or company running the auction. While the purpose of the auction from the
point of view of the bidder is to purchase a valuable object, the purpose of
the auction from the point of view of the auction operator may include
other goals. For example, such goals may include: selling other products o r
services; advertising; collecting marketing information or other statistical
information; promoting their company or institution; educating a group of
people; and so on. The basic bidding activities constitute the auction itself,
Page 107 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
while the other activities referred to above will be referred to as the non-
auction activities. These non-auction activities can be divided into two
major categories; those activities that directly support t he operation of the
auction; and those activities that are ancillary to the auction.
Non-auction activities that directly support the operation of the
auction include one-time or rarely performed activities, as well as activities
that must be performed immediately before or after each auction. One-time
activities include bidding registration, system testing and qualification, a n
d
downloading plugins or other client-machine based components. Those
periodic activities that must be performed before or after each auction
include login, server assignment, and viewing auction results.
Registration is used to collect and record information about each
contestant desiring to participate in a scheduled contest (e.g. listed on the
Contest WWW Site). This information can include the name, address,
telephone number(s), E-mail address, and any other information required o r
desired of each contestant by the contest organizer and/or sponsor(s). The
contestant chooses or is assigned an identification number (or "handle")
and a password, in order to protect their access to the contest process. At
registration time, a number of tests may be performed on the bidder's
system. These tests could be used to qualify the client machine to be used
by the bidder, by determining whether it meets certain requirements
necessary to successfully participate in the auction. In addition, data
produced as a result of these tests may be recorded, either on the client
machine or on one of the servers. This data could be used, in conjunction
with other information collected during and/or after the auction, to help
determine whether the auction participated fairly in the competition.
Another activity which is also performed before the contest is downloading
any programs, installable components, and plugins, as well as any data
required by them. These programs, components, and plugins, along with a
browser or other programs already present on the bidder's system will b a
used to present advertising and other information and content to the
auction, as well as to perform all operations of the auction on the client
machine.
Page 108 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
As shown in FIG. 6B, a number of system components are used t o
distribute and present HTML (or XML) encoded documents (with or without
Java or Active-X applets) and associated web content to the bidder. As
shown, such system components include a plurality of mirrored web servers
I 10, wherein each web server 1 10 is connected to auction database 130' a n d
each serves a set of Web-enabled client machines 160 equipped with web
browsers 320. A master web server I 10 stores and provides the web site
content to a set of client machines, utilizing HTTP, FTP, and other standard
Internet protocols. In order to avoid overloading a single web server with
many thousands or millions of connections, a number of mirror web servers
110 are used. The master web server transmits copies of the entire auction
web site to the mirror web servers, which then are each able to serve a large
number of client machines 160. As shown, each of the web servers 1 1 0
shares a common networked auction database 130' which contains
registration and other information. In addition to providing the auction
"web site", the web servers also distribute the auction client software (340)
using the HTTP or FTP protocols. Before downloading auction client
software, each bidder /user is required to register on the web server 1 10.
Registration involves filling out a web-based (e.g. HTML-encoded or XML-
encoded) form containing the necessary personal and client machine
information and submitting that form to the web server. Client machine
qualification may be tested using either browser plug-ins or stand alone test
programs downloaded from the web server.
In an extremely large multi-bidder auction, it is clear that multiple
auction servers will be necessary to handle communication with all t h a
client machines involved during the auction. When a client machine
initially connects to the auction-supporting system of the present invention,
it will be done through a login server 1 20' located at some well-known
Internet address. The login server will choose which game server should b a
utilized by this bidder's client machine. This choice will be based on a
variety of information, including the location of the client machine, the
characteristics of the connection to the client machine, and the number a n d
characteristics of the connections already assigned, or anticipated to b a
Page 109 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
assigned, to the auction servers in the system. Load balancing algorithms
will be used to distribute the connections to the auction servers, thereby
minimizing the possibility of overwhelming any one server, and ensuring
consistent connections for all the auction client machines.
FIG. 6C depicts the connections between the client machines 160,
login server 120', and the bidder database 130'. Except in extremely large
configurations, it is probable that only a single login server would b a
needed, and all client machines would receive their auction server
assignments from that server. If a single login server is insufficient, then a
hierarchical configuration similar to the one shown for the auction servers
in FIG. 6B could be used. As shown in FIG. 6C, each client machine i s
running the auction client 340', and it is this software that the bidder
interfaces with when logging in to through the login server. In order t o
check passwords and the status of the bidder, the login server accesses t h a
bidder database 1 3 0' .
Processes Involved During The aeration Of The Auction-Supporting S sy tem
Of The Present Invention
In FIG. 7, the high level operations performed by the auction-
supporting system of FIG. 6 are described. Collectively, these operations
enable a bidder to compete with many other bidders, in a secure a n d
fundamentally fair time-constrained auction, wherein each bidder is
provided with a common "start-time" regardless of the location of his or h a r
client machine on the infrastructure of the Internet, for the type of
interconnection provided thereto (e.g. POTS line, ISDN, frame-relay or T I
line). The flowchart of FIG. 9 sets forth the eight basic steps or operations
carried out by the auction-supporting system of FIG. 6. These operations are
indicated at Blocks A through H in FIG. 9. As a overview of the method
hereof, these operations will be first briefly described below, and
thereafter,
each operation will be described in greater detail with reference to FIGS.4A
through 3G, respectively.
As indicated at Block A in FIG. 9, the first major operation carried out
by the auction-supporting system hereof involves registration of each user
Page 110 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
as a bidder, and downloading of auction software to enable the creation of a
globally-synchronized and secure networked client machine through which
the bidder may participate in a time-constrained auction, while competing
against large numbers of other bidders.
As indicated at Block B in FIG. 9, the second major operation carried
out by the auction-supporting system hereof involves the bidder using the
auction client software on the client machine to log on to the auction server
150', and the establish a communication channel therewith.
As indicated at Block C in FIG. 9, the third major operation carried out
by the auction-supporting system hereof involves transmitting encrypted
auction information and start-time from the primary server to the client
machine.
As indicated at Block D in FIG. 9, the fourth major operation carried
out by the auction-supporting system hereof involves characterization of the
client machine's local clock with the master clock on the primary server, a n
d
the synchronization of the client machine display update cycle with the
desired start-time for the auction.
As indicated at Block E in FIG. 9, the fifth major operation carried out
by the auction-supporting system hereof involves presenting the starting bid
(and other bidding information) to the bidder precisely at the start-time, as
determined by a local clock that is characterized with respect to a global
master clock located on the primary server.
As indicated at Block F in FIG. 9, the sixth major operation carried o a t
by the auction-supporting system hereof involves accepting the bidder's
response (i.e. counter-bid), attaching a time-stamp to that response, a n d
transmitting the response and time-stamp to the servers.
As indicated at Block G in FIG. 9, the seventh major operation carried
out by the auction-supporting system hereof involves judging the bids from
all the bidders and determining the bidder placing the highest bid on the
auctioned item. In addition, each bidder's standing or rank is determined
for the auction.
Details Relating The Oration Specified In Block A In Fia. 9
Page 111 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
In FIG. 9A, the suboperations are shown for carrying out the method
of registering and downloading of auction software indicated at Block A i n
FIG. 9 .
As indicated at Block A in FIG. 9A, a potential bidder browses the
contest WWW site ("the auctionweb site"). In the auction web
general, site
will include information about the auction, includingdescriptions of
the
auction client software, auctionqualifications, regulations,
auction
instructions on how to play, information about different varieties of the
auction, lists of prizes and awards offered, advertising, lists of auction
sponsors, lists of previous winners, and the standings or ranks of other
bidders. FIG. 7A indicates the flow of information between the user's client
machine 160 and the web server 110 containing HTML (and/or XML)
encoded documents comprising the auction web site. In this figure, as well
as in FIGS. 7B through 7G, the large arrows extending from one computer to
IS another represent a message or group of messages containing related
information. Messages indicated by 400 in FIG. 7A contain the web auction
being delivered to the client machine 160 from the web server 110.
In addition to the informational content of the auction web site,
provision will also be made to allow the user to register to become a bidder.
As indicated at Block B in Fig. 9A, upon deciding to enter the auction, the
user fills out an on-line registration form, using either standard HTML (or
XML) forms, or forms generated by Java or Active-X applets, or by a CGI
script in a manner well known in the art. During the registration process
indicated at Block B in Fig. 9A, there may also be a qualification procedure,
wherein the user performs some test either of their own abilities and/or of
the capabilities of their computing system. These tests could b a
administered through forms along with the registration process, or could
involve the user downloading and running customized plug-in modules o r
stand-alone applications on his or computing system. Message 405 in FIG.
7A contains registration information being transmitted from the client
machine 160 to the web server 110. This information is encrypted using
standard secure HTTP methods known in the art.
Page 112 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
As indicated at Block C of FIG. 9A, the web server 110 creates a record
in the auction database 130' for this user upon completing receipt of the
registration information therefrom. The registration information is stored i n
this record, establishing the user as a bidder permitted to participate in o n
a
or more on-line mufti-bidder auctions to be promoted (i.e. enabled) the
system of the present invention.
As indicated at Block D of FIG. 9A, a bidder identification (i.e. ID) is
then assigned to the new auction. This ID code uniquely identifies the
bidder for all time, unlike a username, password, e-mail address or other
information that may be changed in the future by this bidder. The bidder
ID is recorded in the bidder database 130', and is used internally by t h a
auction software of the system.
As indicated at Block E in FIG. 9A, the bidder is assigned a username
and a temporary password for use when participating in the auction. The
username may be assigned by the system, or it may be chosen by the user as
a part of the registration procedure. The password is generated randomly,
and will most likely be changed by the auction after logging into the system
the first time. The username and password are stored in the auctio n
database 13 0' .
As indicated at Block F in FIG. 9A, an e-mail message containing the
username and temporary password are sent to the bidder. This e-mail
message from the web-server 110 to the client machine 160 is depicted a s
Message 410 in the data flow process shown in FIG. 7A.
As indicated at Block G in FIG. 9A, the bidder logs onto a secure,
members-only area of the auction web-site using his or her username a n d
temporary password. This area allows the bidder to view and update his o r
her personal information (e.g. username, password, e-mail address,
residence address and telephone numbers, and so on).
As indicated at Block H in FIG. 9A, the bidder downloads the auction
software from the web server 110 to his or her client machine 160, i.e. from
the members-only area of the auction web site. This auction software
download is accomplished using HTTP, FTP, or other file transfer protocol,
Page 113 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
as represented by Message 415 shown in the information flow proceeds of
FIG. 7A.
As indicated at Block I of FIG. 9A, the bidder installs the client
software on his or her machine. This procedure will involve either executing
the downloaded installation file, or initially decompressing the downloaded
file and then executing a setup application contained within the compressed
archive. The installation procedure will install the auction client 340'
application, as well as one or more customized device drivers 350 required
by the bidder's client machine. The device drivers will be used t o
communicate directly with the local clock and any timing hardware (GPS,
etc) used in the client machine. Upon successful installation of the client
software, the bidder's computing system will become a fully enabled "client
machine", and thus ready to participate in a contained competition i n
accordance with the principles of the present invention.
I?etails Relating- The Operation Specified In Block B In Fj,tQ 9
In FIG. 7B, the suboperations are shown for carrying out the method
of logging a bidder onto the auction server I50' indicated at Block B in FIG.
9. In general, this procedure involves a number of "behind-the-scenes"
activities by the various server systems, in addition to the actual log o n
process. Initially, all servers and clients in the system are provided with
the
address of the login server 120 as well as with the login server's encryption
"public key", which is used to send secure message to the login server.
As indicated at Block A in FIG. 9B 1, the primary server 100 transmits a
list of all the participating auction servers to the login server 120. This
message, shown as 420 in FIG. 7B, is encrypted using the login server's
public key. The login server 120 decrypts and stores this message using its
private key.
As indicated at Block B in FIG. 9B1, the login server sends a status
request message to each of the auction servers. In FIG. 7C, this status
request message is indicated by Message 425.
Page 114 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
As indicated at Block C in FIG. 9B1, each auction server 150' sends a
reply in response to the status request message (i.e. Message 425),
containing information about the status of the auction server, including
current loading, indications of maximum server capacity, geographical area
of coverage, and other information. In addition, this reply contains the
auction server's public encryption key. The entire reply, indicated by
Message 430 in FIG. 7C, is encrypted using the login server's public key.
Status request message 425 and response message 430 occur during the
initialization of the auction system, as well as periodically throughout the
operation of each auction enabled by the system hereof.
As indicated at Block D in FIG. 9B1, the bidder must log on to the
system using the auction client application when the bidder decides t o
participate in a particular auction. During this stage of the process, the
auction client machine 160 requests a username and password from the
bidder for the convenience thereof. This username and password may b a
stored locally on the client machine to avoid the bidder having to re-enter
the username and/or password every time he or she participates in a n
auction.
As indicated at Block E in FIG. 9B1, the auction client software 340'
transmits the username and password to the login server 120'. The
username, password, and the client machine's public key are first encrypted
using the login server's public key, and the resulting login request,
indicated
as Message 435 in FIG. 7D, is sent from the client machine 160 to the login
server 120'.
As indicated at Block F in FIG. 9B 1, the login server 120' decrypts t h a
login request, obtaining the username and password. The username and
password are obtained by performing a lookup operation in the bidder
database 130', thereby obtaining a bidder ID.
As indicated at Block G in FIG. 9B1, the bidder ID is transmitted to the
client machine 160, as Message 440 shown in FIG. 7D. The client machine
160 stores this ID for later use.
Page 115 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
As indicated at Block H in FIG. 9B I , the login server 120 selects a n
appropriate name server 150 for this contestant, based on loading,
geographical location, and other factors.
As indicated at Block I of FIG. 9B2, upon selecting an auction server,
the login server 120' sends a login request, indicated as Message 445 in FIG.
3C, containing the bidder ID and the client machine address to the selected
auction server. This message 445 is encrypted using the auction server's
public key. If the login request is granted, then the auction server 1 50'
creates a message containing an auction server access code, indicated as
Message 450 in FIG 7C, encrypted using the login server's public key.
As indicated at Block J in FIG. 9B2, this message (containing the
auction server access code) is sent from the auction server 150' to the login
server 120'. Notably, the auction server access code is a key created using
the bidder ID and the client machine address. This code will only allow t h a
specified bidder to log in using that code.
The login server decrypts Message 450, and then creates a new
message, indicated as Message 455 in FIG. 7D, containing the game server's
address and the auction server access code.
As indicated at Block K in FIG. 9B2, Message 455 is encrypted using
the client machine's public key, and sent from the login server 120 to the
client machine 160.
The client machine decrypts Message 455 containing the game server
address and the auction server access code using its private decryption key.
The client machine then creates a message, indicated as Message 460 in FIG.
7D, containing the bidder ID, the auction server access code, and a client
machine public encryption key. As indicated at Block L in FIG. 9B2, Message
460 is sent from the client machine 160 to the auction server 150' specified
by the auction server address received from the login server 120'. The
auction server 150' responds with Message 463 containing the auction
server public key. At this point, the client machine 160 has successfully
logged on to the auction server 150' chosen for the client machine by t h a
login server 120.
Page 116 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
In FIGS. 9C1 and 9C2, the suboperations are shown for carrying out
the method of downloading an encrypted auction information and start-time
to the client machine indicated at Block C in FIG. 9.
As indicated at Block A in FIG. 9C1, sellers of items to be auctioned
enter auction information (e.g. description of the auction item, minimum
start bid, etc.) into the auction database 140.
As indicated at Block B in FIG. 9C1, at some point before the auction
begins, the auction server 150' sends to the primary server 100, a message,
indicated as Message 465 in FIG. 7F, containing the auction server public
encryption key.
Similarly, as indicated at Block C in FIG. 9C1, the primary server sends
to the auction server 150', a message i n dicated as Message 470 in FIG. 7F,
containing primary server public encryption key.
As indicated at Block D in FIG. 9C l, when a particular auction i s
created, the auction operator or primary server software, accessing the
system through the auction management interface 260', select the action
start-time from the auction database to be used in the auction. Selecting
auction start-times could also be done automatically by the auction
management interface software.
As indicated at Block E in FIG. 9C1, for each auction, the primary
server generates a unique set of encryption and decryption keys.
As indicated at Block F in FIG. 9C1, using the auction encryption key,
the primary server 100' encrypts the auction information.
As indicated at Block G in FIG. 9C1, the primary server 100' creates a
message M1, indicated as Message 475 in FIG. 7F, containing the encrypted
auction information, the auction decryption key, and the auction start-time.
As indicated at Block H in FIG. 9C1, the entire Message (M1) 475 is
encrypted using the auction server's public encryption key.
As indicated at Block I in FIG. 9C2, the entire Message (M1) 475 is sent
from the primary server 100' to the auction server 150'.
Page 117 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
As indicated at Block J in FIG. 9C2, upon receiving the Message (M 1 )
475 from the primary server 100', the auction server 150' decrypts the
Message (M1) 475 and creates a new message (M2), indicated as Message
480 in FIG. 7F, containing encrypted auction information (e.g. bid) and its
start-time.
As indicated at Block K in FIG. 9C2, this new Message (M2) 480 is
encrypted by the auction server using the auction client machine's public
key.
As indicated at Block L in FIG. 9C2, the resulting encrypted Message
(M2) 480 is sent to the client machine.
As indicated at Block M in FIG. 9C2, the client machine decrypts the
Message (M2) 480, and stores the encrypted auction information (e.g. bid)
and the start-time contained therewithin, the client machine 160.
At this point, the client machine 160 creates and begins appending
data to a security verification log file. This encrypted file will contain a
variety of information about the timing of the bid/response process. Among
other data, the security verification log will record the arrival-time (in
local
time) of the encrypted query from the auction server 150'.
Details Relating The Operations Specified In Block D In FIG Without ing
The GSU Of The Present Invention
It is understood that any of the embodiments of the GSU
described above can be used in connection with the auction-supporting
system of the present invention. However, in FIG. 9D, a method is shown for
characterizing the client machine local clock and synchronizing the client
machine display update cycle indicated at Block D in FIG. 9, without utilizing
a global synchronization unit (GSU) as described hereinabove.
As indicated at Block A in FIG. 9D, the local clock is "characterized" b y
each client machine using statistical sampling and curve-fitting techniques,
to determine the functional relationship between the local clock t, and a
global clock t~. This process of characterization can be understood as
follows. Given an abstract idealized "universal clock time", t , a local clock
t,
= f(t) (e.g. the system timer, real time clock, or for greater precision, the
CPU
Page 118 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
clock cycle counter), and a global clock t~ = g(t) maintained on the primary
server, the local clock is said to be "characterized" when it is expressed as
a
- function of the global clock value, t, = f(g-'(ts)). Characterization of the
local
clock with respect to the global clock will be defined as determining some
function h(x) = f(g-'(x)). Over reasonable time periods, and assuming fairly
high quality timing hardware, h(x) will be well approximated by a linear
function. The simplest method of determining this function is to use
standard curve-fitting techniques. If the global clock on the primary server
100' is a GPS-based time reference, the local clock may be characterized very
precisely by also using a GPS reference in the client machine. The GPS
hardware can easily produce an extremely accurate and stable 1 Hz signal.
This signal is connected to one of the CPU IRQ lines. This causes the CPU t o
enter an interrupt service routine every second. At the instant the interrupt
is triggered, t he CPU can record the reading of the local clock (CPU cycle
counter register). After collecting a number of such samples, the function
h(x) may be approximated to a high degree of accuracy.
The statistical information collected in order to determine the clock
characterization function is appended to the security verification log.
As indicated at Block B in FIG. 9D, after determining h(x), the client
machine then uses this function to calculate the local clock start time ( ts,)
corresponding to the desired global clock start-time (t~~) for the auction.
Next the video display update cycle is measured using the local clock.
Almost every video display adapter used in personal computers has a set of
registers used to control and monitor the scanning and refresh periods a n d
rates. One standard function is the ability to query the adapter t o
determine whether it is currently in a vertical retrace period or not. By
using this function over a period of time, and recording the local clock time
each time the display enters vertical retrace, the period and phase of the
display update cycle is determined with respect to local clock time. By
reading the display adapter registers, it is simple to determine the
difference
between the time the last line of the displayed image is drawn and the
beginning of the next vertical retrace. The instant that the last line of the
display is drawn in any display update period will be referred to as the
Page 119 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
display time (t~). Using this calculated period and phase the display times
are extrapolated forward in time to find the display time closest to the
desired start-time.
As indicated at Block C in FIG. 9D, the client machine calculates t h a
error (Ed) between the desired local clock start-time (ts,) and the closest
display update cycle (i.e. display time (td)). Throughout this process, the
times associated with each vertical retrace are appended to the security
verification log.
Since it is desired to have the client machine display bid information
simultaneously on all client machines, the error term Ed is minimized b y
shifting the phase of the display update cycle. A value of 0 for Ed indicates
that the display will complete drawing the given image at the precise
moment of the start-time. The phase of the display update cycle is adjusted
by increasing or decreasing the display update period over a number of
update cycles. This period is typically determined by several registers o n
the display adapter, controlling the so-called "vertical total", "horizontal
total", and the "dot clock". The vertical total is the total count of lines,
both
displayed and non-displayed (within the vertical blanking and retrace
period), that make up one display update cycle. Similarly, the horizontal
total measures the number of pixels, both displayed and within the
horizontal blanking and retrace period. The dot clock frequency determines
the number of pixels per second rendered to the display. By adjusting any
one of these three values temporarily, the period of the display update cycle
may be changed, again temporarily. Although it might be possible to align
td with t~, within a single update cycle, it is probably not desirable to make
such a large modification to the display update period, since this can cause
monitor clicking and may temporarily disrupt the displayed image. Instead,
the display update period is modified only slightly (perhaps adjusting the
vertical total by one or two lines), and the period is left adjusted until
enough phase shift accumulates to reduce Ed to near zero, at which time the
display update period is restored to its original value. This alignment of the
display update cycle with the desired start-time satisfies the criteria set
forth
at Block D in FIG. 9D.
Page 120 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
Note that depending on the accuracy of the clocks, the frequency drift
of the clocks and the refresh update cycle, and the distance into the future
that the display time is extrapolated, it may be necessary to repeat the
alignment procedure to reduce these errors. The display time alignment
procedure should be considered an ongoing process, perhaps being
performed concurrently with other steps in the contest process. As always,
information about this process is recorded in the security verification log,
providing a continuous trace of the operations taking place and the timing
of those operations.
Details Relating The Operation Specified In Block F In FI 9 When Not sing
The GSU Of The Present Invention
FIGS.9E1 and 9E2 show the suboperations for carrying out the
method of presenting the auction information to the bidder at the auction
start-time indicated at Block E in FIG. 9, for a system that does not utilize
a
global synchronization unit, as shown in FIG. 2D, for example. At this point,
the encrypted bid information has been stored on the client machine, t h a
start-time is known in terms of the local clock, and the display time has been
aligned with the desired start-time.
As indicated at Block A in FIG. 9E1, the auction server opens bidding
for item A (e.g. an article to be auctioned) at time t, .
As indicated at Block B in FIG. 9E1, the auction server is able to accept
bids for item A that are time-stamped after t, .
As indicated at Block C in FIG. 9E1, the client machine sends a bid for
item A to the auction server at time t~ and time-stamps its time of
transmission using the local clock which has been characterized using the
GPS, as described above.
As indicated at Block D in FIG. 9E1, the auction server receives the bid
from the client machine at time t~ and time-stamps its time of receipt using
the local clock which has been characterized using the GPS, as described
above.
As indicated at Block E in FIG. 9E1, the auction server sends to the
client machine a confirmation of the bid receipt containing the time-stamps.
Page 121 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
As indicated at Block F in FIG. 9E1, the auction server updates all
competing client machines (i.e. bidders) with the highest bid information for
item A.
As indicated at Block G in FIG. 9E1, the system continues the
operations set forth at Blocks C and D until the auction server no longer
receives any bids for a predetermined amount of time (e.g. x seconds).
As indicated at Block H in FIG. 9E1, the auction server sends all
participating client machines a notice of final bids at time t4.
As indicated at Block I in FIG. 9E2, the auction server waits a second
predetermined time period (i.e. y seconds) for a new bid from any client
machine participating in the auction.
As indicated at Block J in FIG. 9E2, at t4 + y seconds, the auction server
closes the bidding process.
As indicated at Block K in FIG. 9E2, the auction server waits z seconds
for any bids time stamped prior to t4 = y seconds.
As indicated at Block L in FIG. 9E2, the auction server determines
whether a new higher bid has been received, and if so, then returns to Block
F in the process loop.
As indicated at Block M in FIG. 9E2, if the auction server determines
that at Block L that no higher bids have been received, then the auction
server determines that item A is sold to the highest bidder, and then t h a
auction server updates all client machines with the final sales price at which
the item has been sold.
By carrying out accurate time-stamping at both the client and server
ends of the auction process, each bid message carries two time-stamps (i.e.
one produced at the client machine and one at the auction server) and
therefore can be reliably accepted based upon the submission-time of the
bid at the client machine and not upon the receipt-time thereof at the
auction server. Consequently, this enables auction server to accept the
highest bid provided that its time of bid placement at the client machine
falls within the predetermined bid window, and not when they are received
at the server. In a fast paced, real-time auction, this feature of the present
Page 122 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
invention might be a significant factor i n achieving a fundamentally fair
auction process.
The high-level bidding process described above has been described i n
connection with an auction-supporting system having GSP-enabled client
machines as shown in FIG. 2D. It is understood, however, other types of
client machines, such as those disclosed in Figs. 2D1 through 2D5, can be
used to practice the auction-supporting system and method of the present
invention. Such modifications are described hereinabove in connection with
the generic contest-promoting system of the present invention.
In general, the auction-supporting system of the present invention can
be used to auction off virtually any item of value such as, for example:
antiques; commodities; consumer goods; personal articles and effects; real
estate including tracts of land as well as condominiums; licenses to use
intangible properties (e.g. bands of the electromagnetic spectrum, patents,
etc.); transferable club memberships and subscriptions; and the like.
While the auction-supporting system of the present invention has
been described above in connection with an Internet-based process
involving many bidders simultaneously bidding on a single auction item, it
is understood that such bidders could be bidding on multiple items in a
mufti-item combinatorial auctions, as well as any variations thereof.
In many applications, the bidders will be human beings using GSU-
enabled client machines. However, it is understood that there will be m a n y
present and future applications in which the bidders will be intelligent
software-based robots (commonly referred to as "BOTS") programmably
engaged in real-time, time-constrained competition for valuable resources
over the Internet. In such embodiments of the present invention, the client
machines can provide a h ost environment for these hots to participate i n
time-constrained contests and other forms of competitive behavior for
recognition and/or rewards in accordance with the principles of the present
invention.
It is also understood that the auction-supporting system of the present
invention can be used to support many different types of auction-based
processes including, for example, the sale of financial securities (e.g.
s.tocks
Page 123 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
and bonds), options, futures, commodities, foreign currency, and the like,
wherein a group of competitors or contestants (e.g. bidders) are required t o
compete for the acquisition (e.g. purchase or lease) of an item of value in a
time-constrained manner over the Internet or other information network.
Modifications of and FxtPn ion o The y~tPm of the Illu tra ive
Embodiments
Although the illustrative embodiments of the global synchronization
unit (GSU) utilize a global positioning system (GPS) receiver as a source of
time and space data, the present invention contemplates the existence and
possible value of current and future alternative means of obtaining time a n d
space information.
For example, Loran-C systems are widely used for determining
maritime location and time information, and is also available for land-based
systems in many parts of the world. This type of system could be used in a
similar manner to the GSP receiver, although with a somewhat lower
precision and accuracy.
Time signals can be produced from a periodically-synchronized free-
running clock (ranging from a standard quartz-crystal based clock to a n
atomic clock). The accuracy of these signals of course depend on the
stability of the clock and the frequency at which the clock is synchronized
with some global clock.
Time signals are also available using a standard radio receiver from
the NIST WWV and WWVH time and frequency service broadcast stations.
Because the time signals are sent by radio waves from one or more fixed
transmitting towers, there is a time latency due to the speed of propagation
of the radio waves. This latency is affected not only by the straight line
distance to the transmitter, but also by the actual path taken by the radio
waves to reach the transmitter, which may involve reflections from natural
or man-made objects. This latency may be compensated to some extent
using the physical location of the receiver unit. After determining the unit's
location, using cellular telephone data, user-entered location information, o
r
other means, the estimated latency for that location can be determined,
Page 124 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
using a lookup table or other means. The expected latency can then b a
compensated for to arrive at a more accurate time value.
_ Because of the phenomenal popularity of the GPS system, it is certain
that more advanced time and space determining systems will be d eveloped
in the future. The basic GSU concepts will surely benefit from the
improvements in performance and convenience provided by such
anticipated developments in these systems.
Any attempt to synchronize the processing of data at distributed
locations, where the data originates at a single central location, is
fundamentally constrained by the latency and bandwidth of the connections
between the distributed locations and the central location. The latency of
the communications channel is a measure of the time delay between the
instant a piece of information is sent from the originator and the instant
that information is received by the receiver. Latency is expressed in units of
time, for example a "1 second latency". The bandwidth is a measure of the
rate of information flow from sender to receiver in terms of information
units per unit of time, for example bits per second. Assuming a one way
flow of information from the sender to a set of receivers, where the
information is broken down into discrete units (packets, messages, files,
etc),
as might be the case with stock "ticker" information, it may be desirable t o
synchronize the times that these units are made available to the receivers.
In other words, for a given unit sent from the sender to all the receivers, i
t
is desirable that the unit to becomes available for use on all the receivers
simultaneously, despite the differing latencies of the various connections.
This goal is accomplished by considering the expected value of the longest
latency among all the connections. In order for the unit to be received b y
each receiver before the desired synchronization time (or start-time), the
units must be sent out to each receiver at a time early enough to at least
compensate for the latency to that receiver. In fact, the data unit must b a
sent earlier still to allow for the stochastic nature of communications delays
as well as to allow for the time for the receiving GSU to process and decrypt
the information.
Page 125 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
Thus, in a stock market "ticker-tape" application, stock prices are
determined at a central location as a function of the various offers to b a y
and sell (and other factors) in effect at that time. When a stock price
becomes available at this central location, it is then sent to all of the
remote
GSU-equipped terminals, along with an indication of the desired time t o
display the stock price (the "start-time"). This desired display time must b a
sufficiently delayed from the time it is sent from the central location t o
allow for network latency a nd for the GSU processing time. If the worst case
latency was SOOms, and the processing time was IOOms, then the display
time must be at least 600ms after it is sent out. However, this stock price is
just one of a stream of stock prices being produced at the central location
and distributed to the remote GSU-equipped terminals. The maximum rate
(stock-prices per second) of display is constrained by several factors. First,
we are limited by the GSU processing time. In this hypothetical case the GSU
processing time is IOOms, so the maximum display rate is 10 prices per
second.
The bandwidth of the communication channel also is a factor when
looking at a long term, continuous display rate. The bandwidth, as well as
the size of the stock-price-containing messages limits the rate (stock-prices
per second) of message sent over that link. Notably, the GSU processing
time depends on whether the information is actually being displayed on a
monitor, or simply being decrypted and given to a CPU. If the information
is to be displayed at a time-precision moment on the order of a few
milliseconds or less, then the display must be synchronized, which can be a
relatively time consuming process (on the order of many milliseconds to
several seconds). This requirement can be avoided if the start-times are
chosen to be in synchronization with the display update rate, however. For
example, if all the displays were synchronized at a common frequency of
1 OOHz, and the start-times were chosen as integer-multiples of 10 m s, then i
t
would only be necessary to perform the full monitor synchronization
procedure once, after which the stock prices could be updated at a much
faster rate (approaching the bandwidth of the communications channel). In
Page 126 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
actual practice, multiple-stock prices can be sent as a single unit, to reduce
some of the GSU processing overhead.
In each of the client machines of the present invention, there is
provided a GSU, which combines a GPS clock with an encryption mechanism
for digitally signing data in order to provide a secure and verifiable time-
stamp on each response from each competitor. This security measure may
be compromised in only two ways: (1) by physically dissecting the GSUand
extracting the secret key; or (2) by a computational-based attack to
determine the secret key (a very time consuming process dependent on the
number of bits used in the algorithms).
In order to prevent physically dissecting the GSU associated with each
client machine, the present invention contemplates the use of tamper
evident seals on the GSU (which would be submitted to receive the contest
award), as well as techniques which result in the automatic destruction o r
disabling of the GSU upon tampering.
In order to render computational-based attacks on the GSU very
difficult using ordinary computation means, the present invention
contemplates using sufficiently long keys in the GSU so that the time
involved to decipher the key would be very long, in accordance with
standard security practices.
The GSU may also be used to test motor skills of human subject t o
detect their ability to perform a particular job--that is, determine if their
motor skills are impaired by lack of sleep, alcohol, or drugs. For example,
remote timed testing of truck drivers. Coupling tests with a secure camera
would insure accuracy.
Alternative Apnlicari~ns For The Corr~neririon/Contest Promo ink ~, s P s
And Methods f The Presenr Invention
As explained hereinabove, the Internet-based competition and contest
promoting systems and methods of the present invention can be used in the
securities trading industry so that truly real-time price quotes and order
execution is achieved, thereby creating a level playing field for everyone
with a financial position in the market. Also, application of the present
Page 127 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
invention to real-time auction processes will also create a level playing
field
for all bidders participating in on-line auctions.
_ The system and methods of the present invention can also be applied
to the filing of patent and trademark applications in p atent offices world-
s wide, as well as in connection with any legal document filing process where
the time of filing can be of importance with respect to the rights of the
parties involved. By providing truly accurate time-space stamps on legal
documents, the rights of members of our society can be more fairly
championed, regardless of where such parties may be physically o r
electronically situated.
In addition to the Internet-based game, securities trading, and auction
processes described in detail above, the Internet-based competition a n d
contest promoting systems and methods of the present invention can b a
used in connection with various other types of business application models
including, for example: marketing driven models where contestants compete
for prizes by answering questions about products and/or services;
game/puzzle driven models where contestants compete for prizes b y
participating in games (e.g. query-based games) or solving puzzles (e.g.
cross-word puzzle); education models where contestants compete for prizes
by answering questions about educational topics; where contestants, as
members of competing teams in a recreational league, compete for prizes b y
answering questions on particular topics (e.g. sports, business, recreational
activities, etc.) or by responding to Invitations To Respond (ITRs)
simultaneously served and displayed to a large number of competing teams,
each having one or more designated representatives participating in the
competition; where contestants, as members of competing corporations in a
particular market, compete for prizes by answering questions on particular
topics relating to their business, or by responding to Invitations To Respond
(ITRs) simultaneously served and displayed to a large number of competing
corporations, each having one or more designated representatives
participating in the competition; where contestants, as members of
competing teams in a sports league, compete for prizes by answering
questions on particular topics (e.g. sports, business, recreational
activities,
Page 128 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/LTS00/05093
etc.) or by responding to Invitations To Respond (ITRs) simultaneously
served and displayed to a large number of competing teams, each having
one or more designated representatives participating in the competition.
Time-Snace Stamnin,g Based Oyject Trackina,~vstem and Method Of The
Present Invention
In general, the GSU technology of the present invention can be used i n
numerous applications involving the collection of time and/or space
coordinate information in relation to objects and prespecified frames of
reference. With reference to FIGS. 16 through 22, several applications will
be described with time-space coordinates of objects (e.g. animate a n d
inanimate objects alike) are collected, recorded and analyzed in order t o
track the position of such objects and/or determine the motion thereof
within the space-time continuum. As will be described hereinafter, such
basic functionalities enabled by the GSU of the present invention can
enabled a wide array of novel service applications deliverable over the
Internet and other globally-extensive networks.
In FIG. 16, there is shown a time-space (TS) based stamping based
system for tracking mobile animate as well as inanimate objects including,
for example, human beings, animals (e.g. pets, cattle, etc.) and articles of
property, mobile/moveable relative to a globally-defined coordinate
reference system, by internal or external forces. As shown in the illustrative
embodiment, each object being tracked carries an ultra-compact o r
miniature client-type computing/network device embodying the global
synchronization unit (GSU) or extended GSU of the present invention, as
possibly other data collecting/sensing devices, as will be described i n
connection with the alternative embodiment shown in FIGS. 19 through 22.
As shown in FIG. 16, the TS-stamping based object tracking system of
the present invention comprises: a plurality of wireless client-computing
devices (i.e. machines) of ultra-compact or miniature construction
embodying the GSU 175 shown in FIG. 2D2 or the extended GSU 175 shown
in FIG. 2D5, each of which is operably connected to the infrastructure of the
Internet (or other globally-extensive packet switching digital
Page 129 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
communications network), and is adapted for embodiment within o r
otherwise supported upon an object to be tracked, using suitable device
_ mounting mechanisms and devices known in the arts; a Web-based
Owner/Object Registration Information Server 1003, operably connected t o
the infrastructure of the Internet, for access by any Web-enabled client
machine 1010 to create an Object Record and Owner Record in a Web-
enabled RDBMS Owner/Object 1001 (during the Object/Owner Registration
Process), for each object to be tracked by the object tracking system; TS-
stamping Based Tracking Server 1000, operably connected to the
infrastructure of the Internet, and in wireless communication with each GSU-
enabled client-computing device 160' registered with the system, for (i)
collecting time-space (TS) coordinate data therefrom as the underlying
object being tracked is moved about the planet as shown in FIG. 17A (during
mobile tracking applications) or in FIG. 17B (during stationary object
movement detection operations); (ii) storing such collected TS coordinate
data in a Owner/Object RDBMS 1001, wherein each object, its owner, a n d
other information are preregistered during the Object/Owner Registration
Process carried out over the Internet using a simple Web-enabled client
machine 1010; and (iii) analyzing collected TS coordinate data on a real-
time basis to (1) determine the precise location of the object at any instant
in time, relative to the global coordinate reference system, or a local
coordinate reference system derived from the global coordinate reference
system using homogeneous transformations, or (2) whether the object has
been moved from a particular location without authorization over a given
time frame; a Web-based Object/Owner Registration Server 1003, operably
connected to the infrastructure of the Internet, and the Web-enabled
Object/Owner RDBMS 1001, for enabling owners of objects to be tracked,
and/or the agents thereof, to use any Web-enabled client machine 1010 t o
register themselves and their property with the system by creating, editing
and deleting Owner Records and Object Records linked thereto maintained
in the Owner/Object RDBMS 1001; and a Web-based Object Trajectory
Monitoring Server 1002, operably connected to the infrastructure of the
Internet, for enabling registered owners to monitor in real-time the position
Page 130 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
(and possibly other vital characteristics) of his or her object being tracked
by the system, by reviewing TS data tables, maps, graphs, images and/or
speech-synthesized reports displayed on the GUI Web-browser of a Web-
enabled client machine, for analysis and subsequent action.
The GSU-Enabled Wireless lient omputing Device of Present Invention
As shown FIG. 16A, each wireless client-computing device employed i n
the mobile object tracking system of FIG. 16 comprises: a micro-computing
platform with hardware and software components; a global synchronization
unit 175 and a client computing platform supporting various hardware a n d
software layers including client software such as a tracking client
application
340', tracking hooks and drivers 350', and a wireless communications
network interface 215' and the like. In the illustrative embodiment, each
client computing platform may be realized as a standard palm-computer,
augmented by the addition of several software and hardware components,
or by Java virtual machine (JVM) chip augmented by a GSU of the present
invention. In general, each client computing platform will include the
operating system 240, standard device drivers 280, clock or timer hardware
290. Each client computing device communicates with the wireless
communications network through hooks and drivers 350' with the
underlying output and timing hardware. In order that each GSU-enabled
client network device can be uniquely identified among potentially millions
of such devices, each GSU-enabled client network devices is programmed
with a unique identification code (UIC) at the time of manufacture, o r
thereafter. Preferably, this UIC is written into a ROM chip aboard the GSU
chip at the time of manufacture. As will be described hereinafter, this UIC
will be used i n connection with the process of generating digitally-signed
time-space (TS) stamps from the GSU-enabled client network device d a ri n g
its trajectory through the time-space continuum.
As shown in FIG. 2D2, a basic global synchronization unit (GSU) 1 7 5
for use within a GSU-enabled client network device of the present invention
would be realized in the form of an integrated circuit (IC) chip comprising: a
GPS receiver 700 connected to an antenna 730; and a central processor 7 5 0
Page 131 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
connected to the GPS receiver, for (i) storing the GSU's UIC and desired
trigger time/locations, (ii) calculating digital signatures verifying the
- authenticity of the data including, for example, time and space information
provided by the GPSreceiver 700, GSUinput data from input sources and
sensors, and the UIC of the GSU chip, (iii) performing encryption a n d
decryption functions on selected items of collected data, and (iv) performing
other functions described hereinabove.
Aboard the GSU-enabled client network device, the GSU chip 1 7 5
periodically samples its input port for client input data (e.g.
biophysiological, or other state data of the object or its ambient
environment). In the case of not receiving any data at its input port, the
GSU chip can be designed to automatically generate an UIC (or default) data
element at each input sampling instant, and then use the data element for
time-space stamping operations at that sampling instant. Notably, the use
of a UIC-indicating data element serves to uniquely identify the
corresponding GSU chip at each instance in time along the time-space
continuum. In such embodiments, the UIC can be encrypted for added
security measures. Then the GSU chip 175 generates a time and space
stamp for each input sampling instant. The GSU chip uses digital signature
techniques to create (i.e. compute) a digital signature for the set of data
comprising: the UIC-indicating (or default) data element generated at each
GSU sampling instant; and the time and location data of the GSU chip at the
time of input data sampling within the GSU chip. Notably, the time of GSU
input data sampling will be expressed in terms of a globally time-
synchronized time measure derived by the GSU chip, whereas the location of
the GSU at the instant of GSU input sampling would be expressed in terms of
a globally referenced space/location measure derived by the GSU chip. The
set of data and the computed digital signature applied thereto produces a
digitally signed data package. The digitally signed data package is then
sent over the network to the TS-stamping based tracking server 1000 t o
serve as a record of the time-space trajectory point of the uniquely
identified GSU chip, and associated object, at a particular instant in time.
At
a later time, this record can be used to prove that the GSU chip ( an d
Page 132 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
associated object) existed at the space-time coordinates indicated by the
time-stamp contained within the digitally-signed data package received a t
the TS-stamping based tracking server 1000.
Web-Based Owner/Ob~iect Registration Information Server of the Pre ent
Invention
As shown in FIG. 16C, the Web-Based Owner/Object Registration
Information Server 1003 comprises: a standard I/O 220; a high performance
network interface 210; standard device drivers 280; and the operating
system 240. These components cooperate to support the operation of the
web server software 360. The web server software 360 consists of an HTTP
daemon, along with various scripts and utility programs used to handle
owner/object registration and to perform object tracking service updates as
such information becomes available. Typically, the web server software 360
provides support for HTML, Java, and other standard protocols and web
technologies.
As shown in FIG. 16C, a number of system components are used t o
distribute and present HTML (or XML) encoded documents (with or without
Java or Active-X applets) and associated web content to the owners. Web-
based Owner/Object Registration Servers 1003 shares a common networked
Owner/Object RDBMS 1001 which contains registration and other
information. In addition to providing the Owner/Object Registration WWW
Site, the Owner/Object Registration Web Server 1003 also distributes the
Owner/Object information management (OOIM) client software to Web-
enabled client machines I O1 0 used by owners to monitor their registered
objects. Such down loading operations can be carried out using the HTTP o r
FTP protocols. Before downloading OOIM client software, each owner is
required to register on the Web-based Owner/Object Registration Server
1003. Registration involves filling out a web-based (e.g. HTML-encoded o r
XML-encoded) form containing the necessary personal and client machine
information and submitting that form to the web server.
Web-Based Owner/Object Tracking Information Server of the Presenr
Invention
Page 133 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
As shown in FIG. 16B, the TS-Stamping Based Tracking Server 1000
employed in the system of FIG. 16, comprises a number of software and
hardware components. As shown in FIG. 16B, the structure of the tracking
server 1000 is d escribed using the layered structure of a standard general
purpose computer, wherein the hardware components are shown at the
lowest level, with successive layers of software functionality disposed above
them. Each layer of components utilizes and builds upon the services and
capabilities of the lower layers, most often only directly interfacing with
the
layer immediately below it. In the server, the low level hardware includes a
GPS receiver 170, and high precision clock and timing hardware 200
synchronized to a global time reference using the GPS receiver. In addition,
the high performance network interface hardware 210 is used to connect the
server 1000 to the communications network 190. These hardware
components are in addition to the standard I/O and other hardware 2 2 0
typically provided on a high-end network server, such as the SUN
EnterpriseTM server running the SolarisTM platform, by Sun Microsystems, Inc.
of Palo Alto, California. Above the hardware level are standard a n d
customized device drivers 230 that control and communicate directly with
the hardware. The device drivers are used by the operating system 240 and
higher-level applications so that direct hardware programming is not
necessary. At the top level of FIG. 16B, an object-tracking related
application, called the TS-tracking server daemon 242, is supported. This
piece of software manages the sequence of operations for the TS-stamping
based object tracking process as a whole, as well as managing the
communication of collected time-space (TS) coordinate data between the
tracking server 1000 and with the Owner/Object Registration RDBMS 100 I ,
where such data is stored.
Owner/O~j~t Record RDBMS of The Pres nt Invention
In FIG. 18, a database table is shown for storing owner records, object
property records, and object trajectory records. Owner records and object
Page 134 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
property records are created during the Owner/Object Registration Process
described hereinabove using a Web-enabled client machine 1010 accessing
the Owner/Object Registration Information server 1003. In general, such
records can be changed at any time by the owner using the password
assigned thereto at the time of initial registration. Owner records will
generally contain information identifying the owner of one or more objects
to be tracked by the system of the present invention, his or her address, a n
d
other contact information. In some instances, it may be desired for the
owner to remain anonymous and therefore will register with an alias, o r
using a numeric or alphanumeric code assigned thereto by another Web-
based information server, to maintain the privacy of the owner. Various
sorts of techniques can be employed to protect the identity of the owner, i n
relation to particular objects being tracked, in various applications. As
shown in Fig. 18, each object property record is uniquely linked or related
to a particular owner record in the RDBMS 1001 and typically will uniquely
identify the object being tracked. Such object identification can be by way
of a title assigned to the object by its owner, by a unique bar code symbol o
r
other code assigned to the object by the owner or system administrator.
Such object property records can also describe unique properties a n d
characteristics of the object for insurance reasons, proof of ownership, a n d
the like. Each object tracking record is uniquely linked or related to a n
object property record maintained within the RDBMS 1001, and in the
illustrative embodiment, contains time-space coordinate data generated by a
mobile GSU-enabled client-computing machine carried by the object being
tracked by the system. During the object tracking process, TS-stamping data
collected by the Object Tracking information server 1002 is automatically
stored in the RDBMS 1001 in a linked relationship with its associated object
record, as shown schematically in Fig. 18.
Web-Based Objiect Trajectory Monitoring Information Server Of Th Pre ent
Invention
As shown in FIG. 16D, the Web-Based Object Trajectory Monitoring
Information Server 1002 comprises: a standard I/O 220; a high performance
Page 135 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
network interface 210; standard device drivers 280; and the operating
system 240. These components cooperate to support the operation of the
web server software 360" which serves up a Object Trajectory Monitoring
WWW site accessible to registered owners using from any Web-enabled client
machine 1010. As shown in Fig. 16D, the web server software 360" consists
of an HTTP daemon, along with various scripts and utility programs used t o
handle object trajectory monitoring operations carried out in response to
requests by owners as to the trajectory of a registered object over a period
of time (i.e. position of the registered object plotted as a function of
time),
as illustrated in Figs. 17A and 17B. In order to respond to owner requests
for object trajectory information, the Web-Based Object Trajectory
Monitoring Information Server 1002 has network access to t h a
Owner/Object RDBMS 1001 via a common gateway interface (CGI) or Java-
servlet based interface to the RDBMS 1001. Typically, the web server
software 360" provides support for HTML, Java, and other standard
protocols and web technologies well known in the art.
As shown in FIG. 16D, a number of system components are used t o
distribute and present HTML (or XML) encoded documents (with or without
Java or Active-X applets) and associated web content to the owners o r
custodians of objects registered with the system. Web-based Object
Trajectory Monitoring information server 1002 communicates with the
common networked Owner/Object RDBMS 1001 which contains owner and
object registration information as well as other object trajectory information
(e.g. TS data). Also at the Object Trajectory Monitoring Web Site, owners of
authorized custodians can download the Object Trajectory Monitoring
(OTM) client software using HTTP or FTP protocols. Before downloading
OTM client software, each owner is required to register on the web-based
Object Trajectory Monitoring Information Server 1002. Registration
involves filling out a web-based (e.g. HTML-encoded or XML-encoded) form
containing the necessary personal and client machine information a n d
submitting that form to the web server.
Communications Network Of The Ob~ecr Tracking~vstem of The Prey nt
Invention
Page 136 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
The final component of system shown in FIG. 16 which deserves
mention is the communications network 190. In general, the
communications supported by the communications network 190 can b a
carried out using a variety of different communications methods. In
general, each computer or device in the system will establish a connection o r
connections to one or more of the other computers through the network
190. In practice, these connections will be "virtual" connections through a
general network such as the Internet, rather than as a direct point-to-point
physical connection. In the illustrative embodiments disclosed herein, the
communications network 190 is a packet-switched data communications
network running the popular Transmission Control Protocol/Internet
Protocol (TCP/IP). Thus each server computer connected to the
communications network 190 will have a statically assigned IP address, while
each client machine connected thereto will have either a statically o r
dynamically assigned IP address in a manner well known in the a rt.
Three Basic Mode of vstem Operatiow Owner/Obie~r Reaistrarion Ob,lect
Tracking & Object Moniterinø
In general, the object tracking system of the present invention has
three primary modes of operation, namely: owner/object registration mode;
object tracking mode; and object trajectory monitoring mode. Each of these
modes of operation will be described below.
Owner/Objiect Regi~traric~n ProcPSS of The Present Invention
During the owner/object registration mode, the owner of an object to
be tracked by the system would first obtain a GSU-enabled client network
device that is compatible with the particular TS-stamping based object
tracking service to be used in the case at hand. In practice, each GSU-
enabled client network device could be realized as the size of a conventional
beeper or pager, but ideally smaller and lighter for attachment to various
types of objects without causing an inconvenience. The form factor in which
the housing of the device is realized will depend on the application at hand.
Page 137 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
For example, in the shipping industry, it might be desirable to realize
the GSU-enabled client computing/network device as a wireless, ultra-low
profile security tag affixed to a package in a tamper-indicating manner so
that once affixed to the package, and registered with the web-based object
tracking system, the GSU-enabled device will automatically generate a n
"device is being tampered with or removed from package" message at the
input of the GSU chip 175, which will be received by the TS-Stamping Based
Tracking Server 1000, causing the generation of an alarm message with
respect to the object/owner associated with the shipped package. It is
understood that while the shipper who affixed the wireless GSU tracking
device to the package may not be the owner of the package, this entity may
nevertheless be treated as such for purposes of administrating the Web-
based object tracking services) of the present invention.
In general, there are many ways in which to generate data inputs a t
the GSU's input port indicating that "the device is being tampered with or
removed from its package". Such data message generation methods can b a
based on electrical, mechanical-electrical, acoustical-electrical, and optical-
electrical principles well known in the security arts. One such mechanism
might involve encasing the GSU chip and supporting platform within a
device package having a spring-biased surface-sensing pin projecting from
the mounting surface of the device. The surface-sensing pin would b a
constructed so that it retracts when pushed against the surface of the
package to which the GSU-enabled device is to be mounted, a n d
automatically projects out therefrom when the device is removed from the
package's mounting surface, automatically generating a binary signal at t he
input port of the GSU c h i p .
During the registration process, the GSU-enabled device would b a
affixed to the package, setting the surface-sensing pin within the device a t
an appropriate time. Then, when the device is removed from the package,
by either an authorized or unauthorized person, the tracking system will
automatically detect this event and inform the package's owner or shipper,
depending on the particular application/service being carried out.
Expectedly, such GSU-enabled tags will have many other applications across
Page 138 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
diverse industries requiring the information collection/detection
functionalities of the present invention.
- Having acquired a GSU-enabled client network device, the owner o r
agent thereof uses a web-enabled client machine to log-on to the
Owner/Object Registration Information server 1003 and register himself an d
one or more objects to be tracked by the Object Trajectory Tracking
information server 1002. The registration process will typically involve
filling out HTML-encoded forms and sending them back to the server for
processing. During processing of such completed forms, the Owner/Object
Registration Information server 1003 creates in the Owner/Object
Registration Database (i.e. RDBMS) 1001, a data record for the owner of each
object to be registered with the system, as well as for each such object,
including the UIC assigned to the GSU chip to be used to track and monitor
the time and space trajectory thereof.
Object Tracking Process of The Present Inven ion
Once a GSU-enabled client network device has been attached to a
registered object, and the registration process has been completed, the TS-
stamping based object tracking server 1000 will attempt to communicate
with the wireless GSU-enabled client network device over the wireless IP-
based packet switching network of the system. Once a connection has been
established, the TS-stamping based object tracking server 1000 will perform
all sorts of diagnostic checks to see that the wireless GSU-enabled network
device is operating properly. Such checks will typically include (i) TS data
collection and transmission by the GSU chip, (ii) battery-power level
monitoring using battery-power level monitoring module 305, as well as
(iii) other diagnostic checks aboard the wireless network device. Typically,
the results of such diagnostic tests will be posted for review by the owner a
t
the Object Trajectory Monitoring WWW Site served by the Web-based Object
Trajectory Monitoring information server 1002. Notably, the owner will
have to log-on to this site by password, or can be immediately switched over
thereto from the Owner/Object Registration WWW Site served by the Web-
based Owner/Object Registration information server 1003.
Page 139 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
Once all systems are determined to be working properly, the time an d
space coordinates of the GSU-enabled client network device carried on the
owner's object will be automatically tracked every input sampling period
within the GSU chip thereof, as described hereinabove. Periodically, the GSU-
enabled client network device will monitor the battery power level of its
battery power supply and send information representative of this system
state to the TS-Stamping Based Tracking Server 1000.
During mobile object tracking processes, the time-space coordinates of
the GSU-enabled client network device are automatically collected by the TS
Stamping Based Tracking Server 1000. FIG. 17A shows an exemplary locus
of TS data collected by the system while the object being tracked is
transported through space.
During the object m ovement detection processes, the TS-Stamping
Based Tracking Server 1000 will collect TS data samples having substantially
the same space coordinates, indicating that the object has not been moved
from its location registered with the system (i.e. via data stored in t h a
Owner/Object RDBMS 1001). When the object is moved from this registered
location, either by authorized or unauthorized personnel, the TS-Stamping
Based Tracking Server 1000 will collect TS data samples having space
coordinates that fall outside the registered location, as indicated in FIG.
17B.
Data processing algorithms can be used to process TS data within the
Owner/Object RDBMS 1001 to detect such object motion or movement. Also,
using knowledge of the data input sampling rate (TS) within each GSU chip,
the instantaneous velocity of the object (vX) between pairs of position
locations along the x axis of the coordinate system (x 1 and x2) can b a
readily computed using the formula vX= [xl -x2] Ts. Similarly, the
instantaneous velocity of the object along the y and z axis can also b a
computed similar formulas known in the art. Such computed velocity
measures can be stored in the Owner/Object RDBMS 1001 and visually
displayed on the Web-Based Object Trajectory Monitoring WWW Site for
viewing by the object's owner logged thereon using password protection.
Objiect Monitoring Process of The Pre enr Invention
Page 140 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
Each object owner can log-on to the Object Trajectory Monitoring
WWW Site and monitor the trajectory of any one of his or her registered
_ objects. Such monitoring operations are carried out using any Web-enabled
client machine 1010 pointing to the URL at which the Object Trajectory
Monitoring WWW Site is located. During trajectory monitoring operations,
the Object Trajectory Monitoring Server 1002 accessed information stored in
the Owner/Object RDBMS 1001. While the TS-Stamping Tracking Server
1000 tracks GSU's in terms of its assigned UIC, each owner can his or h a r
object using the name/title that the owner has assigned to the object.
ADnlication of The TS tam ing Based Ob~iecr Trackina~vstPrn Of The
Present Invention
The object tracking system described above can be modified t o
perform biophysiological data collection as well as TS data collection. This
system modification will be useful in applications where vital characteristics
of living things (e.g. humans and animals) are to be monitored in real-time,
in addition to tracking the time and space coordinates thereof. This system
is achieved by replacing the GSU-enabled client network d evice shown i n
FIG. 16A with the GSU-enabled client network device shown in FIGS. 19A a n d
19B. As shown, GSU-enabled client network device 160" includes a
biophysiological data sensor (e.g. pulse sensor, EKG sensor, or other
biophysiological signal sensor) 309, as well as all other subcomponents
contained in the GSU-enabled client network device shown in FIG. 16A.
Also, the system in FIG. 16 is further modified by replacing TS-Stamping
Tracking Server 1000 shown in FIG. 16B with the TSB-Stamping Tracking
Server 1007 shown in FIG. 20 which is capable of receiving and decrypting
biophysiological data as well as TS data contained within each digitally-
signed data package transmitted by the GSU-enabled client network device
175". Also, the Owner/Object RDBMS 1001 specified by the table in FIG. 1 8
is replaced by the Owner/Object RDBMS 1001 specified by the table in FIG.
22.
Page 141 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
Owner and object registration with this modified system can b a
carried out in substantially the same manner as carried out in the system of
FIG. 16. schematic representation of an exemplary locus of time, space a n d
biophysiological coordinates collected by the time, space a n d
biophysiological (TSB) stamping based tracking server shown in FIG. 1 6
during the process of tracking a living being carrying the GSU-enabled client
device of FIGS. 19A and 19B in accordance with the principles of the present
invention.
During the process of tracking a living being carrying the GSU-enabled
client device of FIGS. 19A and 19B, digitally-signed TSB data packages are
periodically transmitted by the GSU-enabled client network device 160" t o
the TSB-Stamping Based Tracking Server 1007. FIG. 21 shows an exemplary
TSB trajectory plot for an object being tracked by the system and monitored
from the Web-based Object Trajectory Monitoring WWW Site. The TSB data
associated with the TSB trajectory plot is stored within the Owner/Object
RDBMS shown in Fig. 22.
Data processing algorithms can be used to analyze the TSB data table
to automatically detect changes i n the biophysiological data stream which
indicate changes in vital signs of the living being tracked/monitored. Such
changes in biophysiological data can be graphed and viewed by the
owners/custodians of the corresponding object using a Web-enabled client
machine pointing to the Web-based Object Trajectory Monitoring WWW site.
Alternative Applications For The Internet ba d T tamping Obyecr_
Trackin,~Svstem and Method Of The Present Invention
The Internet-based TS-stamping object tracking system and method
described in great detail above can be readily modified to provide a wide
range of useful systems capable of supporting a wide range of novel services
deliverable over the Internet. The downloading of service-specific client
software and service registration and monitoring operations carried o a t
using conventional Web browser technology in a manner similar to that
described hereinabove. Referring to Figs. 23A through 29B, seven different
Internet-based systems and methods will now be described below.
Page 142 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
In Fig. 23A, a schematic description is provided for an Internet-based
method of and system for securing a region of physical space, indicated i n
the TS tractory diagram of Fig. 23B. In this system, a GSU-enabled client
network device 160' is provided with a CCD-based digital video camera or
scanner for capturing images of a field of view (FOV) of the camera o r
scanner, and a sound recording device for recording sound (tracks) within
and about the field of view (FOV) of the camera. Each captured image frame
is accurately space-time stamped, and recorded on videotape or other digital
recording medium associated with image RDBMS 1001'. Web-based
owner/device registration server 1003' is provided for registering owners
(or custodians) of GSU-enabled devices 160' within the RDBMS 1001', with
other data contained therein. A Web-based image monitoring server 1 002'
is provided for allowing owners to view image/sound frames captured a n d
stored in the RDBMS 1001'. Web-enabled client machines 1010' are
provided for carrying out such owner involved operations.
Fig. 23B shows a data table describing the information fields
maintained in the Image RDBMS employed in the system of Fig. 23A,
wherein TS-stamped images and associated sound recording tracks are
stored for analysis and usage in various security operations.
In Fig. 24A, a schematic description is provided for an Internet-based
method of and system for securing a computer communications network b y
embodying a GSU chip 175 into each network computing device 160' so that
its access to a particular communications/computer network (i.e.
subnetwork) or WWW site can be securely enabled by a TS-stamping
tracking server 1001' only upon the generation of a unique time-space
stamp by the GSU-chip 175. This is achieved when the GSU-enabled network
computing device is physically present at a predetermined location over a
particular time interval. A Web-based owner/device registration server
1003' is provided for registering owners (or custodians) of GSU-enabled
devices 160' within the RDBMS 1001'. A Web-based Network access
monitoring server 1002' is provided for allowing owners to monitor network
access enabled by the system. Web-enabled client machines 1010' are
provided for carrying out such owner involved operations.
Page 143 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
Fig. 24B provides a schematic representation of an exemplary locus of
time-space coordinates collected by the TS-Stamping Based Tracking Server
_ of the system of FIG. 24A, and the predetermined TS-region over which the
GSU-enabled network computing device is enabled by the TS-Stamping Based
Tracking Server to access a prespecified communication subnetwork or WW
server in accordance with the principles of the present invention.
In Fig. 25A, a schematic description is provided for an Internet-based
method of and system for securing a computers communications network b y
embodying a GSU chip 175, wherein a GSU-enabled network computing
device 160' which is used to access a particular communications
(sub)network or WWW site, is partially enabled by the enabled the TS-
stamping tracking server 1001' when the GSU-enabled network computing
device 160' is present outside of the predetermined location, o r
predetermined time interval, so that the TS-stamping tracking server can
track to the exact location of the GSU-enabled computing device 160' and
authorities can apprehend the person using the same without authorization.
A Web-based GSU-enabled client computing device/owner registration
server 1003' is provided for registering owners (or custodians) of GSU-
enabled devices 160' within the RDBMS 1001'. A Web-based device
trajectory monitoring server 1002' is provided for allowing owners to
monitor TS trajectory of each registered network computing device 160',
and to determine when and where encrypted messages have been decrypted
and displayed by the device. Web-enabled client machines 1010' are
provided for carrying out such owner involved operations.
Fig. 25B shows a schematic representation of an exemplary locus of
time-space coordinates collected by the TS-Stamping Based Tracking Server
of the system of FIG. 25A, and the predetermined TS-region over which the
GSU-enabled network computing device is enabled by the TS-Stamping Based
Tracking Server to decrypt and display encrypted message prestored on th a
GSU-enabled network computing device in accordance with the principles of
the present invention.
In Fig. 26A, a schematic description is provided for an Internet-based
method and system for enabling "location-and time" based decryption of
Page 144 of 238
CA 02363940 2001-08-24
WO 00/50974 ~ PCT/US00/05093
messages by using a GSU-enabled client computing device 160' which i s
enabled by a TS-stamping tracking server 1001' to decrypt certain messages
_ stored on a computer network only at certain times/places (i.e. ranges of TS
coordinate data), and at no others, for reasons that need only be known t o
the author of such messages. A Web-based GSU-enabled client computing
device/owner registration server 1003' is provided for registering owners
(or custodians) of GSU-enabled devices 160' within the RDBMS 1001'. A
Web-based device trajectory m o nitoring server 1002' is provided for
allowing owners to monitor TS trajectory of each registered network
computing device 160', and to determine when and where received
encrypted radio messages have been decrypted and visually or sonically
displayed by the device. Web-enabled client machines 1010' are provided
for carrying out such owner involved operations.
Fig. 26B shows a schematic representation of an exemplary locus of
time-space coordinates collected by the TS-Stamping Based Tracking Server
of the system of FIG. 26A, and the predetermined TS-region over which the
GSU-enabled network computing device is enabled by the TS-Stamping Based
Tracking Server 1001' to decrypt and display encrypted radio messages
being received by the GSU-enabled network computing device in accordance
with the principles of the present invention.
In Fig. 27A, a schematic description is provided for an Internet-based
method of and system for displaying information clues or instructions a t
particular instances along the space-time continuum. In the system, a
wireless GSU-enabled client network device 160' (realized for example in t h a
form of a watch or other portable casing having an integrated display screen
and keypad) cooperates with a TS-stamping based tracking server 1001'
through a global communication network (i.e. the Internet) so as to enable
the GSU-enabled client network device to display information clues and/or
instructions only when the GSU-enabled device 160' is present within
specific location over a particular time interval (i.e. intersects a
prespecified
region along the space-time continuum). A Web-based GSU-enabled client
computing device/owner registration server 1003' is provided for
registering owners (or custodians) of GSU-enabled devices 160' within the
Page 145 of 238
CA 02363940 2001-08-24
WO 00/50974
PCT/US00/05093
RDBMS 1001'. A Web-based display monitoring server 1002' is provided for
allowing owners to the display of each registered network computing device,
and to determine when and where received encrypted messages have been
decrypted and visually or sonically displayed by the device. Web-enabled
client machines 1010' are provided for carrying out such owner involved
operations.
In Fig. 27B, shows a schematic representation of an exemplary locus of
time-space coordinates collected by the TS-Stamping Based Tracking Server
of the system of FIG. 27A, and the predetermined TS-region over which the
GSU-enabled network computing device is enabled by the TS-Stamping Based
Tracking Server to decrypt and display encrypted messages prestored i n
memory in the GSU-enabled network computing device in accordance with
the principles of the present invention.
Fig. 28A shows a schematic representation of an Internet-based
method of and system for enabling the operation of set-top cable television
boxes 160', and other digital media content delivery devices, in compliance
with license agreements, wherein a GSU-enabled network computing device
160' is embedded within each set-top cable television box, and other digital
media content delivery device, in a media content delivery system, and one
or more TS-stamping based tracking servers 1001' are used to track a n d
control such media content delivery devices so that the media content
delivery devices are enabled into operation only when such devices are i n
fact used in accordance with the conditions of use set forth in the license
agreement with the customer (i.e. when used within the particular location
'-5 specified in the license agreement and during the time duration thereof).
A
Web-based GSU-enabled client computing device/owner registration server
1003' is provided for registering owners (or custodians) of GSU-enabled
devices 160' within the RDBMS 1001'. A Web-based device trajectory
monitoring server 1002' is provided for allowing owners to monitor TS
trajectory of each registered media content delivering device, and determine
when and where each registered device has been enabled for operation.
Web-enabled client machines 1010' are provided for carrying out such
owner involved operations.
Page 146 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
Fig. 28B provides a schematic representation of an exemplary locus of
time-space coordinates collected by the TS-Stamping Based Tracking Server
of the system of FIG. 28A, and the predetermined TS-region over which the
GSU-enabled media content delivery device is enabled operational by the
TS-Stamping Based Tracking Server in accordance with the principles of the
present invention.
In Fig. 29A, a schematic description is provided for an Internet-based
method of and system for enabling/controlling the operation any portable
host system or device which is restricted to operate within a set of space-
time constraints, by embedding a GSU-enabled device 160' within each such
portable host system or device, and using one or more TS-stamping based
tracking servers 1001' to track and enable the operation of each such
portable host system or device only when such systems and devices are i n
fact used in accordance with the conditions of use set forth in the license
agreement.
Fig. 29B provides a schematic representation of an exemplary locus of
time-space coordinates collected by the TS-Stamping Based Tracking Server
of the system of FIG. 29A, and the predetermined TS-region over which the
GSU-enabled media content delivery device is rendered operational by the
TS-stamping based tracking server, in accordance with the principles of the
present invention.
Alternative Apnlicarinnc For GSU of The Pre ent Invention
There are many possible configurations for retrieving and using the
information produced by the GSU of the present invention. In the real-time
object tracking system detailed above, each GSU-enabled device transmitted
digitally-signed TS (and TSB) containing data packages to the TS-stamping
(and TSB-stamping) based Tracking Server 1000 (1007) after each sampling
of TS coordinates carried out within the GSU chip within the GSU-enabled
device. It is understood, however, that in particular applications, it b a
desirable to buffer large or small sets of TS coordinate data aboard the
device and then periodically downloaded the same to the tracking server,
Page 147 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
eliminating the amount of time that the client network device has to be on-
line. In some applications, the entire TS trajectory of the client network
device for a particular time interval (e.g. hour, day, week or month) can b a
buffered in data storage aboard the GSU-enabled client device a n d J
downloaded at a predetermined time to the tracking server, or other
computer for processing and eventual display.
While a wireless communication link has been described for linking
each mobile GSU-enabled client network device 160' with the TS-stamping
based tracking server, it is understood that in other applications of the
present invention, it might be desirable to use types of communications
links and protocols, such as the "BIueTooth" protocol for local access, or a
physical connector, or remote access through wired or wireless networking.
While it would be preferred to integrate the GSU, CPU and data
storage structures aboard the GSU-enabled client network device as a single
integrated circuit (IC) chip, it is understood that the GSU-enabled client
network device can be realized as a separate GSU interfaced with its
associated client computer.
While the GSU-enabled client network device of the illustrative
embodiment has been provided with one or more biophysiological sensors,
to enable remote monitoring of the vital signs of a living object being
tracked, it is understood that other types of sensors and inputs could
provided to the GSUs of such devices in order to perform additional
functionalities. Such sensors and input devices may include, for example:
temperature sensors, humidity sensors, light level sensors, chemical sensors,
and other physical property sensors, CCD image capturing devices, s o a n d
sensing/pickup and recording devices, fingerprint sensing/detection devices
and other biometric sensing devices, vibration sensors, radiation sensors,
gas/vapor sensors, speech recognition devices, keypad input devices,
graphics input devices, devices for detecting tampering of the GSU-enabled
device and/or removal of the GSU from its associated object, and the like.
Another use for the GSU of the present invention would be in security
applications. In such a contemplated application, the GSU-enabled client
network device includes a CCD-based digital video camera or scanners for
Page 148 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
capturing images of a field of view of the camera or scanner, as well as a n
sound recording device for recording sound within and about the field of
view of the camera. Each captured image frame would be accurately space-
time stamped, and recorded o n videotape or other digital recording
medium. Tamper-proof manufacturing of the GSU-enabled digital camera
insures accuracy of captured image data. A unique serial number can b a
encrypted in bash on video tape or digital document. The use of a random
sampling rate for video and audio can insure that live action will be filmed
The GSU-enabled client network device of the present invention can
be used for ensuring security in computers communications networks b y
requiring that the GSU-enabled network device generate a unique time-space
stamp for entry into a particular communications network. In such a n
application, a user would be provided access to a particular communications
network only if the user accesses the network using a GSU-enabled client
computing/network device (having keyboard and mouse input and a display
screen) that is physically present at a particular location in space, at a
particular internal in time. This application enables the creation of an audit
trail that shows place and time of a se of the GSU-enabled computing device.
Also, it has the potential to lock out stolen GSU-enabled devices, or, if
desired, allow limited access to the network only to track to the exact
location of the device and apprehend the theft using the stolen o r
authorized computing device.
Another application for the GSU-enabled client computing device of
the present invention is to enable "location-and time" based decryption of
messages so that certain messages stored on a computer network can b a
decrypted at certain times/places, and at no others, for a particular reason
know to the author of the message.
Another application for the GSU-enabled client computing device of
the present invention is to enable the embedding of a message within a
transportable GSU-enabled computing device so that the message can only
be decrypted in a specific location at a specific time period.
Another application for the GSU-enabled client computing device of
the present invention is to enable secure radio communications b y
Page 149 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/US00/05093
restricting that only specific GSU-enabled client network device, equipped
with radio communications capabilities, can decrypt a particular radio
message at a particular location at a particular period of time.
Another application for the GSU-enabled client network device of the
present invention would be to provide wireless GSU-enabled client network
device in the form of a watch having a display screen and keypad which can
be used to play a scavenger-hunt and like game. In such a contemplated
application, the a ser of the device obtains clues from the GSU-enabled wrist
watch only when he or she is within specific location. There can be multiple
start points, multiple paths to finish, and variable paths based upon the time
the user arrives at the clue locations.
Similarly, such a wireless GSU-enabled network device, without a
display screen or keypad input, can be affixed (i.e. strapped) to the body of
a human athlete (e.g. skier, runner or swimmer) or animal participating i n
sports competition. During a competition, TD data is collected from the GSU-
enabled device carried by the athlete on a real-time basis (using a TS-
stamping based tracking server) as the athlete travels from point to point,
along a predetermined course. The collected TS data can be remotely
analyzed to determine the performance of the athlete in the competition
and determination of a winner.
Another application for the GSU-enabled network device of the
present invention is to embed a GSU-enabled device within each set-top
cable television box, or other digital media content delivery device, in a
media content delivery system. Then, using one or more TS-stamping based
tracking servers, the GSU-enabled digital content media delivery devices are
enabled into operation only when such devices are in fact used i n
accordance with the conditions of use set forth in the license agreement with
the customer (i.e. when used within the particular location specified in the
license agreement and during the time duration thereof). By virtue of the
present invention, it is now possible to enforce strict compliance of license
agreements relating to the use of media content delivery devices and
services involving use of the same.
Page 150 of 238
CA 02363940 2001-08-24
WO 00/50974 PCT/LTS00/05093
Another application for the GSU-enabled network device of the
present invention is to embed a GSU-enabled device within any portable
host system or device which is restricted to operate within a set of space-
time constraints. In such instances, in addition to TS data tracking, the TS-
stamping based tracking server of such a system will also enable o r
otherwise control particular functions within the host system or device
based on its time-space coordinates.
While the illustrative embodiments of the present invention have been
described with regard to the Internet, it is understood that t he systems a n
d
methods of the present invention can also be carried out on public as well as
private intranets, owned, managed, or otherwise used by large or small
business and/or social organizations of either national or international
extent, having members scattered across the globe.
It is understood that the Internet-based system and subsystems a n d
IS components of the present invention may be modified in a variety of ways
which will become readily apparent to those skilled in the art of having the
benefit of the novel teachings disclosed herein. All such modifications a n d
variations of the illustrative embodiments thereof shall be deemed to b a
within the scope and spirit of the present invention as defined by the Claims
to Invention appended hereto.
Page 151 of 238
