Steven H Scott

US Patent:

D560605, Jan 29, 2008

Filed:

Sep 20, 2006

Appl. No.:

29/249104

Inventors:

Meredith McClintock - Portola Valley CA, US
Steven Scott - Poway CA, US

Assignee:

Readysolar, Inc. - Portola Valley CA

International Classification:

1302

US Classification:

D13102

US Patent:

D560606, Jan 29, 2008

Filed:

Sep 29, 2006

Appl. No.:

29/249321

Inventors:

Meredith McClintock - Portola Valley CA, US
Steven Scott - Poway CA, US

Assignee:

Readysolar, Inc. - Portola Valley CA

International Classification:

1302

US Classification:

D13102

US Patent:

7797889, Sep 21, 2010

Filed:

Jan 11, 2008

Appl. No.:

12/013328

Inventors:

Meredith McClintock - Portola Valley CA, US
Steven Scott - Poway CA, US

Assignee:

Telesis Solar, Inc. - Portola Valley CA

International Classification:

E04D 13/18

US Classification:

521733, 522041, 522045, 526565

Abstract:

In one embodiment, an apparatus is provided. The apparatus includes a first rail coupled to a second rail, a third rail coupled to the second rail, and a fourth rail coupled to the first rail and the third rail. The apparatus may form a rectangular frame from the four rails. The rails may be coupled through use of corner connectors or may be mitered and coupled through use of brackets in an abutting relationship. Additionally, further rails may be added by interposing the additional rails between a pair of the first, second, third and fourth rails, to extend the frame, and such additions may involve connectors or abutting rails and brackets, for example. The rails may have support ledges. Alternatively, the rails may have slots allowing for support brackets which slide along the slots. Moreover, the rails may be anchored using roof anchoring components to various surfaces. Additionally, the rails may support photovoltaic or other solar panels, and may have caps or top brackets to maintain the position of such solar panels.

US Patent:

57272204, Mar 10, 1998

Filed:

Nov 29, 1995

Appl. No.:

8/564756

Inventors:

Reinhard H. Hohensee - Boulder CO
David E. Stone - Longmont CO
Ronald D. Parrish - Niwot CO
Dwight R. Palmer - Longmont CO
Steven M. Scott - Lafayette CO
Brian G. Platte - Frisco CO

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 900

US Classification:

395774

Abstract:

A method and system for presenting a document at a presentation device utilizing a presentation data stream having a continuous ordered stream of uniquely identified data objects and associated elements which specify format and presentation parameters for each of those data objects. The data stream contains a plurality of documents, including a resource document and a presentation document, which each comprise a collection of the uniquely identified data objects and associated elements. A save object command structure is defined within a resource document within the presentation data stream. Within the save object command structure, a particular data object is identified. In response to receipt of the save object command structure at the presentation device, the particular data object is stored within storage media. Thereafter, an include saved object command structure is defined within a diverse presentation document within a presentation data stream. The particular data object is identified within the include saved object command structure.

US Patent:

55639879, Oct 8, 1996

Filed:

Oct 28, 1994

Appl. No.:

8/330943

Inventors:

Steven M. Scott - Lafayette CO

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06K 1500

US Classification:

395115

Abstract:

Disclosed is a process and apparatus for pagemap memory representation in RISC controlled printers. The technique disclosed optimizes pagemaps in memory to minimize losses in processor efficiency of processors having data caches, TLB's and virtual memory, due to unavailability of desired data in first the data cache, then the random access memory. The technique is particularly applicable to RISC processors having a plurality of table lookaside buffers, each containing the address of a frame or page of memory, each frame comprising a finite number of bytes of data. This is accomplished by dividing the pagemap into one dimensional array of swaths of scans, each swath containing a two dimensional array of words in column major order. Each of said swaths having a height measured in scans which is a function of frame size, data cache line size and set associativity of the data cache, but which is an integral multiple of the number of words in a data cache line. The optimization of set associativity of data cache line utilization is accomplished by determining that the swath height divided by the number of words in a data cache line are not evenly divided by two.

US Patent:

55636250, Oct 8, 1996

Filed:

Sep 8, 1994

Appl. No.:

8/302307

Inventors:

Steven M. Scott - Boulder CO

Assignee:

IBM Corporation - Armonk NY

International Classification:

G09G 534

US Classification:

345126

Abstract:

A method of reversing all of the pixels in an image word uses recursive steps of shifting the image word a varying, predetermined number of spaces, followed by filtering the shifted and unshifted words through a varying, predetermined mask. The number of cycles necessary to reverse an image word having 2. sup. n pixels is n cycles, plus one additional shifting step. This method of reversing a single image word is used to generate the mirror image of an input image. This image word reversal method is also useful for rotating an image word 180 degrees about an axis through its center.

US Patent:

56732090, Sep 30, 1997

Filed:

Mar 29, 1995

Appl. No.:

8/413057

Inventors:

Ronald L. Heiney - Longmont CO
Keith E. Duvall - Niwot CO
Anthony F. Stuart - Jamestown CO
Claude A. Bugg - Boulder CO
Gregory S. Felderman - Westminster CO
Steven M. Scott - Lafayette CO

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 700
G06F 1500

US Classification:

36471502

Abstract:

A data compression and decompression technique compresses a binary stream of digital data into compressed form and decompresses a compressed data stream into decompressed form without any loss of fidelity. The techniques require very little processing time to permit compression and decompression of digital data quickly. Once the digital data is compressed into compressed form, the amount of memory required to store the compressed digital data is much less than the amount of memory required to store the corresponding data in uncompressed form.