Manish Mehta

US Patent:

6415193, Jul 2, 2002

Filed:

Jul 8, 1999

Appl. No.:

09/350039

Inventors:

Manoj Betawar - Fremont CA
Vrunda Bhagwat - Santa Clara CA
Dinesh Goradia - Fremont CA
Manish Mehta - Santa Clara CA
Nitin Parekh - Milpitas CA

Assignee:

FabCentric, Inc. - Sunnyvale CA

International Classification:

G06F 1900

US Classification:

700 97, 700121

Abstract:

A universal recipe editor is for off-line viewing and editing of semiconductor-manufacturing recipes. The universal recipe editor can read recipes from a wide variety of semiconductor-manufacturing machines from different manufacturers using recipe distributed object model (R-DOM) files. An R-DOM file is generated for each kind of recipe-file format to locate process parameters within proprietary recipe-file formats. The sequence of parameters in the R-DOM file matches the sequence in the recipe data file so that parameters may be mapped from recipe data files for display and editing. ASCII or binary recipe file formats are mapped from the recipe data file using R-DOM objects. Revision and authoring information is kept in a recipe information file for each recipe. Each line of the recipe data file can specify a different process parameter. Security or access rights for each parameter is added for each parameter by including security codes on each line in the R-DOM file.

US Patent:

6665575, Dec 16, 2003

Filed:

Jan 18, 2002

Appl. No.:

09/683569

Inventors:

Manoj Betawar - Fremont CA
Vrunda Bhagwat - Santa Clara CA
Dinesh Goradia - Fremont CA
Manish Mehta - Santa Clara CA
Nitin Parekh - Milpitas CA

Assignee:

FabCentric, Inc. - Sunnyvale CA

International Classification:

G06F 1900

US Classification:

700121, 700 87, 713200, 717170

Abstract:

A universal recipe editor for editing of semiconductor-manufacturing recipes. The universal recipe editor can read recipes from a wide variety of semiconductor-manufacturing machines from different manufacturers using recipe distributed object model (R-DOM) files. An R-DOM file is generated for each kind of recipe-file format to locate process parameters within proprietary recipe-file formats. The sequence of parameters in the R-DOM file matches the sequence in the recipe data file so that parameter may be mapped from recipe data files for display and editing. ASCII or binary recipe file formats are mapped from the recipe data file using R-DOM objects. Revision and authorng information is kept in a recipe information file for each recipe.

US Patent:

8627423, Jan 7, 2014

Filed:

Apr 9, 2010

Appl. No.:

12/757771

Inventors:

Santashil PalChaudhuri - Mountain View CA, US
Anupam Wadhawan - Bangalore, IN
Shekhar Kshirsagar - San Jose CA, US
Manish Mehta - Santa Clara CA, US

Assignee:

Aruba Networks, Inc. - Sunnyvale CA

International Classification:

H04L 29/06

US Classification:

726 6, 713153

Abstract:

Authorizing remote access points for use in a network: After the remote access point is provisioned to communicate securely to a controller using its TCP/IP address provided by a user, the remote access point is put into an un-authorized state by the controller pending further authorization. The user is presented with a secure captive portal page authenticating the end-user. User's authentication credentials are verified by the controller. After the remote access point has been authorized, the controller marks it verified as a fully functional node, and saves this state. The remote access point is provisioned with the current provisioning parameters for the remote access point as configured by the IT administrator for the end user, so that each remote access point can have unique per-user configuration applied.

US Patent:

20100313262, Dec 9, 2010

Filed:

Jun 3, 2009

Appl. No.:

12/477774

Inventors:

Manish Mehta - Santa Clara CA, US
Shekhar Kshirsagar - San Jose CA, US

Assignee:

ARUBA NETWORKS, INC. - Sunnyvale CA

International Classification:

G06F 21/20
H04W 84/02
H04L 9/00
G06F 1/24
G06F 9/44
H04L 9/32

US Classification:

726 12, 370338, 380255, 713100, 717171, 713176

Abstract:

Provisioning remote access points for use in a telecommunication network. A remote access point contains identity information established during manufacturing; this identity information may be in the nature of a digital certificate. The identity information is stored in the remote access point, and may be stored in a Trusted Platform Module if present. When the remote access node is powered up in unprovisioned state, outside the manufacturing environment, it attempts to establish an internet connection via a first wired interface, and queries a user for information representing the TCP/IP address of its controller via a second wired interface. Once an internet connection is present, and a TCP/IP address has been provided, the remote access point attempts to connect to the controller at that address. The controller may filter connection requests through a whitelist of approved remote access points. Once a connection is established, controller and access point exchange and verify each other's identities. This may be done through the exchange and verification of digital certificates. Provisioning information is downloaded from controller to remote access point and installed. This may be done via a tunnel such as an encrypted tunnel. Software updates may be applied. The provisioned remote access point is placed in operation.

