Modular reduction in extended finite fields and polynomial rings is presented, which once implemented works for any random reduction polynomial without changes of the hardware. It is possible to reduce polynomials of whatever degree. Based on the principal defined, two example RTL architectures are designed, and some useful features are noted furthermore. The first architecture is sequential an...

Objective: Adiponectin (an insulin sensitizing protein) and zinc have insulin like effect. This study was conducted to assess the effect of zinc supplementation on serum adiponectin and insulin resistance in first degree relatives of diabetic patients. Materials and Methods: This study was a randomized clinical trial performed on 58 first degree relatives of diabetic patients with normal gluco...

An algorithmic approach to degree reduction of B ezier curves is presented. The algorithm is based on the matrix representations of the degree elevation and degree reduction processes. The control points of the approximation are obtained by the generalized least square method. The computations are carried out by minimizing the L2 and discrete l2 distance between the two curves.

Recursion theory deals with computability on the natural numbers. A function ƒ from N to N is computable (or recursive) if it can be calculated by some program on a Turing machine, or equivalently on any other general purpose computer. A major topic of interest, introduced in Post [23], is the notion of relative difficulty of computation. A function ƒ is computable relative to a function g if a...

Informally, mass problems are similar to decision problems. The difference is that, while a decision problem has only one solution, a mass problem is allowed to have more than one solution. Many concepts which apply to decision problems apply equally well to mass problems. For instance, a mass problem is said to be solvable if it has at least one computable solution. Also, one mass problem is s...

Computability theorists have studied many different reducibilities between sets of natural numbers including one reducibility (≤1), many-one reducibility (≤m), truth table reducibility (≤tt), weak truth table reducibility (≤wtt) and Turing reducibility (≤T ). The motivation for studying reducibilities stronger that Turing reducibility stems from internally motivated questions about varying the ...