Patents by Inventor Brian Leo Quanz

Brian Leo Quanz 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: 20210287101
    Abstract: Embodiments relate to a system, program product, and method for inducing creativity in an artificial neural network (ANN) having an encoder and decoder. Neurons are automatically selected and manipulated from one or more layers of the encoder. An encoded vector is sampled for an encoded image. Decoder neurons and a corresponding activation pattern are evaluated with respect to the encoded image. The decoder neurons that correspond to the activation pattern are selected, and an activation setting of the selected decoder neurons is changed. One or more novel data instances are automatically generated from an original latent space of the selectively changed decoder neurons.
    Type: Application
    Filed: March 12, 2020
    Publication date: September 16, 2021
    Applicant: International Business Machines Corporation
    Inventors: Payel Das, Brian Leo Quanz, Pin-Yu Chen, Jae-Wook Ahn
  • Publication number: 20210216922
    Abstract: Embodiments herein describe a return network simulation system that can simulate changes in a retailer's return network to determine the impact of those changes. Advantageously, being able to accurately simulate the retailer's return network means changes can be evaluated without first making those adjustments in the physical return network. Doing so avoids the cost of implementing the changes on the return network without first being able to predict whether the changes will have a net positive result (e.g., a positive result that offsets any negative results). A retailer can first simulate the change on the return network, review how the change affects one or more KPIs, and then decide whether to implement the change in the actual return network. As a result, the retailer has a reliable indicator whether the changes will result in a desired effect.
    Type: Application
    Filed: January 10, 2020
    Publication date: July 15, 2021
    Inventors: Ajay Ashok DESHAPANDE, Ali KOC, Brian Leo QUANZ, Jae-Eun PARK, Yada ZHU, Yingjie LI, Christopher Scott MILITE, Xuan LIU, Chandrasekhar NARAYANASWAMI
  • Publication number: 20210216965
    Abstract: The embodiments herein provide techniques for selecting an optimal return location from a plurality of candidate return locations for returning an item based on an expected recovery associated with each location. As discussed above, using predesignated return location(s) ignores many factors that can increase costs that affect returning items such as shipping costs, inventory, handling costs, operational transfer costs, as well as several predicted costs. Further, these techniques do not consider expected future revenue (which can offset these costs). In one embodiment, a net expected recovery is determined for each location using the costs and future revenues discussed above. By comparing the net expected recovery associated with each candidate return location, the optimal return location can be identified.
    Type: Application
    Filed: January 10, 2020
    Publication date: July 15, 2021
    Inventors: Ajay Ashok DESHAPANDE, Ali KOC, Brian Leo QUANZ, Jae-Eun PARK, Yingjie LI, Christopher Scott MILITE, Xuan LIU, Chandrasekhar NARAYANASWAMI, Yada ZHU
  • Publication number: 20210110332
    Abstract: Staffing is allocated by expressing a risk of violating a service level agreement for a given service line as a function of a number of full-time equivalents allocated to the given service line and a number of service tickets received at the given service line per unit of time per ticket severity level. The number of service tickets are processed by the number of full-time equivalents allocated to the given service line. Risks are summed across a plurality of distinct service lines to generate a total risk. Total risk is minimized by adjusting the number of full time equivalents allocated to each given service line across all services lines subject to a pre-determined reduction in total cost to process all service tickets by the number of full-time equivalents across all service lines and a pre-determined range of a permissible number of full-time equivalents for each service line.
    Type: Application
    Filed: October 15, 2019
    Publication date: April 15, 2021
    Inventors: Ali KOC, Ajay Ashok DESHPANDE, Sampoorna HEGDE, Brian Leo QUANZ, Narahari RAMACHANDRA, Arun HAMPAPUR, Deborah Marie BOLK, Steven LOEHR, Tinniam TINNIAM VENKATARAMAN GANESH, Mohammed EHSANULLA
  • Patent number: 10929808
    Abstract: Techniques for facilitating estimation of node processing capacity values for order fulfillment are provided. In one example, a computer-implemented method can comprise: generating, by a system operatively coupled to a processor, a current processing capacity value for an entity; and determining, by the system, a future processing capacity value for the entity based on the current processing capacity value and by using a future capacity model that has been explicitly trained to infer respective processing capacity values for the entity. The computer-implemented method can also comprise fulfilling an order of an item, by the system, based on the future processing capacity value.
    Type: Grant
    Filed: January 17, 2017
    Date of Patent: February 23, 2021
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Lei Cao, Ajay Ashok Deshpande, Ali Koc, Yingjie Li, Xuan Liu, Brian Leo Quanz, Yada Zhu
  • Publication number: 20190378070
    Abstract: A computer implemented method and system of setting values of parameters of nodes in an omnichannel distribution system, the method comprising is provided. Input parameters are received from a computing device. Historical data related to the network of nodes is received from a data repository. A synthetic scenario is determined based on the received input parameters and the historical data. Each node is clustered into a corresponding category. For each category of nodes, key parameters are identified. A range of each key parameter is determined based on the synthetic scenario. A number of simulations N to perform with data sampled from the synthetic scenario within the determined range of each key parameter is determined. For each of the N simulations, a multi-objective optimization is performed to determine a cost factor of the parameter settings. The parameter settings with a lowest cost factor are selected.
    Type: Application
    Filed: June 11, 2018
    Publication date: December 12, 2019
    Inventors: Yada Zhu, Xuan Liu, Brian Leo Quanz, Ajay Ashok Deshpande, Ali Koc, Lei Cao, Yingjie Li
  • Publication number: 20190378061
    Abstract: A computer implemented method and system of evaluating a fulfillment strategy in an omnichannel distribution system is provided. Input parameters are received from a computing device of a user. Historical data related to a network of nodes is received from a data repository. A synthetic demand status is determined based on the historical data and the input parameters. A synthetic network status based on the historical data and the input parameters are determined. A fulfillment strategy is identified based on the synthetic demand status and the synthetic network status. Key performance indicators (KPIs) for the fulfillment strategy are determined based on the synthetic demand status and the synthetic network status.
    Type: Application
    Filed: June 11, 2018
    Publication date: December 12, 2019
    Inventors: Lei Cao, Brian Leo Quanz, Ajay Ashok Deshpande, Xuan Liu, Arun Hampapur, Ali Koc, Yingjie Li, Yada Zhu
  • Publication number: 20190378066
    Abstract: A computer implemented method and system of calculating labor resources for a network of nodes in an omnichannel distribution system. Input parameters are received from a computing device of a user. Historical data related to a network of nodes is received, from a data repository. A synthetic scenario is determined based on the received input parameters and the historical data. For each node, key parameters are identified and set based on a multi-objective optimization, wherein the multi-objective optimization includes a synthetic inventory allocation to the node based on the synthetic scenario. A synthetic labor efficiency is determined for the node from the synthetic scenario. Labor resources are calculated based on the synthetic inventory allocation for the synthetic scenario. The labor resources of at least one node are displayed on a user interface of a user device.
    Type: Application
    Filed: June 11, 2018
    Publication date: December 12, 2019
    Inventors: Yada Zhu, Xuan Liu, Brian Leo Quanz, Ajay Ashok Deshpande, Ali Koc, Lei Cao, Yingjie Li
  • Publication number: 20180204171
    Abstract: Techniques for facilitating estimation of node processing capacity values for order fulfillment are provided. In one example, a computer-implemented method can comprise: generating, by a system operatively coupled to a processor, a current processing capacity value for an entity; and determining, by the system, a future processing capacity value for the entity based on the current processing capacity value and by using a future capacity model that has been explicitly trained to infer respective processing capacity values for the entity. The computer-implemented method can also comprise fulfilling an order of an item, by the system, based on the future processing capacity value.
    Type: Application
    Filed: December 8, 2017
    Publication date: July 19, 2018
    Inventors: Lei Cao, Ajay Ashok Deshpande, ALI KOC, Yingjie Li, Xuan Liu, Brian Leo Quanz, YADA ZHU
  • Publication number: 20180204169
    Abstract: Techniques for facilitating estimation of node processing capacity values for order fulfillment are provided. In one example, a computer-implemented method can comprise: generating, by a system operatively coupled to a processor, a current processing capacity value for an entity; and determining, by the system, a future processing capacity value for the entity based on the current processing capacity value and by using a future capacity model that has been explicitly trained to infer respective processing capacity values for the entity. The computer-implemented method can also comprise fulfilling an order of an item, by the system, based on the future processing capacity value.
    Type: Application
    Filed: January 17, 2017
    Publication date: July 19, 2018
    Inventors: Lei Cao, Ajay Ashok Deshpande, ALI KOC, Yingjie Li, Xuan Liu, Brian Leo Quanz, YADA ZHU