نتایج جستجو برای: weak multiplication module
تعداد نتایج: 231304 فیلتر نتایج به سال:
We introduce a spanning set of BLM type, {A(j, r)}A,j, for affine quantum Schur algebras S△(n, r) and construct a linearly independent set {A(j)}A,j for an associated algebra K̂△(n). We then establish explicitly some multiplication formulas of simple generators E △ h,h+1(0) by an arbitrary element A(j) in K̂△(n) via the corresponding formulas in S△(n, r), and compare these formulas with the multi...
Machine learning [1] is concerned with the design and development of algorithms that allow computers to evolve intelligent behaviors based on empirical data. Weak learner is a learning algorithm with accuracy less than 50%. Adaptive Boosting (Ada-Boost) is a machine learning algorithm may be used to increase accuracy for any weak learning algorithm. This can be achieved by running it on a given...
for the first time nakayama introduced qf-ring. in 1967 carl. faith and elbert a. walker showed that r is qf-ring if and only if each injective right r-module is projective if and only if each injective left r-modules is projective. in 1987 s.k.jain and s.r.lopez-permouth proved that every ring homomorphic images of r has the property that each cyclic s-module is essentialy embeddable in dire...
As computing and communication devices are equipped with increasingly versatile wireless connection capabilities, the demand for security increases. Cryptography provides a method for securing and authenticating the transmission of information over the insecure channels. Elliptic Curve [EC] Cryptography is a public key cryptography which replaces RSA because of its increased security with lesse...
The finite field modular multiplier is the most critical component in the elliptic curve crypto processor (ECCP) consuming the maximum chip area and contributing the most to the device latency. Modular multiplication, point multiplication, point doubling are few of the critical activities to be carried out by multiplier in ECC algorithm, and should be managed without compromising on security an...
Let V be a finite dimensional complex linear space and let G be an irreducible finite subgroup of GL(V ). For a G-invariant lattice Λ in V of maximal rank, we give a description of structure of the complex torus V/Λ. In particular, we prove that for a wide class of groups, V/Λ is isogenous to a self-product of an elliptic curve, and that in many cases V/Λ is isomorphic to a product of mutually ...
Let V be a finite dimensional complex linear space and let G be an irreducible finite subgroup of GL(V). For a G-invariant lattice Λ in V of maximal rank, we give a description of structure of the complex torus V /Λ. In particular, we prove that for a wide class of groups, V /Λ is isogenous to a self-product of an elliptic curve, and that in many cases V /Λ is isomorphic to a product of mutuall...
We recall that a pseudo complex structure on a C∞-manifold X of dimension 2N is a C-module structure on the tangent bundle TX . Such a module structure induces an action of the group C∗ on TX , with λ ∈ C∗ acting by multiplication by λ. By transport of structures, the group C∗ acts also on each exterior power ∧TX , as well as on the complexified dual Ω := Hom(∧TX ,C). For p+ q = n, a (p, q)-for...
Image filtering is one of the very useful techniques in image processing and computer vision. It is used to eliminate useless details and noise from an image. In this paper, a hardware implementation of image filtered using 2D Gaussian Filter will be present. The Gaussian filter architecture will be described using a different way to implement convolution module. Thus, multiplication is in the ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید