Rahul Gupta

US Patent:

7275071, Sep 25, 2007

Filed:

Feb 27, 2004

Appl. No.:

10/789191

Inventors:

Jeffrey S. Weyrich - Duluth GA, US
Nitin K. Gupta - Lawrenceville GA, US
Rahul Gupta - Duluth GA, US
David Lutz - Dacula GA, US
Aaron Lynch - Atlanta GA, US
Anthony Owens - Lawrenceville GA, US
Howard B. Soloway - Broomfield CO, US
Deborah A. Spencer - Apopka FL, US
John DeBoard - Lawrenceville GA, US
Ching F. Wong - Suwanee GA, US
Yimin Zhang - Roanoke VA, US

Assignee:

Scientific-Atlanta, Inc. - Lawrenceville GA

International Classification:

G06F 17/30

US Classification:

707200, 707 4, 707102, 7071041

Abstract:

The present invention is suitable for use in a communications system that downloads applications over a broadcast file system (BFS). An application services interface (ASI) provides the BFS an application file including a configuration file and an image file that are stored in a service manager in set-tops. Additionally, the ASI provides the BFS a content file that is included in the application file. The provided content file is separated into service files, where each service file is associated with a particular service. When a set-top requests a service, the associated service file is subsequently loaded onto the set-top. Alternatively, a service file is stored in memory until such time as another service is requested, which at that point the older service file is removed from memory to allow space for the newly requested service file.

US Patent:

7562389, Jul 14, 2009

Filed:

Jul 30, 2004

Appl. No.:

10/903391

Inventors:

Rajan Goyal - Sunnyvale CA, US
Virgil N. Mihailovici - San Jose CA, US
Rahul Gupta - Sunnyvale CA, US
Pere Monclus - San Jose CA, US
Ahsan Habib - Los Gatos CA, US
Kirtikumar L. Prabhu - San Jose CA, US
Christophe J. Paggen - Plainevaux, BE
Shyamasundar S. Kaluve - Bangalore, IN

Assignee:

Cisco Technology, Inc. - San Jose CA

International Classification:

G06F 11/00
H04L 9/00

US Classification:

726 22, 726 11, 726 12, 713153, 713154

Abstract:

In accordance with one embodiment of the present invention, a method includes receiving a packet at a physical interface of a network security gateway. The packet is tagged with a first VLAN identifier associated with an external network. The method also includes communicating a copy of the packet to a first processor, analyzing the copy of the packet at the first processor to determine whether the packet violates a security condition, and communicating a reply message from the first processor to the interface. The reply message indicates whether the packet violates a security condition. If the packet does not violate a security condition, the method includes re-tagging the packet with a second VLAN identifier associated with a protected network by using a second processor at the physical interface. The method further includes communicating the re-tagged packet to the protected network if the packet does not violate a security condition.

US Patent:

20050067949, Mar 31, 2005

Filed:

Sep 30, 2003

Appl. No.:

10/676434

Inventors:

Sriram Natarajan - Burlingame CA, US
Andrew Ingle - Fremont CA, US
Rahul Gupta - Santa Clara CA, US

International Classification:

H05B033/14
H05B033/10

US Classification:

313504000, 313503000, 313506000, 427066000, 445024000

Abstract:

An organic polymer solution is made of at least one organic polymer, a first solvent, and a second solvent. The first solvent has a high solubility (e.g., the first solvent dissolves at least about one weight percent of the organic polymers) and has a faster evaporation rate than the second solvent, and the second solvent has a very low solubility (e.g., the second solvent dissolves less than about one-fourth weight percent of the organic polymers). After the solution is deposited on an object, the solution is allowed to dry. As the solution dries, the first solvent due to its faster evaporation rate than the second solvent starts to evaporate from the solution, and soon after the first solvent starts to evaporate, the one or more organic polymers, due to its lower solubility in the second solvent, rapidly gels resulting in a substantially uniform organic polymer layer.

US Patent:

20060017057, Jan 26, 2006

Filed:

Jul 20, 2004

Appl. No.:

10/895862

Inventors:

