Patents by Inventor Alon ARAD

Alon ARAD 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).

  • Network optimization
    Patent number: 11775852
    Abstract: A system may receive a cluster prediction requirement. The system may determine a first node conglomerate by sorting a first dataset into a first plurality of nodes. The system may determine a plurality of attributes by sorting a second dataset associated with the cluster prediction requirement. The system may determine a second node conglomerate for each of the plurality of attributes. A node confidence score may be assigned to each of the second plurality of nodes. The system may determine a node graph based on a comparison between the first node conglomerate and the second node conglomerate. The node graph may be iteratively modified based on a node optimization threshold value to generate a harmonized node graph. The node optimization threshold value may be based on a map confidence score allotted to the node graph.
    Type: Grant
    Filed: August 29, 2019
    Date of Patent: October 3, 2023
    Assignee: ACCENTURE GLOBAL SOLUTIONS LIMITED
    Inventors: Ashesh Parikh, Afzal Husain, Alon Arad, Suresh Aswathnarayana, Ragnar-Miguel Myhrer, Tejas Rao, Sharad Sachdev, Joshua Intriligator, Scott Andrew Alfieri
  • NETWORK OPTIMIZATION
    Publication number: 20210065031
    Abstract: A system may receive a cluster prediction requirement. The system may determine a first node conglomerate by sorting a first dataset into a first plurality of nodes. The system may determine a plurality of attributes by sorting a second dataset associated with the cluster prediction requirement. The system may determine a second node conglomerate for each of the plurality of attributes. A node confidence score may be assigned to each of the second plurality of nodes. The system may determine a node graph based on a comparison between the first node conglomerate and the second node conglomerate. The node graph may be iteratively modified based on a node optimization threshold value to generate a harmonized node graph. The node optimization threshold value may be based on a map confidence score allotted to the node graph.
    Type: Application
    Filed: August 29, 2019
    Publication date: March 4, 2021
    Applicant: ACCENTURE GLOBAL SOLUTIONS LIMITED
    Inventors: Ashesh PARIKH, Afzal HUSAIN, Alon ARAD, Suresh ASWATHNARAYANA, Ragnar-Miguel MYHRER, Tejas RAO, Sharad SACHDEV, Joshua INTRILIGATOR, Scott Andrew ALFIERI