Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Jain, Santa Clara
Arvind Jain, Santa Clara, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20080320151 | TRANSACTION ACCELERATOR FOR CLIENT-SERVER COMMUNICATIONS SYSTEMS - Self-discovering transaction accelerators improve communications between a client and a server. A client directs a message to a server. A client-side transaction accelerator intercepts the message, terminates the connection with the client, and accelerates the request by replacing segments of data with references. The accelerated request is forwarded to a server-side transaction accelerator through a new connection. The server-side transaction accelerator reconstructs the message by replacing the reference with segment data in a persistent segment store accessible to the server-side transaction accelerator. The reconstructed request is then provided to the server. Accelerations may occur in any direction of communication. Persistent segment stores can be pre-populated with segment data from other transaction accelerators and anticipated transactions. The persistent segment store can store segments that are data segmented based on content of the data and can be independent of transaction protocol, application, and device. | 12-25-2008 |
Ashish Jain, Santa Clara, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20100036827 | INTERCONNECTED, UNIVERSAL SEARCH EXPERIENCE ACROSS MULTIPLE VERTICALS - One or more query terms that were submitted by a user in connection with a first vertical of a plurality of verticals and not in connection with any other vertical of the plurality of verticals are received. A first set of search results that are both (a) indexed in the first vertical and (b) relevant to the one or more query terms is determined. A second set of search results that are both (a) indexed in a second vertical, but not in the first vertical and (b) relevant to the one or more query terms is also determined. A search results page that contains search results both sets of search results, and that visually distinguishes the sets from each other, is generated. According to one aspect, the results from the second set are shown on the search results page in what appears to be a yellow sticky note. | 02-11-2010 |
Ashish R. Jain, Santa Clara, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20100308790 | APPARATUS AND METHOD FOR TESTING DRIVER WRITEABILITY STRENGTH ON AN INTEGRATED CIRCUIT - An apparatus and method for testing driver write-ability strength on an integrated circuit includes one or more drive detection units each including a number of drivers. At least some of the drivers may have a different drive strength and each may drive a voltage onto a respective driver output line. Each drive detection unit may include a number of keeper circuits, each coupled to a separate output line and configured to retain a given voltage on the output line to which it is coupled. Each detection unit may also include a number of detection circuits coupled to detect the drive voltage on each of the output lines. In one implementation, the drive voltage appearing at the output line of each driver may be indicative of that the driver was able to overdrive the voltage being retained on the output line to which it is coupled by the respective keeper circuits. | 12-09-2010 |
| 20100308887 | APPARATUS AND METHOD FOR TESTING LEVEL SHIFTER VOLTAGE THRESHOLDS ON AN INTEGRATED CIRCUIT - An apparatus and method for testing level shifter threshold voltages on an integrated circuit includes one or more level shifter modules each including a number of level shifter circuits. Each level shifter circuit may be coupled to a first and a second voltage supply. Each level shifter circuit may also receive an input signal that is referenced to the first voltage supply, and to generate an output signal that is referenced to the second voltage supply. In addition, each level shifter module may include detection logic that may detect an output value of each of the level shifter circuits. The control circuit may be configured to iteratively change the voltage output from one of the voltage supplies, and maintaining a voltage on the other voltage supply while the input signal is provided to the level shifter circuits. The detection logic may capture the output value upon each change in voltage. | 12-09-2010 |
| 20100322026 | MECHANISM FOR MEASURING READ CURRENT VARIABILITY OF SRAM CELLS - A mechanism for measuring the variability of the read current of SRAM cells on an integrated circuit includes the integrated circuit having an SRAM array including a plurality of SRAM cells. The integrated circuit may also include a selection circuit configured to select a particular SRAM cell in response to a selection input. An oscillator circuit such as a ring oscillator, for example, on the integrated circuit may be configured to oscillate at a frequency that is dependent upon a read current of a selected SRAM cell during operation in a first mode. A frequency determining circuit that is coupled to the oscillator circuit may be configured to output a value corresponding to the frequency of oscillation of the oscillator circuit. | 12-23-2010 |
| 20110012643 | APPARATUS AND METHOD FOR TESTING SENSE AMPLIFIER THRESHOLDS ON AN INTEGRATED CIRCUIT - An apparatus and method for testing sense amplifier threshold voltages on an integrated circuit includes one or more sense amplifier modules each including a number of sense amplifier circuits, a voltage generator unit, and detection logic. The voltage generator unit may select a differential voltage to supply to at least some of the sense amplifier circuits, and each sense amplifier circuit may be configured to generate an output value that is dependent upon the applied differential voltage in response to receiving an enable signal. The detection logic may detect and capture an output value of each of the sense amplifier circuits. In one implementation, the voltage generator unit may iteratively select a different differential voltage in response to a control input. Accordingly, the detection logic may capture the output value of the sense amplifiers after each change in differential voltage. | 01-20-2011 |
Bhupendra Jain, Santa Clara, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20110099085 | PRODUCT IDENTIFICATION USING MULTIPLE SERVICES - A method and a system to determine a product identification of an item for sale in an online publication system is shown and described. For example, the method may be initiated when an input identifying an item is received from a user. An input type (e.g., image, text, audio recording, etc.) may be determined and one or more identification services may be selected based on the input type. At least a portion of the input is transmit to the selected one or more identification services. A product identification is received from each of the one or more identification services. Based on the received product identifications, a recommended product identification is determined. The recommended product identification is transmitted to the user. | 04-28-2011 |
| 20110258027 | POINT-OF-SALE PROMOTIONS - A method and a system to publish a promotion at a point-of-sale are provided. For example, a preliminary selection associated with a purchase from a user may be received. A promotion may be published to the user at a point-of-sale associated with the purchase after the user makes the preliminary selection and before the user finalizes the purchase. The promotion may be based on at least one attribute of past transactions and the preliminary selection. | 10-20-2011 |
Jawahar Jain, Santa Clara, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20090210212 | Validating One or More Circuits Using One or More Grids - In one embodiment, a method includes simulating by one or more computer systems a larger circuit to assign one or more values to one or more latch variables associated with the larger circuit, generating by the one or more computer systems one or more reduced circuits from the larger circuit according to the values assigned to the latch variables, generating by the one or more computer systems a transition relation (TR) for each reduced circuit, and generating by the one or more computer systems an initial state set for one or more instances of validation on the reduced circuits according to the TRs. | 08-20-2009 |
| 20100036835 | Caching Query Results with Binary Decision Diagrams (BDDs) - Construct a plurality of first binary decision diagrams (BDDs), each representing a different one of a plurality of words. Construct a plurality of second BDDs, each representing a different one of a plurality of search queries, each of the search queries comprising one or more of the words. Construct a plurality of third BDDs, each representing a different one of a plurality of web pages. Construct a plurality of fourth BDDs, each representing a different one of a plurality of search results, each search result comprising one or more web pages. Construct a plurality of fifth BDDs each representing a different one of a plurality of search tuples, each of the search tuples comprising a different one of the search queries and a different one of the search results. Construct a sixth BDD representing the search queries and the search results. | 02-11-2010 |
| 20100211534 | Efficient computation of ontology affinity matrices - In one embodiment, generating an ontology includes accessing an inverted index comprising a plurality of inverted index lists. An inverted index list may correspond to a term of a language. Each inverted index list may comprise a term identifier of the term and one or more document identifiers indicating one or more documents of a document set in which the term appears. The embodiment also includes generating a term identifier index according to the inverted index. The term identifier index comprises a plurality of sections and each section corresponds to a document. Each section may comprise one or more term identifiers of one or more terms that appear in the document. | 08-19-2010 |
| 20120042326 | Identifying An Event Occurrence From Sensor Data Streams - According to one embodiment of the present invention, a method for identifying the occurrence of an event from sensor data streams may be provided. The method may include accessing a plurality of sensor data streams generated by a plurality of sensor sets. Each sensor set may comprise one or more sensors. A sensor data stream may be associated with a user. The user may be co-located with a sensor set that generates the sensor data stream. A relationship between two or more sensor data streams of the plurality of sensor data streams may be identified. The method may further include determining, according to the relationship, that the plurality of sensor data streams corresponds to an event. A notification of an occurrence of the event may be sent. | 02-16-2012 |
Kapil Jain, Santa Clara, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20120063552 | Electro-magnetic Interference Reduction for Switched Signal Systems - In one embodiment, a method receives a pulse width modulation signal. A value that is a function of the pulse width modulation signal is determined. The value is used to modulate a switching frequency of the pulse width modulation signal to generate a modulated pulse width modulation signal. The applied value reduces electro-magnetic interference from tones in the modulated pulse width modulation signal. | 03-15-2012 |
Maneesh Jain, Santa Clara, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20090204945 | UTILIZING INTELLIGENT AUTOMATED SCRIPTS TO TEST SOFTWARE APPLICATIONS - Embodiments of the invention provide for utilizing an intelligent automated script to test software applications. According to one embodiment, testing a software application can comprise executing a test script for testing a plurality of versions of the software application. For example, executing the test script can comprise instantiating a first instance of the test script for testing the first version of the software application. The first version of the software application can be initiated and a temporary map of the first version of the software application can be built by the test script. The first version of the software application can be tested based on the temporary map. In some cases, a second instance of the test script can be instantiated for testing a second version of the software application. In such cases, the first and second versions of the application may be tested in parallel. | 08-13-2009 |
Praveen Jain, Santa Clara, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20110128963 | SYSTEM AND METHOD FOR VIRTUAL CHANNEL COMMUNICATION - A system and method for communicating over a single virtual channel. The method includes reserving a first group of credits of a credit pool for a first traffic class and a second group of credits of the credit pool for a second traffic class. In addition, a first and second respective groups of tags are reserved from a tag pool for the first and second traffic class. A packet may then be selected from a first buffer for transmission over the virtual channel. The packet may include a traffic indicator of the first traffic class operable to allow the packet to pass a packet of the second traffic class from a second buffer. The method further includes sending the packet over the virtual channel and adjusting the first group of credits and the first group of tags based on having sent a packet of the first traffic class. | 06-02-2011 |
Sandeep Jain, Santa Clara, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20090037601 | System and Method for Updating State Information in a Router - Systems and methods consistent with the present invention enable routing table updates are performed by optimally utilizing the resources of a node without exceeding the resources of the node. Using feedback on the amount of resources available to the nodes, such as in terms of available memory, the node may make new connections before breaking old one where those updates will not exceed available resources. This is referred to as make-before-break. When not enough resources are available, the node will break old connections before making new ones. This is referred to as break-before-make. Unlike the strict make-before-break and break-before-make models, this “loose” make-before-break method considers the amount of available resources in view of the resources required to perform the routing table updates without a node failure. Routes may also be tagged to prioritize the addition of more important routes and the deletion of less significant routes. Methods and systems consistent with the present invention, therefore, provide a routing table update method with which routing table updates are achieved without crashing and at the same time minimizing black hole intervals. | 02-05-2009 |
Vipin Jain, Santa Clara, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20090254452 | SYSTEMS AND METHODS FOR PERFORMING AN ACTION BASED ON USER INTERACTION WITH A GRAPHICAL PRESENTATION - A method for performing an action based on user interaction with a graphical presentation, according to one embodiment. In use, output data is generated corresponding to a multidimensional presentation of graphical representations of two or more consumer products in relation to each other. Additionally, positions of the graphical representations of the consumer products relative to each other are based on multiple attributes of the products. Further, none of the dimensions correlates to a side by side ordering of the consumer products. Further still, a user selection of one or more of the consumer products is received. Also, a transaction is performed based on additional input received from the user. Additional embodiments are also presented. | 10-08-2009 |
| 20100088154 | SYSTEMS, METHODS AND COMPUTER PROGRAM PRODUCTS FOR COMPUTING AND OUTPUTTING A TIMELINE VALUE, INDICATION OF POPULARITY, AND RECOMMENDATION - A computer-implemented method is provided for computing and outputting a timeline value. In use, model data about a product is received. Additionally, thresholds relevant to the model data are received or computed. Further, a timeline value is computed based on comparing the thresholds to the model data, where the timeline value is indicative of a current stage in a lifecycle of the product. Further still, the timeline value is output. Additional systems, methods and computer program products are also implemented. For example, methods are presented for computing and outputting an indication of product buzz and/or popularity. Other methods include using one or more of timeline, popularity, sentiment, value, discount ratings, etc. to compute a recommendation and output the same. | 04-08-2010 |