Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
G01S 3/02
US Classification:
342458, 342463
Abstract:
A position for a beacon in a location system is determined based on distances measured from positions in a local coordinate system for the location system and from intersection points of circles. The circles each have a center point of one of the positions in the local coordinate system and a radius of one of the measured distances.
Configuring Sensor Network Behavior Using Tag Identifiers
Cyril Brignone - Mountain View CA, US Malena Mesarina - San Francisco CA, US John Recker - Mountain View CA, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
G08B 23/00
US Classification:
3405734, 235375, 3405721
Abstract:
Systems and methods for configuring behaviors of sensors and actuators in a sensor network include receiving behavior ID tag information uniquely identifying a behavior, and configuring behavior in the sensor network according to the identified behavior. Behavior configuration may be effected by programming the sensors and actuators directly, or by programming a computing node connected to the sensors and actuators.
Methodology To Program Sensors Into Collaborative Sensing Groups
Malena Mesarina - San Francisco CA, US Devaraj Das - Ft. Collins CO, US John Recker - Mountain View CA, US
Assignee:
Hewlett-Packard Development Company L. P. - Houston TX
International Classification:
G05B 11/01
US Classification:
700 78, 700 19, 370254, 34087011, 34087016
Abstract:
Embodiments of the invention employ a distributed algorithm to enable sensor nodes in a sensor network to adaptively self-configure into sensor clusters to provide a desired higher-level functionality.
Method And System For Perturbing Multi-Radio-Frequency-Identification-Tag-Reader Networks To Increase Interrogation Efficiency
John Recker - Mountain View CA, US Malena Mesarina - San Francisco CA, US Salil Pradhan - San Jose CA, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
G06K 19/06
US Classification:
235451, 235441
Abstract:
Methods and systems of the present invention employ perturbation techniques for configuring RFID-tag-reader networks in order to achieve increased overall efficiency of a network of RFID-tag readers. According to described embodiments of the present invention, individual RFID-tag readers within a multi-RFID-tag-reader network may be removed or shut down, or RFID-tag readers may be displaced relative to one another, in order to remove interferences between RFID-tag readers and to increase the interrogation efficiency of the multi-RFID-tag-reader network.
Method And System For Scheduling Multi-Radio-Frequency-Identification-Tag-Reader Networks To Increase Interrogation Efficiency
Vinay Deolaliker - Mountain View CA, US John L. Recker - Mountain View CA, US Malena R. Mesarina - San Francisco CA, US Salil Pradhan - Santa Clara CA, US
International Classification:
H04Q 5/22
US Classification:
340 102, 3405721, 340 104
Abstract:
Methods and systems of the present invention employ perturbation techniques for configuring RFID-tag-reader networks in order to achieve increased overall efficiency of a network of RFID-tag readers. According to described embodiments of the present invention, individual RFID-tag readers within a multi-RFID-tag-reader network may be removed or shut down, or RFID-tag readers may be displaced relative to one another, in order to remove interferences between RFID-tag readers and to increase the interrogation efficiency of the multi-RFID-tag-reader network. A method embodiment of the present invention schedules a multi-RFID-tag-reader network as a cycle of power-on/power-off intervals.
Clustering Methods For Radio-Frequency-Identifier Networks
John Recker - Mountain View CA, US Malena Mesarina - San Francisco CA, US Salil Pradhan - San Jose CA, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
H04Q 5/22
US Classification:
340 102, 3405721, 340 104
Abstract:
Methods and systems of the present invention are directed to clustering RFID-tag readers of a multi-RFID-tag-reader network in order to obtain a set of RFID-tag readers with high probability of detecting an event, but with low probability of collisions and with an acceptable cost. The cost may be determined by any of numerous cost functions of the RFID-tag readers in the set of RFID-tag readers, and may represent a cost in power, long-term reliability, and other such metrics that may be applied to an RFID-tag network.
Salil Vijaykumar Pradhan - San Jose CA, US Craig Peter Sayers - Menlo Park CA, US John Ludd Recker - Mountain View CA, US Alan Andrew McReynolds - Los Altos CA, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
G06F 15/177
US Classification:
709218, 709201, 709202, 709203, 709226, 709229
Abstract:
An embodiment of a synchronizer for a mobile device comprises memory for containing identification data and message data. The synchronizer is operative at least part of the time when the mobile device is inactive to establish communication with a base station, to provide from memory identification data enabling the base station to establish communication between the synchronizer and a server and, where message data is waiting to be transferred between the server and the mobile device, to enable transfer of message data waiting to be transferred. The synchronizer is operative when the mobile device is active to transfer message data between the mobile device and the memory of the synchronizer.
Ingeborg Tastl - San Mateo CA, US John Ludd Recker - Mountain View CA, US Yao Zhang - Davis CA, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
G09G 5/02
US Classification:
345600, 345603, 345604
Abstract:
Color transformation sample point identification is described. A subset of points from a superset of points representing a colorimetric relationship is identified. The subset of points defines an initial n-simplex with (n+1) points representing an approximation of the colorimetric relationship, where n represents a number of dimensions. An additional point from the superset of points is selected and added to the subset of points to replace the n-simplex with a set of at least two n-simplices. The additional point is selected such that a volume of an (n+1)-simplex formed by the (n+1) points of the initial n-simplex and the additional point is increased. An error value for the approximation is determined by calculating an error volume between the (n+1)-simplex and the superset of points.
Ohio Dept of Transportation Sep 2011 - Sep 2012
Regional Manager
Regional Growth Partnership Sep 2011 - Sep 2012
Senior Project Manager
Ohio Dept of Development Jul 2010 - Aug 2011
Regional Workforce Director
Teledoor Jul 2005 - Jul 2010
President and Co-Owner and General Manager
The Ohio State University Jan 2001 - Jul 2005
Program Manager
Education:
The Ohio State University 1996 - 1998
Masters, Public Administration
Bowling Green State University 1993
Bachelors
Kalida High School
Skills:
Leadership Management Team Building Project Management Government Facets Program Management Business Development Proposal Writing Nonprofits Public Speaking Training Policy Strategic Planning Contract Negotiation Project Planning Management Consulting Budgets