Joel S Bernstein

US Patent:

39433129, Mar 9, 1976

Filed:

Feb 14, 1975

Appl. No.:

5/550041

Inventors:

Joel L. Bernstein - Commack NY
Paul E. Kovach - Syosset NY

Assignee:

Grumman Aerospace Corporation - Bethpage NY

International Classification:

H01H 316
H01H 906
H01H 2116

US Classification:

200 6158R

Abstract:

An electrical switch assembly includes a housing adapted to be coupled to a hose and nozzle to form a fluid passage therebetween. The assembly has a pair of reed switches which provide signal input to circuitry and each switch may be activated by the manual rotation of a sleeve. The sleeve carries a magnet to actuate the switch and may be rotated in either direction from a centered position between the reed switches.

US Patent:

20200159713, May 21, 2020

Filed:

Jan 21, 2020

Appl. No.:

16/748649

Inventors:

- San Mateo CA, US
Joel Bernstein - New York NY, US

International Classification:

G06F 16/22
G06F 16/951
G06F 16/21

Abstract:

A system and method for providing fine-grained access control in a search engine. Access control predicates associated with a search query, including fixed-width and/or variable-width tokens, are received from the search engine, and are formatted in a machine-readable binary format to generate a single byte array. A pre-sorted memory index structure associated with the single byte array is generated, by sorting the access control predicates according to their token width. The pre-sorted memory index structure is merge joined with an uninverted terms index that includes a sorted list of all terms in a field associated with the search query, and a document index mapping each document identifier (ID) to a term ordinal for a specific field.

US Patent:

20180218021, Aug 2, 2018

Filed:

Jan 30, 2017

Appl. No.:

15/419748

Inventors:

- San Mateo CA, US
Joel Bernstein - New York NY, US

International Classification:

G06F 17/30

Abstract:

A system and method for providing fine-grained access control in a search engine. Access control predicates associated with a search query, including fixed-width and/or variable-width tokens, are received from the search engine, and are formatted in a machine-readable binary format to generate a single byte array. A pre-sorted memory index structure associated with the single byte array is generated, by sorting the access control predicates according to their token width. The pre-sorted memory index structure is merge joined with an uninverted terms index that includes a sorted list of all terms in a field associated with the search query, and a document index mapping each document identifier (ID) to a term ordinal for a specific field.