Patents by Inventor Srikanth Narayanan
Srikanth Narayanan 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).
-
Patent number: 10767633Abstract: The present invention relates to a method and wind turbine for determining a dynamic twist of one or more blades. One or more first signals are received from a first wireless sensor attached to a blade of a wind turbine and a first angle is determined based on the received first signals. One or more second signals are received from a second wireless sensor attached to a blade of a wind turbine and spaced apart from the first wireless sensor by a predetermined distance. A second angle is determined based on the received second signals. A dynamic twist of the blade is determined based on the determined first angle, the determined second angle and the predetermined distance.Type: GrantFiled: December 22, 2015Date of Patent: September 8, 2020Assignee: VESTAS WIND SYSTEMS A/SInventor: Srikanth Narayanan
-
Patent number: 10318593Abstract: Data extraction and automatic validation from digitized documents in non-editable formats is disclosed. Paper documents are digitized or converted into formats suitable for storage on computers or other digital devices. The digitized documents are classified into one of a plurality of document types and based on the document type, document processing rules are selected for analyzing the digitized documents to enable data extraction and automatic validation. The positions and values of the data fields in the digitized documents are obtained using machine learning techniques. The data field values are automatically validated and assigned confidence scores. Data fields with low confidence scores are flagged for manual review.Type: GrantFiled: August 21, 2017Date of Patent: June 11, 2019Assignee: ACCENTURE GLOBAL SOLUTIONS LIMITEDInventors: Prakash Ghatage, Nirav Sampat, Kumar Viswanathan, Suvendu Kumar Mahapatra, Srikanth Narayanan, Rekha Mani, Aravind Krishnan, Rahul Kotnala, Kameshkumar Lakshminarayanan, Ashish Jain
-
Publication number: 20180373711Abstract: Data extraction and automatic validation from digitized documents in non-editable formats is disclosed. Paper documents are digitized or converted into formats suitable for storage on computers or other digital devices. The digitized documents are classified into one of a plurality of document types and based on the document type, document processing rules are selected for analyzing the digitized documents to enable data extraction and automatic validation. The positions and values of the data fields in the digitized documents are obtained using machine learning techniques. The data field values are automatically validated and assigned confidence scores. Data fields with low confidence scores are flagged for manual review.Type: ApplicationFiled: August 21, 2017Publication date: December 27, 2018Applicant: ACCENTURE GLOBAL SOLUTIONS LIMITEDInventors: Prakash GHATAGE, Nirav SAMPAT, Kumar VISWANATHAN, Suvendu Kumar MAHAPATRA, Srikanth NARAYANAN, Rekha MANI, Aravind KRISHNAN, Rahul KOTNALA, Kameshkumar LAKSHMINARAYANAN, Ashish JAIN
-
Patent number: 10069732Abstract: Exemplary techniques for architecture-independent dynamic flow learning in a packet forwarder are described. A packet forwarder includes a plurality of forwarding threads and a plurality of provisioning threads, and can implement three functional blocks to learn new flows—an admission control block, a forwarding database building block, and a notification path block. An admission control module can control the ability for forwarding threads to place flow operation requests in operation queues. Provisioning threads independently manage particular operation queues, and can update corresponding portions of a control database and a forwarding database. Flow operation notifications can be managed through notification queues, which can be drained back into the operation queues for the provisioning threads to later process. The packet forwarder thus can benefit from a highly-parallel, highly-efficient software-based approach to flow learning operations that does not require specialized hardware support.Type: GrantFiled: October 12, 2016Date of Patent: September 4, 2018Assignee: Telefonaktiebolaget LM Ericsson (publ)Inventors: Srikanth Narayanan, Matias Cavuoti, Arunkumar M. Desigan, Vikram Guleria
-
Publication number: 20180069793Abstract: Exemplary techniques for architecture-independent dynamic flow learning in a packet forwarder are described. A packet forwarder includes a plurality of forwarding threads and a plurality of provisioning threads, and can implement three functional blocks to learn new flows—an admission control block, a forwarding database building block, and a notification path block. An admission control module can control the ability for forwarding threads to place flow operation requests in operation queues. Provisioning threads independently manage particular operation queues, and can update corresponding portions of a control database and a forwarding database. Flow operation notifications can be managed through notification queues, which can be drained back into the operation queues for the provisioning threads to later process. The packet forwarder thus can benefit from a highly-parallel, highly-efficient software-based approach to flow learning operations that does not require specialized hardware support.Type: ApplicationFiled: October 12, 2016Publication date: March 8, 2018Inventors: Srikanth NARAYANAN, Matias CAVUOTI, Arunkumar M. DESIGAN, Vikram GULERIA
-
Publication number: 20170356425Abstract: The present invention relates to a method and wind turbine for determining a dynamic twist of one or more blades. One or more first signals are received from a first wireless sensor attached to a blade of a wind turbine and a first angle is determined based on the received first signals. One or more second signals are received from a second wireless sensor attached to a blade of a wind turbine and spaced apart from the first wireless sensor by a predetermined distance. A second angle is determined based on the received second signals. A dynamic twist of the blade is determined based on the determined first angle, the determined second angle and the predetermined distance.Type: ApplicationFiled: December 22, 2015Publication date: December 14, 2017Inventor: Srikanth NARAYANAN
-
Publication number: 20140348002Abstract: A method in a router for participating in computation of a constraint-based label switched path (LSP) that spans a plurality of areas to reach a destination is described. The method comprises computing a path segment that meets a set of one or more constraints to at least one border router of the first area, transmitting a path computation request message to a path computation element in a second one of the plurality of areas, receiving a path computation reply message from the path computation element, and stitching at least one of the set of computed path segments that are specified in the path computation reply message with the path segment computed by the router to form at least part of the constraint-based LSP.Type: ApplicationFiled: August 8, 2014Publication date: November 27, 2014Applicant: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)Inventors: Wenhu LU, Sriganesh KINI, Srikanth NARAYANAN
-
Patent number: 8885461Abstract: A first network element in an MPLS network receives a first label advertised from a second network element in the network. The first network element computes a shortest path tree (SPT) to reach a destination network element under a potential failure condition. The second network element is a nexthop of the first network element in the computed SPT and is not upstream from the potential failure condition in the computed SPT. The first network element determines that a third network element in the network is a Point of Local Repair (PLR) when the potential failure condition is realized. The first network element distributes a second label to the third network element for a backup LDP Label Switched Path (LSP) that will serve as a backup path when the potential failure condition is realized. The first network element installs a swap action from the second label to the first label.Type: GrantFiled: October 25, 2011Date of Patent: November 11, 2014Assignee: Telefonaktiebolaget L M Ericsson (Publ)Inventors: Sriganesh Kini, Srikanth Narayanan
-
Patent number: 8848519Abstract: MPLS (Multiprotocol Label Switching) fast re-routing using LDP (Label Distribution Protocol) is described. A first network element in a MPLS network receives a first label advertised from a second network element in the MPLS network. The first network element computes a shortest path tree (SPT) to reach a destination network element under a potential failure condition. The second network element is a nexthop of the first network element in the computed SPT and is not upstream from the potential failure condition. The first network element advertises a second label to one or more third network elements for a backup LDP LSP (Label Switched Path) that will serve as a backup when the potential failure condition is realized. The third network element(s) are upstream neighbors on the computed SPT with respect to the first network element. The first network element installs a swap action from the second label to the first label.Type: GrantFiled: May 20, 2011Date of Patent: September 30, 2014Assignee: Telefonaktiebolaget L M Ericsson (Publ)Inventors: Sriganesh Kini, Srikanth Narayanan
-
Patent number: 8837292Abstract: Computing a constraint-based label switched path (LSP) that spans multiple areas is described. In one embodiment, a router in a first one of the multiple areas computes a path segment that meets a set of one or more constraints to at least one border router of the first area that lies in a path necessary to reach the destination. The router transmits a path computation request message to a path computation element (PCE) in a second one of the areas, which includes a set of one or more attributes for each computed path segment that are used by the PCE to compute one or more path segments towards the destination of the constraint-based LSP. The router receives a path computation reply message from the PCE that specifies a set of one or more computed path segments that meet the set of constraints and that were computed by one or more PCEs downstream from the router.Type: GrantFiled: December 31, 2010Date of Patent: September 16, 2014Assignee: Telefonaktiebolaget L M Ericsson (Publ)Inventors: Wenhu Lu, Sriganesh Kini, Srikanth Narayanan
-
Publication number: 20130135349Abstract: This invention is a system and method that allows wearing or trying on clothes virtually by a user of any body shape or size. A Web server on the World Wide Web provides pictures of apparel such as dress, gowns, tops, blouse, skirts, pants. A user provides his/her picture and is able to virtually try on the apparel article of choice.Type: ApplicationFiled: December 22, 2012Publication date: May 30, 2013Inventors: Srikanth Narayanan, Sriram N
-
Publication number: 20130010589Abstract: MPLS (Multiprotocol Label Switching) fast re-routing using LDP (Label Distribution Protocol) is described. A first network element in an MPLS network receives a first label advertised from a second network element in the MPLS network. The first network element computes a shortest path tree (SPT) to reach a destination network element under a potential failure condition. The second network element is a nexthop of the first network element in the computed SPT and is not upstream from the potential failure condition in the computed SPT. The first network element determines that a third network element in the MPLS network is a Point of Local Repair (PLR) when the potential failure condition is realized. The first network element distributes a second label to the third network element for a backup LDP Label Switched Path (LSP) that will serve as a backup path when the potential failure condition is realized. The first network element installs a swap action from the second label to the first label.Type: ApplicationFiled: October 25, 2011Publication date: January 10, 2013Inventors: Sriganesh Kini, Srikanth Narayanan
-
Publication number: 20120218884Abstract: MPLS (Multiprotocol Label Switching) fast re-routing using LDP (Label Distribution Protocol) is described. A first network element in a MPLS network receives a first label advertised from a second network element in the MPLS network. The first network element computes a shortest path tree (SPT) to reach a destination network element under a potential failure condition. The second network element is a nexthop of the first network element in the computed SPT and is not upstream from the potential failure condition. The first network element advertises a second label to one or more third network elements for a backup LDP LSP (Label Switched Path) that will serve as a backup when the potential failure condition is realized. The third network element(s) are upstream neighbors on the computed SPT with respect to the first network element. The first network element installs a swap action from the second label to the first label.Type: ApplicationFiled: May 20, 2011Publication date: August 30, 2012Inventors: Sriganesh Kini, Srikanth Narayanan
-
Publication number: 20120069740Abstract: Computing a constraint-based label switched path (LSP) that spans multiple areas is described. In one embodiment, a router in a first one of the multiple areas computes a path segment that meets a set of one or more constraints to at least one border router of the first area that lies in a path necessary to reach the destination. The router transmits a path computation request message to a path computation element (PCE) in a second one of the areas, which includes a set of one or more attributes for each computed path segment that are used by the PCE to compute one or more path segments towards the destination of the constraint-based LSP. The router receives a path computation reply message from the PCE that specifies a set of one or more computed path segments that meet the set of constraints and that were computed by one or more PCEs downstream from the router.Type: ApplicationFiled: December 31, 2010Publication date: March 22, 2012Inventors: Wenhu Lu, Sriganesh Kini, Srikanth Narayanan