Search

Lorenz F Huelsbergen

from Califon, NJ
Age ~60

Lorenz Huelsbergen Phones & Addresses

  • 17 Farmersville Rd, Califon, NJ 07830
  • Hopewell, NJ
  • 12 Longview Rd, Lebanon, NJ 08833
  • 914 Park Ave, Hoboken, NJ 07030
  • 914 Park Ave #2, Hoboken, NJ 07030
  • 720 Monroe St, Hoboken, NJ 07030
  • 908 Garden St, Hoboken, NJ 07030
  • 1908 Alabama St, Laurence, KS 66046
  • Lawrence, KS
  • New Providence, NJ
  • Madison, KS

Work

Company: Western digital Aug 2017 Position: Engineering fellow

Education

Degree: Doctorates, Doctor of Philosophy School / High School: University of Wisconsin - Madison 1987 to 1993 Specialities: Computer Science, Philosophy

Skills

Java • Javascript • C++ • Linux • Software Development • Html • Python • Distributed Systems • Perl • Unix • Go • Machine Learning • Cloud Computing • Software Design • Scalability • Computer Science • Algorithms • Research • Artificial Intelligence • Big Data • Field Programmable Gate Arrays • Matlab • R • C • Amazon Web Services • High Performance Computing • Genetic Algorithms • Parallel Computing • Parallel Programming • Multithreading

Languages

German

Industries

Internet

Resumes

Resumes

Lorenz Huelsbergen Photo 1

Senior Research Engineer

View page
Location:
17 Farmersville Rd, Califon, NJ 07830
Industry:
Internet
Work:
Western Digital
Engineering Fellow

Upthere Mar 2016 - Aug 2017
Member Technical Staff

Google Jun 2007 - Mar 2016
Software

Lucent Technologies Bell Labs Aug 1993 - Jun 2007
Member Technical Staff

Aug 1993 - Jun 2007
Senior Research Engineer
Education:
University of Wisconsin - Madison 1987 - 1993
Doctorates, Doctor of Philosophy, Computer Science, Philosophy
Grinnell College 1982 - 1986
Bachelors, Bachelor of Arts, Mathematics, German
Skills:
Java
Javascript
C++
Linux
Software Development
Html
Python
Distributed Systems
Perl
Unix
Go
Machine Learning
Cloud Computing
Software Design
Scalability
Computer Science
Algorithms
Research
Artificial Intelligence
Big Data
Field Programmable Gate Arrays
Matlab
R
C
Amazon Web Services
High Performance Computing
Genetic Algorithms
Parallel Computing
Parallel Programming
Multithreading
Languages:
German

Publications

Us Patents

Apparatus And Methods For Analyzing Graphs

View page
US Patent:
6941236, Sep 6, 2005
Filed:
Mar 31, 2003
Appl. No.:
10/400904
Inventors:
Lorenz Francis Huelsbergen - Hoboken NJ, US
Oskar Mencer - Jersey City NJ, US
Assignee:
Lucent Technologies Inc. - Murray Hill NJ
International Classification:
G06F019/00
US Classification:
702 66, 702 67
Abstract:
A plurality of hardware cells are defined, wherein at least a given one of the hardware cells corresponds to sets of vertices from a graph having vertices and edges interconnecting the vertices, and each of the sets are from a corresponding one of a number of portions of the graph. The given hardware cell is adapted to select one of the sets of vertices and to define for the selected set of vertices whether an edge exists in the graph between the vertices in the selected set. The hardware cells are used to analyze one or more properties of the graph, such as reachability or shortest path. The graph is mapped into an adjacency matrix, which contains a number of contexts, each context having a number of elements, and where the given hardware cell corresponds to multiple contexts of the adjacency matrix.

Methods And Apparatus For Automatic Classification Of Text Messages Into Plural Categories

View page
US Patent:
7472095, Dec 30, 2008
Filed:
Dec 16, 2005
Appl. No.:
11/305300
Inventors:
Lorenz Huelsbergen - Lebanon NJ, US
S. Shehryar Qutub - Hoffman Estates IL, US
Assignee:
Alcatel-Lucent USA Inc. - Murray Hill NJ
International Classification:
G06F 15/18
G06E 1/00
US Classification:
706 20, 706 48, 706 18
Abstract:
Systems and techniques for classification of incoming text messages into categories. An initial set of categories is created and populated with a set of initial messages in each category. Incoming messages are assigned to a category based on text analysis of the incoming message and analysis of dissimilarities and differences between the message and messages already in the category. A set of unclassified messages is also maintained for incoming messages that do not fit an established category. Periodically, unclassified messages are reassigned to one of the established categories or to new categories created based on analysis of the unclassified messages.

Presenting Related Communications

View page
US Patent:
8332477, Dec 11, 2012
Filed:
May 24, 2012
Appl. No.:
13/479465
Inventors:
Christian Kaiserlian - New York NY, US
Adam Berenzweig - Brooklyn NY, US
Lorenz Huelsbergen - Lebanon NJ, US
Assignee:
Google Inc. - Mountain View CA
International Classification:
G06F 15/16
G06F 3/00
US Classification:
709206, 715758
Abstract:
Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for presenting related conversations. In one aspect, it is determined that a portion of a conversation thread includes an exchange of messages between fewer than a predetermined number of conversation participants. Based on determining that the portion of the conversation thread includes the exchange of messages between fewer than the predetermined number of conversation participants, a conversation view can be generated that that includes a flattened representation of the portion of the conversation thread.

