Kai Zhu, 41Ann Arbor, MI

8255854, Aug 28, 2012

Apr 2, 2010

12/753247

Kai Zhu - Palo Alto CA, US
Volker Hecht - Barsinghausen, DE

Actel Corporation - Mountain View CA

G06F 17/50
G06F 9/455
G06F 7/38

716117, 716110, 716113, 716116, 326 38

A method for reducing delay in an integrated circuit by compensating for differences in rise and fall delay times comprises creating a timing graph; computing minimum delay tuples for nodes in the timing graph; if there is not at least one feasible delay tuple, determining a longest path and computing minimum delay tuples for the longest path; changing polarities on the longest path to reduce delays; updating the timing graph by transferring new polarity and delay values; performing timing analysis to determine a new longest path if the new longest path is shorter than the prior longest path, accepting a resulting polarity selection and computing minimum delay tuples for the longest path; if the new longest path is not shorter than the prior longest path, accepting a resulting polarity selection and implementing changes in a user-program bitstream.

2004001, Jan 22, 2004

Jul 3, 2002

10/189936

Kai Zhu - Houston TX, US
Helen El Mallakh - Houston TX, US

CONOCO INC.

G06F017/60

705/007000

A method and system which deal with the evaluation of the impact of political risk on forecast and value of a project. Key macro political risks are identified and quantified. Project specific political risk events that can result from changes in macro political uncertainties are identified and the probabilities quantified. The relationship of the macro political risks and project specific political risk events are defined. The key project economic parameters susceptible to political uncertainties are identified and the threshold or changes in economic parameters upon the occurrence of a risk event are quantified. The data is assembled into a computer system and a Monte Carlo analysis can be preformed to forecast the probable value of the project taking into account potential political risks.

2023001, Jan 19, 2023

Sep 13, 2022

17/931595

- San Jose CA, US
Navindra Yadav - Cupertino CA, US
Tapan Shrikrishna Patwardhan - Mountain View CA, US
Umamaheswaran Arumugam - San Jose CA, US
Darshan Shrinath Purandare - Fremont CA, US
Aiyesha Ma - San Francisco CA, US
Hongyang Zhang - Mountain View CA, US
Kai Zhu - San Jose CA, US

H04L 9/40

The present disclosure relates to securing workloads of a network by identifying compromised elements in communication with the network and preventing their access to network resources. In one aspect, a method includes monitoring network traffic at network elements of a network; detecting a compromised element in communication with one or more of the network elements, the compromised element being associated with at least one network threat; and based on a defined network policy, applying one of a number of different access prevention schemes to the compromised element to prevent access to the network by the compromised element.

2021033, Oct 28, 2021

Jul 11, 2021

17/372494

- Dallas TX, US
Kai Zhu - Dallas TX, US

Telesolve, Inc., DBA in Telesystems - Dallas TX

G06Q 10/06
G06Q 10/10
H04L 12/24
G06F 3/0482

A system is disclosed that sends, through one or more messaging modalities, an electronic message containing a system or user genera0ted unique identifier to at least one recipient on a system or user enabled and controlled list. The system receives a response electronic message containing the unique identifier and response data identified by a symbol. The program verifies the validity of the unique identifier and optionally that a sender of the response message is on the list. If the unique identifier is verified, the program correlates the message response data with the unique identifier and sends an additional message replicating the response data to the controlled list as a reply or update concerning the message. The program repeats the receiving, verifying, and sending to allow further updates on the message using the modality of communication.

2020005, Feb 20, 2020

Oct 25, 2019

16/664417

- Dallas TX, US
Kevin Scoones - San Jose CA, US
Jairo D. Olivares - Dallas TX, US
Kai Zhu - Knoxville TN, US

H02J 7/00
H03K 19/0185
H03K 17/687
H02M 3/00
H03K 17/12
H03K 17/06

A driver circuit includes two high-side switches and a single low-side switch, output inductor, and output capacitor. By having multiple high-side switches, the driver can regulate power from multiple charging devices. The high-side switches share a channel with an input capacitor for that channel and the channels are connected to the low-side switch at a common node. When the capacitor for one of the channels becomes charged quickly, the capacitor of the other channel will balance itself with the charged capacitor. To avoid damaging the high-side switches, a low-impedance bridge and driver circuit is connected between the channels.

