Patents by Inventor Ashish Khisti
Ashish Khisti 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).
-
Publication number: 20230017542Abstract: It is provided a federated learning system for aggregating gradient information representing a result of training an AI model in an edge device, the federated learning system comprising the edge device and a server apparatus, the training module in the edge device being configured to generate an edge switch share in which the encrypted aggregated gradient is encrypted, and to transmit the generated edge switch share to the server apparatus, the encryption/decryption module in the server apparatus being configured to generate an encrypted aggregated gradient for decryption by adding edge switch shares received from the plurality of the edge device, generate an aggregated gradient by decrypting the generated encrypted aggregated gradient for decryption, and to transmit the generated aggregated gradient to the edge device, the training module in the edge device being configured to train the AI model by using the aggregated gradient received from the server apparatus.Type: ApplicationFiled: April 18, 2022Publication date: January 19, 2023Applicants: The Governing Council of the University of Toronto, Hitachi Solutions, Ltd.Inventors: Ashish KHISTI, Syederfan HOSSEINI, Mitsuharu OBA, Takushi FUJIMOTO
-
Patent number: 10461780Abstract: In various implementations, a method includes determining a sequence of source packets. In some implementations, the sequence of source packets satisfies a windowing condition. In various implementations, the method includes synthesizing a first set of one or more parity packets as a function of a first set of source packets in the sequence. In some implementations, the first set of source packets satisfies a first encoding pattern. In various implementations, the method includes synthesizing a second set of parity packets as a function of a second set of source packets in the sequence. In some implementations, the second set of source packets satisfies a second encoding pattern that is different from the first encoding pattern. In some implementations, the first and second encoding patterns characterize an encoding structure determined as a function of a channel characterization vector.Type: GrantFiled: January 13, 2017Date of Patent: October 29, 2019Assignee: Cisco Technology, Inc.Inventors: Xiaoqing Zhu, Ahmed Badr, Wai-tian Tan, Ashish Khisti, John Apostolopoulos
-
Patent number: 10218765Abstract: In one embodiment, a device in a network assigns packets from a communication transmitted via the network to time windows over a period of time. The device determines a transmission performance metric for each of the packets in a particular time window and calculates, for each of the time windows, local disturbance scores, which are based on the transmission performance metrics for the packet in the time windows. A particular local disturbance score for a particular time window maps the transmission performance metrics for the packets in the time window to a perceived quality metric. The device determines a distortion score for the communication by aggregating the local disturbance scores for the time windows over the period of time.Type: GrantFiled: September 21, 2016Date of Patent: February 26, 2019Assignee: Cisco Technology, Inc.Inventors: Xiaoqing Zhu, Dan Tan, John George Apostolopoulos, Ahmed Atef Younes Badr, Ashish Khisti
-
Publication number: 20180205394Abstract: In various implementations, a method includes determining a sequence of source packets. In some implementations, the sequence of source packets satisfies a windowing condition. In various implementations, the method includes synthesizing a first set of one or more parity packets as a function of a first set of source packets in the sequence. In some implementations, the first set of source packets satisfies a first encoding pattern. In various implementations, the method includes synthesizing a second set of parity packets as a function of a second set of source packets in the sequence. In some implementations, the second set of source packets satisfies a second encoding pattern that is different from the first encoding pattern. In some implementations, the first and second encoding patterns characterize an encoding structure determined as a function of a channel characterization vector.Type: ApplicationFiled: January 13, 2017Publication date: July 19, 2018Inventors: Xiaoqing Zhu, Ahmed Badr, Wai-tian Tan, Ashish Khisti, John Apostolopoulos
-
Patent number: 9641803Abstract: In one embodiment, a device in a network identifies delay requirements of each of a plurality of media streams. The device selects a joint forward error correction (FEC) encoding strategy for the plurality of media streams based on the identified delay requirements of the streams and on a burst loss length of a communication channel. The device applies the selected joint FEC encoding strategy to the plurality of media streams, to form a multiplexed packet stream. The device sends the multiplexed packet stream to one or more nodes in the network via the communication channel.Type: GrantFiled: October 13, 2016Date of Patent: May 2, 2017Assignee: Cisco Technology, Inc.Inventors: Ahmed Atef Younes Badr, Ashish Khisti, Dan Tan, John George Apostolopoulos, Xiaoqing Zhu
-
Patent number: 8352832Abstract: An error correction code includes a separate error code portion for each of two or more separate burst erasure durations (or burst error durations). For each burst erasure duration, the code can be employed to recover from the burst erasure with a different delay time. Each error code portion has a particular parameter for burst duration (B) and delay (T), meaning that the code can be used to recover from a burst erasure of duration B with delay T. Each error code portion is based on separating the source symbols into sub-symbols and diagonally interleaving the sub-symbols based on the (B,T) parameters for the error code portion. Accordingly, different burst erasures are recovered from with different delays.Type: GrantFiled: June 19, 2009Date of Patent: January 8, 2013Assignee: Deutsche Telekom AGInventors: Ashish Khisti, Jatinder Pal Singh
-
Publication number: 20100325521Abstract: An error correction code includes a separate error code portion for each of two or more separate burst erasure durations (or burst error durations). For each burst erasure duration, the code can be employed to recover from the burst erasure with a different delay time. Each error code portion has a particular parameter for burst duration (B) and delay (T), meaning that the code can be used to recover from a burst erasure of duration B with delay T. Each error code portion is based on separating the source symbols into sub-symbols and diagonally interleaving the sub-symbols based on the (B,T) parameters for the error code portion. Accordingly, different burst erasures are recovered from with different delays.Type: ApplicationFiled: June 19, 2009Publication date: December 23, 2010Applicant: Deutsche Telekom AGInventors: Ashish Khisti, Jatinder Pal Singh
-
Patent number: 7779268Abstract: Biometric parameters acquired from human forces, voices, fingerprints, and irises are used for user authentication and access control. Because the biometric parameters are continuous and vary from one reading to the next, syndrome codes are applied to determine biometric syndrome vectors. The biometric syndrome vectors can be stored securely while tolerating an inherent variability of biometric data. The stored biometric syndrome vector is decoded during user authentication using biometric parameters acquired at that time. The syndrome codes can also be used to encrypt and decrypt data.Type: GrantFiled: November 29, 2006Date of Patent: August 17, 2010Assignee: Mitsubishi Electric Research Laboratories, Inc.Inventors: Stark C. Draper, Ashish Khisti, Emin Martinian, Anthony Vetro, Jonathan S. Yedidia
-
Publication number: 20070174633Abstract: Biometric parameters acquired from human forces, voices, fingerprints, and irises are used for user authentication and access control. Because the biometric parameters are continuous and vary from one reading to the next, syndrome codes are applied to determine biometric syndrome vectors. The biometric syndrome vectors can be stored securely while tolerating an inherent variability of biometric data. The stored biometric syndrome vector is decoded during user authentication using biometric parameters acquired at that time. The syndrome codes can also be used to encrypt and decrypt data.Type: ApplicationFiled: November 29, 2006Publication date: July 26, 2007Inventors: Stark Draper, Ashish Khisti, Emin Martinian, Anthony Vetro, Jonathan Yedidia
-
Patent number: 7239611Abstract: Appropriate determinations in a series of tests, which transition from more passive tests to more active tests, control the admission of data streams onto a network data path. More passive tests can include promiscuous mode and packet-pair tests. When the results of more passive tests indicate a reduce likelihood of a data stream causing a network data path to transition into a congested state, the network data path can be actively probed to make a more precise determination on the likelihood of congestion. A train of diagnostic data packets is transmitted at a diagnostic data transfer rate having a significantly reduced chance of causing congestion. A train of target data packets is transmitted at a requested application transfer data rate. The number of target data packets received within a specified delay threshold is compared to the number of diagnostic data packets receive with the delay threshold.Type: GrantFiled: March 3, 2003Date of Patent: July 3, 2007Assignee: Microsoft CorporationInventors: Ashish Khisti, Christian Huitema, Aditya Dube
-
Publication number: 20060048038Abstract: A method compresses a set of correlated signals by first converting each signal to a sequence of integers, which are further organized as a set of bit-planes. This can be done by signal transformation and quantization. An inverse accumulator is applied to each bit-plane to produce a bit-plane of shifted bits, which are permuted according to a predetermined permutation to produce bit-planes of permuted bits. Each bit-plane of permuted bits is partitioned into a set of blocks of bits. Syndrome bits are generated for each block of bits according to a rate-adaptive base code. Subsequently, the syndrome bits can be decompressed in a decoder to recover the original correlated signals. For each bit-plane of the corresponding signal, a bit probability estimate is generated. Then, the bit-plane is reconstructed using the syndrome bits and the bit probability estimate.Type: ApplicationFiled: August 27, 2004Publication date: March 2, 2006Inventors: Jonathan Yedidia, Anthony Vetro, Ashish Khisti, Dmitry Malioutov
-
Publication number: 20040174815Abstract: Appropriate determinations in a series of tests, which transition from more passive tests to more active tests, control the admission of data streams onto a network data path. More passive tests can include promiscuous mode and packet-pair tests. When the results of more passive tests indicate a reduce likelihood of a data stream causing a network data path to transition into a congested state, the network data path can be actively probed to make a more precise determination on the likelihood of congestion. A train of diagnostic data packets is transmitted at a diagnostic data transfer rate having a significantly reduced chance of causing congestion. A train of target data packets is transmitted at a requested application transfer data rate. The number of target data packets received within a specified delay threshold is compared to the number of diagnostic data packets receive with the delay threshold.Type: ApplicationFiled: March 3, 2003Publication date: September 9, 2004Inventors: Ashish Khisti, Christian Huitema, Aditya Dube