Abstract: A computer system for automatically generating and sending messages to individuals, entities, processes, or locations (objects) in response to events when specified conditions are met. The automated messaging system is capable of delivering generated messages via a plurality of message delivery mechanisms (e.g. e-mail, FAX, voice mail, textual page). The automated messaging system provides the ability to link objects in chains of relationships and to use these chains to determine which messages to generate, which objects are the recipient of generated messages, and via which message delivery mechanism generated messages are sent. The automated messaging system is useful in a variety of environments including asset management, electronic-commerce, and Internet-based securities trading, as well as other applications.

Abstract: In a network, a query originator injects queries of network devices into the network at a query node using query messages. The network transports the query messages to the network devices, or to network nodes at which queries about the network devices can be answered. Query responses from the network devices or network nodes are directed through the network to a collection node or nodes. As an internal network node receives multiple query responses from network devices, the internal network node might aggregate, as needed, the multiple query responses into an aggregated query response that preferably occupies less bandwidth than the aggregated multiple query responses. Where the result desired at the collection node is a computed function of the multiple query responses, the computed function can be performed at each internal network node on the multiple query responses received at that node, thus distributing the computation needed to form a collected response to the query.

Abstract: In a network interconnecting a plurality of content providers and a plurality of clients, for providing content to a client, each of the plurality of content providers is coupled to at least one content distribution network of a plurality of content distribution networks, wherein the client is coupled to at least one of the plurality of content distribution networks and a request for the content is sent from the client to a redirector node that receives requests, wherein a redirector at the redirector node provides an address for a server available to serve the requested content. When the client's content distribution network is a primary content distribution network for the content provider providing the requested content, redirecting the client to a server within the client's content distribution network.

Abstract: A method of generating procedural language code for extracting data from a data warehouse comprising the steps of accepting a declarative specification and generating procedural language code to execute the declarative specification.

Abstract: A system for classifying, monitoring, controlling and otherwise managing and allocating bandwidth of a network to data streams. A method for allocating bandwidth of a data network to a plurality of data streams is provided. The method comprises specifying apportionment of the bandwidth to a plurality of data classes. Receiving a plurality of data streams wherein each data stream has an associated data class. Negotiating a transfer rate for each data stream, wherein the transfer rate is limited to the bandwidth apportioned to the data class associated with each data stream and transmitting the data streams on the data network at the negotiated transfer rates.

Abstract: A game and messenger client-server system is provided including a plurality of game clients, a game server, a plurality of messenger clients, and a messenger server. The game server includes logic to operate a multiplayer game using inputs from and outputs to an active game set of game clients, wherein game clients other than those in the active game set can join an active game by supplying the game server with a reference to the active game. Additionally, logic is included for coupling a game client to a messenger client to allow the game client to send the messenger client data used to initiate joining a game, whereby a message sent by the messenger client includes the data used to initiate joining a game. Also, logic is included for initiating a join of a game at an invitee client, using data received in a message to the invitee.

Abstract: The Sharing arbiter is an arbiter which, under certain conditions, permits two or more Done signals to be received before the Sharing arbiter issues a grant signal and, under certain conditions, is permitted to issue more than one grant signal before receiving a Done signal. A Sharing arbiter can be implemented by adding a queue onto the Done input of a Sequencer arbiter. In a Sharing arbiter with a Sharing-number of N and K request inputs, the Sharing arbiter is permitted to issue M grant signals concurrently if M input requests have been received (where M≦K and M≦N) without enforcing mutual exclusion between the grants if at least M Done signals have also been received. Where less than M Done signals have been received (P Done signals, for example), the Sharing arbiter arbitrates among the M input requests and is permitted to issue P grant signals concurrently.

Abstract: In a space platform supply system, a canister containing supply for a space platform is launched into orbit using a launch vehicle. An intermediate space vehicle rendezvous and docks with the canister while the attached launch vehicle provides the necessary orbit maintenance and stabilization to enable the docking. After docking, the intermediate space vehicle detaches the canister from the launch vehicle element or the launch vehicle element may initiate detachment from the intermediate space vehicle/canister. In either event, the intermediate space vehicle then can provide propulsion and attitude control to allow the canister to be transported to and docked with the space platform being supplied, thus eliminating the need for the canister to include propulsion and attitude control of its own.

Abstract: A networked information appliance for use on a network, comprising a plurality of agency base units, wherein each base unit is configured on the network with an address and a plurality of agent cards, wherein each agent card includes state for at least one functionality that is provided to a user of the network at an address dependent on the address of the agency base unit into which the agent card is mounted.

Abstract: In a coding system, input data within a system is encoded. The input data might include sequences of symbols that repeat in the input data or occur in other input data encoded in the system. The encoding includes determining a target segment size, determining a window size, identifying a fingerprint within a window of symbols at an offset in the input data, determining whether the offset is to be designated as a cut point and segmenting the input data as indicated by the set of cut points. For each segment so identified, the encoder determines whether the segment is to be a referenced segment or an unreferenced segment, replacing the segment data of each referenced segment with a reference label and storing a reference binding in a persistent segment store for each referenced segment, if needed.

Abstract: An encoder uses an input file of data and a key to produce an output symbol. An output symbol with key I is generated by determining a weight, W(I), for the output symbol to be generated, selecting W(I) of the input symbols associated with the output symbol according to a function of I, and generating the output symbol's value B(I) from a predetermined value function F(I) of the selected W(I) input symbols. An encoder can be called repeatedly to generate multiple output symbols. The output symbols are generally independent of each other, and an unbounded number (subject to the resolution of I) can be generated, if needed. A decoder receives some or all of the output symbols generated. The number of output symbols needed to decode an input file is equal to, or slightly greater than, the number of input symbols comprising the file, assuming that input symbols and output symbols represent the same number of bits of data.

