Patents by Inventor Christopher S. Milite

Christopher S. Milite 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: 11488095
    Abstract: Data content delivery and validation in a computer environment may provide a file system in the computer environment, the file system subdivided into unique folder locations per content type, each of the unique folder locations representing a content type folder. The file system is monitored for changes to a content type folder. An occurrence of a manifest file in the content type folder may be detected, the occurrence of the manifest file ensuring that all files in a package of files associated with the manifest file have arrived. Content of the manifest file may be analyzed to check validity of the files. A content package registry may be queried to determine a base job for processing a given content type associated with the package of files, and the base job may be run to process the package of files.
    Type: Grant
    Filed: May 1, 2019
    Date of Patent: November 1, 2022
    Assignee: DoorDash, Inc.
    Inventors: Ajay A. Deshpande, Saurabh Gupta, Arun Hampapur, Pradyumnha G. Kowlani, Xuan Liu, Christopher S. Milite, Brian L. Quanz, Chek Keong Tan, Dahai Xing
  • Patent number: 11074544
    Abstract: Evaluating node fulfillment capacity in node order assignment by receiving a current order for node order assignment, retrieving data of each node, the retrieved data of each node including current capacity utilization, determining a probability of backlog on an expected ship date of each node, the probability of backlog being based on the retrieved current capacity utilization, determining a capacity utilization cost of each node based on the probability of backlog on the expected ship date, automatically calculating a fulfillment cost of each node of the current order based on the capacity utilization cost, identifying one or more nodes for the current order with the lowest fulfillment cost and automatically generating a node order assignment assigning the current order to one of the one or more nodes with the lowest fulfillment cost.
    Type: Grant
    Filed: June 19, 2019
    Date of Patent: July 27, 2021
    Assignee: International Business Machines Corporation
    Inventors: Ajay A. Deshpande, Saurabh Gupta, Arun Hampapur, Alan J. King, Ali Koc, Yingjie Li, Xuan Liu, Christopher S. Milite, Brian L. Quanz, Chek Keong Tan, Dahai Xing, Xiaobo Zheng
  • Patent number: 10937084
    Abstract: A method for continuously tracking business performance impact of order sourcing systems and algorithms that decide how ecommerce orders should be fulfilled by assigning the items of the order to nodes in a fulfillment network such as stores, distribution centers, and third party logistics—to provide automatic root cause analysis and solution recommendations to pre-defined business problems arising from KPI monitoring. A Business Intelligence (BI) dashboard architecture operates with: 1) a monitoring module that continuously monitors business KPIs and creates abnormality alerts; and 2) a root cause analysis module that is designed specifically for each business problem to give real time diagnosis and solution recommendation. The root cause analysis module receives the created alert, and triggers conducting a root cause analysis at an analytics engine. The BI dashboard and user interface enables visualization of the KPI performance and root cause analysis results.
    Type: Grant
    Filed: November 30, 2017
    Date of Patent: March 2, 2021
    Assignee: International Business Machines Corporation
    Inventors: Shyh-Kwei Chen, Ajay A. Deshpande, Saurabh Gupta, Arun Hampapur, Ali Koc, Yingjie Li, Dingding Lin, Xuan Liu, Christopher S. Milite, Brian L. Quanz, Chek Keong Tan, Dahai Xing, Xiaobo Zheng
  • Patent number: 10915854
    Abstract: A method and system for considering customized capacity utilization cost in node order fulfillment. The method includes receiving by a customized capacity utilization cost module an electronic record of a current order. The method includes retrieving data of a plurality of nodes and calculating an actual capacity utilization. The method includes automatically converting the actual capacity utilization of each node of the plurality of nodes and a predetermined maximum amount of cost to balance capacity utilization across the plurality of nodes into a customized capacity utilization cost, and transmitting the customized capacity utilization cost to an order fulfillment engine. The method includes receiving by the order fulfillment engine the current order, the processing cost data, and the customized capacity utilization cost. The method includes automatically calculating a fulfillment cost and identifying a node-order assignment with the lowest fulfillment cost.
    Type: Grant
    Filed: May 13, 2016
    Date of Patent: February 9, 2021
    Assignee: International Business Machines Corporation
    Inventors: Ajay A. Deshpande, Saurabh Gupta, Arun Hampapur, Alan J. King, Ali Koc, Yingjie Li, Xuan Liu, Christopher S. Milite, Brian L. Quanz, Chek Keong Tan, Dahai Xing, Xiaobo Zheng
  • Patent number: 10902373
    Abstract: The present disclosure relates generally to the field of retail supply networks. In one specific example, mechanisms are provided to model markdown-avoidance savings for omni-channel fulfillment in retail supply networks. In various embodiments, systems, methods and computer program products are provided.
    Type: Grant
    Filed: May 13, 2016
    Date of Patent: January 26, 2021
    Assignee: International Business Machines Corporation
    Inventors: Ajay A. Deshpande, Saurabh Gupta, Arun Hampapur, Alan J. King, Ali Koc, Yingjie Li, Xuan Liu, Christopher S. Milite, Brian L. Quanz, Chek Keong Tan, Dahai Xing, Xiaobo Zheng
  • Patent number: 10839338
    Abstract: A predictive engine on a computer environment comprising a shared pool of configurable computing resources is executed to perform a predictive analysis on data pipelined into the computer environment, the data received from a plurality of sources and in a plurality of different formats, the predictive engine generating a network level cost information based on the predictive analysis on a dynamic and continuous basis. Asynchronous communication comprising the network level cost information from the predictive engine is received and a set of candidate nodes for order fulfillment is generated based on the network level cost information and a defined distance between the set of candidate nodes and a target destination. An optimization engine on the computer environment is invoked that filters the set of candidate nodes. A number of fulfillment nodes that meet one or more of a constraint and preconfigured rule is output.
    Type: Grant
    Filed: May 13, 2016
    Date of Patent: November 17, 2020
    Assignee: International Business Machines Corporation
    Inventors: Sanjay E. Cheeran, Ajay A. Deshpande, Saurabh Gupta, Arun Hampapur, Steve Igrejas, Ali Koc, Pradyumnha G. Kowlani, Yingjie Li, Ding Ding Lin, Xuan Liu, Christopher S. Milite, Brian L. Quanz, Vadiraja S. Ramamurthy, Sachin Sethiya, Chek Keong Tan, Dahai Xing, Michael Yesudas, Xiaobo Zheng
  • Patent number: 10832205
    Abstract: A method and system determining node order fulfillment performance considering cancelation costs. The method includes receiving a current order for fulfillment node assignment and calculating a cancelation ratio of a node of a plurality of nodes by dividing orders canceled due to back order from the node by orders scheduled from the node collected from a pre-assigned time period. The method also includes determining a cancelation cost of the node based on the cancelation ratio of said node. The method then includes automatically generating a node order assignment based on the determined cancelation cost for fulfillment of a current order.
    Type: Grant
    Filed: March 31, 2016
    Date of Patent: November 10, 2020
    Assignee: International Business Machines Corporation
    Inventors: Ajay A. Deshpande, Saurabh Gupta, Arun Hampapur, Ali Koc, Yingjie Li, Xuan Liu, Christopher S. Milite, Brian L. Quanz, Chek Keong Tan, Dahai Xing
  • Patent number: 10783483
    Abstract: A method and system for evaluating node fulfillment capacity in node order assignment. The method includes receiving by a network average capacity utilization cost module an electronic record of a current order. The method includes retrieving data of a plurality of nodes, calculating an actual capacity utilization on an expected date, and determining a probability of backlog on the expected date. The method includes generating a network average capacity utilization cost model, automatically converting a regular labor cost or a overtime labor cost into a capacity utilization cost, and transmitting the capacity utilization cost of each node to an order fulfillment engine. The method includes receiving by the engine the current order, the processing cost data, and the capacity utilization cost. The method includes automatically calculating a fulfillment cost and identifying a node with the lowest fulfillment cost for assignment.
    Type: Grant
    Filed: May 13, 2016
    Date of Patent: September 22, 2020
    Assignee: International Business Machines Corporation
    Inventors: Ajay A. Deshpande, Saurabh Gupta, Arun Hampapur, Alan J. King, Ali Koc, Yingjie Li, Xuan Liu, Christopher S. Milite, Brian L. Quanz, Chek Keong Tan, Dahai Xing, Xiaobo Zheng
  • Patent number: 10776747
    Abstract: A method and system for evaluating node fulfillment capacity in node order assignment. The method includes receiving by a network average capacity utilization cost module an electronic record of a current order. The method includes retrieving data of a plurality of nodes, calculating an actual capacity utilization on an expected date, and determining a probability of backlog on the expected date. The method includes generating a network average capacity utilization cost model, automatically converting one or more of a plurality of costs and capacity utilization into a capacity utilization cost, and transmitting the capacity utilization cost of each node to an order fulfillment engine. The method includes receiving by the engine the current order, the processing cost data, and the capacity utilization cost. The method includes automatically calculating a fulfillment cost and identifying a node with the lowest fulfillment cost for assignment.
    Type: Grant
    Filed: April 1, 2016
    Date of Patent: September 15, 2020
    Assignee: International Business Machines Corporation
    Inventors: Ajay A. Deshpande, Saurabh Gupta, Arun Hampapur, Alan J. King, Ali Koc, Yingjie Li, Xuan Liu, Christopher S. Milite, Brian L. Quanz, Chek Keong Tan, Dahai Xing, Xiaobo Zheng
  • Patent number: 10650438
    Abstract: A system, method and computer program product for continuously tracking business performance impact of order sourcing systems and algorithms that decide how ecommerce orders should be fulfilled by assigning the items of the order to nodes in a fulfillment network such as stores, distribution centers, and third party logistics—to provide automatic root cause analysis and solution recommendations to pre-defined business problems arising from KPI monitoring. A Business Intelligence (BI) dashboard architecture operates with: 1) a monitoring module that continuously monitors business KPIs and creates abnormality alerts; and 2) a root cause analysis module that is designed specifically for each business problem to give real time diagnosis and solution recommendation. The root cause analysis module receives the created alert, and triggers conducting a root cause analysis at an analytics engine. The BI dashboard and user interface enables visualization of the KPI performance and root cause analysis results.
    Type: Grant
    Filed: January 13, 2017
    Date of Patent: May 12, 2020
    Assignee: International Business Machiness Corporation
    Inventors: Shyh-Kwei Chen, Ajay A. Deshpande, Saurabh Gupta, Arun Hampapur, Ali Koc, Yingjie Li, Dingding Lin, Xuan Liu, Christopher S. Milite, Brian L. Quanz, Chek Keong Tan, Dahai Xing, Xiaobo Zheng
  • Publication number: 20190303865
    Abstract: Evaluating node fulfillment capacity in node order assignment by receiving a current order for node order assignment, retrieving data of each node, the retrieved data of each node including current capacity utilization, determining a probability of backlog on an expected ship date of each node, the probability of backlog being based on the retrieved current capacity utilization, determining a capacity utilization cost of each node based on the probability of backlog on the expected ship date, automatically calculating a fulfillment cost of each node of the current order based on the capacity utilization cost, identifying one or more nodes for the current order with the lowest fulfillment cost and automatically generating a node order assignment assigning the current order to one of the one or more nodes with the lowest fulfillment cost.
    Type: Application
    Filed: June 19, 2019
    Publication date: October 3, 2019
    Inventors: Ajay A. Deshpande, Saurabh Gupta, Arun Hampapur, Alan J. King, Ali Koc, Yingjie Li, Xuan Liu, Christopher S. Milite, Brian L. Quanz, Chek Keong Tan, Dahai Xing, Xiaobo Zheng
  • Publication number: 20190258998
    Abstract: Data content delivery and validation in a computer environment may provide a file system in the computer environment, the file system subdivided into unique folder locations per content type, each of the unique folder locations representing a content type folder. The file system is monitored for changes to a content type folder. An occurrence of a manifest file in the content type folder may be detected, the occurrence of the manifest file ensuring that all files in a package of files associated with the manifest file have arrived. Content of the manifest file may be analyzed to check validity of the files. A content package registry may be queried to determine a base job for processing a given content type associated with the package of files, and the base job may be run to process the package of files.
    Type: Application
    Filed: May 1, 2019
    Publication date: August 22, 2019
    Inventors: Ajay A. Deshpande, Saurabh Gupta, Arun Hampapur, Pradyumnha G. Kowlani, Xuan Liu, Christopher S. Milite, Brian L. Quanz, Chek Keong Tan, Dahai Xing
  • Patent number: 10373102
    Abstract: A method and system for evaluating node fulfillment capacity in node order assignment. The method includes receiving a current order for node order assignment. The method also includes retrieving data of each node from a plurality of nodes, the retrieved data comprising current capacity utilization, capacity of a current day and capacity of a future day. The method then includes determining a probability of backlog on an expected ship date of each node, the probability of backlog being based on the retrieved current capacity utilization. Further, the method includes automatically converting the probability of backlog, backlog cost, and labor cost of each node into a capacity utilization cost of the each node using a capacity utilization cost model defining a set of predetermined capacity utilization threshold values. Then, the method includes automatically calculating a fulfillment cost of each node of the current order by adding a plurality of costs.
    Type: Grant
    Filed: March 31, 2016
    Date of Patent: August 6, 2019
    Assignee: International Business Machines Corporation
    Inventors: Ajay A. Deshpande, Saurabh Gupta, Arun Hampapur, Alan J. King, Ali Koc, Yingjie Li, Xuan Liu, Christopher S. Milite, Brian L. Quanz, Chek Keong Tan, Dahai Xing, Xiaobo Zheng
  • Patent number: 10373101
    Abstract: Data content delivery and validation in a computer environment may provide a file system in the computer environment, the file system subdivided into unique folder locations per content type, each of the unique folder locations representing a content type folder. The file system is monitored for changes to a content type folder. An occurrence of a manifest file in the content type folder may be detected, the occurrence of the manifest file ensuring that all files in a package of files associated with the manifest file have arrived. Content of the manifest file may be analyzed to check validity of the files. A content package registry may be queried to determine a base job for processing a given content type associated with the package of files, and the base job may be run to process the package of files.
    Type: Grant
    Filed: March 31, 2016
    Date of Patent: August 6, 2019
    Assignee: International Business Machines Corporation
    Inventors: Ajay A. Deshpande, Saurabh Gupta, Arun Hampapur, Pradyumnha G. Kowlani, Xuan Liu, Christopher S. Milite, Brian L. Quanz, Chek Keong Tan, Dahai Xing
  • Publication number: 20180082355
    Abstract: A method for continuously tracking business performance impact of order sourcing systems and algorithms that decide how ecommerce orders should be fulfilled by assigning the items of the order to nodes in a fulfillment network such as stores, distribution centers, and third party logistics—to provide automatic root cause analysis and solution recommendations to pre-defined business problems arising from KPI monitoring. A Business Intelligence (BI) dashboard architecture operates with: 1) a monitoring module that continuously monitors business KPIs and creates abnormality alerts; and 2) a root cause analysis module that is designed specifically for each business problem to give real time diagnosis and solution recommendation. The root cause analysis module receives the created alert, and triggers conducting a root cause analysis at an analytics engine. The BI dashboard and user interface enables visualization of the KPI performance and root cause analysis results.
    Type: Application
    Filed: November 30, 2017
    Publication date: March 22, 2018
    Inventors: Shyh-Kwei Chen, Ajay A. Deshpande, Saurabh Gupta, Arun Hampapur, Ali Koc, Yingjie Li, Dingding Lin, Xuan Liu, Christopher S. Milite, Brian L. Quanz, Chek Keong Tan, Dahai Xing, Xiaobo Zheng
  • Patent number: 9883193
    Abstract: An approach for generating a coding schema for identifying a spatial location of an event within video image data is provided. In one embodiment, there is a spatial representation tool, including a compression component configured to receive trajectory data of a trajectory of an object for an event within video image data; generate a lossless compressed contour-coded blob to encode the trajectory data of the trajectory of the object for the event within video image data; generate a lossy searchable code of the trajectory of the object for the event within the video image data; convert a region of interest within the video image data to a lossy query code, the region of interest corresponding to a sub-section of a visual display output of the video image data; and compare the lossy query code to the lossy searchable code within a relational database to identify a corresponding lossless trajectory data of the trajectory of the object for the event within the video image data.
    Type: Grant
    Filed: May 3, 2016
    Date of Patent: January 30, 2018
    Assignee: International Business Machines Corporation
    Inventors: Michael J. Desimone, Arun Hampapur, Zuoxuan Lu, Carl P. Mercier, Christopher S. Milite, Stephen R. Russo, Chiao-Fe Shu, Chek K. Tan
  • Publication number: 20170228812
    Abstract: A method and system optimizing source selection of an online order with the lowest fulfillment cost by considering multiple types of parameters, including shipping costs, backlog costs and markdown savings of the order. The method includes obtaining an order from the order retrieval subsystem of the OMS, selecting the candidate sources, and retrieving data from retailers or shipping companies of each selected candidate sources. The system then calculates the costs and savings parameters of the candidate sources from the retrieved data. The system identifies all possible candidate sourcing selections of the order and calculates the total fulfillment cost of each sourcing selection of the order by adding the shipping costs with the backlog costs, and subtracting the markdown savings of all candidate sources in each sourcing selection. The system identifies the optimized sourcing selection of the order with the lowest fulfillment cost and renders the selection to the OMS.
    Type: Application
    Filed: February 8, 2016
    Publication date: August 10, 2017
    Inventors: JoAnn P. Brereton, Ajay A. Deshpande, Hongliang Fei, Arun Hampapur, Miao He, Kimberly D. Hendrix, Steve Igrejas, Alan J. King, Yingjie Li, Xuan Liu, Christopher S. Milite, Jae-Eun Park, Vadiraja S. Ramamurthy, Joline Ann V. Uichanco, Songhua Xing, Xiao Bo Zheng
  • Patent number: 9729834
    Abstract: An invention for identifying a spatial location of an event within video image data is provided. Disclosed are embodiments for detecting an object and obtaining trajectory data of a trajectory of the object within the video image data from a sensor device; converting the trajectory data into a contour-coded compressed image; generating, based on the trajectory data, a searchable code that contains a set of locations traversed by the trajectory of the object within the video image; associating the searchable code with the contour-coded compressed image in a database; and returning, in response to a query having a selected location that corresponds a location of the set of locations in the searchable code, an image of the trajectory data corresponding to the object based on the contour-coded compressed image in the database.
    Type: Grant
    Filed: August 22, 2016
    Date of Patent: August 8, 2017
    Assignee: International Business Machines Corporation
    Inventors: Michael J. Desimone, Arun Hampapur, Zuoxuan Lu, Carl P. Mercier, Christopher S. Milite, Stephen R. Russo, Chiao-Fe Shu, Chek K. Tan
  • Publication number: 20170206478
    Abstract: A method and system determining node order fulfillment performance considering cancelation costs. The method includes receiving a current order for fulfillment node assignment and calculating a cancelation ratio of a node of a plurality of nodes by dividing orders canceled due to back order from the node by orders scheduled from the node collected from a pre-assigned time period. The method also includes determining a cancelation cost of the node based on the cancelation ratio of said node. The method then includes automatically generating a node order assignment based on the determined cancelation cost for fulfillment of a current order.
    Type: Application
    Filed: March 31, 2016
    Publication date: July 20, 2017
    Inventors: Ajay A. Deshpande, Saurabh Gupta, Arun Hampapur, Ali Koc, Yingjie Li, Xuan Liu, Christopher S. Milite, Brian L. Quanz, Chek Keong Tan, Dahai Xing
  • Publication number: 20170206491
    Abstract: A method and system for evaluating node fulfillment capacity in node order assignment. The method includes receiving by a network average capacity utilization cost module an electronic record of a current order. The method includes retrieving data of a plurality of nodes, calculating an actual capacity utilization on an expected date, and determining a probability of backlog on the expected date. The method includes generating a network average capacity utilization cost model, automatically converting a regular labor cost or a overtime labor cost into a capacity utilization cost, and transmitting the capacity utilization cost of each node to an order fulfillment engine. The method includes receiving by the engine the current order, the processing cost data, and the capacity utilization cost. The method includes automatically calculating a fulfillment cost and identifying a node with the lowest fulfillment cost for assignment.
    Type: Application
    Filed: May 13, 2016
    Publication date: July 20, 2017
    Inventors: Ajay A. Deshpande, Saurabh Gupta, Arun Hampapur, Alan J. King, Ali Koc, Yingjie Li, Xuan Liu, Christopher S. Milite, Brian L. Quanz, Chek Keong Tan, Dahai Xing, Xiaobo Zheng