Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Arun Kumar
Arun Kumar Chandrashekarappa, Karnataka IN
| Patent application number | Description | Published |
|---|---|---|
| 20110096963 | METHOD AND SYSTEM FOR CUSTOMIZING MEDICAL IMAGES BASED ON PATIENT PREFERENCE - A method and system for customizing medical images based on patient preference is disclosed herein. The method comprises: receiving patient preference on displaying patient identification information in a medical image; and providing customized patient identification information on the image based on the patient preference. The image with customized patient information is stored in a media. | 04-28-2011 |
Arun Kumar Chandrashekarappa, Bangalore IN
| Patent application number | Description | Published |
|---|---|---|
| 20110110565 | METHOD AND SYSTEM FOR CHECKING THE DIAGNOSTIC QUALITY OF A MEDICAL SYSTEM - A system and a method are provided that may be used to determine the suitability of a client for use in medical diagnosis. Multimedia content may be presented on the client and used to elicit responses from a user indicative of the suitability of the client for use in medical diagnosis. The elicited responses may be used to determine the suitability of the client for medical diagnosis. | 05-12-2011 |
| 20110145274 | Exemplary Data Guidance in a Multi-Modality Data Viewer - Systems, methods and mediums with instructions for viewing medical data are provided. A system for viewing medical data can include a computer processor, a database and a user interface. The database can include numerous entries from numerous clinical modalities. Each entry can include image data and/or non-image data. Each entry can include annotated medical information from a previous study. The annotated medical information can include comments and markings. The database can be searchable to identify an entry based on input medical information relating to a current study. The user interface can be configured to simultaneously display annotated medical information from an identified entry and medical information from the current study. The system can further include a second user interface configured to display medical information, allow a user to annotate the medical information, and allow the user to save the annotated medical information as an entry in the database. | 06-16-2011 |
Arun Kumar Gnanamani, Mountain View, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20100250527 | SPONSORED SEARCH RESULTS RE-RANKING BASED ON LINKING ASSOCIATIONS - A computer-implemented system and methods of re-ranking sponsored search results by a search engine in response to a search query include: retrieving one or more organic search results and a plurality of sponsored search results (“search results”), along with their respective rankings, associated with a search query; determining a degree of association between each sponsored search result and the other search results through analyzing web links between the search results and other web documents to or from which the search results are at least indirectly linked; calculating a clustering score for each sponsored search result based on their respective degrees of linking association; generating a new ranking score for each sponsored search result based on their respective clustering scores and rankings; and re-ranking, and storing in memory, the plurality of sponsored search results based on the new ranking scores of each respective sponsored search result. | 09-30-2010 |
| 20110047027 | SYSTEM AND METHOD FOR DETERMINING WHETHER AN AD IS UBIQUITOUS - A method of determining whether an advertisement will be served against a search query calculates the ubiquitous index of the advertisement and if at least the ubiquitous index is below a predefined threshold, the advertisement is served. The ubiquitous index may be based, at least in part, on either the relatedness of a set of search queries against which the advertisement was served over a predetermined period, or a comparison between a click-through rate associated with the advertisement over the predetermined period and an aggregated click-through rate calculated over a set of advertisements available to be served over the predetermined period, or some combination thereof. | 02-24-2011 |
| 20120030021 | SELECTING ADVERTISEMENTS USING SAME SESSION QUERIES - Techniques are described herein for selecting an advertisement using same session queries. Each occurrence of a query is referred to as a query instance. When a query instance is received from a user, that query instance and other query instances that were received from the user prior to that query instance (i.e., historical query instances) are taken into consideration to select an advertisement to be provided to the user. The query instance in response to which the advertisement is to be provided and the historical query instances that are received at respective time instances that do not precede a threshold time instance are referred to collectively as a session of the user. Accordingly, the session of the user may be described generally as a collection of query instances that are most recently received from the user. | 02-02-2012 |
| 20120030185 | SPONSORED SEARCH RESULTS RE-RANKING BASED ON LINKING ASSOCIATIONS - A computer-implemented system and methods of re-ranking sponsored search results by a search engine in response to a search query include: retrieving one or more organic search results and a plurality of sponsored search results (“search results”), along with their respective rankings, associated with a search query; determining a degree of association between each sponsored search result and the other search results through analyzing web links between the plurality of sponsored search results, the one or more organic search results, and other web documents to or from which the search results are at least indirectly linked; re-ranking the plurality of sponsored search results based on the degree of association between each respective sponsored search result and the other search results; and storing in memory the plurality of re-ranked sponsored search results in relation to the search query. | 02-02-2012 |
| 20120072281 | METHOD AND SYSTEM TO MONETIZE DOMAIN QUERIES IN SPONSORED SEARCH - Techniques are provided for enabling relevant search results and advertisement selections to be generated in response to domain queries. A query that is input to a search engine is received. The query is analyzed to determine whether the search query is a domain query. If the query is determined to be a domain query, at least one domain related segment is stripped from the domain query to generate a condensed query, the condensed query is tokenized into at least one token, and the token(s) is/are spell corrected to generate at least one query feature. The query feature(s) may be normalized to generate at least one normalized query feature. The query feature(s) is/are provided to an advertisement selector to be used to select one or more advertisements. | 03-22-2012 |
| 20120089456 | SYSTEM FOR SEARCH BID TERM SELECTION - A system is disclosed for selecting bid terms for search advertising. A bid term selection tool includes a processor to execute an algorithm to provide suggested bid terms. The algorithm includes a cosine similarity function, a modified cosine similarity function, a penalty factor function, and an expected revenue function. The bid term selection tool aggregates the function of the algorithm for potential bid terms and compares the totals for the potential bid terms to select a relevant bid term. | 04-12-2012 |
Arun Kumar Gupta, Andra Pradesh IN
| Patent application number | Description | Published |
|---|---|---|
| 20090043131 | Process for the Preparation of Florfenicol - The present invention relates to a method for the preparation of Florfenicol from Fluoroamine compound, namely (1R,2S)-1-[4-(methylsulfonyl)phenyl]-2-amino-3-fluoro-1-propanol (II), by reaction with dihaloacetic acid ester in an organic solvent in presence of an inorganic base. | 02-12-2009 |
Arun Kumar Gupta, Singapore SG
| Patent application number | Description | Published |
|---|---|---|
| 20100035527 | POLISHING WITH ENHANCED UNIFORMITY - A polishing head is presented. The polishing head includes a housing having top and bottom surfaces. The housing is formed from a single piece of material. The polishing head includes grooves disposed on the bottom surface and an inlet in communication with the grooves for coupling to a pressure medium supply to supply a pressure medium to the grooves. The pressure medium when supplied to the grooves exerts pressure on a template when attached to the bottom surface to provide back side pressure on a back surface of an article when temporally attached to the template. | 02-11-2010 |
Arun Kumar Jagota, Sunnyvale, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20120059853 | SYSTEM AND METHOD OF LEARNING-BASED MATCHING - Some embodiments match address data in a database system having a corpus of address information stored therein. In some embodiments, an external address data for a company that is associated with a set of locations is received. Some embodiments determine whether the external address data matches existing address data that includes the set of locations using fuzzy matching techniques. In order to determine whether two addresses match, some embodiments perform fuzzy matching techniques that uses learned knowledge to identify aliases in the address pair. In situations where a contact is specified along with the external address data, the contact is tethered to one of the set of locations when the external address data is determined to match an address within the existing address data. Some embodiments create a new location for the company using the external address data when the external address data does not match the existing address data. | 03-08-2012 |
| 20120066160 | PROBABILISTIC TREE-STRUCTURED LEARNING SYSTEM FOR EXTRACTING CONTACT DATA FROM QUOTES - Systems and methods for updating data stored in a database, such as contact information. An input string is obtained through a search for timely material associated with the stored contact. The input string is parsed using probabilistic tendencies to extract entities corresponding to those stored with the contact. Secondary entities are used to assist in the identification of the primary entities. The contact is then updated (or added if new) using the extracted primary entities. | 03-15-2012 |
Arun Kumar Jagota US
| Patent application number | Description | Published |
|---|---|---|
| 20120089638 | METHODS AND SYSTEMS FOR LATENCY-FREE CONTACTS SEARCH - Systems and methods for performing latency-free contact searches using two-level indexed data structures having decreasing integer sets as identifiers to represent actual contact data. The indexed data structures are stored in distributed memory. Data operations such as intersection and union are performed using the indexed data structures. A binary interval reduction technique is used to quickly move through the data sets looking for common elements for the intersection set, or unique elements to add to the union set. | 04-12-2012 |
| 20120089647 | METHODS AND SYSTEMS FOR LATENCY-FREE DATABASE QUERIES - Systems and methods for performing latency-free database searches using two-level indexed data structures having decreasing integer sets as identifiers to represent actual data. The indexed data structures are stored in distributed memory. Data operations such as intersection and union are performed using the indexed data structures. A binary interval reduction technique is used to quickly move through the data sets looking for common elements for the intersection set, or unique elements to add to the union set. | 04-12-2012 |
Arun Kumar Sharma, Cupertino, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20100040120 | LOW POWER RADIO COMMUNICATION SYSTEM - A method significantly reduces the average power for radio communication in a communication system, such as a system that has applications requiring low communication latency. The method may use a low power radio communication circuit (e.g., a non-heterodyne receiver) to wait for a communication request, taking advantage of the low power consumption of the radio communication circuit. Subsequent to receiving and validating the communication request, the communication system may switch to a more efficient—but higher power—communication circuit. Thus, effective communication is achieved without making undesirable tradeoffs, such as reduced sensitivity. | 02-18-2010 |
Arun Kumar Singh, Farrukhabad IN
| Patent application number | Description | Published |
|---|---|---|
| 20090064319 | ELECTRONIC TRIP UNITS WITH LIMITED READ/WRITE ACCESS - A method of limiting read/write access of information stored on an electronic trip unit is disclosed. The method includes requesting a valid password on one of a communication port of the electronic trip unit and a display device of the electronic trip unit, receiving a password at a processor of the electronic trip unit in response to the request, determining if the received password is valid based on password information stored on a memory of the electronic trip unit, and limiting read/write access of information stored on the electronic trip unit based on the determination. | 03-05-2009 |
Arun Kumar Sundaramoorthy, Cupertino, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20080306894 | Computer-implemented methods and systems for identifying and reporting deviations from standards and policies for contracts, agreements and other business documents - A computer-implemented method may include steps of providing a plurality of business document templates; providing a plurality of deviation rules and associating at least some of the plurality of deviation rules with each of the business document templates; storing the plurality of business document templates and the associated plurality of deviation rules; generating a business document (such as a contract, for example) based upon one of the stored plurality of business document templates, the generated business document including a plurality of clauses and business document terms; retrieving the plurality of deviation rules associated with the business document template upon which the business document is based and applying the retrieved plurality of deviation rules against the generated business document; identifying all business document terms of the business document that do not conform to one or more of the applied plurality of deviation rules, and generating a report that includes at least the identified non-conforming business document terms. | 12-11-2008 |
Arun Kumar Thakore, Boca Raton, FL US
| Patent application number | Description | Published |
|---|---|---|
| 20090307298 | Optimizing Service Processing Based on Business Information, Operational Intelligence, and Self-Learning - A mechanism for using information in an execution context and other information to optimally select a business service implementation and service execution path. Responsive to receiving a request for a service from a service requester, an execution context is created, wherein the execution context comprises information about business aspects and operational aspects of the service being requested. The request is sent with the execution context to a next component in the service request/response flow in the service oriented architecture. Responsive to the next component receiving the request, current execution context information about the service is obtained based on a current processing of the request for the service and historical execution context information about the service based on previous processing of requests for the service. A service execution decision is then made based on the current execution context information and the historical execution context information. | 12-10-2009 |
| 20100131468 | Arbitration Token for Managing Data Integrity and Data Accuracy of Information Services that Utilize Distributed Data Replicas - Illustrative embodiments present a computer-implemented method for controlling update of stored data in a set of data replicas. The computer-implemented method responsive to receiving a data request from a requester, identifies a data replica to resolve the data request to form an identified data replica. The computer-implemented method transmits an update data request to a replica administration agent if the data request is an update data request, determines whether an arbitration token is present, and responsive to a determination that the arbitration token is present; a replica administration agent updates the data in the identified data replica. | 05-27-2010 |
Arun Kumar Timalapur, Bangalore IN
| Patent application number | Description | Published |
|---|---|---|
| 20110307360 | MANAGING CONSISTENT INTERFACES FOR EMPLOYEE TIME EVENT AND HUMAN CAPITAL MANAGEMENT VIEW OF PAYROLL PROCESS BUSINESS OBJECTS ACROSS HETEROGENEOUS SYSTEMS - A business object model, which reflects data that is used during a given business transaction, is utilized to generate interfaces. This business object model facilitates commercial transactions by providing consistent interfaces that are suitable for use across industries, across businesses, and across different departments within a business during a business transaction. In some operations, software creates, updates, or otherwise processes information related to employee time event and human capital management view of payroll process business objects. | 12-15-2011 |