David E Rubin, Age 331474 17Th Ave, San Francisco, CA 94122

6434549, Aug 13, 2002

Dec 13, 1999

09/458836

Gene Linetsky - Palo Alto CA
David Rubin - Menlo Park CA

Ultris, Inc. - Menlo Park CA

G06F 1730

707 3, 707 5

A system for machine- and human-mediated exchange of information, provided in response to receipt of an information query. The received query is first assigned to a selected category or classification, by a human classifier or through automatic parsing of the statement of the query by a computer. A search for a positive response to the query is performed automatically, using an information repository (including, but not limited to, one or more databases) that corresponds to the query classification. If the repository provides no positive response, the system allows a group of one or more human responders having relevant information to bid on providing a positive response to the query. A responder can also route the query to other responders. Optionally, a responder cost bid is compared with a user-supplied upper limit on cost. If a bid is accepted and the responder is selected, the responder provides a positive response to the query.

6680795, Jan 20, 2004

Aug 17, 2001

09/931182

Henry Chezar - Palo Alto CA
David Rubin - Santa Cruz CA

The United States of America as represented by the Secretary of the Interior - Washington DC

G02B 2100

359368, 359363, 7317032

An apparatus and a method are provided for capturing and analyzing video images of sediment from the bottom of a body of water such as a river or sea. The apparatus includes a video imager with a close-up focus of lens adapted to collect images of sediment at the bottom of the body of water. A waterproof housing surrounds the video imager. The video images are analyzed using any appropriate algorithm to determine grain size.

2009019, Aug 6, 2009

Feb 6, 2008

12/027206

David P. Rubin - Menlo Park CA, US
Matthew Serrano - Menlo Park CA, US
Victor Chugonov - Palo Alto CA, US

ORDINATE CORPORATION - Menlo Park CA

G09B 7/00
G06F 15/16

434322, 709219

Methods and systems are disclosed for test administration and management. A server or server system presents an interface to a client web browser over a network. A user of the client web browser selects a test taker, a test, and a destination identifier. The server or server system may then present the test to the test taker in a call to the destination identifier. After completion of the test, the server or server system may then score the test and display the score of the test in the interface. The interface may also allow the user to play back a recording of a completed test. The interface may support multiple test takers or multiple tests.

2014007, Mar 13, 2014

Sep 13, 2013

14/027156

David Rubin - Menlo Park CA, US

G06F 17/24

715230

Embodiments of systems and methods are disclosed providing for annotation of digital documents, such as html and xml documents. In various embodiments, virtual note-paper can be generated with a background-image that is a facsimile of a reviewer-selected portion of a digital document. Annotations can be made on the facsimile and attached to the digital document in a location chosen by the reviewer. The annotations can be typed (e.g., via keyboard input device) or drawn (e.g., via mouse, finger or stylus) on the virtual note-paper.

5680573, Oct 21, 1997

Jul 12, 1994

8/273867

David S. Rubin - San Francisco CA
Robert E. Mihalyi - Castro Valley CA
David A. Marshall - Concord CA

Sybase, Inc. - Emeryville CA

G06F 1208

395456

Computer systems and computer implemented methods are provided for managing memory in a database management system. The computer memory is partitioned into a plurality of buffer caches, each of which is separately addressable. One buffer cache is set aside as a default buffer cache, while the other buffer caches are reserved for specific data objects meeting certain predefined criteria. Those objects meeting the predefined criteria are stored in reserved buffer caches where they are likely to remain for a relatively long period of time (in comparison to data objects stored in the default buffer caches). A buffer cache may have a plurality of memory pools, each of which contains multiple storage blocks. The storage blocks in a given memory pool are identically sized, while the storage blocks in one memory pool are sized differently from the storage blocks in another memory pool.

6236990, May 22, 2001

Sep 26, 1997

8/938918

Mark S Geller - Palo Alto CA
David R Rubin - Palo Alto CA

Intraware, Inc. - Emeryville CA

G06F 1730
G06F 1516

707 5

A system and method assists a user in selecting a product from multiple products, grouped into categories. Information about the product is received and stored. Attributes about the products of each category, and questions related to the attributes are received and stored. Possible responses to the questions and weights associated with each possible response are also received and stored. Evaluation ratings for each of the attributes of each of the products are received and stored. The user selects a category and is provided with questions corresponding to the attributes of the products in the category selected. For each product in the category, a product score is calculated by summing the product of the weights of the responses by the evaluation ratings for that product. The results are displayed, organized into rows and columns in the order of the product scores and weights. The user may change the weights, change categories, or obtain additional information, such as information about each product, attribute or the evaluation ratings, and may place an order for some or all products.

6078897, Jun 20, 2000

Feb 2, 1998

9/018025

David R Rubin - Palo Alto CA
Mark S Geller - Palo Alto CA

Intraware, Inc. - Orinda CA

G06F 1760

705 14

A method and apparatus accepts a proposed order for products and/or services directed toward a vendor and identifies one or more additional orders that can be combined with the proposed order to obtain a higher volume discount than would be obtained submitting the proposed order by itself. One or more additional orders may contain a quantity of one product available from the vendor that, when combined with the proposed order, will qualify for the next discount higher than would be obtained by the proposed order alone and costs lower than cost of achieving the same discount using another product available from the vendor. One or more additional order may contain a quantity of one product in the proposed order that, when combined with the proposed order, will qualify for the next discount higher than would be obtained by the proposed order alone and costs lower than the cost of achieving the same discount using another product in the proposed order. One or more additional orders may contain all of the products in the proposed order that, when combined with the proposed order, will qualify for the next discount higher than would be obtained by the proposed order alone and is scaled so that the quantities of the products in the additional order are approximately the same as the quantity of products in the proposed order. The user can add one or more additional orders to the proposed order, and then submit the new proposed order.

5812996, Sep 22, 1998

Nov 6, 1995

8/554126

David S. Rubin - San Francisco CA
Brijesh Agarwal - Albany CA

Sybase, Inc. - Emeryville CA

G06F 1730

707 2

Database system and methods are described for improving execution speed of database queries (e. g. , for transaction processing and for decision support) by optimizing use of buffer caches. The system includes an Optimizer for formulating an optimal strategy for a given query. More particularly, the Optimizer communicates with a Buffer Manager before it formulates the query plan. For instance, the Optimizer may query the Buffer Manager for the purpose of determining whether the object of interest (e. g. , table or index to be scanned) exists in its own buffer cache (i. e. , whether it has been bound to a particular named cache). If the object exists in its own cache, the Optimizer may inquire as to how much of the cache (i. e. , how much memory) the object requires, together with the optimal I/O size for the cache (e. g. , 16K blocks).