Patents by Inventor Jeffrey M. Fischer
Jeffrey M. Fischer has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20230297878Abstract: A method includes identifying one or more transformations to be applied in order to generate one or more features or feature sets. The method also includes generating metadata identifying the one or more features or feature sets and the one or more transformations. The method further includes using the metadata to determine the one or more features or feature sets for specified data and storing the one or more determined features or feature sets in a feature store. In addition, the method includes outputting at least some of the one or more determined features or feature sets or data associated with the at least some of the one or more determined features or feature sets from the feature store to at least one machine learning model.Type: ApplicationFiled: March 18, 2022Publication date: September 21, 2023Inventors: David Tchankotadze, Rohit P. Sureka, Rahul Yadav, Siddharth Viswanathan, Jeffrey M. Fischer
-
Patent number: 10635646Abstract: Provided are a computer program product, system, and method for generating a view for a schema. A schema provides a definition of elements, wherein at least one of the elements comprises a recursive element of a recursive data type, wherein the recursive data type allows for instances of the recursive element to include instances of that same recursive data type at different levels in a hierarchy. Indication is received to transform the recursive types to non-recursive structures. A view for the schema is generated including information on the indication to transform the recursive types to non-recursive structure, wherein the processing of the data defined by the view causes a parser to generate a structured element for each instance of the recursive element in schema data being parsed, wherein the generated structured element includes a unique identifier of the instance of the recursive element.Type: GrantFiled: January 5, 2017Date of Patent: April 28, 2020Assignee: International Business Machines CorporationInventors: Jeffrey M. Fischer, John C. Holmes, Jeff J. Li, Yong Li
-
Patent number: 10007684Abstract: Provided are a computer program product, system, and method for generating a view for a schema. A schema provides a definition of elements, wherein at least one of the elements comprises a recursive element of a recursive data type, wherein the recursive data type allows for instances of the recursive element to include instances of that same recursive data type at different levels in a hierarchy. Indication is received to transform the recursive types to non-recursive structures. A view for the schema is generated including information on the indication to transform the recursive types to non-recursive structure, wherein the processing of the data defined by the view causes a parser to generate a structured element for each instance of the recursive element in schema data being parsed, wherein the generated structured element includes a unique identifier of the instance of the recursive element.Type: GrantFiled: November 18, 2014Date of Patent: June 26, 2018Assignee: International Business Machines CorporationInventors: Jeffrey M. Fischer, John C. Holmes, Jeff J. Li, Yong Li
-
Publication number: 20170116234Abstract: Provided are a computer program product, system, and method for generating a view for a schema. A schema provides a definition of elements, wherein at least one of the elements comprises a recursive element of a recursive data type, wherein the recursive data type allows for instances of the recursive element to include instances of that same recursive data type at different levels in a hierarchy. Indication is received to transform the recursive types to non-recursive structures. A view for the schema is generated including information on the indication to transform the recursive types to non-recursive structure, wherein the processing of the data defined by the view causes a parser to generate a structured element for each instance of the recursive element in schema data being parsed, wherein the generated structured element includes a unique identifier of the instance of the recursive element.Type: ApplicationFiled: January 5, 2017Publication date: April 27, 2017Inventors: Jeffrey M. Fischer, John C. Holmes, Jeff J. Li, Yong Li
-
Patent number: 9594779Abstract: Provided are a computer program product, system, and method for generating a view for a schema. A schema provides a definition of elements, wherein at least one of the elements comprises a recursive element of a recursive data type, wherein the recursive data type allows for instances of the recursive element to include instances of that same recursive data type at different levels in a hierarchy. Indication is received to transform the recursive types to non-recursive structures. A view for the schema is generated including information on the indication to transform the recursive types to non-recursive structure, wherein the processing of the data defined by the view causes a parser to generate a structured element for each instance of the recursive element in schema data being parsed, wherein the generated structured element includes a unique identifier of the instance of the recursive element.Type: GrantFiled: January 6, 2014Date of Patent: March 14, 2017Assignee: International Business Machines CorporationInventors: Jeffrey M. Fischer, John C. Holmes, Jeff J. Li, Yong Li
-
Patent number: 9552381Abstract: Provided are a computer program product, system, and method for limiting the rendering of instances of recursive elements in view output. A schema provides a definition of elements, wherein at least one of the elements comprises a recursive element of a recursive data type, wherein the recursive data type allows for instances of the recursive element to include instances of that same recursive data type at different levels in a hierarchy. A condition is received for terminating recursion for the recursive element. A view is generated for the schema including information on the condition for terminating the recursion, wherein the processing of the view causes a parser to chunk instances of the recursive element in schema data in response to the condition indicating to terminate recursion at the level of the instance of the recursive element being processed.Type: GrantFiled: November 4, 2014Date of Patent: January 24, 2017Assignee: International Business Machines CorporationInventors: Jeffrey M. Fischer, John C. Holmes, Jeff J. Li, Yong Li
-
Patent number: 9547671Abstract: Provided are a computer program product, system, and method for limiting the rendering of instances of recursive elements in view output. A schema provides a definition of elements, wherein at least one of the elements comprises a recursive element of a recursive data type, wherein the recursive data type allows for instances of the recursive element to include instances of that same recursive data type at different levels in a hierarchy. A condition is received for terminating recursion for the recursive element. A view is generated for the schema including information on the condition for terminating the recursion, wherein the processing of the view causes a parser to chunk instances of the recursive element in schema data in response to the condition indicating to terminate recursion at the level of the instance of the recursive element being processed.Type: GrantFiled: January 6, 2014Date of Patent: January 17, 2017Assignee: International Business Machines CorporationInventors: Jeffrey M. Fischer, John C. Holmes, Jeff J. Li, Yong Li
-
Publication number: 20150193479Abstract: Provided are a computer program product, system, and method for limiting the rendering of instances of recursive elements in view output. A schema provides a definition of elements, wherein at least one of the elements comprises a recursive element of a recursive data type, wherein the recursive data type allows for instances of the recursive element to include instances of that same recursive data type at different levels in a hierarchy. A condition is received for terminating recursion for the recursive element. A view is generated for the schema including information on the condition for terminating the recursion, wherein the processing of the view causes a parser to chunk instances of the recursive element in schema data in response to the condition indicating to terminate recursion at the level of the instance of the recursive element being processed.Type: ApplicationFiled: November 4, 2014Publication date: July 9, 2015Inventors: Jeffrey M. Fischer, John C. Holmes, Jeff J. Li, Yong Li
-
Publication number: 20150193476Abstract: Provided are a computer program product, system, and method for limiting the rendering of instances of recursive elements in view output. A schema provides a definition of elements, wherein at least one of the elements comprises a recursive element of a recursive data type, wherein the recursive data type allows for instances of the recursive element to include instances of that same recursive data type at different levels in a hierarchy. A condition is received for terminating recursion for the recursive element. A view is generated for the schema including information on the condition for terminating the recursion, wherein the processing of the view causes a parser to chunk instances of the recursive element in schema data in response to the condition indicating to terminate recursion at the level of the instance of the recursive element being processed.Type: ApplicationFiled: January 6, 2014Publication date: July 9, 2015Applicant: International Business Machines CorporationInventors: Jeffrey M. Fischer, John C. Holmes, Jeff J. Li, Yong Li
-
Publication number: 20150193556Abstract: Provided are a computer program product, system, and method for generating a view for a schema. A schema provides a definition of elements, wherein at least one of the elements comprises a recursive element of a recursive data type, wherein the recursive data type allows for instances of the recursive element to include instances of that same recursive data type at different levels in a hierarchy. Indication is received to transform the recursive types to non-recursive structures. A view for the schema is generated including information on the indication to transform the recursive types to non-recursive structure, wherein the processing of the data defined by the view causes a parser to generate a structured element for each instance of the recursive element in schema data being parsed, wherein the generated structured element includes a unique identifier of the instance of the recursive element.Type: ApplicationFiled: January 6, 2014Publication date: July 9, 2015Applicant: International Business Machines CorporationInventors: Jeffrey M. Fischer, John C. Holmes, Jeff J. Li, Yong Li
-
Publication number: 20150193480Abstract: Provided are a computer program product, system, and method for generating a view for a schema. A schema provides a definition of elements, wherein at least one of the elements comprises a recursive element of a recursive data type, wherein the recursive data type allows for instances of the recursive element to include instances of that same recursive data type at different levels in a hierarchy. Indication is received to transform the recursive types to non-recursive structures. A view for the schema is generated including information on the indication to transform the recursive types to non-recursive structure, wherein the processing of the data defined by the view causes a parser to generate a structured element for each instance of the recursive element in schema data being parsed, wherein the generated structured element includes a unique identifier of the instance of the recursive element.Type: ApplicationFiled: November 18, 2014Publication date: July 9, 2015Inventors: Jeffrey M. Fischer, John C. Holmes, Jeff J. Li, Yong Li
-
Patent number: 8869098Abstract: A Model Transformation Authoring Framework (MTAF) method and apparatus for authoring and providing model-to-model transformations from one domain to another domain is disclosed. Given a domain and a target domain, at least the given domain having a respective structured hierarchy, the invention system enables a user to specify a declarative mapping (transformation declarative) between a domain specific language modeling the given domain and a modeling language modeling the target domain. The declarative mapping models how the domain specific language modeling the given domain relates to the modeling language of the target domain. The system generates a transformation code implementation of a transformation from the given domain to the target domain. The MTAF provides to the user design decisions with respect to Specification, Transformation Rules, Rule Organization, Rule Application Control, Source-Target Relationship, Incrementality, and Directionality and Tracing.Type: GrantFiled: December 5, 2007Date of Patent: October 21, 2014Assignee: International Business Machines CorporationInventors: Maged E. Elaasar, Jeffrey M. Fischer
-
Patent number: 8661405Abstract: A pattern implementation technique in which a pattern is defined as a software artifact that comprises a pattern signature representing one or more parameters of the pattern and a pattern implementation model representing one or more methods for expanding the pattern in a selected software context by assigning one or more arguments to the one or more parameters.Type: GrantFiled: September 1, 2011Date of Patent: February 25, 2014Assignee: International Business Machines CorporationInventors: David R. Stevenson, James R. Abbott, Jeffrey M. Fischer, Scott E. Schneider, Brian K. Roberts, Martha C. Andrews, David J. Ruest, Shawn K. Gardner, Christopher D. Maguire, Eric O. Funk
-
Patent number: 8386997Abstract: A method and apparatus for authoring model-to-model transformations of programming models involving profiles is disclosed. Using a declarative mapping between a given profile of a subject programming model and a target profile of a target programming model, transformation of the given profile is specified and results in a declarative specification. Similarly the declarative mapping may be to a profile of a target programming model (without a corresponding source side profile) or from a profile of a source programming model (without a corresponding target side profile). Based on the declarative specification, a transformation code implementation (e.g. a transformation API) is generated. The given profile is specified as an input domain or as an output domain along with a meta model of the subject programming model. The generated transformation code implementation effectively handles complexities of dealing with the given profile at run time.Type: GrantFiled: December 5, 2007Date of Patent: February 26, 2013Assignee: International Business Machines CorporationInventors: Maged E. Elaasar, Jeffrey M. Fischer
-
Publication number: 20120023477Abstract: A pattern implementation technique in which a pattern is defined as a software artifact that comprises a pattern signature representing one or more parameters of the pattern and a pattern implementation model representing one or more methods for expanding the pattern in a selected software context by assigning one or more arguments to the one or more parameters.Type: ApplicationFiled: September 1, 2011Publication date: January 26, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: David R. Stevenson, James R. Abbott, Jeffrey M. Fischer, Scott E. Schneider, Brian K. Roberts, Martha C. Andrews, David J. Ruest, Shawn K. Gardner, Christopher D. Maguire, Eric O. Funk
-
Patent number: 8056048Abstract: A pattern implementation technique in which a pattern is defined as a software artifact that comprises a pattern signature representing one or more parameters of the pattern and a pattern implementation model representing one or more methods for expanding the pattern in a selected software context by assigning one or more arguments to the one or more parameters. The pattern implementation model can be based on one or more framework code sets, each of which supports the creation of plural patterns by providing a pattern implementation model for a particular software context. The framework code sets can be rendered extensible by a pattern author by virtue of providing methods whose code is adapted to be modified by a pattern author when defining a pattern. The pattern can be applied by creating an instance of the pattern in a software context and presenting a graphical representation of the pattern instance that can be manipulated by the pattern user in order to apply arguments to the pattern parameters.Type: GrantFiled: August 4, 2005Date of Patent: November 8, 2011Assignee: International Business Machines CorporationInventors: David R. Stevenson, James R. Abbott, Jeffrey M. Fischer, Scott E. Schneider, Brian K. Roberts, Martha C. Andrews, David J. Ruest, Shawn K. Gardner, Christopher D. Maguire, Eric O. Funk
-
Publication number: 20110154004Abstract: Process embodiments, implementations of the process embodiments, and products of the processes are disclosed that may be stored as files on a memory device, or as components in a database. Operating a computer based upon a metadata representation of a component and its interdependency with at least one other component is disclosed. Apparatus embodiments include implementation software components, memory devices and/or servers containing the implementation software component and/or an installation package for the implementation software components. Components may also be hardware components, hardware-software components, or virtual hardware components.Type: ApplicationFiled: December 23, 2010Publication date: June 23, 2011Applicant: genForma CorpInventor: Jeffrey M. Fischer
-
Patent number: 7805474Abstract: A method to convert data between a relational format and an XML document, by creating a set of XML Mapping Definition from metadata; selecting relational data from a relational application database, and converting the relational data to the XML document using the set of XML Mapping Definition.Type: GrantFiled: April 28, 2008Date of Patent: September 28, 2010Assignee: Siebel Systems, Inc.Inventors: Alex S. Warshavsky, Chandrakant R. Bhavsar, Jeffrey M. Fischer
-
Publication number: 20090150854Abstract: A Model Transformation Authoring Framework (MTAF)method and apparatus for authoring and providing model-to-model transformations from one domain to another domain is disclosed. Given a domain and a target domain, at least the given domain having a respective structured hierarchy, the invention system enables a user to specify a declarative mapping (transformation declarative) between a domain specific language modeling the given domain and a modeling language modeling the target domain. The declarative mapping models how the domain specific language modeling the given domain relates to the modeling language of the target domain. The system generates a transformation code implementation of a transformation from the given domain to the target domain. The MTAF provides to the user design decisions with respect to Specification, Transformation Rules, Rule Organization, Rule Application Control, Source-Target Relationship, Incrementality, and Directionality and Tracing.Type: ApplicationFiled: December 5, 2007Publication date: June 11, 2009Inventors: Maged E. Elaasar, Jeffrey M. Fischer
-
Publication number: 20090150856Abstract: A method and apparatus for authoring model-to-model transformations of programming models involving profiles is disclosed. Using a declarative mapping between a given profile of a subject programming model and a target profile of a target programming model, transformation of the given profile is specified and results in a declarative specification. Similarly the declarative mapping may be to a profile of a target programming model (without a corresponding source side profile) or from a profile of a source programming model (without a corresponding target side profile). Based on the declarative specification, a transformation code implementation (e.g. a transformation API) is generated. The given profile is specified as an input domain or as an output domain along with a meta model of the subject programming model. The generated transformation code implementation effectively handles complexities of dealing with the given profile at run time.Type: ApplicationFiled: December 5, 2007Publication date: June 11, 2009Applicant: International Business Machines CorporationInventors: Maged E. Elaasar, Jeffrey M. Fischer