Patents by Inventor Andrew J. Geissler
Andrew J. Geissler 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).
-
Patent number: 10878441Abstract: Method and apparatus for incentivizing ride share users, where offers are presented to the users and based on selected offers, corresponding fares may be reduced. A ride share incentivization may include user profile database, a business database, a route generator, and an advertisement generator. The route generator is configured to generate a first route and a first fare based on a first ride share request, and a second route and a second fare based on a second ride share request. The advertisement generator may generate offers for the rider share users and adjust the fares of the ride share users based on the selected offers. The advertisement generator may further adjust one or more offers when no offers are selected.Type: GrantFiled: November 7, 2018Date of Patent: December 29, 2020Assignee: International Business Machines CorporationInventors: Michael C. Hollinger, Adriana Kobylak, Andrew J. Geissler, Nicholas E. Bofferding
-
Patent number: 10833886Abstract: An apparatus, method, and system for optimal device selection for streaming content are disclosed. One embodiment of an apparatus includes a stream query module that determines playback parameters of available streaming options for playing user-selected content. A playback environment module determines playback capabilities of connected playback devices and a playback environment of a user of the user-selected content. An analysis module performs a comparison of the available streaming options with the connected playback devices in the playback environment. A device optimization module determines an optimal playback device for playing the user-selected content in the playback environment using the comparison and the playback environment. A computer-implemented method and computer program product also perform the functions of the apparatus.Type: GrantFiled: November 7, 2018Date of Patent: November 10, 2020Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Michael C. Hollinger, Nicholas E. Bofferding, Andrew J. Geissler, Adriana Kobylak
-
Patent number: 10657002Abstract: A method for correcting improper repair actions in a computer system includes assigning a first algorithm identifier to a first algorithm and storing the first algorithm identifier and a first input to the first algorithm. The method includes executing the first algorithm with the first input and storing one or more results of the first algorithm, where the one or more results includes a repair action. The method includes determining that the repair action is faulty and storing the algorithm identifier for the first algorithm in a blacklist. The method also includes assigning a second algorithm identifier to a second algorithm and storing the second algorithm identifier and a second input to the second algorithm. The method includes executing the second algorithm with the second input, where the second algorithm corrects the faulty repair action caused by the first algorithm, and storing a result of the second algorithm.Type: GrantFiled: November 10, 2017Date of Patent: May 19, 2020Assignee: International Business Machines CorporationInventors: Nicholas E. Bofferding, Andrew J. Geissler, Michael C. Hollinger, Adriana Kobylak
-
Publication number: 20200143409Abstract: Method and apparatus for incentivizing ride share users, where offers are presented to the users and based on selected offers, corresponding fares may be reduced. A ride share incentivization may include user profile database, a business database, a route generator, and an advertisement generator. The route generator is configured to generate a first route and a first fare based on a first ride share request, and a second route and a second fare based on a second ride share request. The advertisement generator may generate offers for the rider share users and adjust the fares of the ride share users based on the selected offers. The advertisement generator may further adjust one or more offers when no offers are selected.Type: ApplicationFiled: November 7, 2018Publication date: May 7, 2020Inventors: Michael C. HOLLINGER, Adriana KOBYLAK, Andrew J. GEISSLER, Nicholas E. BOFFERDING
-
Publication number: 20200145244Abstract: An apparatus, method, and system for optimal device selection for streaming content are disclosed. One embodiment of an apparatus includes a stream query module that determines playback parameters of available streaming options for playing user-selected content. A playback environment module determines playback capabilities of connected playback devices and a playback environment of a user of the user-selected content. An analysis module performs a comparison of the available streaming options with the connected playback devices in the playback environment. A device optimization module determines an optimal playback device for playing the user-selected content in the playback environment using the comparison and the playback environment. A computer-implemented method and computer program product also perform the functions of the apparatus.Type: ApplicationFiled: November 7, 2018Publication date: May 7, 2020Inventors: Michael C. Hollinger, Nicholas E. Bofferding, Andrew J. Geissler, Adriana Kobylak
-
Patent number: 10592237Abstract: Systems, methods, and computer program products to perform an operation comprising identifying a first commit of a plurality for a software project, a source code of the first commit executable in a first system architecture, determining, based on a set of tests run against a built source code of the first commit for the first and second system architectures, that the first commit is a latest working build for the architectures, computing a score for each commit in a first set of the plurality, identifying a second commit of the first set of commits based on the scores for each commit, building the source code of the second commit for execution on the second system architecture, and determining that the source code of the second commit did not build successfully for the second system architecture based on an error at a first line of the source code.Type: GrantFiled: November 13, 2017Date of Patent: March 17, 2020Assignee: International Business Machines CorporationInventors: Nicholas E. Bofferding, Andrew J. Geissler, Michael C. Hollinger, Ted M. Pacyga
-
Patent number: 10551210Abstract: Dynamic message selection and presentation based on integration of data from two or more applications is provided. Data from two or more applications on a first device is integrated utilizing an authentication token associated with the first device. Responsive to a real-time message request associated with an application, a data storage having one or more messages is interrogated. A first message from the interrogated data storage is selected and presented in real-time based on the message request, route traversal information from a first application, and profile data associated with a second application.Type: GrantFiled: May 12, 2017Date of Patent: February 4, 2020Assignee: International Business Machines CorporationInventors: Nicholas E. Bofferding, Andrew J. Geissler, Michael C. Hollinger, Adriana Kobylak
-
Patent number: 10545030Abstract: Dynamic message selection and presentation based on integration of data from two or more applications is provided. Data from two or more applications on a first device is integrated utilizing an authentication token associated with the first device. Responsive to a real-time message request associated with an application, a data storage having one or more messages is interrogated. A first message from the interrogated data storage is selected and presented in real-time based on the message request, route traversal information from a first application, and profile data associated with a second application.Type: GrantFiled: November 8, 2017Date of Patent: January 28, 2020Assignee: International Business Machines CorporationInventors: Nicholas E. Bofferding, Andrew J. Geissler, Michael C. Hollinger, Adriana Kobylak
-
Patent number: 10394697Abstract: Techniques are disclosed for identifying an optimal set of test cases of a larger test case bucket to execute on a new software release. The release includes one or more patches modifying development code of a previous release of the software, and each test case includes metadata specifying a history of the test case relative to an execution on the previous release. In each patch, it is determined, based on the metadata, whether at a test case targets the development code modified by the patch. Upon determining that the test case targets the development code, a score associated with the test case is incremented. The test cases are prioritized for execution based on score.Type: GrantFiled: May 15, 2017Date of Patent: August 27, 2019Assignee: International Business Machines CorporationInventors: Balaji V. Atyam, Nicholas E. Bofferding, Andrew J. Geissler, Michael C. Hollinger, Sivas Srr
-
Publication number: 20190146880Abstract: A method for correcting improper repair actions in a computer system includes assigning a first algorithm identifier to a first algorithm and storing the first algorithm identifier and a first input to the first algorithm. The method includes executing the first algorithm with the first input and storing one or more results of the first algorithm, where the one or more results includes a repair action. The method includes determining that the repair action is faulty and storing the algorithm identifier for the first algorithm in a blacklist. The method also includes assigning a second algorithm identifier to a second algorithm and storing the second algorithm identifier and a second input to the second algorithm. The method includes executing the second algorithm with the second input, where the second algorithm corrects the faulty repair action caused by the first algorithm, and storing a result of the second algorithm.Type: ApplicationFiled: November 10, 2017Publication date: May 16, 2019Inventors: Nicholas E. BOFFERDING, Andrew J. GEISSLER, Michael C. HOLLINGER, Adriana Kobylak
-
Publication number: 20180328755Abstract: Dynamic message selection and presentation based on integration of data from two or more applications is provided. Data from two or more applications on a first device is integrated utilizing an authentication token associated with the first device. Responsive to a real-time message request associated with an application, a data storage having one or more messages is interrogated. A first message from the interrogated data storage is selected and presented in real-time based on the message request, route traversal information from a first application, and profile data associated with a second application.Type: ApplicationFiled: November 8, 2017Publication date: November 15, 2018Applicant: International Business Machines CorporationInventors: Nicholas E. Bofferding, Andrew J. Geissler, Michael C. Hollinger, Adriana Kobylak
-
Publication number: 20180328754Abstract: Dynamic message selection and presentation based on integration of data from two or more applications is provided. Data from two or more applications on a first device is integrated utilizing an authentication token associated with the first device. Responsive to a real-time message request associated with an application, a data storage having one or more messages is interrogated. A first message from the interrogated data storage is selected and presented in real-time based on the message request, route traversal information from a first application, and profile data associated with a second application.Type: ApplicationFiled: May 12, 2017Publication date: November 15, 2018Applicant: International Business Machines CorporationInventors: Nicholas E. Bofferding, Andrew J. Geissler, Michael C. Hollinger, Adriana Kobylak
-
Publication number: 20180329807Abstract: Techniques are disclosed for identifying an optimal set of test cases of a larger test case bucket to execute on a new software release. The release includes one or more patches modifying development code of a previous release of the software, and each test case includes metadata specifying a history of the test case relative to an execution on the previous release. In each patch, it is determined, based on the metadata, whether at a test case targets the development code modified by the patch. Upon determining that the test case targets the development code, a score associated with the test case is incremented. The test cases are prioritized for execution based on score.Type: ApplicationFiled: May 15, 2017Publication date: November 15, 2018Inventors: Balaji V. ATYAM, Nicholas E. BOFFERDING, Andrew J. GEISSLER, Michael C. HOLLINGER, Sivas SRR
-
Publication number: 20180067740Abstract: Systems, methods, and computer program products to perform an operation comprising identifying a first commit of a plurality for a software project, a source code of the first commit executable in a first system architecture, determining, based on a set of tests run against a built source code of the first commit for the first and second system architectures, that the first commit is a latest working build for the architectures, computing a score for each commit in a first set of the plurality, identifying a second commit of the first set of commits based on the scores for each commit, building the source code of the second commit for execution on the second system architecture, and determining that the source code of the second commit did not build successfully for the second system architecture based on an error at a first line of the source code.Type: ApplicationFiled: November 13, 2017Publication date: March 8, 2018Inventors: Nicholas E. BOFFERDING, Andrew J. GEISSLER, Michael C. HOLLINGER, Ted M. PACYGA
-
Patent number: 9870223Abstract: Systems, methods, and computer program products to perform an operation comprising identifying a first commit of a plurality of commits for a software project, wherein a source code of the first commit is executable in a first system architecture, computing a score for each commit in a first set of the plurality of commits, wherein each score reflects a likelihood of success in porting the source code of the respective commit from the first system architecture to a second system architecture, wherein a version of each commit in the first set of commits is between a version of the first commit and a current version of the software project, identifying one or more of the first set of commits based on the scores for each commit, and building the source code of the one or more of the first set of commits for execution on the second system architecture.Type: GrantFiled: January 7, 2016Date of Patent: January 16, 2018Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Nicholas E. Bofferding, Andrew J. Geissler, Michael C. Hollinger, Ted M. Pacyga
-
Publication number: 20170199737Abstract: Systems, methods, and computer program products to perform an operation comprising identifying a first commit of a plurality of commits for a software project, wherein a source code of the first commit is executable in a first system architecture, computing a score for each commit in a first set of the plurality of commits, wherein each score reflects a likelihood of success in porting the source code of the respective commit from the first system architecture to a second system architecture, wherein a version of each commit in the first set of commits is between a version of the first commit and a current version of the software project, identifying one or more of the first set of commits based on the scores for each commit, and building the source code of the one or more of the first set of commits for execution on the second system architecture.Type: ApplicationFiled: January 7, 2016Publication date: July 13, 2017Inventors: Nicholas E. BOFFERDING, Andrew J. GEISSLER, Michael C. HOLLINGER, Ted M. PACYGA
-
Patent number: 9146608Abstract: A method, computer program product, and apparatus for managing power management in a data processing system are presented. A core is activated and configured to operate at a frequency in response to a request to increase a processing capacity. A determination whether a use of power resulting from activating the core meets a policy for the use of the power is made. A set of parameters is adjusted to meet the policy for the use of power in response to a determination that the use of power does not meet the policy. A determination whether a number of operations performed by a set of cores is made. An indication that the request to increase the processing capacity is unavailable is made in response to the number of operations having not increased.Type: GrantFiled: December 12, 2013Date of Patent: September 29, 2015Assignee: International Business Machines CorporationInventors: Andreas Bieswanger, Andrew J. Geissler, Hye-Young McCreary, Freeman L. Rawson, Malcolm S. Ware
-
Publication number: 20140101471Abstract: A method, computer program product, and apparatus for managing power management in a data processing system are presented. A core is activated and configured to operate at a frequency in response to a request to increase a processing capacity. A determination whether a use of power resulting from activating the core meets a policy for the use of the power is made. A set of parameters is adjusted to meet the policy for the use of power in response to a determination that the use of power does not meet the policy. A determination whether a number of operations performed by a set of cores is made. An indication that the request to increase the processing capacity is unavailable is made in response to the number of operations having not increased.Type: ApplicationFiled: December 12, 2013Publication date: April 10, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Andreas Bieswanger, Andrew J. Geissler, Hye-Young McCreary, Freeman L. Rawson, Malcolm S. Ware
-
Patent number: 8635478Abstract: During manufacture, an operating range for dynamic voltage and frequency scaling can be established. A nominal operating point is identified based on a design nominal operating frequency for a computer processor. The nominal operating point comprises a nominal operating voltage identified for the design nominal operating frequency. In dependence upon the nominal operating point, an operating range of frequency and voltage over which the computer processor is to function is determined. Information specifying the nominal operating point and the operating range is stored in non-volatile storage associated with the computer processor.Type: GrantFiled: December 29, 2011Date of Patent: January 21, 2014Assignee: International Business Machines CorporationInventors: Harold W. Chase, Joshua D. Friedrich, Andrew J. Geissler, Soraya Ghiasi, Norman K. James, Jagat V. Pokala, Malcolm S. Ware
-
Patent number: 8627128Abstract: A method, computer program product, and apparatus for managing power in a data processing system are presented. A core is activated in the data processing system and configured to operate at a frequency in response to receiving a request to increase a processing capacity of a set of resources in the data processing system. A determination whether a use of power resulting from activating the core configured to operate at the frequency meets a policy for the use of the power in the data processing system is made. A set of parameters associated with devices in the set of resources are adjusted to meet the policy for the use of power in the data processing system in response to a determination that the use of power does not meet the policy. A determination whether a number of operations performed per unit of time by a set of cores associated with the set of resources increased after activating the core is made.Type: GrantFiled: November 9, 2010Date of Patent: January 7, 2014Assignee: International Business Machines CorporationInventors: Andreas Bieswanger, Andrew J. Geissler, Hye-Young McCreary, Freeman L. Rawson, Malcolm S. Ware