Abstract: An overlay protocol and system for allowing multicast routing in the Internet to be performed at the application level. The overlay protocol uses “native” Internet multicast and multicast routing protocols to route information, according to overlay routing tables. Overlay groups are mapped to native multicast groups to exploit native multicasting in regional or local forwarding domains. Use of the overlay protocol allows overlay distribution to be handled in a more intelligent and bandwidth-managed fashion. Overlay routers are placed at each of several local area networks, Internet service provider's point of presence, enterprise, or other cohesively-managed locations. The overlay computers are configured according to bandwidth and security policies, and perform application-level multicast distribution across the otherwise disjoint multicast networks by using the overlay routing.

Abstract: A video compression method and apparatus uses an active decoder. The corresponding encoder can produce an encoded bitstream with a greatly reduced overhead by encoding a reference frame based on the structural information inherent to the image (e.g., image segmentation, geometry, color, and/or brightness), and then predicting other frames relative to the structural information. Typically, the description of a predicted frame would include kinetic information (e.g., segment motion data and/or associated residues representing information in previously occluded areas and/or inexact matches and appearance of new information, and portion of the segment evolution that is not captured by motion per se, etc.). Because the decoder is capable of independently determining the structural information (and relationships thereamong) underlying the predicted frame, such information need not be explicitly transmitted to the decoder.

Abstract: An efficient method of matching a segment in one image with a segment in another image. Fourier transforms are implemented to aid in the process. In one embodiment, a method involves identifying a displacement of a segment present in a first image and a second image, the displacement representing a relative change in position of the segment between the first and second images.

Abstract: A bifurcation circuit uses dynamic asP* protocol. to exchange data among three or more FIFOs. Each FIFO contains a plurality of places containing data and a plurality of paths that exchange data between neighboring places. The bifurcator circuit generally comprises a control FIFO, two subordinate FIFOs and a bifurcation path coupled to all three FIFOs. The bifurcator circuit further comprises a chain of data latches coupled to all three FIFOs at the bifurcation path. A data value carried in the control FIFO determines which of the subordinate FIFOs exchanges data with the control FIFO. Each place in the FIFOs contains a set reset flip-flop in which the state of each place is held by a single wire and stabilized by a keeper. A single transistor sets or resets the state of the place. The pulse that changes the state of the control flip-flops also makes the data latches momentarily transparent. The bifurcator circuit is generally capable of a branch or join operations.

Abstract: An image server is captures images from a digital camera. When the image storage device is removed from the camera and placed into a port of the image server, the image server automatically detects the image storage device and downloads the images stored thereon, adding various data elements, such as a camera ID, data of capture, and the like. Once the image is stored in the image server, the image server generates an HTML page that references the new image, or adds a new reference to an existing HTML page. The HTML pages are made available to web browsers that are able to access the image server and the images are thus presented, with optional captions and titles. The images can be stored on the image server and be searched by text (i.e., from the captions or titles) or by image features.

Abstract: In a computer game, a game situation is analyzed using states of a plurality of game elements by determining a state for each of the plurality of game elements, generating a representation of a Voronoi diagram among the game elements, using at least some of the game elements as Voronoi sites and performing an analysis of the game situation using the Voronoi diagram. The analysis can be spatial analysis and/or tactical analysis to determine a move of a computer-controlled entity based on the tactical analysis. The game space might represent playing spaces for soccer, baseball or basketball. The state of a game element might include momentum, speed, and direction of travel, velocity and/or team association of the game element. For a soccer game analysis, multiple Voronoi diagrams might be generated and the analyses done using the multiple Voronoi diagrams.

Abstract: According to the present invention, an electronic commerce method and system for referencing remote merchant sites at a local commerce site is provided. The local commerce site may also be a remote merchant integration server (RMIS). The remote commerce site may also be a remote merchant site. The remote merchant site may be a website of a merchant.

Abstract: A one-hot Muller C-element, wherein an event received on each of a plurality of inputs results in an event being output, can be implemented with complementary inputs and a true transistor pair comprising one transistor having a gate coupled to a first true input and another transistor having a gate coupled to a second true input; a true arm comprising the true transistor pair, coupled in series between a complement output and ground, and a true pull-up transistor, coupled between the complement output and a source; a true arm pull-up logic gate, coupled at its inputs to complement input wires of the one-hot Muller C-element and coupled at its output to a gate of the true pull-up transistor; a complement transistor pair comprising one transistor having a gate coupled to a first complement input and another transistor having a gate coupled to a second complement input; a complement arm comprising the complement transistor pair, coupled in series between a true output and ground, and a complement pull-up transis

Abstract: An encoder encodes an output symbol from input symbols of an input file by determining, for a given output symbol, a list AL that indicates W associated input symbols, within a subset S of the input symbols comprising the input file, to be associated with the output symbol, where W is a positive integer, where at least two output symbols have different values for W associated therewith, where W is greater than one for at least one output symbol, and where the number of possible output symbols is much larger than the number of input symbols in the input file, and generating an output symbol value from a predetermined function of the W associated input symbols indicated by AL. The subset S can be a window that slides over the input file to cover all of the input symbols in a period. The window can be a fixed or variable size. Where the window moves over the file and reaches an edge, the window can wrap around or can cover extended input symbols.