Patents by Inventor Abhishek Kumar

Abhishek Kumar 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: 8141416
    Abstract: The present disclosure relates to an approach by which low-performing turbines may be identified from among a plurality of wind turbines, such as may be present at a wind power plant. In accordance with one embodiment, low-performing turbines are identified from among pairs of turbines and based upon a comparison of the observed and expected performance of the turbines within each pair.
    Type: Grant
    Filed: September 30, 2010
    Date of Patent: March 27, 2012
    Assignee: General Electric Company
    Inventors: Vineel Chandrakanth Gujjar, Colin Craig McCulloch, Philippe Giguere, Abhishek Kumar Srivastava, Angshuman Saha, Pameet Singh
  • Publication number: 20120069786
    Abstract: Methods of communicating location information from a subscriber to a repeater are described. The subscriber switches from a working channel to a data revert channel, transmits a request for a periodic or one-time window to transmit an update, and determines from grant information in the response announcement the allocated window and frame before switching back to the working channel. Before the allocated time, the subscriber switches to the data revert channel, confirms whether it remains scheduled to transmit the update from a repeater announcement, and if so transmits the location update in either the current or reserved window. The announcements from the repeater contain the identity of the next window and frame and the subscriber reserved to use the window in addition to grant information. The subscribers may or may not be time-aligned and the data and data revert channels may or may not be synchronized.
    Type: Application
    Filed: September 22, 2010
    Publication date: March 22, 2012
    Applicant: Motorola, Inc.
    Inventors: David G. Wiatrowski, Dipendra M. Chowdhary, Thomas B. Bohn, Puneet K. Puri, Roopak M. Ingole, Delia M. Marchosky, Abhishek Kumar
  • Publication number: 20120054564
    Abstract: A method and a system for testing memory blocks using a built-in-self-test (BIST) block using a regeneration mechanism. The method includes generation of a test pattern by executing a pre-defined algorithm to test a memory address of a memory block. The test pattern is stored at the memory address, and then the stored data is read from the memory address. The read data is send to a comparator for comparison with a background data. The background data corresponds to the test pattern and is regenerated by a regeneration block corresponding to clock cycles taken for storing the test pattern in the memory address. The stored data is read from the memory address. The comparator generates a validity signal based on the comparison of the background data with the read data.
    Type: Application
    Filed: August 27, 2010
    Publication date: March 1, 2012
    Inventors: Abhishek Kumar Tiwary, Anubhav Singh, Anuj Verma, Arnab Bhattacharya
  • Patent number: 8111929
    Abstract: A method and system for detecting and quantifying blockiness in a video file is disclosed. The video file is a file that has been decompressed by using standard DCT algorithms. The method includes segmenting each frame of the video file into multiple blocks. The method also involves comparing the intensity gradients of each block with one or more threshold values. The one or more threshold values represent predefined intensity variation characteristics. Further, the method includes determining the intensity variation parameters of each block, based on the comparison. Thereafter, a blockiness index is calculated for each block, after which a blockiness value is calculated for each frame. Finally, a blockiness level is assigned to each frame, based on its blockiness value. The blockiness level is a comparative measure of the blockiness of a frame that represents the blockiness content in the frame.
    Type: Grant
    Filed: February 29, 2008
    Date of Patent: February 7, 2012
    Assignee: Interra Systems Inc.
    Inventors: Praveen Kumar Tiwari, Abhishek Kumar Tiwary, Anuj Verma, Manik Gupta, Prabhanjana Kumar Nallani
  • Publication number: 20120005261
    Abstract: Concepts and technologies are described herein for managing recurring appointments without losing historical data associated with the recurring appointments. In accordance with the concepts and technologies disclosed herein, a recurring appointment definition can be modified without deleting the recurring appointment definition and/or losing exceptions, notes, and/or other data associated with the recurring appointment definition. Additionally, the concepts and technologies disclosed herein allow the modification of an existing recurring appointment definition without creating a new recurring appointment definition. Thus, synchronization between rules-based calendaring applications and expansion-based calendaring applications can be accomplished without creating multiple instances of related recurring appointments created due to modifications of the recurring appointment definition.
    Type: Application
    Filed: July 1, 2010
    Publication date: January 5, 2012
    Applicant: MICROSOFT CORPORATION
    Inventors: Prabhat Kumar Pandey, Abhishek Kumar Gupta, Sandhya Vankamamidi, Sutirtha Saha, Kulo Rajasekaran, David Robert Shutt, Derik Bjorn Stenerson, Niraj Yadav, Ramesh Prasad Pandey, Sharad Sharma
  • Publication number: 20110270450
    Abstract: The present disclosure relates to an approach by which low-performing turbines may be identified from among a plurality of wind turbines, such as may be present at a wind power plant. In accordance with one embodiment, low-performing turbines are identified from among pairs of turbines and based upon a comparison of the observed and expected performance of the turbines within each pair.
    Type: Application
    Filed: September 30, 2010
    Publication date: November 3, 2011
    Applicant: General Electric Company
    Inventors: Vineel Chandrakanth Gujjar, Colin Craig McCulloch, Philippe Giguere, Abhishek Kumar Srivastava, Angshuman Saha, Pameet Singh
  • Publication number: 20110252098
    Abstract: The disclosed embodiments provide for an email and messenging system that allows a user composing a message to select an application which will appear next to the composition screen at both the sending and receiving computer. The application is specified as an attachment at the sending client and when received at a receiving client of a user with an enhanced or compliant mail/messenging account the application will be executed at the receiving client, thus customizing the functionality of the receiving client computer and the mail experience between sender and receiver. An unapproved application sent as an attachment will not be executed and/or alter the receiving client interface. Similarly, the application will simply appear as a standard attachment at a non enhanced recipient client/account.
    Type: Application
    Filed: April 13, 2010
    Publication date: October 13, 2011
    Applicant: YAHOO! INC.
    Inventor: Abhishek Kumar
  • Publication number: 20110209012
    Abstract: The invention discloses a method and a system for optimizing address generation for simultaneously running proximity-based Built-In-Self-Test (BIST) algorithms. The method also describes simultaneously testing proximity-based faults for different memories having column multiplexers of different sizes using the BIST algorithms. The system described above may be embodied in the form of a Built-In-Self-Test (BIST) controller. Further, the method includes selecting a memory having the largest size of column multiplexer (CMmax). After selecting the memory, size of an address-width register is extended to form an extended address-width register. Thereafter, an extended width address is generated using the extended address-width register and the extended width address is used to generate addresses for the memories. After generating the addresses, read and write operations are performed on the memories based on pre-defined rules, wherein the read and write operations provide testing of the memories.
    Type: Application
    Filed: December 24, 2010
    Publication date: August 25, 2011
    Inventors: Abhishek Kumar Tiwary, Anubhav Singh, Anuj Verma, Arnab Bhattacharya
  • Publication number: 20110208597
    Abstract: A system for serving localized advertisements generates browser code operable by a browser to cause the browser to display a web page of information that includes an advertisement. The displayed advertisement includes a graphical indicator that indicates that the advertisement is associated with an interface for conveying additional information associated with the advertisement. The advertisement and the additional information are submitted during an advertisement submission time. The browser code is also operable by the browser to cause the browser to detect a selection of the graphical indicator and display the interface along with the information displayed on the web page in response to the selection of the graphical indicator.
    Type: Application
    Filed: February 24, 2010
    Publication date: August 25, 2011
    Applicant: Yahoo! Inc
    Inventor: Abhishek Kumar
  • Patent number: 7996897
    Abstract: Learning to, and detecting spam messages using a multi-stage combination of probability calculations based on individual and aggregate training sets of previously identified messages. During a preliminary phase, classifiers are trained, lower and upper limit probabilities, and a combined probability threshold are iteratively determined using a multi-stage combination of probability calculations based on minor and major subsets of messages previously categorized as valid or spam. During a live phase, a first stage classifier uses only a particular subset, and a second stage classifier uses a master set of previously categorized messages. If a newly received message can not be categorized with certainty by the first stage classifier, and a computed first stage probability is within the previously determined lower and upper limits, first and second stage probabilities are combined.
    Type: Grant
    Filed: January 23, 2008
    Date of Patent: August 9, 2011
    Assignee: Yahoo! Inc.
    Inventors: Vishwanth Tumkur Ramarao, Abhishek Kumar Pandey, Raghav Jeyaraman
  • Patent number: 7945905
    Abstract: A data processing system, method, and instructions executable on a computer inspect the quality of software code. A summary report is generated that summarizes aspects of the current status of a software project. The summary report may include which portions of code have been written, which have been edited to predetermined standards, and which remain to be written. Errors in the code may be identified. Warnings associated with portions of the code may be generated, as well as suggested changes to the code. For comparison, the suggested code changes may be displayed along side of the corresponding portions of the pre-existing code that the suggested code is intended to replace. Hard coded values may be automatically identified. Text elements corresponding to each hard coded value may be automatically created. Subsequently, each hard coded value may be automatically replaced by the corresponding text element. Revisions to pre-existing code may be inspected.
    Type: Grant
    Filed: June 2, 2006
    Date of Patent: May 17, 2011
    Assignee: Accenture Global Services Limited
    Inventors: Abhishek Kumar, Harish Easwaran, Ashok D. Pithdaiya, Anupam Pandey
  • Publication number: 20110014592
    Abstract: Fractr is an entertaining, multi-level card game involving the fundamentals of math. It is inclusive of four operands that are central to the game. The Fractr also features a Fractr scale reading and special cards. One of the unique features of this game is that it is an educational game and also a fun game. The various math applications provide the basic building blocks needed throughout life. It also helps build confidence for those that are not entirely comfortable with math applications. Additionally, the multi-level feature enables the game to be stimulating for people of all ages.
    Type: Application
    Filed: July 17, 2009
    Publication date: January 20, 2011
    Inventor: Abhishek Kumar
  • Publication number: 20110014593
    Abstract: ±1nt is an entertaining, multi-level card game involving the fundamentals of math. It is inclusive of four operands that are central to the game. The ±1nt also features a ±1nt scale reading and special cards. One of the unique features of this game is that it is an educational game and also a fun game. The various math applications provide the basic building blocks needed throughout life. It also helps build confidence for those that are not entirely comfortable with math applications. Additionally, the multi-level feature enables the game to be stimulating for people of all ages.
    Type: Application
    Filed: July 17, 2009
    Publication date: January 20, 2011
    Inventor: Abhishek Kumar
  • Publication number: 20100193987
    Abstract: A method of fabricating a composite panel is disclosed. The method includes cutting a portion of carpet, applying vacuum to the carpet portion, transferring resin into the carpet portion under vacuum, and curing the resin impregnated carpet portion.
    Type: Application
    Filed: January 28, 2010
    Publication date: August 5, 2010
    Inventors: ABHISHEK KUMAR SINGH, GAJENDRA PANDEY, RANJI VAIDYANATHAN, RAMAN PAL SINGH
  • Publication number: 20100052256
    Abstract: Ten0 is an entertaining, multi-level card game involving the fundamentals of math. It is inclusive of four operands that are central to the game. The Ten0 also features a Ten0 scale reading and special cards. One of the unique features of this game is that it is an educational game and also a fun game. Playing Ten0 games include providing a deck of cards, dealing cards, forming the deck, placing the deck faced down, and starting the game with the total for all participating players. The players choosing card(s) from his/her hand, calculating and recording with the use of the card(s), drawing a card and shuffling the deck and finishing the game.
    Type: Application
    Filed: November 5, 2009
    Publication date: March 4, 2010
    Inventor: Abhishek Kumar
  • Publication number: 20090220152
    Abstract: A method and system for detecting and quantifying blockiness in a video file is disclosed. The video file is a file that has been decompressed by using standard DCT algorithms. The method includes segmenting each frame of the video file into multiple blocks. The method also involves comparing the intensity gradients of each block with one or more threshold values. The one or more threshold values represent predefined intensity variation characteristics. Further, the method includes determining the intensity variation parameters of each block, based on the comparison. Thereafter, a blockiness index is calculated for each block, after which a blockiness value is calculated for each frame. Finally, a blockiness level is assigned to each frame, based on its blockiness value. The blockiness level is a comparative measure of the blockiness of a frame that represents the blockiness content in the frame.
    Type: Application
    Filed: February 29, 2008
    Publication date: September 3, 2009
    Inventors: Praveen Kumar Tiwari, Abhishek Kumar Tiwary, Anuj Verma, Manik Gupta, Prabhanjana Kumar Nallani
  • Publication number: 20090187987
    Abstract: Learning to, and detecting spam messages using a multi-stage combination of probability calculations based on individual and aggregate training sets of previously identified messages. During a preliminary phase, classifiers are trained, lower and upper limit probabilities, and a combined probability threshold are iteratively determined using a multi-stage combination of probability calculations based on minor and major subsets of messages previously categorized as valid or spam. During a live phase, a first stage classifier uses only a particular subset, and a second stage classifier uses a master set of previously categorized messages. If a newly received message can not be categorized with certainty by the first stage classifier, and a computed first stage probability is within the previously determined lower and upper limits, first and second stage probabilities are combined.
    Type: Application
    Filed: January 23, 2008
    Publication date: July 23, 2009
    Applicant: Yahoo! Inc.
    Inventors: Vishwanth Tumkur Ramarao, Abhishek Kumar Pandey, Raghav Jeyaraman
  • 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: 20080186070
    Abstract: A latch or flip flop circuit with an increased operating frequency is disclosed. In particular, the operating frequency of the latch is increased by reducing the set up time of the latch circuit. A regenerative circuit is provided between the transmission gate of the latch circuit and the data output. The regenerative circuit comprises a pull up circuit and a pull down circuit. The circuit arrangement of the present invention may be applied to flip flop or latch circuits in combination with other flip flop or latch circuits such as a Master-Slave configuration.
    Type: Application
    Filed: April 27, 2006
    Publication date: August 7, 2008
    Inventors: Arun Sundaresan Iyer, Abhishek Kumar, Zahir Parkar
  • Publication number: 20080044030
    Abstract: A sever application allows an administrator of a server to selectively designate contact data of a particular individual to be encrypted prior to storage in a shared electronic directory. The server application encrypts any designated content and stores the encrypted content in the shared electronic directory. The server application is responsive to a valid directory request received from a user of a telecommunication device to transfer encrypted content and non-encrypted content to the telecommunication device. The server application also transfers a decryption key and a key expiration parameter from the server to the telecommunication device. A client application executing on the telecommunication device can use the decryption key within a time period defined by the key expiration parameter to decrypt encrypted contacted data on the telecommunication device to initiate contact with the particular individual.
    Type: Application
    Filed: August 4, 2006
    Publication date: February 21, 2008
    Applicant: MICROSOFT CORPORATION
    Inventor: Abhishek Kumar Mishra