Harry G Direen
Engineers at Old North Gate Rd, Colorado Springs, CO
License number
Colorado 43218
Issued Date
Jun 25, 2009
Renew Date
Nov 1, 2015
Expiration Date
Oct 31, 2017
Type
Professional Engineer
Address
Address
2750 North Old North Gate Rd, Colorado Springs, CO 80921
Professional information
Consultant, Direentech
Position:
COO, Consultant at DireenTech
Location:
Colorado Springs, Colorado Area
Industry:
Design
Work:
DireenTech
- Colorado Springs, Colorado Area since Mar 2003
-
COO, Consultant
Xpriori
2003 - Nov 2010
-
Chief Architect
NeoCore
1999 - 2007
-
Chief Architech
MKS Instruments
1996 - 1999
-
Engineering Manager
Education:
University of Colorado Colorado Springs 1989 - 1996
Ph.D. EE, Electronics Engineering, Control Systems University of California, Irvine 1979 - 1982
BSEE, Electronics Engineering
Ph.D. EE, Electronics Engineering, Control Systems University of California, Irvine 1979 - 1982
BSEE, Electronics Engineering
Method For Forming A Hashing Code
US Patent:
6493813, Dec 10, 2002
Filed:
Sep 28, 2000
Appl. No.:
09/672754
Inventors:
Christopher Lockton Brandin - Colorado Springs CO
Harry George Direen - Colorado Springs CO
Harry George Direen - Colorado Springs CO
Assignee:
NeoCore, Inc. - Colorado Springs CO
International Classification:
G06F 1202
US Classification:
711216, 711210, 711108
Abstract:
A method of forming a hashing code includes the steps of: first selecting a first linear feedback transform generator that is perfect over a first range. A maximum key length is determined next. When the maximum key length is greater than the first range for a transform, it is determined if a no collisions allowed condition exists. When the no collisions allowed condition exists, it is determined if the maximum key length is less than double the first range. When the maximum key length is less than double the first range, a first transform for a first part of a key is determined. A second transform for the key is then calculated. Next, a first-second combined transform is formed by concatenating the first transform and the second transform, wherein a first portion of the first-second combined transform is an address and a second portion of the first-second combined transform is a confirmer.
Method And System For Generating A Transform
US Patent:
2002006, Jun 6, 2002
Filed:
Oct 12, 2001
Appl. No.:
09/977268
Inventors:
Harry Direen - Colorado Springs CO, US
Christopher Brandin - Colorado Springs CO, US
Christopher Brandin - Colorado Springs CO, US
International Classification:
G06F017/14
US Classification:
708/400000, 708/401000
Abstract:
A system () for generating a transform includes a first transform lookup table () and second transform lookup table (). A transform exclusive OR array () is connected to an output () of the first transform lookup table () and an output () of the second transform lookup table (). The system () allows transforms (polynomial codes, CRCs) to be generated using two or more tables.
Search Engine System And Method
US Patent:
2002004, Apr 25, 2002
Filed:
Oct 9, 2001
Appl. No.:
09/973491
Inventors:
Harry George Direen - Colorado Springs CO, US
Assignee:
NeoCore Inc.
International Classification:
H04L001/22
US Classification:
714/001000, 707/001000, 707/104100
Abstract:
A search engine system () includes an associative memory (). A first search engine () is connected to the associative memory () and has first data input (). A second search engine () is connected to the associative memory () and has a second data input (). The search engine system may include a proximity search engine connected to the first search engine.
Method Of Operating A Hierarchical Data Document System Having A Duplicate Tree Structure
US Patent:
7089382, Aug 8, 2006
Filed:
Sep 25, 2001
Appl. No.:
09/962952
Inventors:
Harry George Direen - Colorado Springs CO, US
International Classification:
G06F 12/06
US Classification:
711161, 711162
Abstract:
A hierarchical structured data document system having a duplicated tree structure includes a map store (). A map index () has a map pointer pointing to a location in the map store in one of the map index's locations. A duplicate array () contains a second map pointer. The map index () has an array pointer that points to the duplicate array. The duplicate array stores map pointers pointing to duplicates of tags or data stored in the map store.