Method And Apparatus For Software Integrity Protection Using Timed Executable Agents

View page
US Patent:
20060090209, Apr 27, 2006
Filed:
Oct 27, 2004
Appl. No.:
10/976353
Inventors:
Juan Garay - West New York NJ, US
Lorenz Huelsbergen - Hoboken NJ, US
International Classification:
H04N 7/16
US Classification:
726026000
Abstract:
A method and apparatus are disclosed for evaluating the security of at least one client. An executable program is executed by the client being evaluated. A result is received from the executable program and an evaluation of the result indicates whether the client has been corrupted. The executable program is one of a plurality of possible programs. The result may be evaluated based on an elapsed time between when the executable program is provided to the client and when the result is received. The executable program may include at least one function that writes to a memory of the client. A program blinding technique is also disclosed to generate executable programs.

Method For Providing Machine Access Security By Deciding Whether An Anonymous Responder Is A Human Or A Machine Using A Human Interactive Proof

View page
US Patent:
20070026372, Feb 1, 2007
Filed:
Jul 27, 2005
Appl. No.:
11/190714
Inventors:
Lorenz Huelsbergen - Lebanon NJ, US
International Classification:
G09B 3/00
G09B 7/00
US Classification:
434322000
Abstract:
A method performed by a host computer for determining whether a client user is a human or a machine. In an interactive process, the host poses a sequence of questions about an object to the client, receives answers back therefrom, and compares the received answers to the correct answers to determine whether the user is a human or a machine. Illustratively, the series of questions may, for example, comprise a version of the well-known “game” of twenty questions in which all questions are yes/no questions. The object is selected from a database comprising a plurality of objects and associated questions (with corresponding correct answers) relating thereto, and an image of the object is presented to the client user. The host computer then determines that the client user is, in fact, a human if, for example, all questions about the selected object are answered correctly.

Diversified Instruction Set Processor Architecture For The Enablement Of Virus Resilient Computer Systems

View page
US Patent:
20070220601, Sep 20, 2007
Filed:
Mar 3, 2006
Appl. No.:
11/368251
Inventors:
Lorenz Huelsbergen - Lebanon NJ, US
Hubert McLellan - Summit NJ, US
International Classification:
G06F 12/14
US Classification:
726022000
Abstract:
A Virus Resilient Processor (VRP) is obtained with use of a “Diverse Instruction Set Architecture” (DISA) comprising an assignment of differing sets of instruction codes (i.e., “opcodes” or operation codes) to different individual processors. In accordance with certain illustrative embodiments of the present invention, an individual “key” associated with a given processor is advantageously used to transform the set of instruction codes to (and from) a particular instruction set. And in accordance with one of these illustrative embodiments of the invention, the set of instruction codes is transformed by permuting (i.e., reordering) the bits of the instruction code in a specific manner based on the individual key. In this manner, since instruction code sets will be diverse across different processors, malicious code can be advantageously thwarted because an attacker will not know the mapping of opcodes to functionality.

Presenting Real-Time Search Results

View page
US Patent:
20110154183, Jun 23, 2011
Filed:
Dec 3, 2010
Appl. No.:
12/960448
Inventors:
Brendan D. Burns - Seattle WA, US
Lorenz Huelsbergen - Lebanon NJ, US
Jeremy Hylton - Easton PA, US
Laramie Leavitt - Kirkland WA, US
Addy Ngan - Sunnyvale CA, US
Jack Menzel - Mountain View CA, US
Assignee:
GOOGLE INC. - Mountain View CA
International Classification:
G06F 17/20
G06F 17/30
US Classification:
715234, 707769, 707706, 707E17014
Abstract:
Methods, systems, and apparatus, including computer programs encoded on computer storage media, for presenting real-time search results. In one aspect, a method includes presenting real-time search results in response to a query; and automatically updating the real-time search results.

Garbage Collection Without Fine-Grain Synchronization

View page
US Patent:
60526998, Apr 18, 2000
Filed:
Dec 10, 1997
Appl. No.:
8/987030
Inventors:
Lorenz Francis Huelsbergen - Hoboken NJ
Philip Steven Winterbottom - Gillette NJ
Assignee:
Lucent Technologies Inc. - Murray Hill NJ
International Classification:
G06F 1202
US Classification:
707206
Abstract:
A garbage collection technique for the concurrent operation of a mutator and garbage collector (e. g. , marker and sweeper) without requiring fine-grain synchronization or atomicity amongst the mutator, marker and sweeper. The garbage collector employs three threads for concurrently executing the mutator, marker and sweeper, and operates through a series of so called epochs (i. e. , individual garbage collection cycles) wherein each epoch (1) runs the mutator; (2) marks all objects that were reachable (i. e. , allocated) in the previous epoch with the present epoch's color; and (3) reclaims any objects marked as garbage. Significantly, the object coloring scheme used in the garbage collector eliminates the need for fine-grain synchronization or atomicity by maintaining the invariant that the mutator never sees an object colored with the sweeper's color. Further, only the marker may alter an object's color during an epoch further eliminating the need for fine-grain synchronization or atomicity between the mutator, marker and sweeper.
Lorenz F Huelsbergen from Califon, NJ, age ~60 Get Report