# Sarma, CA

## Anish Das Sarma, San Francisco, CA US

Patent application number | Description | Published |
---|---|---|

20120036148 | SOCIALIZING VIA SEARCH - Implementations of methods, apparatuses, or systems are disclosed to facilitate search related communications. | 02-09-2012 |

20120143875 | METHOD AND SYSTEM FOR DISCOVERING DYNAMIC RELATIONS AMONG ENTITIES - Method, system, and programs for detecting dynamic relationship and discovering dynamic events. Data from a first data source is first received. At least one dynamic relation candidate is identified and each dynamic relation candidate involves multiple entities. The at least one dynamic relation candidate is identified based on temporal properties with respect to the entities exhibited in the data from the first data source. Dynamic relations are then extracted by corroborating the temporal properties of the entities involved in the at least one dynamic relation candidate with that of the same entities exhibited in data from a second data source. Then, a dynamic event that gives rise to the dynamic relations among different entities is detected. | 06-07-2012 |

20120158687 | DISPLAY ENTITY RELATIONSHIP - Method, system, and programs for providing one or more explanations. An inquiry is received via a communication platform where the inquiry is about how a set of entities are related. Information is retrieved from a knowledge storage in accordance with the set of entities and such information describes a plurality of entities and relationships existing among the plurality of entities. Based on such retrieved information, one or more explanations with respect to each relationship by which the set of entities are connected are generated. The one or more explanations are then transmitted as a response to the inquiry. | 06-21-2012 |

20130166585 | METHOD AND SYSTEM FOR GENERATING QUERY-RELATED SUGGESTIONS - Methods and systems are provided that may be utilized to determine one or more suggestions of entities relating to a user query. | 06-27-2013 |

20150074146 | METHOD AND SYSTEM FOR DISCOVERING DYNAMIC RELATIONS AMONG ENTITIES - Method, system, and programs for detecting dynamic relationship and discovering dynamic events. Data from a first data source is first received. At least one dynamic relation candidate is identified and each dynamic relation candidate involves multiple entities. The at least one dynamic relation candidate is identified based on temporal properties with respect to the entities exhibited in the data from the first data source. Dynamic relations are then extracted by corroborating the temporal properties of the entities involved in the at least one dynamic relation candidate with that of the same entities exhibited in data from a second data source. Then, a dynamic event that gives rise to the dynamic relations among different entities is detected. | 03-12-2015 |

## Anish Das Sarma, Santa Clara, CA US

Patent application number | Description | Published |
---|---|---|

20120203782 | METHOD AND SYSTEM FOR DATA PROVENANCE MANAGEMENT IN MULTI-LAYER SYSTEMS - Method, system, and programs for heterogeneous data management. Information from multiple data sources is first obtained. Data/metadata from each of the data sources is modeled based on the source and/or granularity information of the data/metadata to generate data/metadata models. The data/metadata from multiple data sources are integrated, by applying one or more processes to the data/metadata from different data sources based on the data/metadata models, to generate integrated data/metadata. A provenance representation for the integrated data/metadata is created tracing sources, granularities, and/or processes applied and archived for enabling an query associated with the integrated data/metadata. | 08-09-2012 |

## Atish Das Sarma, Mountain View, CA US

Patent application number | Description | Published |
---|---|---|

20140149510 | SOCIAL SHARING SYSTEM - A system, computer-readable storage medium storing at least one program, and computer-implemented method for providing recommendations based on social network sharing activity. Sharing activity relating to the sharing of the content item on a social network by a first user is accessed. Consumption information related to the consumption of the content item. A correlation between the sharing activity and the consumption information is determined. A recommendation is then generated based on the correlation. | 05-29-2014 |

## Debjit Das Sarma, San Jose, CA US

Patent application number | Description | Published |
---|---|---|

20090094308 | RELAXED REMAINDER CONSTRAINTS WITH COMPARISON ROUNDING - A system and method for efficient floating-point rounding in computer systems. A computer system may include at least one floating-point unit for floating-point arithmetic operations such as addition, subtraction, multiplication, division and square root. For the division operation, the constraints for the remainder may be relaxed in order to reduce the area for look-up tables. An extra internal precision bit may not be used. Only one quotient may be calculated, rather than two, further reducing needed hardware to perform the rounding. Comparison logic may be required that may add a couple of cycles to the rounding computation beyond the calculation of the remainder. However, the extra latency is much smaller than a second FMAC latency. | 04-09-2009 |

