Robbie Green

US Patent:

8243889, Aug 14, 2012

Filed:

Aug 21, 2008

Appl. No.:

12/196094

Inventors:

Jonathan Robert Taylor - Orlando FL, US
Ryan Stephen Campbell - Casselberry FL, US
RJ Auburn - Orlando FL, US
Alexander S. Agranovsky - Longwood FL, US
Robbie A. Green - Apopka FL, US

Assignee:

Voxeo Corporation - Orlando FL

International Classification:

H04M 1/64

US Classification:

379 8801, 370352

Abstract:

A telephony application such as an interactive voice response (“IVR”) needs to identify quickly the nature of the call (e. g. , whether it is a person or machine answering a call) in order to initiate an appropriate voice application. Conventionally, the call stream is sent to a call-progress analyzer (“CPA”) for analysis. Once a result is reached, the call stream is redirected to a call processing unit running the IVR according to the analyzed result. The present scheme feeds the call stream simultaneous to both the CPA and the IVR. The CPA is allowed to continue analyzing and outputting a series of analysis results until a predetermined result appears. In the meantime, the IVR can dynamically adapt itself to the latest analysis results and interact with the call with a minimum of delay.

US Patent:

20030142551, Jul 31, 2003

Filed:

Jan 28, 2003

Appl. No.:

10/248546

Inventors:

Robbie Green - Apopka FL, US

Assignee:

Columbia Data Products, Inc. - Altamonte Springs FL

International Classification:

G11C005/00

US Classification:

365/189010

Abstract:

Hardware having a selected storage capacity within a computer configuration is emulated by (a) representing to an operating system of the computer configuration the presence of the hardware having the selected storage capacity and addresses for reading data therefrom and writing data thereto, (b) writing data to an address of the hardware by (i) writing the data to an address of a data store with which the hardware address is associated, or (ii) writing the data to an address of the data store with which no hardware address is associated, and associating the hardware address with that data store address, and (c) reading data from a hardware address by (i) reading the data from a data store address with which the hardware address has been associated in the writing step, or (ii) returning data that has not been written to the hardware in the writing step.

US Patent:

20030142552, Jul 31, 2003

Filed:

Jan 28, 2003

Appl. No.:

10/248547

Inventors:

Robbie Green - Apopka FL, US

Assignee:

Columbia Data Products, Inc. - Altamonte Springs FL

International Classification:

G11C005/00

US Classification:

365/189010

Abstract:

A volume having a selected storage capacity is emulated within a computer configuration by (a) representing to an operating system of the computer configuration the presence of the volume having the selected storage capacity and addresses for reading data therefrom and writing data thereto, (b) writing data to an address of the volume by, (i) writing the data to an address of a data store with which the volume address is associated, or (ii) writing the data to an address of the data store with which no volume address is associated, and associating the volume address with that data store address, and (c) reading data from a volume address by, (i) reading the data from a data store address with which the volume address has been associated in accordance with the writing step, or (ii) returning data that has not been written to the volume in the writing step.

US Patent:

20030142553, Jul 31, 2003

Filed:

Jan 28, 2003

Appl. No.:

10/248548

Inventors:

Robbie Green - Apopka FL, US

Assignee:

COLUMBIA DATA PRODUCTS, INC. - Altamonte Springs FL

International Classification:

G11C005/00

US Classification:

365/189010

Abstract:

A computer configuration having an original volume with a first storage capacity is altered to appear as a computer configuration having the original and an additional, readable/writable volume by (a) representing to an operating system of the computer configuration the presence of the additional volume, (b) writing data to an address of the volume by (i) writing the data to an address of a data store with which the volume address is associated, or (ii) writing the data to an address of the data store with which no volume address is associated, and associating the volume address with that data store address, and (c) reading data from a volume address by (i) reading the data from a data store address with which the volume address has been associated in the writing step, or (ii) returning data that has not been written to the volume in the writing step.

US Patent:

20030142554, Jul 31, 2003

Filed:

Jan 28, 2003

Appl. No.:

10/248549

Inventors:

Robbie Green - Apopka FL, US
Louis Witt - Orlando FL, US

Assignee:

COLUMBIA DATA PRODUCTS, INC. - Altamonte Springs FL

International Classification:

G11C005/00

US Classification:

365/189010

Abstract:

Hardware having selected storage characteristics is emulated within a computer configuration by, (a) representing to an operating system of the computer configuration the presence of the hardware having the selected storage characteristics and addresses for reading data therefrom and writing data thereto, (b) writing data to an address of the hardware by (i) writing the data to an address of a data store with which the hardware address is associated, or (ii) writing the data to an address of the data store with which no hardware address is associated, and associating the hardware address with that data store address, and (c) reading data from a hardware address by (i) reading the data from a data store address with which the hardware address has been associated in the writing step, or (ii) returning data that has not been written to the hardware in the writing step.

US Patent:

20030167380, Sep 4, 2003

Filed:

Jan 22, 2003

Appl. No.:

10/248483

Inventors:

Robbie Green - Apopka FL, US
Patricio Muirragui - Longwood FL, US
Raymond Young - Orlando FL, US
Donald Cross - Geneva FL, US
Kai Zhang - Oviedo FL, US
Brian McFadden - Altamonte Springs FL, US
Corinne Duncan - Longwood FL, US
Richard Tolpin - Orlando FL, US
Alan Welsh - Altamonte Springs FL, US

International Classification:

G06F012/12

US Classification:

711/136000, 711/160000

Abstract:

A persistent snapshot is taken and maintained in accordance with a novel method and system for extended periods of time using only a portion of a computer readable medium of which the snapshot is taken. Multiple snapshots can be taken in succession at periodic intervals and maintained practically indefinitely. The snapshots are maintained even after powering down and rebooting of the computer system. The state of the object of the snapshot for each snapshot preferably is accessible via a folder on volume of the snapshot. A restore of a file or folder may be accomplished by merely copy that file or folder from the snapshot folder to a current directory of the volume. Alternatively, the entire computer system may be restored to a previous snapshot state thereof. Snapshots that occurred after the state to which the computer is restored are not lost in the restore operation. Different rule sets and scenarios can be applied to each snapshot. Furthermore, each snapshot can be written to within the context of the snapshot and later restored to its pristine condition. Software for implementing the systems and methods of snapshots in accordance with the present invention may comprise firmware of a hard disk drive controller or a disk controller board or within the HDD casing itself. The present invention further comprises novel systems and methods in which the systems and methods of taking and maintaining snapshots are utilized in creating and managing temporal data stores, including temporal database management systems. The implications for data mining and exploration, data analysis, intelligence gathering, and artificial intelligence (just to name a few areas) are profound.

US Patent:

20030220929, Nov 27, 2003

Filed:

Jan 21, 2003

Appl. No.:

10/248460

Inventors:

Richard Tolpin - Orlando FL, US
Kai Zhang - Orlando FL, US
Donald Cross - Geneva FL, US
Brian McFadden - Altamonte Springs FL, US
Louis Witt - Orlando FL, US
Robbie Green - Apopka FL, US

Assignee:

COLUMBIA DATA PRODUCTS, INC. - Altamonte Springs FL

International Classification:

G06F007/00

US Classification:

707/100000

Abstract:

A temporal data store includes one or more data groups in an online archive or snapshot systems. Each data group in turn includes a plurality of members, data of each of which is preserved in a finite data storage having a fixed, predetermined storage capacity. Each data group further has associated therewith a time point, and each member of each data group has associated therewith a preservation weight. Upon detecting that finite data storage consumption has reached a first level, then for each member in order of increasing preservation weight beginning with the one or more members having the lowest preservation weight, successively deleting each member in increasing chronological order beginning with the oldest member first, until the finite data storage consumption has reached a second lower level. Each member of the data group may include a snapshot or a backup.

US Patent:

20030220948, Nov 27, 2003

Filed:

Jan 21, 2003

Appl. No.:

10/248461

Inventors:

Robbie Green - Apopka FL, US
Louis Witt - Orlando FL, US
Kai Zhang - Orlando FL, US
Brian McFadden - Altamonte Springs FL, US

Assignee:

COLUMBIA DATA PRODUCTS, INC. - Altamonte Springs FL

International Classification:

G06F012/00

US Classification:

707/204000

Abstract:

A method of managing a collection of members, wherein each member has data preserved in a finite data storage and each member belongs to a different data group of a temporal data store with which the finite data storage is associated, includes the step of deleting the oldest member of the collection upon the addition of a new member to the collection when the number of members of the collection exceeds a predetermined maximum number. The new member of the collection may be added to the collection after a member is deleted if the predetermined maximum number otherwise would be exceeded or, alternatively, the new member of the collection may be added to the collection, the predetermined maximum number of member then exceeded, and a member then deleted.