Search

Michael P Colena

from Hollis, NH
Age ~55
Get Report
Also known as:
Michael Patrick Colena, Michael J Colena, Michael T Colena, Michelle C Colena, Mike Colena
Related to:
Wendy L Gagnon, 48
Connected to:
Paula M Colena, 61Sharon D Colenberg, 41August Colenbrander, 93Cynthia A Colenda, 67Jacklyn R Colendres, 46Chris A Colenso, 57Paul A Colenso, 65Joanne E Colenzo, 70Michael D Colenzo, 41Benjamin Coler, 44

Michael Colena Phones & Addresses

  • Hollis, NH
  • 71 Heritage Dr, Lowell, MA 01852 (978) 452-3617
  • 200 Market St, Lowell, MA 01852
  • Marlborough, MA
  • Dorchester, MA

Work

Company: Oracle May 2012 Position: Senior manager, solver research and development

Education

School / High School: Northeastern University 1987 to 1992

Industries

Computer Software

Resumes

Resumes

Michael Colena Photo 1

Senior Manager, Solver Research And Development At Oracle

View page
Position:
Senior Manager, Solver Research and Development at Oracle, Senior Principal Software Engineer at Oracle Corporation
Location:
Greater Boston Area
Industry:
Computer Software
Work:
Oracle since May 2012
Senior Manager, Solver Research and Development
Oracle Corporation since Sep 1997
Senior Principal Software Engineer
Concentra Sep 1997 - Dec 1998
Senior Software Engineer
Gensym Corporation Dec 1996 - Jun 1997
Senior Software Developer
nineCo, Inc Sep 1996 - Dec 1996
Principal Engineer
Education:
Northeastern University 1987 - 1992

Publications

Us Patents

Dynamic Constraint Satisfaction Problem Solver That Recreates Structure Across Sessions

View page
US Patent:
8165981, Apr 24, 2012
Filed:
Apr 27, 2009
Appl. No.:
12/430600
Inventors:
Michael Colena - Lowell MA, US
Claire M. Bagley - Carlisle MA, US
Assignee:
Oracle International Corporation - Redwood Shores CA
International Classification:
G06F 17/00
G06N 5/02
US Classification:
706 46
Abstract:
A dynamic constraint solver for solving a constraint satisfaction problem model receives a request for a current solving session to recreate a first solving session for the model. The solver then collects a deferred port list comprising one or more ports in the model that need a sub-problem and creates one or more runtime constraints for the model. For each of the created runtime constraints, the solver propagates the constraint and determines if the propagation generates a conflict. If the propagation generates a conflict, the solver dismisses the constraint and reverts the model to a state before the constraint was propagated.

Constraint Based System That Identifies Top Constraint Expressions

View page
US Patent:
8170970, May 1, 2012
Filed:
Jun 24, 2009
Appl. No.:
12/490725
Inventors:
Claire M. Bagley - Carlisle MA, US
Joyce Ng - Sunnyvale CA, US
Michael Colena - Lowell MA, US
Gao Chen - Beijing, CN
Assignee:
Oracle International Corporation - Redwood Shores CA
International Classification:
G06N 5/00
US Classification:
706 46, 706 45
Abstract:
A constraint solver solves a constraint satisfaction problem (“CSP”) that includes a network of variables and constraints. The solver receives a sub-expression and determines if the sub-expression is an internal constraint of the CSP. The internal constraint has a supporting operator expression. If the sub-expression is an internal constraint, the solver determines any or all top constraint expressions associated with the supporting operator expression.

Interactive Product Configurator

View page
US Patent:
8335987, Dec 18, 2012
Filed:
Aug 7, 2008
Appl. No.:
12/187837
Inventors:
Claire M. Bagley - Carlisle MA, US
Martin P. Plotkin - Concord MA, US
Michael Colena - Lowell MA, US
Assignee:
Oracle International Corporation - Redwood Shores CA
International Classification:
G06F 3/00
US Classification:
715735, 715701, 715726, 715739, 715780, 715807, 715825, 715859
Abstract:
A product configurator is based on a constraint network having a plurality of nodes. The product configurator, when it receives a user choice, determines which nodes in the constraint network are affected by the user choice. For each affected node, the product configurator stores the prior domain state of the node and associates the stored prior domain state with the user choice. Therefore, the nodes can be restored to their prior state if the user choice is later removed for any reason.

Interactive Product Configurator That Allows Modification To Automated Selections