20100125620 | ARITHMETIC PROCESSING DEVICE AND METHODS THEREOF - A device and methods are disclosed for communicating an unrounded result from one arithmetic calculation for use in a second, subsequent calculation. For example, an unrounded result of a first calculation can be forwarded to provide a multiplier, a multiplicand or an addend operand for the subsequent operation. The operand can be forwarded to the input of the same fused multiply addition module (FMAM) that supplied the result, or to another FMAM, and do so without regard to the precision of the forwarded operand, the precision of the subsequent operation, or the native precision of the FMAM. | 05-20-2010 |

20100125621 | ARITHMETIC PROCESSING DEVICE AND METHODS THEREOF - An arithmetic processing unit is disclosed that can perform multiply operations, addition operations, or a combination thereof. The arithmetic processing unit can operate in two modes. The first mode supports one single, double, or extended-precision computation, and the second mode supports two simultaneous single-precision computations using the same exponent and mantissa datapaths. | 05-20-2010 |

20100318771 | COMBINED BYTE-PERMUTE AND BIT SHIFT UNIT - A processor includes a decode unit and a byte permute unit. The byte permute unit receives an instruction from the decode unit. The byte permute unit determines whether the instruction corresponds to a shuffle instruction or a shift instruction. For a shuffle instruction, the byte permute unit uses a byte shuffler to perform a shuffle operation indicated by the instruction. For a shift instruction that indicates a shift magnitude, the byte permute unit uses the byte shuffler to byte-level shift a source operand corresponding to the instruction by an integer number of bytes. The byte permute unit also generates a sequence of output bits by bit-shifting the byte-level shifted source operand by a number of bits such that the sum of the number of bits and the integer number of bytes is equal to the shift magnitude. | 12-16-2010 |

20100318772 | SUPERSCALAR REGISTER-RENAMING FOR A STACK-ADDRESSED ARCHITECTURE - A system and method for increasing processor throughput by decreasing a loop critical path. In one embodiment, a table comprises multiple stack entries, each comprising an x87 floating-point (FP) stack specifier. The combinatorial logic for operand translation of N FP instructions per clock cycle may require N instantiated copies of a combinatorial logic block. Each instantiated copy may determine a new ordering of the stack entries. Control logic may receive necessary information from the corresponding N FP instructions and determine a corresponding combined computational effect, or stack reordering, on entries within the table based on two or more instructions. Resulting control signals are conveyed to the N instantiated copies. A resulting accumulative delay from an input of the first copy to the output of the Nth copy may be less than or equal to (N−1)*time_delay versus a longer N*time_delay. | 12-16-2010 |

20120173854 | PROCESSOR HAVING INCREASED EFFECTIVE PHYSICAL FILE SIZE VIA REGISTER MAPPING - Methods and apparatuses are provided for an efficient technique for processing registers having a known value while improving processor performance. The apparatus comprises a processor having a plurality of physical registers available for use in computations and a decoder for determining that a logical register contains a known value. A renaming unit maps the logical register containing the known value to an address outside an address range for the plurality of physical registers once the known value is determined. Thereafter, scheduling and execution units perform computations using the known value without storing the known value in one of the plurality of physical registers. The method comprises determining that a logical register of a processor has a known value and then mapping that logical register to a physical register address outside an expected range of physical register addresses; which indicates that the logical register represents the known value. Thereafter the processor processes any instruction using the known value without storing the known value in a physical register. | 07-05-2012 |

20120191954 | PROCESSOR HAVING INCREASED PERFORMANCE AND ENERGY SAVING VIA INSTRUCTION PRE-COMPLETION - Methods and apparatuses are provided for achieving increased performance and energy saving via instruction pre-completion without having to schedule instruction execution in processor execution units. The apparatus comprises an operational unit for determining whether an instruction can be completed without scheduling use of an execution unit of the processor and units within the operational unit capable of employing alternate or equivalent processes or techniques to complete the instruction. In this way, the instruction is completed without scheduling use of the execution unit of the processor. The method comprises determining that an instruction can be completed without scheduling use of an execution unit of a processor and then pre-completing the instruction without use of one or more the execution units. | 07-26-2012 |

20120226891 | PROCESSOR WITH INCREASED EFFICIENCY VIA CONTROL WORD PREDICTION - Methods and apparatuses are provided for increased efficiency in a processor via control word prediction. The apparatus comprises an operational unit capable of determining whether an instruction will change a first control word to a second control word for processing dependent instructions. Execution units process the dependent instructions using a predicted control word and compare the second control word to the predicted control word. A scheduling unit causes the execution units to reprocess the dependent instructions when the predicted control word does not match the second control word. The method comprises determining that an instruction will change a first control word to a second control word and processing the dependent instructions using a predicted control word. The second control word is compared to the predicted control word and the dependent instructions are reprocessed using the second control word when the predicted control word does not match the second control word. | 09-06-2012 |

