Uber
Marketplace Analytics at Uber
Paypal
Senior Manager Customer Analytics
Spigit Mar 2011 - Dec 2013
Senior Vice President Product and Chief Scientist
Xerox Oct 2010 - Mar 2011
Global Development Director, Communication and Marketing Services
Xerox Jun 1996 - Mar 2011
Director, Document Workflows and Services Laboratory, Xerox Innovation Group
Education:
University of Connecticut 1992 - 1995
Doctorates, Doctor of Philosophy, Computer Science, Engineering, Computer Science and Engineering
Rensselaer Polytechnic Institute 1990 - 1992
Master of Science, Masters, Computer Science, Engineering
Clarkson University 1984 - 1988
Bachelors, Bachelor of Science, Computer Science
Skills:
Case Based Reasoning Software Development Agile Methodologies Product Management Cloud Computing Software Engineering Enterprise Software Saas Software Project Management Java Machine Learning Knowledge Management Data Mining Artificial Intelligence Xml Program Management C++ Web Services Human Computer Interaction Web 2.0 Scrum Strategy Agile Project Management Innovation Management Leadership Distributed Systems Big Data Project Portfolio Management Web Applications Enterprise Architecture Mobile Applications Business Intelligence Analytics Cross Functional Team Leadership Management Algorithms Analysis
Interests:
10Ks Tom Clancy Reading Half Marathons Chicago Marathon Once Running Leadership Non Fiction Marcus Buckingham John Grisham Daniel Pink
Lisa S. Purvis - Fairport NY John H. Conley - Rochester NY Curtis R. McKelvey - Rochester NY
Assignee:
Xerox Corporation - Rochester NY
International Classification:
G06F 1500
US Classification:
358 115, 358 116, 358 117
Abstract:
A scheduler for a machine includes a selector to select a traverser and to select policies from a library based on a model of the machine and the traverser selected by the selector. The traverser includes a search algorithm that is selected by the selector from a search algorithm library so that the traverser is abstracted from dependence on any particular search algorithm. Alternatively, the traverser includes a search algorithm shell and a plurality of search algorithm fragments that are selected by the selector from a search algorithm library based on a strategy design pattern so that the traverser is abstracted from dependence on any particular search algorithm shell and from dependence on any particular search algorithm fragment.
Lisa S. Purvis - Fairport NY, US John H. Conley - Rochester NY, US Curtis R. McKelvey - Rochester NY, US Christopher LaRosa - Rochester NY, US
Assignee:
Xerox Corporation - Stamford CT
International Classification:
G06F 1500
US Classification:
358 115, 358 116, 358 117
Abstract:
A method of scheduling jobs in a printing machine includes choosing configuration and selection policies and model and store traversers from a library based on a model of the machine, traversing the model of the machine to prepare and store a list of valid itineraries based on the configuration policies and traversing the stored list of valid itineraries to locate a valid itinerary to process a job. An itinerary is a schedule of the printer modules and capabilities through which a sheet must pass to perform a print job. The step of traversing the model of the machine includes evaluating all possible itineraries to preparing the list of valid itineraries based on the configuration policies and storing the list in a memory. The step of traversing the stored list of valid itineraries to locate the valid itinerary to process a job includes evaluating the list based on the selection policies and the job description.
Lisa S. Purvis - Fairport NY, US Christopher LaRosa - Rochester NY, US
Assignee:
Xerox Corporation - Stamford CT
International Classification:
G06F015/00
US Classification:
358 112, 358 115
Abstract:
A scheduler for a machine includes a selector and a traverser. The selector selects the traverser and selects policies from a library based on a model of the machine. The traverser looks for a preferred itinerary. The scheduler includes a first module to choose an itinerary, a second module to calculate a combined weight, and logic to repeatedly operate the first and second modules to choose additional itineraries from the group of itineraries and calculate their combined weight until an end condition is reached. The end condition includes one or more of when a calculated combined weight for an itinerary exceeds a predetermined threshold, when a predetermined time has elapsed, when a combined weight for each of a predetermined number of itineraries has been calculated, and when a combined weight for each itinerary in the group of itineraries has been calculated. The first module chooses an itinerary from either a list of all of the itineraries or a sub-set of the itineraries. The second module includes an itinerary validator to compute an itinerary weight for the chosen itinerary for each of the policies and also includes a combiner to combine the computed itinerary weight for each of the policies into a combined weight for the chosen itinerary.
System And Method For Constraint-Based Document Generation
What is disclosed is a system and method for specifying a custom document as a constraint satisfaction problem (CSP) to create the specified document using existing constraint solving algorithms wherein the document, its content components, and its layout requirements as elements of a constraint satisfaction problem which when solved, results in an automated document layout for the set of content components. This enables an easier (i. e. , automated) custom document creation process while providing a wider array of output documents.
A system and method specify a custom document as a constraint satisfaction problem to create the specified document using existing constraint solving algorithms wherein the document, its content components, and its layout requirements as elements of a constraint satisfaction problem which when solved, results in an automated document layout for the set of content components. The system and method enables an automated custom document creation process, providing a wider array of output documents.
System And Method For Fitness Evaluation For Optimization In Document Assembly
Steven J. Harrington - Webster NY, US Lisa S. Purvis - Fairport NY, US
Assignee:
Xerox Corporation - Stamford CT
International Classification:
G06F 17/00
US Classification:
715517, 715500, 7155001, 345619
Abstract:
What is disclosed is a system and method for method for fitness evaluation to be used with a directly calculated or iterative optimization method for automatic document assembly. The method for fitness evaluation includes the steps of first capturing the creator's desire as a set of relative weights to be applied to an intent vector. Then, calculating for each candidate document assembly a set of value-property functions that evaluate properties considered to be factors in a good design (e. g. , the balance of the document component on the page). Next, an inferred intent vector needs to be determined for each candidate document assembly as a function of the calculated value property function. Note that if the inferred intent vector is determined by a matrix multiplication applied to the vector of value property function results then the relative weights and intent definition matrix can be multiplied together to provide a weight vector that can be applied directly to the value properties. The desired weights are then applied to the inferred intents to derive a fitness measure by multiplying the intent vector components by weights and summing.
Case-Based System And Method For Generating A Custom Document
What is disclosed is a case-based method which specifies previously created documents as cases in a case base, and provides a generalized method for using these previous documents to create a new desired document. The new problem (i. e. , the document you are trying to create) is expressed, using any/all case features (e. g. , new problem constraints, creator intent, document-genre, etc. ). A matching process is performed in order to retrieve documents similar to the desired document from the case base. A selection process chooses one or several of the best matching cases as starting points for creating the new document. The retrieved document(s) are then adapted to create the new desired document. This new document is optionally stored back into the case base as a new case.
Constraint-Optimization System And Method For Document Component Layout Generation
Lisa S Purvis - Fairport NY, US Steven J Harrington - Webster NY, US
Assignee:
Xerox Corporation - Stamford CT
International Classification:
G06F 15/00 G06F 17/00
US Classification:
715517, 715518, 715519, 715520, 715521
Abstract:
What is disclosed is a system and method for specifying a custom document as a multi-criteria constraint optimization problem, and a method to automatically create the specified document using existing constraint optimization solving algorithms. The present method specifies the document, its content components, its layout requirements, and its desired aesthetic criteria are expressed as elements of a constraint optimization problem which when solved, results in an automated document layout for the set of content components that satisfies not only certain primitive content and layout constraints, but which also advantageously fulfills desired design properties and which provides a way to ensure that the generated document is well designed. The method for automatic document layout comprises the steps of determining a set of variables that can be adjusted to achieve a satisfactory layout; expressing said satisfactory layout as a set of constraints on said determined set of variables wherein at least one of said set of constraints is expressed as being optimizable; and solving said constraints to find a layout which solves for the variables over the constraints. The system for automatic document layout on multi-function office equipment comprises means for document layout constraint acquisition; means for document layout variable specification which specifies a set of variables that can be adjusted to achieve a satisfactory layout; means for relationship-constraint to optimization-constraint conversion which expresses said satisfactory layout as a set of constraints on said set of variables wherein at least one of said set of constraints is expressed as being optimizable; and means for constraint optimization for solving said constraints to find a layout which solves for the variables over said constraints.
Purdue University - Directory of Instruction and Digital Program Services (1994)
Education:
Purdue University - Masters in Technology
Lisa Purvis
Work:
Music Teacher
Lisa Purvis
About:
Front Door Consulting specializes in the needs of small to mid-sized businesses and non-profit organizations. Whether your organization wants to raise more money, is looking for low-cost high-impact m...