US Patent:

20110029771, Feb 3, 2011

Filed:

Jul 28, 2009

Appl. No.:

12/510725

Inventors:

Manish Mehta - Santa Clara CA, US
Shekhar Kshirsagar - San Jose CA, US

Assignee:

ARUBA NETWORKS, INC. - Sunnyvale CA

International Classification:

H04L 9/00

US Classification:

713156

Abstract:

Automated generation of certificates from a Certificate Authority through the use of an Enrollment Agent. Devices needing certificates generate the necessary keys and package public key information with other identifying information about the device and send this information to an Enrollment Agent. The Enrollment Agent takes this information and submits it on behalf of the device to a Certificate Authority, managing the interaction with the Certificate Authority on behalf of the device. The Certificate Authority signs the request, returning a certificate to the Enrollment Agent. The Enrollment Agent packages the certificate along with the other certificates needed to establish a chain of trust and returns these to the device. Certificates may be stored in the device in flash memory. The process is secure as long as the communications path between the devices and the Enrollment Agent is secure; a secure VPN or HTTPS: connection allows the devices and the Enrollment Agent to be in separate locations.

US Patent:

20140082072, Mar 20, 2014

Filed:

Mar 15, 2013

Appl. No.:

13/834257

Inventors:

- Dublin, IE
Gurdeep Singh Virdi - Bangalore, IN
Matthew T. Short - San Jose CA, US
Manish Mehta - Sunnyvale CA, US
Sakshi C. Jain - Bangalore, IN
Upendra Chintala - Whitefield, IN

Assignee:

Accenture Global Services Limited - Dublin

International Classification:

H04L 29/06

US Classification:

709204

Abstract:

A dynamic expert solicitation, collaboration and reputation management system monitors and matches tasks with experts qualified to perform the tasks. The system receives a request for assistance associated with a task from a user. The request for assistance includes task information such as a due date, at least one skill associated with the task, and badges assigned to the task. The system publishes the request for assistance to at least one community of practice web page from among a plurality of community of practice web pages, and obtains a response to the request for assistance from another user. Upon completion of the task, they system allocates the badges to a profile of the second user, and publishes completion of the task to an activity feed of the community of practice web site.

US Patent:

58707352, Feb 9, 1999

Filed:

May 1, 1996

Appl. No.:

8/641404

Inventors:

Rakesh Agrawal - San Jose CA
Manish Mehta - San Jose CA
John Christopher Shafer - Amherst MA

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 1730

US Classification:

707 3

Abstract:

A method and system are disclosed for generating a decision-tree classifier in parallel in a multi-processor system, from a training set of records. The method comprises the steps of: partitioning the records among the processors, each processor generating an attribute list for each attribute, and the processors cooperatively generating a decision tree by repeatedly partitioning the records using the attribute lists. For each node, each processor determines its best split test and, along with other processors, selects the best overall split for the records at that node. Preferably, the gini-index and class histograms are used in determining the best splits. Also, each processor builds a hash table using the attribute list of the split attribute and shares it with other processors. The hash tables are used for splitting the remaining attribute lists. The created tree is then pruned based on the MDL principle, which encodes the tree and split tests in an MDL-based code, and determines whether to prune and how to prune each node based on the code length of the node.

US Patent:

61381152, Oct 24, 2000

Filed:

Feb 5, 1999

Appl. No.:

9/245765

Inventors:

Rakesh Agrawal - San Jose CA
Manish Mehta - San Jose CA
John Christopher Shafer - Amherst MA

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 1730

US Classification:

707 3

Abstract:

A method and system are disclosed for generating a decision-tree classifier in parallel in a multi-processor system, from a training set of records. The method comprises the steps of: partitioning the records among the processors, each processor generating an attribute list for each attribute, and the processors cooperatively generating a decision tree by repeatedly partitioning the records using the attribute lists. For each node, each processor determines its best split test and, along with other processors, selects the best overall split for the records at that node. Preferably, the gini-index and class histograms are used in determining the best splits. Also, each processor builds a hash table using the attribute list of the split attribute and shares it with other processors. The hash tables are used for splitting the remaining attribute lists. The created tree is then pruned based on the MDL principle, which encodes the tree and split tests in an MDL-based code, and determines whether to prune and how to prune each node based on the code length of the node.