20130282784 | ARITHMETIC PROCESSING DEVICE AND METHODS THEREOF - A device and methods are disclosed for communicating an unrounded result from one arithmetic calculation for use in a second, subsequent calculation. For example, an unrounded result of a first calculation can be forwarded to provide a multiplier, a multiplicand or an addend operand for the subsequent operation. The operand can be forwarded to the input of the same fused multiply addition module (FMAM) that supplied the result, or to another FMAM, and do so without regard to the precision of the forwarded operand, the precision of the subsequent operation, or the native precision of the FMAM. | 10-24-2013 |

20140136587 | FLOATING POINT MULTIPLY-ADD UNIT WITH DENORMAL NUMBER SUPPORT - The present application provides a method and apparatus for supporting denormal numbers in a floating point multiply-add unit (FMAC). One embodiment of the FMAC is configurable to add a product of first and second operands to a third operand. This embodiment of the FMAC is configurable to determine a minimum exponent shift for a sum of the product and the third operand by subtracting a minimum normal exponent from a product exponent of the product. This embodiment of the FMAC is also configurable to cause bits representing the sum to be left shifted by the minimum exponent shift if a third exponent of the third operand is less than or equal to the product exponent and the minimum exponent shift is less than or equal to a predicted left shift for the sum. | 05-15-2014 |

20140136819 | REGISTER FILE MANAGEMENT FOR OPERATIONS USING A SINGLE PHYSICAL REGISTER FOR BOTH SOURCE AND RESULT - A processor includes a physical register file having physical registers and an execution unit to perform an arithmetic operation to generate a result mapped to a physical register, wherein the processor delays a write of the result to the physical register file until the result is qualified as valid. A method includes mapping the same physical register both to store load data of a load-execute operation and to subsequently store a result of an arithmetic operation of the load-execute operation, and writing the load data into the physical register. The method further includes, in a first clock cycle, executing the arithmetic operation to generate the result, and, in a second clock cycle, providing the result as a source operand for a dependent operation. The method includes, in a third clock cycle, enabling a write of the result to the physical register file responsive to the result qualifying as valid. | 05-15-2014 |

## Keshab Sarma, Sunnyvale, CA US

Patent application number | Description | Published |
---|---|---|

20080312467 | NOVEL PROCESS FOR THE PREPARATION OF 3-AMINO-PENTAN-1,5-DIOL - The present invention provides a novel method for preparing a key intermediate, 3-amino-pentan-1,5-diol (2), which is useful for the preparation of 6-(2,4-difluorophenoxy)-2-[3-hydroxy-1-(2-hydroxyethyl)-propylamino]-8-methyl-8H-pyrido[2,3-d]pyrimidine-7-one (1) a MAP-kinase inhibitor useful in the treatment of rheumatoid arthritis. | 12-18-2008 |

20090012304 | Process for preparing triazolones - The present process provides a improved method for the preparation of alkylsulfanyl substituted triazoles 2 which are useful intermediates in a new process for the preparation of triazolones 20. | 01-08-2009 |

20100056770 | PREPARATION OF NUCLEOSIDES RIBOFURANOSYL PYRIMIDINES - The present process provides an improved method for the preparation of 4-amino-1-((2R,3R,4R,5R)-3-fluoro-4-hydroxy-5-hydrox-ymethyl-3-methyl-tetrahydro-furan-2-yl)-1H-pyrimidin-2-one of the formula (IV) which is a potent inhibitor of Hepatitis C Virus (HCV) NS5B polymerase. | 03-04-2010 |

## Lakshmi Priya Sarma, Santa Clara, CA US

Patent application number | Description | Published |
---|---|---|

20150085706 | CONVERGENCE OF MULTI-DESTINATION TRAFFIC IN A NETWORK ENVIRONMENT - An example method for convergence of multi-destination traffic in a network environment is provided and includes receiving a first type-length-value (TLV) message from a true broadcast root in a Transparent Interconnection of Lots of Links (TRILL) network, where the first TLV message indicates a first subset of multi-destination trees in the TRILL network, receiving a second TLV message from the true broadcast root indicating a second subset of multi-destination trees in the TRILL network, such that a union of the first subset and the second subset indicates at least one inactive multi-destination tree in the TRILL network, and deleting the inactive tree from a hash table of active trees. | 03-26-2015 |

## Pallav Sarma, San Ramon, CA US

Patent application number | Description | Published |
---|---|---|

