Pranav
Pranav Agarwal, Niskayuna, NY US
Patent application number | Description | Published |
---|---|---|
20150337802 | SYSTEM AND METHOD FOR PITCH FAULT DETECTION - The system includes at least one blade, a pitch command generator, a blade pitch system, a model store unit and a monitor unit. The pitch command generator is for generating at least one pitch command. The blade pitch system is for adjusting a pitch angle of the blade according to the pitch command and outputting an actual response representing an actual pitch condition of the blade in response to the pitch command. The model store unit is for receiving the pitch command and generating a desired response representing a desired pitch condition in response to the pitch command based on a nonlinear blade model. The monitor unit is for comparing a difference between the actual response and the desired response with a predetermined threshold and determining an operation status of the blade based at least in part on the difference. A method and a wind turbine are also provided. | 11-26-2015 |
Pranav Agarwal, Guilderland, NY US
Patent application number | Description | Published |
---|---|---|
20140003936 | Systems and Methods to Reduce Tower Oscillations in a Wind Turbine | 01-02-2014 |
20150147173 | METHODS AND SYSTEMS TO SHUT DOWN A WIND TURBINE - A wind turbine system is presented. The wind turbine system includes a wind turbine comprising a plurality of blades and a tower, and a processing subsystem configured to shut down the wind turbine by non-linearly pitching out the plurality of blades in the wind turbine towards a feather position at a pitch rate determined based upon a tower-fore-aft velocity of a top-portion of the tower during oscillations of the tower. | 05-28-2015 |
Pranav Dharwadkar, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20090296579 | EFFICIENT CONVERGENCE OF GROUPED VPN PREFIXES - In one embodiment, one or more virtual private network (VPN) prefixes may be grouped at a network node into sets having shared network border node next-hop options, where each border node has a defined index value associated therewith. Also, a list of VPN labels associated with each VPN prefix may be maintained by the network node, where each VPN label is associated with a border node of a particular set by a corresponding index value. Further, the network node may determine a particular border node for traffic to be forwarded, along with the defined index value. The network node may then apply the index value to select an associated VPN label, and may affix the selected VPN label to the traffic for forwarding. | 12-03-2009 |
20100215047 | SUBSETS OF THE FORWARD INFORMATION BASE (FIB) DISTRIBUTED AMONG LINE CARDS IN A SWITCHING DEVICE - Disclosed are, inter alia, methods, apparatus, computer-storage media, mechanisms, and means associated with subsets of the Forward Information Base (FIB) distributed among line cards in a switching device; especially wherein one or more of the line cards does not contain the complete FIB, and this line card forwards packets, for which it does not have the forwarding information, to another line card which has the forwarding information for the packet. | 08-26-2010 |
20120099420 | EFFICIENT CONVERGENCE OF GROUPED VPN PREFIXES - In one embodiment, a list of border node next hop options is maintained in a memory. The list of border node next hop options includes one or more of border nodes that may be utilized to reach one or more prefixes. An index value is associated with each border node of the list of border node next hop options. A list of labels is also maintained in the memory. The index value of each border node is associated with a corresponding label for a path to reach that border node. When a change to the one or more border nodes is detected, the list of border node next hop options is updated to remove a border node. However, a label for the path to reach the border node is maintained in the list of labels for at least a period of time. | 04-26-2012 |
Pranav Jhumkhawala, Fremont, CA US
Patent application number | Description | Published |
---|---|---|
20100250316 | DEVELOPING A SERVICE ORIENTED ARCHITECTURE SHARED SERVICES PORTFOLIO - An approach that develops a service oriented architecture (SOA) shared services portfolio is provided. In one embodiment, there is a portfolio tool, including a decomposition component configured to decompose a business architecture of an enterprise into a set of SOA shared services, and a development component configured to develop a SOA shared service portfolio that is populated with the set of SOA shared services. | 09-30-2010 |
20100280856 | IDENTIFYING SERVICE ORIENTED ARCHITECTURE SHARED SERVICE OPPORTUNITIES - An approach that identifies a service oriented architecture (SOA) shared service opportunity is provided. In one embodiment, there is an opportunity tool, including an identification component configured to identify a plurality of projects from each of a plurality of lines of business; a selection component configured to select a set of projects common to more than one line of business from the plurality of lines of business; and an evaluation component configured to evaluate the set of projects common to more than one line of business from the plurality of lines of business to identify a SOA shared service opportunity. | 11-04-2010 |
Pranav Kalavade, Santa Clara, CA US
Patent application number | Description | Published |
---|---|---|
20120137048 | METHOD AND APPARATUS FOR IMPROVING ENDURANCE OF FLASH MEMORIES - A method and apparatus for improving the endurance of flash memories. In one embodiment of the invention, a high electric field is provided to the control gate of a flash memory module. The high electric field applied to the flash memory module removes trapped charges between a control gate and an active area of the flash memory module. In one embodiment of the invention, the high electric field is applied to the control gate of the flash memory module prior to an erase operation of the flash memory module. By applying a high electric field to the control gate of the flash memory module, embodiments of the invention improve the Program/Erase cycling degradation of the single-level or multi-level cells of the flash memory module. | 05-31-2012 |
Pranav Kalavade US
Patent application number | Description | Published |
---|---|---|
20150279476 | RAMPING INHIBIT VOLTAGE DURING MEMORY PROGRAMMING - The inhibit voltage is a voltage applied to wordlines adjacent to a program wordline having a memory cell to write during the program operation. The inhibit voltage for a program operation can be ramped up during the program pulse. Instead of applying a constant high inhibit voltage that results in the initial boosted channel potential reducing drastically due to leakage, a system can start the inhibit voltage lower and ramp the inhibit voltage up during the program pulse. The ramping up can be a continuous ramp or in finite discrete steps during the program pulse. Such ramping of inhibit voltage can provide better tradeoff between program disturb and inhibit disturb. | 10-01-2015 |
Pranav Kalavade, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20100155807 | Apparatus and methods for improved flash cell characteristics - Embodiments of an apparatus and methods for providing improved flash memory cell characteristics are generally described herein. Other embodiments may be described and claimed. | 06-24-2010 |
20110080789 | AUTOMATIC SELECTIVE SLOW PROGRAM CONVERGENCE - Apparatus, methods, and systems are disclosed, including those to improve program voltage distribution width using automatic selective slow program convergence (ASSPC). One such method may include determining whether a threshold voltage (Vt) associated with a memory cell has reached a particular pre-program verify voltage. In response to the determination, a voltage applied to a bit-line coupled to the memory cell may be automatically incremented at least twice as the program voltage is increased, until the cell is properly programmed. Additional embodiments are also described. | 04-07-2011 |
20110141822 | Source Bias Shift for Multilevel Memories - The threshold voltage range of a multilevel memory cell may be increased without using a negative voltage pump. In one embodiment, an added positive voltage may be applied to the source of the selected cell. A boost voltage may be applied to the output of a sense amplifier. Non-ideal characteristics of a buffer that supplies the voltage to the selected cell may be compensated for in some embodiments. | 06-16-2011 |
20110216600 | DRAIN SELECT GATE VOLTAGE MANAGEMENT - Some embodiments include apparatus, systems, and methods that operate to apply a first value of a drain select gate voltage during a first portion of a programming time period associated with programming a plurality of memory cells, and to apply a second value of the drain select gate voltage different from the first value during a second, subsequent portion of the programming time period. The drain select gate voltage may be changed between groups of programming pulses in a single programming cycle. The first and second portions may be determined according to the number of applied programming pulses, the number of memory cells that have been completely programmed, and/or other conditions. Additional apparatus, systems, and methods are disclosed. | 09-08-2011 |
20120002482 | CHARGE EQUILIBRIUM ACCELERATION IN A FLOATING GATE MEMORY DEVICE VIA A REVERSE FIELD PULSE - Methods for accelerating charge equilibrium in a non-volatile memory device using floating gate memory cells are disclosed. Memory devices and storage systems using charge equilibrium acceleration are also disclosed. In one such method, a programming pulse is applied to the word line to change an amount of charge stored on the floating gate of the memory cells being programmed. A reverse field pulse is then applied to the memory cell using only voltages greater than or equal to about 0 volts. The reverse field pulse accelerates charge equilibrium by moving any electrons trapped in the insulating oxide layers to a stable location so that the threshold voltage is stabilized. After the reverse field pulse, a program verify operation is performed and additional programming pulses and reverse field pulses are applied as needed to properly program the memory cell. | 01-05-2012 |
20120117306 | SENSE OPERATION FLAGS IN A MEMORY DEVICE - Memory devices, methods for programming sense flags, methods for sensing flags, and memory systems are disclosed. In one such memory device, the odd bit lines of a flag memory cell array are connected with a short circuit to a dynamic data cache. The even bit lines of the flag memory cell array are disconnected from the dynamic data cache. When an even page of a main memory cell array is read, the odd flag memory cells, comprising flag data, are read at the same time so that it can be determined whether the odd page of the main memory cell array has been programmed. If the flag data indicates that the odd page has not been programmed, threshold voltage windows can be adjusted to determine the states of the sensed even memory cell page. | 05-10-2012 |
20120176843 | MEMORIES AND METHODS OF PROGRAMMING MEMORIES - Apparatus and methods for adjusting programming for upper pages of memories are disclosed. In at least one embodiment, a threshold voltage distribution upper limit is determined after a single programming pulse for lower page programming, and upper page programming start voltages are adjusted based on the determined upper limit of the threshold voltage distribution. | 07-12-2012 |
20130215680 | AUTOMATIC SELECTIVE SLOW PROGRAM CONVERGENCE - Apparatus, methods, and systems are disclosed, including those to improve program voltage distribution width using automatic selective slow program convergence (ASSPC). One such method may include determining whether a threshold voltage (Vt) associated with a memory cell has reached a particular pre-program verify voltage. In response to the determination, a voltage applied to a bit-line coupled to the memory cell may be automatically incremented at least twice as the program voltage is increased, until the cell is properly programmed. Additional embodiments are also described. | 08-22-2013 |
20130318395 | RECONSTRUCTING CODEWORDS USING A SIDE CHANNEL - Embodiments of the present disclosure describe device, methods, computer-readable media and system configurations for decoding codewords using a side channel. In various embodiments, a memory controller may be configured to determine that m of n die of non-volatile memory (“NVM”) have failed iterative decoding. In various embodiments, the memory controller may be further configured to generate a side channel from n-m non-failed die and the m failed die other than a first failed die. In various embodiments, the memory controller may be further configured to reconstruct, using iterative decoding, a codeword stored on the first failed die of the m failed die based on the generated side channel and on soft input to an attempt to iteratively decode data stored on the first failed die. In various embodiments, the iterative decoding may include low-density parity-check decoding. Other embodiments may be described and/or claimed. | 11-28-2013 |
20130322170 | MEMORY CELL SENSING - This disclosure concerns memory cell sensing. One or more methods include determining a data state of a first memory cell coupled to a first data line, determining a data state of a third memory cell coupled to a third data line, transferring determined data of at least one of the first and the third memory cells to a data line control unit corresponding to a second data line to which a second memory cell is coupled, the second data line being adjacent to the first data line and the third data line, and determining a data state of the second memory cell based, at least partially, on the transferred determined data. | 12-05-2013 |
20130339603 | METHOD, APPARATUS AND SYSTEM FOR DETERMINING ACCESS TO A MEMORY ARRAY - Techniques and mechanisms for determining a sequence of accessed to a memory array. In an embodiment, a memory array includes multi-level cells and single-level cells interleaved with one another, where bits of the multi-level cells and single-level cells are variously allocated to different logical pages. In another embodiment, requests to access the memory array are ordered according to a sequence of page rounds to avoid an access event which includes a type of successive accessing of adjacent multi-level cells. | 12-19-2013 |
20140063960 | MEMORY PROGRAM DISTURB REDUCTION - Some embodiments include a memory device and a method of programming memory cells of the memory device. One such method can include applying, during a first pass of programming, a first bias voltage value to a source select gate to isolate memory cells from a source, applying a programming voltage to an access line of a page of the memory cells during the first pass of programming, and applying a second bias voltage value to the source select gate to isolate the memory cells from the source during a second pass of programming. Further devices, systems, and methods are disclosed. | 03-06-2014 |
20140115231 | NAND MEMORY MANAGEMENT - Apparatus, systems, and methods manage NAND memory are described. In one embodiment, an apparatus comprises a memory controller logic to apply a binary parity check code to a binary string and convert the binary string to a ternary string. Other embodiments are also disclosed and claimed. | 04-24-2014 |
20140169093 | ERASE AND SOFT PROGRAM FOR VERTICAL NAND FLASH - Methods, and apparatuses to erase and or soft program a block of NAND memory may include performing an erase cycle on a block of NAND memory comprising two or more sub-blocks, verifying the two or more sub-blocks until a sub-block fails to verify, stopping the verification in response to the failed verify, performing another erase cycle on the block of NAND memory, and re-starting to verify the two or more sub-blocks at the sub-block that failed to verify | 06-19-2014 |
20140185385 | MEMORIES AND METHODS OF PROGRAMMING MEMORIES - Apparatus and methods for adjusting programming for upper pages of memories are disclosed. In at least one embodiment, a threshold voltage distribution upper limit is determined after a single programming pulse for lower page programming, and upper page programming start voltages are adjusted based on the determined upper limit of the threshold voltage distribution. | 07-03-2014 |
20140313825 | DRAIN SELECT GATE VOLTAGE MANAGEMENT - Some embodiments include apparatus, systems, and methods that operate to apply a first value of a drain select gate voltage during a first portion of a programming time period associated with programming a plurality of memory cells, and to apply a second value of the drain select gate voltage different from the first value during a second, subsequent portion of the programming time period. The drain select gate voltage may be changed between groups of programming pulses in a single programming cycle. The first and second portions may be determined according to the number of applied programming pulses, the number of memory cells that have been completely programmed, and/or other conditions. Additional apparatus, systems, and methods are disclosed. | 10-23-2014 |
20140380108 | METHOD AND SYSTEM TO OBTAIN STATE CONFIDENCE DATA USING MULTISTROBE READ OF A NON-VOLATILE MEMORY - An apparatus may include a processor circuit a processor circuit to retrieve data from a non-volatile memory, and a multistrobe read module operable on the processor circuit to set a read operation to read a memory cell over a multiplicity of sense operations, where each sense operation is performed under a different sense condition. The multistrobe read module may be further operable to schedule a new sense operation to succeed a prior sense operation of the multiplicity of sense operations without recharge of the wordline when a value of one or more read condition is within a preset range. Other embodiments are disclosed and claimed. | 12-25-2014 |
20150043275 | MULTI-PULSE PROGRAMMING FOR MEMORY - Embodiments of the present disclosure include techniques and configurations for multi-pulse programming of a memory device. In one embodiment, a method includes applying multiple pulses to program one or more multi-level cells (MLCs) of a memory device, wherein individual pulses of the multiple pulses correspond with individual levels of the one or more MLCs and subsequent to applying the multiple pulses, verifying the programming of the individual levels of the one or more MLCs. Other embodiments may be described and/or claimed. | 02-12-2015 |
20150149818 | DEFECT MANAGEMENT POLICIES FOR NAND FLASH MEMORY - Systems and methods of managing defects in nonvolatile storage systems that can be used to avoid an inadvertent loss of data, while maintaining as much useful memory in the nonvolatile storage systems as possible. The disclosed systems and methods can monitor a plurality of trigger events for detecting possible defects in one or more nonvolatile memory (NVM) devices included in the nonvolatile storage systems, and apply one or more defect management policies to the respective NVM devices based on the types of trigger events that resulted in detection of the possible defects. Such defect management policies can be used proactively to retire memory in the nonvolatile storage systems with increased granularity, focusing the retirement of memory on regions of nonvolatile memory that are likely to contain a defect. | 05-28-2015 |
20150179267 | PROGRAM VT SPREAD FOLDING FOR NAND FLASH MEMORY PROGRAMMING - Embodiments of methods and systems disclosed herein provide a NAND cell programming technique that results in a substantially reduced T | 06-25-2015 |
20150194218 | MEMORY CELL SENSING - This disclosure concerns memory cell sensing. One or more methods include determining a data state of a first memory cell coupled to a first data line, determining a data state of a third memory cell coupled to a third data line, transferring determined data of at least one of the first and the third memory cells to a data line control unit corresponding to a second data line to which a second memory cell is coupled, the second data line being adjacent to the first data line and the third data line, and determining a data state of the second memory cell based, at least partially, on the transferred determined data. | 07-09-2015 |
Pranav Kamkhalia, Flushing, NY US
Patent application number | Description | Published |
---|---|---|
20090049052 | Flexible method and system for providing digital content - A system and method for disseminating digital content, including receiving at a server a request from a user computer for a browser displayable interface definition, and sending from the server to the user computer the interface definition including resource tags, the resource tags being interpretable for linking to sources of the digital content. | 02-19-2009 |
20090049373 | Method and system for user receipt of digital content - A method for disseminating digital, including executing code referenced in a markup language page to request a browser displayable interface configuration from a server, receiving from the server a definition of the interface including resource tags, and interpreting the resource tags to request the digital content. A markup language page for disseminating digital content, the page having division tags defining a plurality of containers for the digital content and locations in the page for playing the content, and having an a script tag referencing a web address from which a player definition can be retrieved. | 02-19-2009 |
Pranav Kariwala, Sandy Springs, GA US
Patent application number | Description | Published |
---|---|---|
20120226588 | eGift Social Platform - Systems and methods for electronic commerce using a dynamic checkout and/or group gifting are provided. The dynamic checkout process can be integrated with a social platform electronic commerce experience allowing a user to select a single gift, multiple gifts, and/or to create a basket of goods to send to one or multiple recipients. The dynamic checkout allows the user to select the desired recipient(s) before, after, or intermixed with selecting the offers and/or creating the basket of goods. These offers or products can be purchased by the user with a single payment which will be appropriately apportioned to the merchants based on the products purchased. Once the payment has been successfully processed, an electronic delivery or a physical delivery of the goods or products will occur. | 09-06-2012 |
Pranav Mishra, Banglore IN
Patent application number | Description | Published |
---|---|---|
20150293597 | Method, Apparatus and Computer Program for Enabling a User Input Command to be Performed - A method including in response to a detected gesture user input, wherein the gesture user input is ambiguous as to which one of a plurality of putative targets the gesture user input is directed, disambiguating the plurality of putative targets using disambiguating data to enable selection of one of the plurality of targets; and performing, in response to the gesture user input, a user input command associated with the selected target. | 10-15-2015 |
Pranav Nawani, Farmington Hills, MI US
Patent application number | Description | Published |
---|---|---|
20140271970 | MODULAR SUPERCRITICAL FLUID MATERIALS PROCESSING SYSTEM - A modular system for processing an exfoliated aggregate material or a polymer composite material comprising the exfoliated aggregate, utilizing supercritical fluid processing is described. The modular system may provide exfoliated aggregate particulates, polymer composite materials or master batch polymer composite materials. | 09-18-2014 |
20140275347 | MODIFIED NANO-CLAY MATERIALS AND NANOCOMPOSITES MADE THEREFROM - A nano-clay material that exhibits improved compatibility with polymers is described. The nano-clay material may be mixed with polymers to produce a nano-clay polymer nanocomposite material including reduced levels of clay loading. Methods for making the nano-clay nanocomposite material and articles of manufacture from the nanocomposite material are also described. | 09-18-2014 |
Pranav Patel, Chattanooga, TN US
Patent application number | Description | Published |
---|---|---|
20130275187 | WORK MEASUREMENT TOOLKIT - A customizable work measurement tool that includes a data gathering tools to facilitate work sampling. A setup process generates customized data tables that are synced to a mobile computing device. The mobile computing device utilizes the data tables to generate a user interface presenting predefined lists and parameters based on an interactive decision matrix. Activity and parameter selection may be prompted by sensor readings received by the mobile computing device that identify locations, workers, or assets. Users may be provided data collection routes, data collection instructions, prompts, and tools for acquiring work observations including comments on work activities. The collected work observations may be analyzed for reporting, data mining, and historical benchmark comparisons. The storage of data categorizes each data point as direct work, indirect work, barriers to work, or a delay thereby providing in-depth analysis and reporting capabilities. | 10-17-2013 |
Pranav Patel, East Windsor, NJ US
Patent application number | Description | Published |
---|---|---|
20150087681 | Bendamustine HCL Stable Lyophilized Formulations - The present invention provides a lyophilized bendamustine hydrochloride (HCL) pharmaceutical composition. The present invention further provides methods of producing the lyophilized bendamustine HCL composition from a composition including bendamustine HCL, mannitol, formic acid, and water. The pharmaceutical formulation can be used for any disease that is sensitive to treatment with bendamustine, such as neoplastic diseases. | 03-26-2015 |
Pranav Patel, Albuquerque, NM US
Patent application number | Description | Published |
---|---|---|
20150088627 | METHOD AND SYSTEMS FOR AGGREGATING MULTIPLE QUANTITIES OF GOODS, SERVICES AND PRODUCTS SUCH THAT VALUE-ADDED INCENTIVES CAN BE REQUESTED - A method is disclosed for aggregating multiple quantities of services and/or multiple customers such that offers of value-added services and/or products can be requested. The method includes requesting quantities of services and/or products based upon an individual's predetermined buyer identifier. The predetermined buyer identifier comprises: a buyer profile associated with one or more third-party accounts; a buyer profile having one or more contract dates; and a buyer profile associated with one or more services and/or products. Next the method determines the availability of services and/or products from third-party suppliers based on the individual's predetermined buyer identifier. The method then determines which value-added services and/or products third-party suppliers may offer based on the individual's predetermined buyer identifier. The third-party supplier offers are matched with the individual's predetermined buyer identifier to create one or more third-party sales packages. Finally selectable lists of one or more sales packages that are unique to the individual are presented. | 03-26-2015 |
Pranav Piyush, San Francisco, CA US
Patent application number | Description | Published |
---|---|---|
20150296012 | Migrating Shared Content Items Between Accounts - Shared content items are migrated between accounts on a content management system. Users store content items synchronized between one or more client devices and the content management system. A user may have multiple accounts including personal and organization accounts. Content items may be shared with accounts belonging to other users to enable those other users to view or manipulate the content items. A user initiates a migration of content items between accounts of different categories via a user interface, e.g., by dragging and dropping a folder from one account to another. The content management system recognizes that the user has deleted the folder from the user's first account and determines that an identical folder has been created in another account belonging to the same user. In response the content management system joins the second account to the shared folder, and removes the first account from the shared folder. | 10-15-2015 |
Pranav Rajanala, Bangalore IN
Patent application number | Description | Published |
---|---|---|
20090198688 | METHODS AND SYSTEMS FOR DYNAMICALLY REARRANGING SEARCH RESULTS INTO HIERARCHICALLY ORGANIZED CONCEPT CLUSTERS - Methods of and systems for dynamically rearranging search results into hierarchically organized concept clusters are provided. A method of searching for and presenting content items as an arrangement of conceptual clusters to facilitate further search and navigation on a display-constrained device includes providing a set of content items and receiving incremental input to incrementally identify search terms for content items. Content items are selected and grouped into sets based on how the incremental input matches various metadata associated with the content items. The selected content items are grouped into explicit conceptual clusters and user-implied conceptual clusters based on metadata in common to the selected content items. The clustered content items are presented according to the conceptual clusters into which they are grouped. | 08-06-2009 |
20100325106 | METHOD AND SYSTEM FOR PROCESSING AMBIGUOUS, MULTITERM SEARCH QUERIES - In accordance with one or more embodiments of the invention, a method and system are provided of processing a search query entered by a user of a device having a text input interface with overloaded keys. The search query is directed at identifying an item from a set of items. Each of the items has one or more associated descriptors. The system receives from the user an ambiguous search query directed at identifying a desired item. The search query is a prefix substring of each of at least two words relating to the desired item. The system dynamically identifies a group of one or more items from the set of items having one or more descriptors matching the search query as the user enters each character of the search query. The system outputs identification of the one or more items of the identified group to be displayed on the device operated by the user. | 12-23-2010 |
20110113039 | METHOD AND SYSTEM FOR PERFORMING SEARCHES FOR TELEVISION CONTENT USING REDUCED TEXT INPUT - A method and system are provided for identifying a television content item desired by a television viewer from a set of television content items. Each of the television content items has one or more associated descriptors. The system receives from the television viewer a reduced text search entry directed at identifying the desired television content item. The search entry is a prefix substring of one or more words relating to the desired television content item. The system dynamically identifies a group of one or more television content items from the set of television content items having one or more descriptors matching the search entry as the television viewer enters each character of the search entry. The system then transmits the names of the one or more television content items of the identified group to be displayed on a device operated by the television viewer. | 05-12-2011 |
20120023102 | METHODS AND SYSTEMS FOR DYNAMICALLY REARRANGING SEARCH RESULTS INTO HIERARCHICALLY ORGANIZED CONCEPT CLUSTERS - Methods of and systems for dynamically rearranging search results into hierarchically organized concept clusters are provided. A method of searching for and presenting content items as an arrangement of conceptual clusters to facilitate further search and navigation on a display-constrained device includes providing a set of content items and receiving incremental input to incrementally identify search terms for content items. Content items are selected and grouped into sets based on how the incremental input matches various metadata associated with the content items. The selected content items are grouped into explicit conceptual clusters and user-implied conceptual clusters based on metadata in common to the selected content items. The clustered content items are presented according to the conceptual clusters into which they are grouped. | 01-26-2012 |
20130254188 | METHOD AND SYSTEM FOR PROCESSING AMBIGUOUS, MULTI-TERM SEARCH QUERIES - In accordance with one or more embodiments of the invention, a method and system are provided of processing a search query entered by a user of a device having a text input interface with overloaded keys. The search query is directed at identifying an item from a set of items. Each of the items has one or more associated descriptors. The system receives from the user an ambiguous search query directed at identifying a desired item. The search query is a prefix substring of each of at least two words relating to the desired item. The system dynamically identifies a group of one or more items from the set of items having one or more descriptors matching the search query as the user enters each character of the search query. The system outputs identification of the one or more items of the identified group to be displayed on the device operated by the user. | 09-26-2013 |
Pranav Sharma, Antwerp BE
Patent application number | Description | Published |
---|---|---|
20130198332 | PROCESSING METHOD, PROXY PROCESSING AGENT, SYSTEM AND METHOD FOR FILLING A ROUTING TABLE OF A DHT CLIENT NODE, ROUTER AND DHT CLIENT NODE - Processing method for replying to a distributed hash table (DHT) message from a DHT client in order to allow the DHT client to fill his DHT routing table, includes at a proxy processing agent having a plurality of nodes, receiving from the DHT client a DHT request message, and generating at least one node identifier and associating each node identifier with an IP address and a port number. Each IP address/port number combination corresponding with a node of the plurality of nodes. A DHT response message containing the at least one node identifier and associated IP address and port is sent to the DHT client, and the at least one generated node identifier and associated IP address and port are stored in connection with said DHT client. | 08-01-2013 |
20130297703 | PEER NODE AND METHOD FOR IMPROVED PEER NODE SELECTION - A peer node configured to exchange data with other peer nodes through a peer-to-peer protocol includes a categorization and selection module. The selection module is configured to receive peer node identifiers extracted from messages received from the other peer nodes, to categorize the peer node identifiers according to one or more criteria in one of at least two categories, and to select a peer node identifier as a peer node identifier to be used for communication through the peer-to-peer protocol, if the peer node identifier was categorized in a first category of the at least two categories. | 11-07-2013 |
Pranav Somaiya, Harrow GB
Patent application number | Description | Published |
---|---|---|
20110294158 | Rapid Detection of Bacteria Using Mass Spectrometric Analysis - Methods for the detection or diagnosis of a bacterial infection or colonisation utilising mass spectrometric analysis are provided. The methods involve short-term enrichment of samples followed by mass spectrometric analysis of biomarker profiles. Also provided are methods for preparing short-term enrichment cultures. | 12-01-2011 |
Pranav Wankawala, Palo Alto, CA US
Patent application number | Description | Published |
---|---|---|
20140257785 | HANA BASED MULTIPLE SCENARIO SIMULATION ENABLING AUTOMATED DECISION MAKING FOR COMPLEX BUSINESS PROCESSES - Data for simulation are selected from an in-memory database of an in-memory database server or simultaneous scenarios simulation at a business application server. The simulation results of a plurality of scenarios received from the business application server are temporarily stored at the in-memory database. One scenario from the plurality of scenarios is selected based on using user-defined rules at the in-memory database server. The selected scenario is communicated to the business application server. | 09-11-2014 |
20140258230 | ENTERPRISE RESOURCE PLANNING RUNNING ON MULTIPLE DATABASES - A system and method for running an application on multiple databases is described. A selection of data stored in a database to be used in conjunction with an in-memory database is identified. A selection of a storage mode corresponding to a dual system storage mode or a source system storage mode is received. The selection of data is initialized in the in-memory database. An entry corresponding to the selection of data is generated in a lookup table when the dual system storage mode is selected. | 09-11-2014 |