نتایج جستجو برای: grobner bases

تعداد نتایج: 67104  

Journal: :Computational Intelligence 1995
Haim Schweitzer Janell Straach

Shapes such as triangles or rectangles can be defined in terms of geometric properties invariant under a group of transformations. Complex shapes can be described by logic formulae w i th simpler shapes as the atoms. A standard technique for computing invariant properties of simple shapes is the method of moment invariants, known since the early sixties. We generalize this technique to shapes d...

Journal: :Journal of personality and social psychology 2008
Ya Hui Michelle See Richard E Petty Leandre R Fabrigar

The authors investigated the predictive utility of people's subjective assessments of whether their evaluations are affect- or cognition driven (i.e., meta-cognitive bases) as separate from whether people's attitudes are actually affect- or cognition based (i.e., structural bases). Study 1 demonstrated that meta-bases uniquely predict interest in affective versus cognitive information above and...

2007
Rudolf Albrecht

The problem of computer assisted literature search is often misstated as the attempt to nd, in a repository of electronic literature, a paper which, according to title and keywords, contains the desired information. This assumes that the original author was correct and complete in assigning keywords, and that the search criteria are free of preconceived expectations on the context in which the ...

2004
Thomas Durt

Abstract: Mutually unbiased bases generalize the X, Y and Z qubit bases. They possess numerous applications in quantum cryptography and quantum information. It is well-known that in prime power dimensions N = p (with p prime and m a positive integer) there exists a maximal set of N + 1 mutually unbiased bases. In the present paper, we derive a new, simple and compact expression for those bases,...

Journal: :iranian journal of science and technology (sciences) 2004
b. etemadi

the crystal structure of the compound c20 h24 n2 o24 was determined by direct methods. thecrystals are monoclinic, space group p21/n, and unit cell parameters are: a= 10.2342 (9), b=4.8763 (5),c=19.3578 (11) a, β =98.9632 (10) o ,v=956.6 (5) a3, z=2, dc=1.239grm-3, dm=1.22grm-3. the final rfactorsare converged to r=0.059 and rw=0.056 for 553 independent observed reflections. themolecules are li...

A. Amiri M. Hashemian Zadeh S. Ketabi

The hydration of biomolecules is vitally important in molecular biology, so in this paper thesolvation energy and radial distribution function of DNA bases have been calculated by theMonte Carlo simulation.The geometries of isolated Adenine, Guanine, Cytosine, and Thyminehave been optimized using 6-31+G(d,p) basis function sets. These geometries then will be used inthe Monte Carlo calculation o...

Bateniparvar, O., Noormohammadi, N., Salehi, A. M. ,

In this paper, Equilibrated Singular Basis Functions (EqSBFs) are implemented in the framework of the Finite Element Method (FEM), which can approximately satisfy the harmonic PDE in homogeneous and heterogeneous media. EqSBFs are able to automatically reproduce the terms consistent with the singularity order in the vicinity of the singular point. The newly made bases are used as the compliment...

2008
BRIAN OSSERMAN

The study of ideals in polynomial rings over fields is absolutely central to algebraic geometry. We think of an affine variety (usually called affine algebraic set without an irreducibility hypothesis) in n dimensions as defined to be the common zero set of a collection of polynomials f1(x1, . . . , xn), . . . , fm(x1, . . . , xn) with coefficients in some field k. We see that if a point (c1, ....

Journal: :Computer Aided Geometric Design 1995
Suresh K. Lodha Ron Goldman

The computational complexity of general change of basis algorithms from one bivariate polynomial basis of degree n to another bivariate polynomial basis of degree n using matrix multiplication is O(n 4). Applying blossoming and duality, we derive change of basis algorithms with computational complexity O(n 3) between two important classes of polynomial bases used for representing surfaces in CA...

In this paper, a closed-loop location-inventory problem for spare parts is presented. The proposed supply chain network includes two echelons, namely (1) distribution centers (DCs) and repairing centers (RCs) and (2) operational bases. Multiple spare parts are distributed among operational bases from distribution centers in the forward supply chain and failed spare parts from operational bases ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید