Patents by Inventor Ali Koc

Ali Koc 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: 10699230
    Abstract: A method for enhancing on-premise order management systems (OMS) designed for fulfillment transactions with analytic and optimization technologies and services hosted in a shared multi-tenant software-as-a-service (SaaS) environment, such as a hybrid cloud. The computer-implemented method improves an order management system by leveraging a “punch-out” approach based on user exits to integrate with and augment currently implemented order management processing and transaction flows. Using the hybrid cloud, an entity may retain data such as its accumulated business, sales, test and other data, and then run analytical queries, which can scale to support distributed computing tasks. A framework adaptor/connector is leveraged by the OMS to provide a web client for communicating with and integrating to the SaaS analytics runtime environment, encapsulating all necessary connection pooling, security, and data marshaling complexity away from the order management system to meet strict service response time windows.
    Type: Grant
    Filed: November 30, 2017
    Date of Patent: June 30, 2020
    Assignee: International Business Machines Corporation
    Inventors: Ajay A. Deshpande, Saurabh Gupta, Arun Hampapur, Ali Koc, Yingjie Li, Xuan Liu, Christopher 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
  • Patent number: 10643160
    Abstract: A system, method and computer program product for enhancing on-premise order management systems (OMS) designed for fulfillment transactions with analytic and optimization technologies and services hosted in a shared multi-tenant software-as-a-service (SaaS) environment, such as a hybrid cloud. The computer-implemented method improves an order management system by leveraging a “punch-out” approach based on user exits to integrate with and augment currently implemented order management processing and transaction flows. Using the hybrid cloud, an entity may retain data such as its accumulated business, sales, test and other data, and then run analytical queries, which can scale to support distributed computing tasks.
    Type: Grant
    Filed: January 13, 2017
    Date of Patent: May 5, 2020
    Assignee: International Business Machines Corporation
    Inventors: Ajay A. Deshpande, Saurabh Gupta, Arun Hampapur, Ali Koc, Yingjie Li, Xuan Liu, Christopher Milite, Brian L. Quanz, Chek Keong Tan, Dahai Xing, Xiaobo Zheng
  • 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: 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: 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
  • Patent number: 10417571
    Abstract: The present disclosure relates generally to computational solution algorithms (and associated systems and methods) applied to a stochastic unit commitment problem. In one example, the computational solution algorithms (and associated systems and methods) may be applied to the energy industry.
    Type: Grant
    Filed: May 11, 2015
    Date of Patent: September 17, 2019
    Assignee: International Business Machines Corporation
    Inventors: Jayant R. Kalagnanam, Ali Koc
  • 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: 10296932
    Abstract: A method is provided for selecting eligible nodes and item assignments to those nodes for fulfillment based on satisfaction of a reward constraint and fulfillment cost. This method includes several steps, including determining by a computer processor of the fulfillment engine whether each of the plurality of assignments to the plurality of nodes satisfies a reward constraint based on a first customer loyalty reward level of the plurality of customer loyalty reward levels, identifying by a computer processor of the fulfillment engine one or more satisfactory assignments to nodes by identifying which of the one or more assignments is both associated with an order fulfillment cost that is less than the maximum fulfillment cost and satisfies the reward constraint and automatically generating by a computer processor of the fulfillment engine a node order assignment assigning the current order to the one or more satisfactory nodes.
    Type: Grant
    Filed: May 12, 2016
    Date of Patent: May 21, 2019
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Ajay A. Deshpande, Arun Hampapur, Ali Koc, Yingjie Li, Xuan Liu, Brian L. Quanz, Dahai Xing
  • Patent number: 10164693
    Abstract: Technology for reducing buffer overflow at a Third Generation Partnership Project (3GPP) Serving Gateway (S-GW) is described. A buffer overflow message may be received, at an evolved node B (eNB) from the S-GW, indicating potential overflow of downlink information at an S-GW buffer. The downlink information may be stored at the S-GW buffer until a plurality of user equipments (UEs) awake from a low power mode during a discontinuous reception (DRX) sleep cycle. One or more UEs may be selected from the plurality of UEs according to predefined criteria, wherein the one or more UEs are in a connected mode. The DRX configurations of the one or more UEs may be modified in order to reduce the downlink information that is stored at the S-GW buffer, thereby reducing the potential for overflow at the S-GW buffer.
    Type: Grant
    Filed: December 16, 2013
    Date of Patent: December 25, 2018
    Assignee: INTEL IP CORPORATION
    Inventors: Ali Koc, Satish Jha, Maruti Gupta, Rath Vannithamby
  • Patent number: 10074066
    Abstract: A method, system and computer program product for managing an order in an Omni-channel order fulfillment system is disclosed. A stock-keeping unit (SKU) node level cost is predicted for a plurality of SKUs. The order is received containing one or more SKUs. A candidate list of fulfillment nodes is determined for fulfilling each of the one or more SKUs in the order using the predicted SKU node level cost and a fulfillment node-destination shipping distance. One or more fulfillment nodes are selected from the candidate list, and the order is fulfilled using the selected one or more fulfillment nodes.
    Type: Grant
    Filed: February 8, 2016
    Date of Patent: September 11, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Ajay A. Deshpande, Saurabh Gupta, Arun Hampapur, Alan J. King, Ali Koc, Pradyumnha G. Kowlani, Yingjie Li, Ding Ding Lin, Xuan Liu, Christopher Milite, Brian L. Quanz, Chek Keong Tan, Dahai Xing, Xiao Bo Zheng
  • 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
  • Publication number: 20180158008
    Abstract: A method for enhancing on-premise order management systems (OMS) designed for fulfillment transactions with analytic and optimization technologies and services hosted in a shared multi-tenant software-as-a-service (SaaS) environment, such as a hybrid cloud. The computer-implemented method improves an order management system by leveraging a “punch-out” approach based on user exits to integrate with and augment currently implemented order management processing and transaction flows. Using the hybrid cloud, an entity may retain data such as its accumulated business, sales, test and other data, and then run analytical queries, which can scale to support distributed computing tasks. A framework adaptor/connector is leveraged by the OMS to provide a web client for communicating with and integrating to the SaaS analytics runtime environment, encapsulating all necessary connection pooling, security, and data marshaling complexity away from the order management system to meet strict service response time windows.
    Type: Application
    Filed: November 30, 2017
    Publication date: June 7, 2018
    Inventors: Ajay A. Deshpande, Saurabh Gupta, Arun Hampapur, Ali Koc, Yingjie Li, Xuan Liu, Christopher Milite, Brian L. Quanz, Chek Keong Tan, Dahai Xing, Xiaobo Zheng
  • 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: 9900772
    Abstract: Technology for communicating a small data set between a user equipment (UE) and an evolved node B (eNB). A channel condition of a downlink channel with the eNB may be determined at the UE. A channel condition indication based on the channel condition may be communicated to the eNB. The small data may be transmitted to the eNB using a signaling radio bearer (SRB) when the channel condition is greater than a selected threshold.
    Type: Grant
    Filed: December 16, 2013
    Date of Patent: February 20, 2018
    Assignee: Intel IP Corporation
    Inventors: Rath Vannithamby, Ali Koc, Maruti Gupti, Jha Satish
  • Publication number: 20170330218
    Abstract: A method is provided for selecting eligible nodes and item assignments to those nodes for fulfillment based on satisfaction of a reward constraint and fulfillment cost. This method includes several steps, including determining by a computer processor of the fulfillment engine whether each of the plurality of assignments to the plurality of nodes satisfies a reward constraint based on a first customer loyalty reward level of the plurality of customer loyalty reward levels, identifying by a computer processor of the fulfillment engine one or more satisfactory assignments to nodes by identifying which of the one or more assignments is both associated with an order fulfillment cost that is less than the maximum fulfillment cost and satisfies the reward constraint and automatically generating by a computer processor of the fulfillment engine a node order assignment assigning the current order to the one or more satisfactory nodes.
    Type: Application
    Filed: May 12, 2016
    Publication date: November 16, 2017
    Inventors: Ajay A. Deshpande, Arun Hampapur, Ali Koc, Yingjie Li, Xuan Liu, Brian L. Quanz, Dahai Xing
  • Publication number: 20170330211
    Abstract: A method and computer readable medium for selecting order fulfillment nodes within an order fulfillment system. The method determines one or more product-node pairs of an omni-channel order fulfillment system responsive to a received customer order. There is received for each determined product-node pair, a first input including an associated price and a price markdown rate (r) for the product. There is further received for each product-node pair, input representing a current amount of supply availability of the product (w) for a period of time in an inventory; and a first threshold value and a second threshold values defining a supply availability window of the product. The method computes an inventory performance value based on the current w, the defined supply availability window, and one or more the p and r values; and selects a node for customer order fulfillment based on the computed cost of inventory performance value.
    Type: Application
    Filed: May 13, 2016
    Publication date: November 16, 2017
    Inventors: Ajay Deshpande, Saurabh Gupta, Arun Hampapur, Alan King, Ali Koc, Yingjie Li, Xuan Liu, Christopher Milite, Brian L. Quanz, Chek Keong Tan, Dahai Xing, Xiaobo Zheng
  • Publication number: 20170330123
    Abstract: A method and system determining an inventory threshold for offering for online sale or an inventory threshold for sourcing in node order assignment. The method includes receiving by a computer processor of a probabilistic cancellation module an electronic record of a current order or item. The program instructions executed by the processor of the probabilistic cancellation module allows the module to retrieve historical and current data of each node from a plurality of nodes. The method then includes automatically converting the retrieved historical data into a probability of cancellation of an item comprising the one or more items from the plurality of items. Further, the method includes identifying an inventory threshold for offering of an item or an inventory threshold for sourcing of one or more items of the current order, where the probability of item cancellation is lower than a predetermined order cancelation rate of the one or more items from the plurality of items.
    Type: Application
    Filed: May 10, 2016
    Publication date: November 16, 2017
    Inventors: Ajay A. Deshpande, Arun Hampapur, Ali Koc, Yingjie Li, Xuan Liu, Brian L. Quanz, Dahai Xing