Patents by Inventor Sudarshan Yermal

Sudarshan Yermal 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: 7966660
    Abstract: Wireless devices, such as field devices or repeater/relay nodes, detect the presence of anomalies in data packets that suggest intrusion. Upon detection of an anomaly, a wireless device sends a notification to a sentinel device, which determines if intrusion may be occurring. If so, the sentinel device downloads a spy routine to at least one of the wireless devices, which enables further investigation into and/or isolation of the intrusion. Since the spy routine is downloaded to the wireless devices, the spy routine can be used in conjunction with memory-constrained wireless devices. Memory-constrained wireless devices may lack adequate memory for storing both a main application executed during normal operation and the spy routine. The spy routine could overwrite one or more modules of the main application. Once executed, the spy routine could itself be overwritten by the one or more modules, allowing the wireless device to return to normal operation.
    Type: Grant
    Filed: September 11, 2007
    Date of Patent: June 21, 2011
    Assignee: Honeywell International Inc.
    Inventors: Sudarshan Yermal, Abhishek K. Singh, Kartikeya S. Ramanathan
  • Publication number: 20080291017
    Abstract: Wireless devices, such as field devices or repeater/relay nodes, detect the presence of anomalies in data packets that suggest intrusion. Upon detection of an anomaly, a wireless device sends a notification to a sentinel device, which determines if intrusion may be occurring. If so, the sentinel device downloads a spy routine to at least one of the wireless devices, which enables further investigation into and/or isolation of the intrusion. Since the spy routine is downloaded to the wireless devices, the spy routine can be used in conjunction with memory-constrained wireless devices. Memory-constrained wireless devices may lack adequate memory for storing both a main application executed during normal operation and the spy routine. The spy routine could overwrite one or more modules of the main application. Once executed, the spy routine could itself be overwritten by the one or more modules, allowing the wireless device to return to normal operation.
    Type: Application
    Filed: September 11, 2007
    Publication date: November 27, 2008
    Applicant: Honeywell International Inc.
    Inventors: Sudarshan Yermal, Abhishek K. Singh, Kartikeya S. Ramanathan
  • Publication number: 20080295171
    Abstract: A wireless node in a wireless network examines data packets directed to itself (i.e., value in destination address field indicates that the wireless node is an intended recipient)for presence of anomalies that suggest intrusion. The data packet is examined as part of the normal course of operation of the node. Upon detection of an anomaly, the wireless node sends a message packet containing details of the anomaly to a sentinel device. The sentinel device processes the anomalies to determine if a possibility of intrusion is indicated, and activates a spy routine in the wireless node. The spy routine enables further investigation into the intrusion. As components (such as wireless nodes) in the wireless network operate normally (normal operations) until an anomalous condition/event occurs, the additional power requirements for intrusion detection are reduced. If intrusion is detected, appropriate actions, such as alerting an operator, are taken to mitigate the intrusion.
    Type: Application
    Filed: May 23, 2007
    Publication date: November 27, 2008
    Applicant: Honeywell International Inc.
    Inventors: Abhishek Kumar Singh, Gaurav Kumar, Sudarshan Yermal, Kartikeya Sriniwas Ramanathan, Denis Foo Kune, Channabasavaraj Raravi
  • Publication number: 20080201717
    Abstract: Periodic communication of data packets between modules in time frames having a plurality of frame rates including a base frame rate through a bus is schedule by determining a first load schedule for data packets of base frame and half base frame rates using constraint logic programming techniques, by determining a second load schedule for data packets of other frame rates using mixed integer linear programming techniques, and by scheduling produce and consume loads for each of the modules based on the first and second load schedules.
    Type: Application
    Filed: February 21, 2007
    Publication date: August 21, 2008
    Inventors: Mangesh D. Kapadi, Sudarshan Yermal, Lingathurai Palanisamy, Gowri Ganesan
  • Patent number: 6772037
    Abstract: A pattern solution set for paper roll trimming to fulfill orders is generated using constraint programming and a heuristic. For every pattern generated, an objective function is evaluated based on the sum of waste factor and the variance of the quantity ordered for all widths in that pattern. The pattern that has the least objective function is chosen with the maximum number of sets possible. Orders are updated with the quantities left over and then the process continues, forming a solution tree, which serves as an initial solution set. The initial solution set is checked individually against the average loss of the solution set. Nodes in the solution tree having trim loss greater than the average loss are identified. Branches of the tree emanating from its parent are explored for better patterns. The process continues until all patterns are below the initial average loss.
    Type: Grant
    Filed: November 26, 2002
    Date of Patent: August 3, 2004
    Assignee: Honeywell International Inc.
    Inventors: Lingathurai Palanisamy, Sudarshan Yermal, K.S.T. Vanisri
  • Publication number: 20040102867
    Abstract: A pattern solution set for paper roll trimming to fulfill orders is generated using constraint programming and a heuristic. For every pattern generated, an objective function is evaluated based on the sum of waste factor and the variance of the quantity ordered for all widths in that pattern. The pattern that has the least objective function is chosen with the maximum number of sets possible. Orders are updated with the quantities left over and then the process continues, forming a solution tree, which serves as an initial solution set. The initial solution set is checked individually against the average loss of the solution set. Nodes in the solution tree having trim loss greater than the average loss are identified. Branches of the tree emanating from its parent are explored for better patterns. The process continues until all patterns are below the initial average loss.
    Type: Application
    Filed: November 26, 2002
    Publication date: May 27, 2004
    Inventors: Lingathurai Palanisamy, Sudarshan Yermal, K.S.T Vanisri