| Class / Patent application number | Description | Number of patent applications / Date published |
|---|
| 708446000 | Solving equation | 44 |
| 20080235315 | TECHNIQUE FOR SOLVING NP-HARD PROBLEMS USING POLYNOMIAL SEQUENTIAL TIME AND POLYLOGARITHMIC PARALLEL TIME - A system and technique, called Solution Enumeration technique, for finding efficient algorithms for NP-hard combinatorial problems is presented. The solution space of these problems grows exponentially with the problem size. Some examples in this class are: Hamiltonian Circuit, SAT, Graph Isomorphism, and Perfect Matching problems. The core of this technique is a graph theoretical model of an NP-hard problem, viz., counting the perfect matchings in a bipartite graph. This technique is then applied to develop deterministic algorithms using polynomial sequential time or polylogarithmic parallel time (for massively parallel computers) for the search and counting associated with all NP-complete problems. In the past no polynomial time algorithms for these problems were found, and thus are believed to be intractable. This invention thus makes a theoretical as well as practical contribution to the field of computing, and has practical applications in many diverse areas. | 09-25-2008 |
| 20080263119 | Digital Generation of a Chaotic Numerical Sequence - A method is provided for generating a chaotic sequence. The method includes selecting a plurality of polynomial equations. The method also includes using residue number system (RNS) arithmetic operations to respectively determine solutions for the polynomial equations. The solutions are iteratively computed and expressed as RNS residue values. The method further includes determining a series of digits in a weighted number system (e.g., a binary number system) based on the RNS residue values. According to an aspect of the invention, the method includes using a Chinese Remainder Theorem process to determine a series of digits in the weighted number system based on the RNS residue values. According to another aspect of the invention, the determining step comprises identifying a number in the weighted number system that is defined by the RNS residue values. | 10-23-2008 |
| 20080307027 | System and Method to Compute Narrow Bounds on a Modal Interval Spherical Projection - A computer executable method of processing a representation of a modal interval spherical projection is provided. A representation of a vector comprised of modal intervals X, Y, and Z is provided wherein each modal interval of the modal intervals are delimited by first and second marks of a digital scale. An analytical expression of an azimuthal spherical projection is partitioned into terms of a pair of independent functions wherein a function of the pair exhibits a monotonicity over piecewise domains of the function. A modal interval analysis is performed upon the function wherein arguments of said piecewise domains are modal intervals. | 12-11-2008 |
| 20090172064 | Method for enhancing the computation of CSS and accuracy of computing hardware and to promote the computation speed - This invention proposed a new algorithm. By multiply the proposed weight coefficients of this invention, CSP and CSS can be computed without computing for the mean(s) of the data. After the proposed weight coefficients of this invention undergo factorization, it can promote a new recursive and real time updatable computation method. To test the accuracy of the new invention, the StRD data were separately tested using SAS ver 9.0, SPSS ver 15.0 and EXCEL 2007 for comparison. The results showed that the accuracy of the results of the proposed invention exceeds the level of accuracy of SAS ver 9.0, SPSS ver 15.0 and EXCEL 2007. Aside from an accurate computation, this new invented algorithm can also produce efficient computations. | 07-02-2009 |
| 20090216821 | Singular Value Decomposition Apparatus and Singular Value Decomposition Method - The present invention provides a singular value decomposition apparatus that can perform processing in parallel at high speed and high accuracy. The singular value decomposition apparatus comprises a matrix dividing portion | 08-27-2009 |
| 20090319592 | PARALLEL PROCESSING METHOD OF TRIDIAGONALIZATION OF REAL SYMMETRIC MATRIX FOR SHARED MEMORY SCALAR PARALLEL COMPUTER - When a real symmetric matrix is tridiagonalized using a shared memory scalar parallel computer, the matrix is divided into threads to be updated. In the updating, the data of the lower triangular portion is for the calculation utilizing the symmetry in the matrix. The lower triangular matrix portion is divided into columns, and the resultant pieces are assigned to respective CPUs so that an equal number of elements are assigned to each of the CPUs. Also, the computation is performed simultaneously in the column and row directions once for each loading of the data in order to reduce the number of times data is loaded into memory. The lower triangular matrix portion of the diagonal block matrix portion is divided into one small square matrix and two small triangular matrices recursively so that they are updated. | 12-24-2009 |
| 20090327387 | DIGITAL GENERATION OF AN ACCELERATED OR DECELERATED CHAOTIC NUMERICAL SEQUENCE - A method for generating an accelerated and/or decelerated chaotic sequence. The method involves selecting a plurality of polynomial equations constructed from an acc-dec variable v. The method also involves selecting a value for the acc-dec variable v for advancing or stepping back a chaotic sequence generation by at least one cycle at a given time. The method further involves using residue number system (RNS) arithmetic operations to respectively determine solutions for the polynomial equations using the acc-dec variable v. The solutions iteratively computed and expressed as RNS residue values. The method involves determining a series of digits in a weighted number system based on the RNS residue values. | 12-31-2009 |
| 20100005130 | ITERATED VARIATIONAL REGULARIZATION COMBINED WITH COMPONENTWISE REGULARIZATION - The present invention relates to a solution for solving an ill-posed inverse problem in image analysis, e.g. in an electron tomography application in order to recover a structure of a sample. The solution is provided for instance as a method comprising steps of determining reliable prior knowledge about the solution, determining initial guess for the solution and determining the corresponding forward operator, deciding upon model of stochasticity, deciding on suitable regularization method, deciding on updating scheme, and producing a sequence using the set configuration. | 01-07-2010 |
| 20100106761 | Method, Apparatus, and Computer Program Product for Identifying Techniques for Solving Functions - An apparatus for identifying techniques for solving functions may include a processor. The processor may be configured to identify a function and identify candidate techniques for solving the function. The processor may also be configured to separate a domain of the function into a plurality of domain intervals and determine respective cost indicators for each candidate technique as applied to each domain interval of the function. Further, the processor may be configured to select a technique for each domain interval based on the cost indicators; and provide for configuring an application processor to solve the function via the selected techniques and the respective domain intervals. Associated methods and computer program products may also be provided. | 04-29-2010 |
| 20100106762 | Computer apparatus and calculation method - Transmission overhead that takes a long period of time in calculating processes with an iterative solution technique is to be suppressed. After its own calculation result is calculated with the calculating processes, calculating processes are repeatedly executed without waiting for a determination as to whether the calculation result is significant. After the calculating processes are started and when an indication that the significance can be determined is transmitted because of reception of calculation results from other computer apparatuses via transmission units, or, when a request as to whether the significance can be determined is sent and an indication that the significance can be determined is obtained as a result of the request, the significance of its own calculation result is determined. When it is determined that the calculation result is significant, the calculation processes are suspended. | 04-29-2010 |
| 20100169403 | SYSTEM FOR MATRIX PARTITIONING IN LARGE-SCALE SPARSE MATRIX LINEAR SOLVERS - A system for solving large-scale matrix equations comprises a plurality of field programmable gate arrays (FPGAs), a plurality of memory elements, a plurality of memory element controllers, and a plurality of processing elements. The FPGAs may include a plurality of configurable logic elements and a plurality of configurable storage elements. The memory elements may be accessible by the FPGAs and may store a matrix and a first vector. The memory element controllers may be formed from configurable logic elements and configurable storage elements and may supply at least a portion of a row of the matrix and at least a portion of the first vector. Each processing element may receive at least the row of the matrix and the first vector and solve an iteration for one element of the first vector. | 07-01-2010 |
| 20100223313 | COMPUTATIONAL METHOD OF MATERIAL CONSTANT OF COMPOSITE MATERIAL AND VOLUME FRACTION OF MATERIAL COMPONENT IN COMPOSITE MATERIAL, AND RECORDING MEDIUM - The overall material constant of a composite material is computed where the composite material includes multiple kinds of material components in a matrix phase, each of the material constants of the material components and the matrix phase being known. First, for the composite material, an equation, having the material constant of a virtual composite material as an unknown, is prepared by defining the virtual composite material in which each of the material components is dispersed in a form of spherical particles in the matrix phase at a known volume fractions. Next, the overall material constant of the virtual composite material is found as the overall material constant of the composite material by solving the equation. In this case, the equation is a recursive equation which is obtained using the self-consistent method. The volume fraction of a material component in the composite material is computed using the equation. | 09-02-2010 |
| 20100262643 | COMPUTING MINIMAL POLYNOMIALS - Described is a technology, such as implemented in a computational software program, by which a minimal polynomial is efficiently determined for a radical expression over the ring Z of integer numbers or the ring Q of rational numbers. The levels of the radical are grouped into a level permutation group that is used to find a level permutation set. An annihilation polynomial is found based upon the level permutation set. The annihilation polynomial is factored, and a selection mechanism selects the minimal polynomial based upon the annihilation polynomial's factors. | 10-14-2010 |
| 20100318593 | Method for Using a Graphics Processing Unit for Accelerated Iterative and Direct Solutions to Systems of Linear Equations - Methods for increasing the processing speed of computational electromagnetic methods, such as the Method of Moments (MoM), may involve using efficient mapping of algorithms onto a Graphics Processing Unit (GPU) architecture. Various methods may provide speed/complexity improvements to either or both of: (1) direct solution via Lower-Upper (LU) factorization; and (2) iterative methods (e.g., Generalized Minimal Residual (GMRES) method). | 12-16-2010 |
| 20110010409 | SYSTEM FOR CONJUGATE GRADIENT LINEAR ITERATIVE SOLVERS - A system for a conjugate gradient iterative linear solver that calculates the solution to a matrix equation comprises a plurality of gamma processing elements, a plurality of direction vector processing elements, a plurality of x-vector processing elements, an alpha processing element, and a beta processing element. The gamma processing elements may receive an A-matrix and a direction vector, and may calculate a q-vector and a gamma scalar. The direction vector processing elements may receive a beta scalar and a residual vector, and may calculate the direction vector. The x-vector processing elements may receive an alpha scalar, the direction vector, and the q-vector, and may calculate an x-vector and the residual vector. The alpha processing element may receive the gamma scalar and a delta scalar, and may calculate the alpha scalar. The beta processing element may receive the residual vector, and may calculate the delta scalar and the beta scalar. | 01-13-2011 |
| 20110010410 | SYSTEM FOR CONVERGENCE EVALUATION FOR STATIONARY METHOD ITERATIVE LINEAR SOLVERS - A system for evaluating the convergence to a solution for a matrix equation comprises at least one reconfigurable computing device such as a field programmable gate array (FPGA), an update storage element, a conversion element, a summation unit, and a comparator. The FPGA includes a plurality of configurable logic elements and a plurality of configurable storage elements, which are utilized to form the update storage element, the conversion element, the summation unit, and the comparator. The update storage element is configured to store a plurality of updates. The conversion element determines the absolute value of the updates. The summation unit accumulates the absolute values of the updates to produce a total sum, which is compared to a convergence factor by the comparator. Convergence is signaled when the total sum is less than the convergence factor. | 01-13-2011 |
| 20110047201 | SYSTEMS, METHODS AND APPARATUS FOR FACTORING NUMBERS - Systems, methods and apparatus for factoring numbers are provided. The factoring may be accomplished by creating a factor graph, mapping the factor graph onto an analog processor, initializing the analog processor to an initial state, evolving the analog processor to a final state, and receiving an output from the analog processor, the output comprising a set of factors of the number. The factoring may be accomplished by generating a logic circuit representation of the factoring problem, such as a multiplication circuit, encoding the logic circuit representation as a discrete optimization problem, and solving the discrete optimization problem using a quantum processor. Output(s) of the logic circuit representation may be clamped such that the solving involves effectively executing the logic circuit representation in reverse to determine input(s) that corresponds to the clamped output(s). | 02-24-2011 |
| 20110185002 | DEFINITION OF UNIVERSAL CONSTANTS BY POSITIVE INTEGERS - A method is given to facilitate discovery of the positive integers which may be the numerator and denominator which form the basis of some universal constants. Solutions are given for both π, the ratio of the circumference of a circle to its diameter, and ε, the base of the natural logarithm. A short computer code is provided as a simple tool for finding the two integers if they exist. It is suggested that reduction of these integers to the one or more primary numbers of which they are composed might be a useful tool in the quest to find a link between the separate physical models of the universe. | 07-28-2011 |
| 20110191400 | L1 Projections with Box Constraints - Similarities between simplex projection with upper bounds and L | 08-04-2011 |
| 20110196907 | RECONFIGURABLE NETWORKED PROCESSING ELEMENTS PARTIAL DIFFERENTIAL EQUATIONS SYSTEM - A method for using a system to compute a solution to a partial differential equation (PDE) broadly comprises the steps of determining the true accuracy required (TAR) to solve the PDE, determining an architecture according to the TAR that performs a plurality of calculations to solve the PDE, determining a time allowed (TA) and a time required (TR) based on the architecture to solve the PDE, rejecting the PDE if the TR is less than or equal to the TA, configuring a plurality of programmable devices with the architecture, initiating the calculations, and ceasing the calculations when an accuracy criteria is met or when the TA expires. The system broadly comprises a plurality of programmable devices, a plurality of storage elements, a device bus, a plurality of printed circuit (PC) boards, and a board to board bus. | 08-11-2011 |
| 20110238720 | SOLVING LINEAR MATRICES IN AN INTEGRATED CIRCUIT DEVICE - Circuitry for solving linear matrix equations involving a resultant matrix, an unknown matrix and a product matrix that is a product of the resultant matrix and the unknown matrix includes matrix decomposition circuitry for triangulating an input matrix to create a resultant matrix having a plurality of resultant matrix elements on a diagonal, and having a further plurality of resultant matrix elements arranged in columns below the resultant matrix elements on the diagonal. The matrix decomposition circuitry includes an inverse square root multiplication path that computes diagonal elements of the resultant matrix having an inverse square root module, and the said inverse square root module computes inverses of the diagonal elements to be used in multiplication in place of division by a diagonal element. Latency is hidden by operating on each nth row of a plurality of matrices prior to any (n+1)th row. | 09-29-2011 |
| 20110295920 | Computer-Implemented Symbolic Polynomial Factorization - An input polynomial, in symbolic form, is received, classified, pre-processed, and factored. The input polynomial is classified as a constant, a univariate polynomial, or a multivariate polynomial. Various pre-processing is performed depending on the classification. After the input polynomial is pre-processed, the remaining polynomial is factored using a polynomial factoring algorithm. By pre-processing the input polynomial, the complexity of the polynomial to be factored is reduced, which reduces the computational expense of the polynomial factoring algorithm. | 12-01-2011 |
| 20120078991 | ORDERING GENERATING METHOD AND STORAGE MEDIUM, AND SHARED MEMORY SCALAR PARALLEL COMPUTER - When a Cholesky decomposition or a modified Cholesky decomposition is performed on a sparse symmetric positive definite matrix using a shared memory parallel computer, the discrete space in a problem presented by the linear simultaneous equations expressed by the sparse matrix is recursively sectioned into two sectioned areas and a sectional plane between the areas. The sectioning operation is stopped when the number of nodes configuring the sectional plane reaches the width of a super node. Each time the recursively halving process is performed, a number is sequentially assigned to the node in the sectioned area in order from a farther node from the sectional plane. The node in the sectional plane is numbered after assigning a number to the sectioned area each time the recursively halving process is performed. | 03-29-2012 |
| 20120197955 | METHOD, APPARATUS, AND COMPUTER PROGRAM PRODUCT FOR RESOURCE, TIME, AND COST AWARE VARIABLE-PRECISION SOLVING OF MATHEMATICAL FUNCTIONS - An apparatus for solving a function, such as a mathematical function, may be configured to minimize cost indicators associated with solving the function. Embodiments may be used to compute, in a fast and efficient way, the results of a given mathematical function f(x) and to execute the required operations on the best possible computational elements available within the target platform. Embodiments may exploit a mixture of calculation/evaluation methods that can be implemented on each computational element of the platform in order to approximate the desired function within the desired degree of accuracy and at a low computational cost. Associated methods and computer program products may also be provided. | 08-02-2012 |
| 20120323985 | ALIGNMENT OF MULTIPLE LIQUID CHROMATOGRAPHY-MASS SPECTROMETRY RUNS - The problem of aligning multiple liquid chromatography mass spectrometry (LC-MS) runs to a common reference time frame is solved to facilitate comparison among LC-MS runs. The alignment of multiple LCMS can be achieved by solving a sparse system of linear equations to optimally stretch or compress local retention times for maximal similarity among the multiple runs. The multiple LCMS runs can be aligned simultaneously, thereby providing the advantage of efficient use of data by employing a sparse solver. A method of quality control in retention time alignment is also provided. | 12-20-2012 |
| 20130086137 | Systems and Methods for Improved Parallel ILU Factorization in Distributed Sparse Linear Systems - Systems and methods for parallel incomplete LU (ILU) factorization in distributed sparse linear systems, which order nodes underlying the equations in the system(s) by dividing nodes into interior nodes and boundary nodes and assigning no more than three codes to distinguish the boundary nodes. Each code determines an ordering of the nodes, which in turn determines the order in which the equations will be factored and the solution performed. | 04-04-2013 |
| 20130144923 | Quadratic Innovations for Skewed Distributions in Ensemble Data Assimilation - Methods of computer-implemented data assimilation are presented which permit more accurately finding a posterior distribution and estimating the mean | 06-06-2013 |
| 20130226980 | MULTIPURPOSE CALCULATION COMPUTING DEVICE - A calculation computer includes a calculator-solver receiving a working matrix representation corresponding to a system of equations, as well as residue data, and for providing a solution to the system of equations from residue data, an adapter receiving an initial matrix representation corresponding to a system of equations to be processed, as well as a filtering matrix representation, the working matrix representation forced to meet with the initial matrix representation, the adapter iteratively calculates blockwise an intermediate matrix from the initial matrix representation and from said numerical representation of a filtering matrix representation, the calculator-solver works on this intermediate matrix, blockwise, so as to provide a solution of the system of equations of the initial matrix representation, without completely inverting the latter, | 08-29-2013 |
| 20140025720 | SOLVING LINEAR EQUATION SYSTEMS WITH MULTIPLE RIGHT HAND SIDES BY KRYLOV SUBSPACE EXPANSION - One embodiment sets forth a method for solving linear equation systems that include the same matrix A coupled with multiple right-hand-side vectors. For each new right-hand-side vector, a solver expands an existing Krylov subspace based on the Krylov subspace and data associated with the previous right-hand-side vector. The solver then uses the expanded Krylov subspace to approximately solve the linear equation system for the new right-hand-side vector. By expanding the Krylov subspace for each new right-hand-side vector, the solver continually leverages the information from the preceding right-hand-side vectors. Advantageously, expanding the Krylov subspace is typically computationally quicker than prior art-techniques, such as creating a new Krylov subspace or transforming an existing Krylov subspace. Consequently, by implementing the disclosed techniques, the likelihood of exceeding time constraints associated with algorithms that include solving certain classes of linear equation systems may be decreased. | 01-23-2014 |
| 20140046993 | SYSTEM AND METHOD FOR MULTI-COLOR DILU PRECONDITIONER - A system and method for preconditioning or smoothing (e.g., multi-color DILU preconditioning) for iterative solving of a system of equations. The method includes accessing a matrix comprising a plurality of coefficients of a system of equations and accessing coloring information corresponding to the matrix. The method further includes determining a diagonal matrix based on the matrix and the coloring information corresponding to the matrix. The determining of the diagonal matrix may be determined in parallel on a per color basis. The method may further include determining an updated solution to the system of equations where the updated solution is determined in parallel on a per color basis using the diagonal matrix. | 02-13-2014 |
| 20140067892 | Estimation of Hidden Variance Distribution Parameters - Methods for finding (i) the parameter var(σ | 03-06-2014 |
| 20140258355 | INTERACTION DETECTION FOR GENERALIZED LINEAR MODELS - Provided are techniques for interaction detection for generalized linear models. Basic statistics are calculated for a pair of categorical predictor variables and a target variable from a dataset during a single pass over the dataset. It is determined whether there is a significant interaction effect for the pair of categorical predictor variables on the target variable by: calculating a log-likelihood value for a full generalized linear model without estimating model parameters; calculating the model parameters for a reduced generalized linear model with a recursive marginal mean accumulation technique using the basic statistics; calculating a log-likelihood value for the reduced generalized linear model; calculating a likelihood ratio test statistic using the log-likelihood value for the full generalized linear model and the log-likelihood value for the reduced generalized linear model; calculating a p-value of the likelihood ratio test statistic; and comparing the p-value to a significance level. | 09-11-2014 |
| 20140258356 | COLUMN AND CONSTRAINT GENERATION METHOD FOR OPTIMAL STRATEGIES - Optimization processes, which are parameter driven for solving interdiction problems, for example, power grid interdiction problems, are provided. An algorithm of the subject invention can include column-and-constraint generation and can be used to solve a set of system interdiction, vulnerability analysis, and reliability based design problems, including a power grid vulnerability analysis problem and an edge-interdiction minimum dominating set problem. An algorithm can be provided on a computer-readable medium, a computer, a portable computing device, or other machine. | 09-11-2014 |
| 20140358980 | METHOD OF GENERATING PROVEN PRIME NUMBERS SUITABLE FOR BEING IMPLEMENTED IN A SMART CARD - The invention relates to a method for generating a prime number, implemented in an electronic device, the method including steps of generating a prime number from another prime number using the formula Pr=2P·R+1, where P is a prime number having a number of bits lower than that of the candidate prime number, and R is an integer, and applying the Pocklington primality test to the candidate prime number, the candidate prime number being proven if it passes the Pocklington test. According to the invention, the size in number of bits of the candidate prime number is equal to three times the size of the prime number, to within one unit, the generated candidate prime number being retained as candidate prime number only if the quotient of the integer division of the integer by the prime number is odd. | 12-04-2014 |
| 20150039663 | TRUST-TECH ENHANCED METHODS FOR SOLVING MIXED-INTEGER OPTIMIZATION PROBLEMS - A dynamical method and system generate a global optimal solution to a mixed integer nonlinear programming (MINLP) problem, where a part or all of optimization variables of the MINLP problem are restricted to have discrete values. The method computes a first integer solution to the MINLP problem with a given starting point using an MINLP solver; computes a set of stable equilibrium points (SEPs) of a nonlinear dynamical system associated with a relaxed continuous problem of the MINLP problem, where the SEPs surround the first integer solution and form one or more tiers; identifies from the SEPs a set of new starting points for the MINLP problem; computes integer solutions to the MINLP problem with progressively tightened bounds, starting from the new starting points using the MINLP solver; and generates the global optimal solution based on the integer solutions after one or more iterations. | 02-05-2015 |
| 20150039664 | SOLVING A GATE-SIZING OPTIMIZATION PROBLEM USING A CONSTRAINTS SOLVER - Systems and techniques are described for solving a gate-sizing optimization problem using a constraints solver. Some embodiments can create a constraints problem based on a gate-sizing optimization problem for a portion of a circuit design. Specifically, the constraints problem can comprise a set of upper bound constraints that impose an upper bound on one or more variables that are used in the objective function of the gate-sizing optimization problem. Next, the embodiments can solve the gate-sizing optimization problem by repeatedly solving the constraints problem using a constraints solver. Specifically, prior to each invocation of the constraints solver, the upper bound can be increased or decreased based at least on a result returned by a previous invocation of the constraints solver. | 02-05-2015 |
| 20150293882 | CONJUGATE GRADIENT SOLVERS FOR LINEAR SYSTEMS - A conjugate gradient solver apparatus is provided for generating data defining a solution vector x for a linear system represented by Ax=b where A is a predetermined matrix and b is a predetermined vector. The apparatus includes solver circuitry and a precision controller. The solver circuitry processes input data, defining said matrix A and vector b, in accordance with an iterative conjugate gradient method to generate said data defining the solution vector x. The solver circuitry is adapted to process data items, corresponding to vectors used in said conjugate gradient method, having a variable fixed-point data format. The precision controller determines the fixed-point data formats of respective said data items adaptively during progress of the conjugate gradient method in the solver circuitry. | 10-15-2015 |
| 20150293883 | CALCULATION DEVICE AND CALCULATION METHOD FOR DERIVING SOLUTIONS OF SYSTEM OF LINEAR EQUATIONS AND PROGRAM THAT IS APPLIED TO THE SAME - A calculation device for deriving solutions of a system of linear equations, which realizes a solution of the system of linear equations using an iterative method belonging to a Krylov subspace method, includes a plurality of arithmetic units. In the calculation device, a vector sequence x | 10-15-2015 |
| 20160004663 | NP-PROCESSOR - The invention relates to computer technology and can be used as a processor or a co-processor for solving exponential complexity problems (NP-problems) in time that is a polynomial function of the amount of input data. The main object of the invention is to build artificial intelligence systems based thereon. | 01-07-2016 |
| 20160041946 | PERFORMING A COMPARISON COMPUTATION IN A COMPUTER SYSTEM - A method and computer system are provided for performing a comparison computation, e.g. for use in a check procedure for a reciprocal square root operation. The comparison computation compares a multiplication of three values with a predetermined value. The computer system performs the multiplication using multiplier logic which is configured to perform multiply operations in which two values are multiplied together. A first and second of the three values are multiplied to determine a first intermediate result, w | 02-11-2016 |
| 20160077806 | METHOD TO SECURELY EXECUTE A MODULAR EXPONENTIATION - The present invention relates to a method to execute a modular exponentiation R=X | 03-17-2016 |
| 20160140082 | METHOD FOR COMPUTING SELF-CONTAMINATION PROCESSES OF A SPACECRAFT - A method for computing self-contamination processes of a spacecraft by means of a data processing device comprising the following steps: receiving a first set of input parameters comprising general definitions of the spacecraft, receiving a second set of input parameters comprising control parameters for the spacecraft orbital data, physics, numeric, and a predetermined accuracy requirement of the computation, computing a self-contamination process of the spacecraft based on the received first and second sets of input data by either evaluating the analytical solution of a basic equation of emission or numerically solving the basic equation of emission for calculating a deposit of molecules outgassed from surfaces of the spacecraft with a numerical solver with the data processing device, wherein the numerical solver applies an adaptive stepsize control based on the preset accuracy requirement of the computation, and outputting the calculated deposit. | 05-19-2016 |
| 20160147712 | DYNAMICAL METHODS FOR SOLVING MIXED-INTEGER OPTIMIZATION PROBLEMS - A dynamical method and system generate a global optimal solution to a mixed integer nonlinear programming (MINLP) problem, where a part or all of optimization variables of the MINLP problem are restricted to have discrete values. Relaxed continuous problems of the MINLP problem are generated. For each relaxed continuous problem that has an integer solution with an objective value superior to a current bound, the method updates the current bound with the objective value, computes a set of stable equilibrium points (SEPs) around the integer solution in a nonlinear dynamical system associated with the relaxed continuous problem, identifies from the SEPs a set of starting points for the MINLP problem, and computes a set of integer solutions to the MINLP problem with progressively tightened bounds from the starting points using an MINLP solver. The global optimal solution is generated based on the integer solutions. | 05-26-2016 |
| 20160170937 | CALCULATION DEVICE, CALCULATION METHOD, AND PROGRAM | 06-16-2016 |