2019023, Aug 1, 2019

Jun 29, 2018

16/024182

- San Jose CA, US
Navindra Yadav - Cupertino CA, US
Umamaheswaran Arumugam - San Jose CA, US
Michael Watts - Mill Valley CA, US
Shashi Gandham - Fremont CA, US
Darshan Shrinath Purandare - Fremont CA, US
Duy Nguyen - San Jose CA, US
Hai Vu - San Jose CA, US
Kai Zhu - San Jose CA, US
Aiyesha Ma - San Francisco CA, US
Tapan Shrikrishna Patwardhan - Mountain View CA, US
Jothi Prakash Prabakaran - Fremont CA, US

H04L 29/08
H04L 12/24
H04L 12/26

Aspects of the disclosed technology provide methods for automatically tuning load-balancer configurations in a network environment. In some implementations, a process of the disclosed technology includes steps for collecting flow records of traffic flow segments at a middle box in a network environment, the traffic flow segments corresponding to one or more traffic flows passing through the middle box, analyzing the flow records to identify one or more traffic patterns in the network environment, and automatically updating a load balancer configuration based on the one or more traffic patterns, wherein updating the load balancer configuration improves at least one traffic flow parameter for at least one of the traffic flows passing through the middle box. Systems and machine-readable media are also provided.

2019022, Jul 25, 2019

May 21, 2018

15/985520

- San Jose CA, US
Navindra Yadav - Cupertino CA, US
Umamaheswaran Arumugam - San Jose CA, US
Michael Watts - Mill Valley CA, US
Shashi Gandham - Fremont CA, US
Prasannakumar Jobigenahally Malleshaiah - Sunnyvale CA, US
Duy Nguyen - San Jose CA, US
Hai Vu - San Jose CA, US
Aiyesha Ma - San Francisco CA, US
Tapan Shrikrishna Patwardhan - Mountain View CA, US
Kai Zhu - San Jose CA, US
Jothi Prakash Prabakaran - Fremont CA, US

H04L 12/24
H04L 12/26

Systems, methods, and computer-readable media for flow stitching network traffic flow segments at a middlebox in a network environment. In some embodiments, flow records of traffic flow segments at a middlebox in a network environment are collected. The flow records can include transaction identifiers assigned to the traffic flow segments. Sources and destinations of the traffic flow segments with respect to the middlebox can be identified using the flow records. Further, the traffic flow segments can be stitched together to form a plurality of stitched traffic flows at the middlebox based on the transaction identifiers and the sources and destinations of the traffic flow segments in the network environment with respect to the middlebox. A configuration of the middlebox operating in the network environment can be identified based on the stitched traffic flows at the middlebox in the network environment.

2019023, Jul 25, 2019

Jun 18, 2018

16/011427

- San Jose CA, US
Navindra Yadav - Cupertino CA, US
Umamaheswaran Arumugam - San Jose CA, US
Michael Watts - Mill Valley CA, US
Shashi Gandham - Fremont CA, US
Duy Nguyen - San Jose CA, US
Hai Vu - San Jose CA, US
Prasannakumar Jobigenahally Malleshaiah - Sunnyvale CA, US
Aiyesha Ma - San Francisco CA, US
Kai Zhu - San Jose CA, US
Darshan Shrinath Purandare - Fremont CA, US
Jothi Prakash Prabakaran - Fremont CA, US

H04L 12/891
H04L 29/08

Systems, methods, and computer-readable media for flow stitching network traffic flow segments across middleboxes. A method can include collecting flow records of traffic flow segments at a first middlebox and a second middlebox in a network environment including one or more transaction identifiers assigned to the traffic flow segments. Sources and destinations of the traffic flow segments can be identified with respect to the first middlebox and the second middlebox. Corresponding subsets of the traffic flow segments can be stitched together to from a first stitched traffic flow at the first middlebox and a second stitched traffic flow at the second middlebox. The first and second stitched traffic flows can be stitched together to form a cross-middlebox stitched traffic flow across the first middlebox and the second middlebox. The cross-middlebox stitched traffic flow can be incorporated as part of network traffic data for the network environment.