View page
US Patent:
8458050, Jun 4, 2013
Filed:
Nov 13, 2008
Appl. No.:
12/270350
Inventors:
Claire M. Bagley - Carlisle MA, US
Martin P. Plotkin - Concord MA, US
David J. Kulik - Carlisle MA, US
Michael Colena - Lowell MA, US
Gao Chen - Malden MA, US
Joyce Ng - Sunnyvale CA, US
Assignee:
Oracle International Corporation - Redwood Shores CA
International Classification:
G06Q 30/00
US Classification:
705 265, 705 21, 705 261, 705 262, 705 267, 705 29
Abstract:
A product configurator includes a constraint based network that includes a plurality of nodes. The configurator receives one or more user selections and generates one or more automatic selections to form a complete configuration. The configurator receives a request to change the configuration after forming the complete configuration, and retracts the automatic selections. For each of the retracted automatic selections, the configurator determines if the retracted automatic selection is a configuration-defining selection and reasserts the configuration-defining selections.

Interactive Product Configurator With Default Decisions

View page
US Patent:
8464156, Jun 11, 2013
Filed:
Aug 8, 2008
Appl. No.:
12/188525
Inventors:
Claire M. Bagley - Carlisle MA, US
Martin P. Plotkin - Concord MA, US
Michael Colena - Lowell MA, US
Assignee:
Oracle International Corporation - Redwood Shores CA
International Classification:
G06F 3/00
G06F 15/177
G06F 3/048
G06F 17/00
G06Q 30/00
US Classification:
715733, 715735, 715810, 715811, 715812, 715813, 705 265, 706 47
Abstract:
An interactive product configurator includes a constraint network having a plurality of nodes. The configurator receives a new user choice after previously asserting one or more default decisions. The configurator then retracts the previously asserted default decisions before asserting the new user choice. The default decisions are then reasserted.

Dynamic Constraint Satisfaction Problem Solver

View page
US Patent:
8504501, Aug 6, 2013
Filed:
Nov 13, 2008
Appl. No.:
12/270366
Inventors:
Michael Colena - Lowell MA, US
Claire M. Bagley - Carlisle MA, US
Gao Chen - Malden MA, US
Assignee:
Oracle International Corporation - Redwood Shores CA
International Classification:
G06E 1/00
G06E 3/00
G06F 15/18
G06G 7/00
US Classification:
706 19
Abstract:
A system for solving a dynamic constraint satisfaction problem comprises a constraint network of variables and constraints. The system creates a first sub-problem model that includes a first model type, one or more first variables and zero or more first constraints. The system propagates the first constraints through the constraint network and determines if a first conflict is detected from propagating the first constraints. If the first conflict is detected, the system restores the constraint network variables to a first previous state before the first constraints were propagated. The system creates a first sub-problem set that includes a second model type and one or more sub-problem models. The system connects the first sub-problem model to the first sub-problem set via a second constraint and propagates the second constraint through the constraint network.

System And Method For Efficient Representation Of Dynamic Ranges Of Numeric Values

View page
US Patent:
8521785, Aug 27, 2013
Filed:
Jan 3, 2012
Appl. No.:
13/342725
Inventors:
Michael Colena - Lowell MA, US
Assignee:
Oracle International Corporation - Redwood Shores CA
International Classification:
G06N 5/02
G06F 15/18
US Classification:
707797, 706 19
Abstract:
Embodiments of the present invention describe using a data structure to represent variable domains in solving a constraint problem. The data structure includes nodes that are configured to represent ranges of values in order to save memory space and processor power. Ranges of values and single values may be both added to and removed from the data structure such that the data structure does not include duplicate values. Operations may include detecting multiple nodes with adjacent or overlapping ranges that may be combined into a single node, and adding or removing all the values in the structure that are beyond a threshold value. In one embodiment the data structure may be a balanced binary tree. Constraint solvers may either add values to the data structure as the values are eliminated from the solution, or they may remove those values.

Constraint Based System With Dynamic Consistency Checking

View page
US Patent:
8209276, Jun 26, 2012
Filed:
Oct 27, 2008
Appl. No.:
12/258593
Inventors:
Michael Colena - Lowell MA, US
Joyce Ng - Sunnyvale CA, US
Claire M. Bagley - Carlisle MA, US
Assignee:
Oracle International Corporation - Redwood Shores CA
International Classification:
G06N 5/00
US Classification:
706 46, 706 45
Abstract:
A constraint based system solves a network that includes a first variable node having a first integer domain, a second variable node having a second integer domain, and a constraint for the first variable node and the second variable node. The system retrieves a first integer domain representation of the first integer domain and a second integer domain representation of the second integer domain and determines from the first and second integer domain representations if the first integer domain or second integer domain has at least one excluded value. The system then determines a type of constraint consistency checking based on whether the integer domains have at least one excluded value.
Control profile
Michael P Colena from Hollis, NH, age ~55 Get Report