Shastry, IN
Addagadde Subramanya Ravishankara Shastry, Bangalore IN
Patent application number | Description | Published |
---|---|---|
20140344651 | SYSTEM AND METHOD FOR VARYING MEMORY SIZE IN A DATA STREAM PROCESSING - The present disclosure relates to methods, systems, and computer-readable media for varying a memory size in a data stream processing while improving a connection degree sketch. Embodiments of the present disclosure may encode an input data by using an error coding technique to produce an encoded data, wherein the encoded data results in a modified memory size; generate a host connectivity using a set of parameters and applying a reverse sketching technique over the encoded data in order to obtain estimated encoded data; and decode the encoded data after the host connectivity is established using a decoding technique and obtaining an output data. The memory size of the output data may be proportional to the memory size of the input data. | 11-20-2014 |
Ananda Huchappa Shastry, Bangalore IN
Patent application number | Description | Published |
---|---|---|
20090312969 | SYSTEM TO MAKE CONSUMERS AWARE OF ELECTRICITY USAGE - Energy usage of a plurality of appliances is measured using a single meter. A pattern of energy usage with respect to the plurality of appliances is determined dependent upon the measured energy usage, appliance details of the plurality of appliances, and usage hours of the plurality of appliances. The pattern is provided to a user of the appliances. | 12-17-2009 |
20120290238 | METHOD AND APPARATUS FOR DETECTION OF LVDT CORE FALLOUT CONDITION - A method includes measuring a first voltage (V | 11-15-2012 |
Chakrakody Shastry, Bangalore IN
Patent application number | Description | Published |
---|---|---|
20140190834 | PLATING PROCESS - A plated component and a plating process are disclosed. The plating process includes applying a material to a region of a component, the material being selected from the group consisting of nickel, cobalt, chromium, iron, aluminum, or a combination thereof. The region includes a single crystal microstructure, includes a directionally solidified microstructure, is substantially devoid of equiaxed microstructure, or a combination thereof. The applying includes electroplating, electroless plating, or the electroplating and the electroless plating. The plated component includes an electroplated region, an intermediate layer on the electroplated region, and an overlay coating on the intermediate layer. | 07-10-2014 |
Chakrakody Girish Shastry, Bangalore IN
Patent application number | Description | Published |
---|---|---|
20100303612 | SYSTEM AND METHOD FOR CLEARANCE CONTROL - A system, in one embodiment, includes a turbine clearance controller. The turbine clearance controller is configured to independently adjust clearances of a plurality of shroud segments about a plurality of blades via first and second magnets opposite from one another in fixed and movable portions of each shroud segment. | 12-02-2010 |
Gopalakrishna Shastry, Bangalore IN
Patent application number | Description | Published |
---|---|---|
20090218329 | METHOD AND SYSTEM FOR AUTOMATED SELECTION OF A SET OF CANDIDATE WELD GUNS INCLUDING ORIENTATIONS OF THE SELECTED GUNS - The disclosure relates to the automatic selection of a set of candidate weld guns and candidate orientations for the weld guns from a library of existing weld guns. Minimum values for weld points and test orientations are calculated. The calculated minimum values are added to the library. As each point is added to the library, the set of weld guns that are candidates for the weld point at the tested orientation may be efficiently retrieved, and a matrix of candidate weld guns and orientations is produced. | 09-03-2009 |
20100023150 | Method of Optimizing Weld Design for Concurrent Consideration of Performance and Manufacturing Requirements - A method of weld design for a work piece is provided. The work piece may be a unitary piece or a multi-component piece. The method includes determining a manufacturing feasible region of the work piece satisfying one or more predetermined manufacturing requirements including accessibility of welding components. The method includes determining a performance feasibility function satisfying one or more predetermined performance factors as applied in a performance simulation of the work piece. The workpiece may have a varying number of welds. An optimized weld design may be determined by minimizing an objective function, defined as a summation of the number of welds and the performance feasibility function, within the manufacturing feasible region. The optimized weld design is configured to have a minimum number of welds, and concurrently satisfy the predetermined manufacturing requirements and the performance factors. | 01-28-2010 |
20100198384 | AUTOMATIC ESTIMATION OF WELDGUN SIZE USING SECTION GEOMETRY - A method for estimating a plurality of geometrical parameters defining the size of a weld gun that has particular application for automatically selecting a weld gun for a welding operation. The method includes iteratively estimating a plurality of geometric parameters based on part section curves corresponding to a direction of approach of the weld gun to weld point of the plurality of weld points. Thereafter, a set of valid weld gun sizes are calculated based on the estimated plurality of geometric parameters. Similarly all the valid weld gun sizes are calculated corresponding to each of the weld gun approach direction. Further, each set of the valid gun sizes are estimated for each of the weld point for the welding operation. Finally, a weld gun for performing the welding operation is selected based on the set of weld gun sizes corresponding to the welding operation. | 08-05-2010 |
Krishna Shastry, Dakshina Kannada Vittal IN
Patent application number | Description | Published |
---|---|---|
20100100369 | Translating Source Locale Input String To Target Locale Output String - A dictionary mapping source locale strings to target locale strings is constructed. A tree is constructed from the dictionary. The tree has nodes including a start node, end nodes, and string nodes. The nodes form node chains of the tree that correspond to the source locale strings. Each node chain links a collection of the nodes from the start node to a string node. Each node other than the start node has a parent node and corresponds to a character of the source locale strings. Each node other than the end nodes has one or more child nodes. Each string node ends a node chain, and corresponds to a mapping within the dictionary of a source locale string to a target locale string. An input string having the source locale is processed against the tree to generate an output string having the target locale. | 04-22-2010 |
Krishna C. Shastry, Dakshina Kannada IN
Patent application number | Description | Published |
---|---|---|
20110082883 | INTELLIGENT EVENT-BASED DATA MINING OF UNSTRUCTURED INFORMATION - A method, system and computer program product is disclosed for intelligent data mining. The method comprises receiving an event from an application, assigning property weights to properties of the event, and building a query from these properties based on the property weights. The method further comprises assigning search engine weights to a group of search engines, selecting at least some of the search engines based on the search engine weights, and sending the built query to the selected search engines. Results from the selected search engines are stored in a knowledge repository and used to adjust the property weights and the search engine weights. The invention may be used to provide an analysis with information about a problem, and to manage a solutions database which can be used for problem determination. The invention provides a low cost solution for collecting relevant information from online sources. | 04-07-2011 |
20110145313 | METHOD AND SYSTEM FOR DATA TRANSPORT COMPRESSION BASED ON AN ENCODING DICTIONARY PATCH - A method and system for transport data compression between a server and a client based on patches to the dictionaries used for encoding the data. The method includes requesting the server for data, returning the data and a dictionary patch to the client where data having been compressed based on a previously used dictionary and the dictionary patch, and decompressing the returned data using the dictionary and the dictionary patch. The dictionary patch includes updates to the previously used dictionary. Each dictionary has a dictionary identifier that the server and client use to identify the dictionary in their requests and responses. The identifier might be a unique identification or a network session number. Upon receiving a response, the client updates the previously used dictionary with information in the patch and decompresses the returned data using the updated dictionary. | 06-16-2011 |
Narayana Shastry, Bangalore IN
Patent application number | Description | Published |
---|---|---|
20160115805 | FLEXIBLE FILM-RIDING SEAL - A seal apparatus for a rotary machine, including a plurality of sealing assembly segments surrounding a rotor element which is mounted for rotation about a longitudinal axis and has an outer surface. Each of the segments includes a shoe with one or more labyrinth teeth facing the outer surface and a shoe plate disposed downstream of the one or more labyrinth seal teeth and configured to generate an aerodynamic force between the shoe plate and the outer surface of the rotor element. The shoe is further configured to be flexible in a radial-axial plane in response to fluid film forces generated by interaction of the sealing assembly segment and the rotor element, and an axially-oriented beam spring connects the shoe to a stationary seal body. | 04-28-2016 |
Pavan Venkata Shastry, Bangalore IN
Patent application number | Description | Published |
---|---|---|
20120201308 | Method for Low Memory Footprint Compressed Video Decoding - This invention is a method of memory saving in compressed video decoding. For each group of pictures the method determines whether less than the maximum number N reference frames are needed for decoding. If so, then a memory is configuring for the needed number M reference frames less than N. If not, the memory is configured for N reference frames. The group of pictures is decoding the group of pictures using the configured number of reference frames. | 08-09-2012 |
20130044118 | ERROR RECOVERY OPERATIONS FOR A HARDWARE ACCELERATOR - In at least some embodiments, an apparatus includes a hardware accelerator subsystem with a pipeline. The hardware accelerator subsystem is configured to perform error recovery operations in response to a bit stream error. The error recovery operations comprise a pipe-down process to completely decode a data block that is already in the pipeline, an overwrite process to overwrite commands in the hardware accelerator subsystem with null operations (NOPs) once the pipe-down process is complete, and a pipe-up process to restart decoding operations of the pipeline at a next synchronization point. | 02-21-2013 |
20150271494 | LOW POWER ULTRA-HD VIDEO HARDWARE ENGINE - A low power video hardware engine is disclosed. The video hardware engine includes a video hardware accelerator unit. A shared memory is coupled to the video hardware accelerator unit, and a scrambler is coupled to the shared memory. A vDMA (video direct memory access) engine is coupled to the scrambler, and an external memory is coupled to the vDMA engine. The scrambler receives an LCU (largest coding unit) from the vDMA engine. The LCU comprises N×N pixels, and the scrambler scrambles N×N pixels in the LCU to generate a plurality of blocks with M×M pixels. N and M are integers and M is less than N. | 09-24-2015 |
20150271512 | DYNAMIC FRAME PADDING IN A VIDEO HARDWARE ENGINE - A video hardware engine which support dynamic frame padding is disclosed. The video hardware engine includes an external memory. The external memory stores a reference frame. The reference frame includes a plurality of reference pixels. A motion estimation (ME) engine receives a current LCU (largest coding unit), and defines a search area around the current LCU for motion estimation. The ME engine receives a set of reference pixels corresponding to the current LCU. The set of reference pixels of the plurality of reference pixels are received from the external memory. The ME engine pads a set of duplicate pixels along an edge of the reference frame when a part area of the search area is outside the reference frame. | 09-24-2015 |
Ravishankara Shastry, Bangalore IN
Patent application number | Description | Published |
---|---|---|
20140294177 | IDENTITY BASED PUBLIC KEY CRYPTOSYSTEM - A method for generating cryptographic parameters comprises generating a private_IGTABLE based on an Euler totient function of a composite number (φ(n)), where the private_IGTABLE includes a plurality of random numbers (x). Further, a public_IGTABLE based on the private_IGTABLE, a composite number (n), and a group generator element (g) is generated, where the public_IGTABLE includes a corresponding modular exponentiation under modulo n for each of the plurality of random numbers with g as base. Further, a public key of a user is computed based on the public_IGTABLE, an identity number (ID) corresponding to the user, and n. Further, a secret key of the user is generated based on the ID, a master private key, the φ(n), and the private_IGTABLE. Thereafter, the cryptographic parameters are provided to the user for performing encryption and decryption, where the cryptographic parameters include at least one of the ID, the public key, and the secret key. | 10-02-2014 |
20150071435 | IDENTITY BASED ENCRYPTION - Method and system for identity based encryption are described. The method comprises obtaining public parameters and a public key set from a central server, where the public parameters include a friendly prime, a torsion group prime order, an super-singular elliptic curve, a first torsion group, a pre-computed Tate pairing value, a first elliptic curve point and a second elliptic curve point, and a distortion map, and where the pre-computed Tate pairing value is generated by the central server. Further, a receiver key set of elliptic curve points based on a receiver identity of a receiver is determined, where the receiver key set is a subset of the public key set. Further a receiver public key based on the receiver key set is computed. Further, the data is encrypted using the Tate pairing value and an encryption component, wherein the encryption component is computed based on the receiver public key set. | 03-12-2015 |
Shankara M. C. Shastry, Bangalore IN
Patent application number | Description | Published |
---|---|---|
20080258865 | BINARY VERIFICATION SERVICE - A binary is received at a binary verification service from a binary verification client agent. The binary verification service performs binary verification of the binary, wherein binary verification includes determining whether the binary is complicit with a set of usage rules. The binary verification service sends a binary verification result to the binary verification client agent. | 10-23-2008 |