Brian Cumpston - Pleasanton CA, US
Pierre-Marc Allemand - San Jose CA, US
Vi-En Choong - San Jose CA, US
Rahul Gupta - Milpitas CA, US

International Classification:

H01L 29/22
H01L 29/227
H01L 33/00
B32B 9/00
B32B 19/00

US Classification:

257098000

Abstract:

An organic light emitting diode (“OLED”) device is formed with a thick light emitting polymer layer, hole transporting layer and an interlayer between the thick LEP layer and the hole transporting layer.

US Patent:

20070018153, Jan 25, 2007

Filed:

Jul 20, 2005

Appl. No.:

11/186201

Inventors:

Brian Cumpston - Pleasanton CA, US
Rahul Gupta - Milpitas CA, US
Franky So - San Jose CA, US

International Classification:

H01L 29/08

US Classification:

257040000

Abstract:

The light emitting polymer layer of an organic light emitting diode (“OLED”) device is formed to be thick having a thickness of more than 80 nanometers and preferably between 80 and 200 nanometers.

US Patent:

20210026846, Jan 28, 2021

Filed:

Oct 13, 2020

Appl. No.:

16/949076

Inventors:

- Mountain View CA, US
Fernando Pereira - Palo Alto CA, US
Ni Lao - Belmont CA, US
John Blitzer - Mountain View CA, US
Rahul Gupta - Foster City CA, US

International Classification:

G06F 16/245

Abstract:

Implementations include systems and methods for querying a data graph. An example method includes receiving a machine learning module trained to produce a model with multiple features for a query, each feature representing a path in a data graph. The method also includes receiving a search query that includes a first search term, mapping the search query to the query, and mapping the first search term to a first entity in the data graph. The method may also include identifying a second entity in the data graph using the first entity and at least one of the multiple weighted features, and providing information relating to the second entity in a response to the search query. Some implementations may also include training the machine learning module by, for example, generating positive and negative training examples from an answer to a query.

US Patent:

20200207339, Jul 2, 2020

Filed:

Dec 26, 2018

Appl. No.:

16/232172

Inventors:

- San Francisco CA, US
Samuel Abrahams - San Francisco CA, US
Batyr Nurbekov - San Francisco CA, US
Rahul Gupta - San Francisco CA, US

International Classification:

B60W 30/095
G05D 1/02
G05D 1/00
G06K 9/00
G06N 7/00
G06N 20/00

Abstract:

Various technologies described herein pertain to labeling sensor data generated by autonomous vehicles. A computing device identifies candidate path plans for an object in a driving environment of an autonomous vehicle based upon sensor data generated by sensor systems of the autonomous vehicle. The sensor data is indicative of positions of the object in the driving environment at sequential timesteps in a time period. Each candidate path plan is indicative of a possible maneuver being executed by the object during the time period. The computing device generates a weighted directed graph based upon the candidate path plans. The computing device determines a shortest path through the weighted directed graph. The computing device assigns a maneuver label to the sensor data based upon the shortest path, wherein the maneuver label is indicative of a maneuver that the object executes during the time period.

US Patent:

20200021496, Jan 16, 2020

Filed:

Jul 10, 2018

Appl. No.:

16/031621

Inventors:

- Redwood City CA, US
Eric Choi - Piedmont CA, US
Rahul Gupta - Dublin CA, US
Prashant Jain - Mountain View CA, US

International Classification:

H04L 12/24
H04L 29/06
G06F 21/57
G06Q 40/08

Abstract:

A system, method and computer-readable medium for data breach simulation and impact analysis in a computer network, including generating an exposure matrix corresponding to data stores connected to the computer network, the exposure matrix storing a correspondence between regulations and an exposure of each data store the regulations, generating approximation matrices from the exposure matrix by iteratively applying a data compression algorithm to the exposure matrix, each successive iteration of the data compression algorithm being configured to more closely approximate the exposure matrix than a previous iteration of the data compression algorithm, simulating a plurality of data breach and mitigation scenarios on the plurality of data stores based at least in part on the plurality of approximation matrices to determine an overall impact of each data breach and mitigation scenario, determining an optimal data breach and mitigation scenario in the plurality of data breach and mitigation scenarios.