20090216505 | SYSTEM AND METHOD FOR EFFICIENT WELL PLACEMENT OPTIMIZATION - The disclosed methods, systems, and software are described for optimizing well placement in a reservoir field. A geological model of a reservoir field, a grid defining a plurality of cells, one or more wells to be located within the plurality of cells, and an objective function are all provided. The geological model is associated with the grid defining the plurality of cells. The locations of the wells are represented by continuous well location variables associated with a continuous spatial domain. A gradient of the objective function is calculated responsive to the continuous well location variables. The locations of the wells are then adjusted responsive to the calculated gradient of the objective function. Iterative calculation of the gradient and adjustment of the wells continue until the well locations are optimized. A visual representation of the reservoir field can be generated based on the optimized well placements. | 08-27-2009 |

20100198570 | System and method for predicting fluid flow in subterranean reservoirs - A reservoir prediction system and method are provided that use generalized EnKF using kernels, capable of representing non-Gaussian random fields characterized by multi-point geostatistics. The main drawback of the standard EnKF is that the Kalman update essentially results in a linear combination of the forecasted ensemble, and the EnKF only uses the covariance and cross-covariance between the random fields (to be updated) and observations, thereby only preserving two-point statistics. Kernel methods allow the creation of nonlinear generalizations of linear algorithms that can be exclusively written in terms of dot products. By deriving the EnKF in a high-dimensional feature space implicitly defined using kernels, both the Kalman gain and update equations are nonlinearized, thus providing a completely general nonlinear set of EnKF equations, the nonlinearity being controlled by the kernel. By choosing high order polynomial kernels, multi-point statistics and therefore geological realism of the updated random fields can be preserved. The method is applied to two non-limiting examples where permeability is updated using production data as observations, and is shown to better reproduce complex geology compared to the standard EnKF, while providing reasonable match to the production data. | 08-05-2010 |

20120150506 | Constrained Pressure Residual Preconditioner For Efficient Solution Of The Adjoint Equation - A method, system and computer program product is disclosed for using a constrained pressure residual (CPR) preconditioner to solve adjoint models. A linear system of fluid flow equations comprising a plurality of variables that represent fluid flow properties in a geological formation of a subterranean reservoir is provided. Matrix (Ã) | 06-14-2012 |

20120215511 | SYSTEM AND METHOD FOR MODELING A SUBTERRANEAN RESERVOIR - A computer-implemented reservoir prediction system, method, and software are provided for updating simulation models of a subterranean reservoir. An ensemble of reservoir models representing a subterranean reservoir having non-Gaussian characteristics is provided, along with reservoir data from the subterranean reservoir used to condition the ensemble of reservoir models. For each of the reservoir models in the ensemble of reservoir models, a constrained optimization with equality constraints and inequality constraints are solved using a constrained Kernel Ensemble Kalman Filter to obtain a constrained optimal solution. The constrained optimal solutions are assembled to update the ensemble of reservoir models. The updated ensemble of reservoir models are consistent with the reservoir data provided from the subterranean reservoir and the non-Gaussian characteristics of the subterranean reservoir are preserved. | 08-23-2012 |

20120215512 | System And Method For Uncertainty Quantification In Reservoir Simulation - A computer-implemented reservoir prediction system, method, and software are provided for quantifying uncertainty and evaluating production performance of a subterranean reservoir. A reservoir simulation model representing a subterranean reservoir and an associated distribution of input variables are provided. A plurality of polynomial chaos expansions is generated. Each polynomial chaos expansion is used to approximate a simulation output of the reservoir simulation model for the distribution of input variables. Deterministic coefficients of the polynomial chaos expansions are calculated using a sampling process, such as a quasi-Monte Carlo method using a low discrepancy sequence. An output variable, such as cumulative oil production, and associated output variable uncertainty are forecasted using the polynomial chaos expansions and the deterministic coefficients such that production performance of the subterranean reservoir can be evaluated. | 08-23-2012 |

20130338983 | SYSTEM AND METHOD FOR USE IN SIMULATING A SUBTERRANEAN RESERVOIR - A computer-implemented method, system, and computer program product are disclosed for updating simulation models of a subterranean reservoir. An ensemble of reservoir models representing a subterranean reservoir having non-Gaussian characteristics is provided and the ensemble of reservoir models is updated using a subspace ensemble Kalman filter. Kemal principle component analysis parameterization or K-L expansion parameterization can be used to update the ensemble of reservoir models. | 12-19-2013 |

20140136165 | MODEL SELECTION FROM A LARGE ENSEMBLE OF MODELS - A method, system and processor readable medium containing computer readable software instructions for selecting representative models from a large ensemble of models is disclosed. An ensemble of reservoir models that define an input uncertainty space is provided. A target number of representative models and one or more target percentiles of output variables that the representative models are to approximate are input. The representative models from the ensemble of reservoir models that match the one or more target percentiles of output variables are selected while maximizing the spread between the selected representative models in the input uncertainty space. | 05-15-2014 |