Filters








334 Hits in 2.3 sec

Page 2715 of Mathematical Reviews Vol. , Issue 82f [page]

1982 Mathematical Reviews  
Solidi B 92 (1979), no. 2, K135—K138] has proposed, without proof, an inversion formula which is not based on series expansion. This direct formula is deduced by efficient group-theoretic methods.  ...  This relation is derived from the Kubo formula and is valid for any number of scattering channels with or without time-reversal symmetry.  ... 

Index

1979 Symposium - International astronomical union  
,165,168,196,203-212,213- 225,268ff,277,344 gradient 228ff time series of 214,218ff variation of 166 conduction effects of heat island, model of 14ff convection of heat island, model of 14ff coordinates  ...  , determination of 4ff 43,103373-380 geodetic framework trilateration and 267-274 geodimeter 172 geodynamics 371 gravitational radiation Humidity gradient 329,363 in model atmospheres 166 infrared 11 formulae  ... 
doi:10.1017/s0074180900066262 fatcat:m4uepeejanceliolieg3qoees4

Page 1641 of Mathematical Reviews Vol. , Issue 91C [page]

1991 Mathematical Reviews  
For such extended interpolation formulae we prove uniform convergence theorems.” O T. J.  ...  “The main purpose of this paper is to give a new method for constructing ‘good’ formulae of extended interpolation Lim+n(X, Y ; f); namely, we assume that the elements of the matrix X coincide with the  ... 

Fast computation of 3-D geometric moments using a discrete Gauss' theorem [chapter]

Luren Yang, Fritz Albregtsen, Torfinn Taxt
1995 Lecture Notes in Computer Science  
(8) Then we lter the image v q p (y; z) in the z-direction, and obtain v q0 p (y;z) = N X k=z v q p (y;k) use Green's theorem for fast compuation.  ...  j+1 y q z r 1 A x (7) where (9) This is our formula for 3-D moment computation, obtained from Eq. (2) of the discrete Gauss's theorem. Similar formulas can be derived from Eqs. (3) and (4) .  ...  In step 2 we need ( 1 2 K 2 + 3 2 K + 1)N 2 additions for all the y-directional lterings and ( 1 6 K 3 + K 2 + 11 6 K + 1)N additions for all the z-directional lterings.  ... 
doi:10.1007/3-540-60268-2_359 fatcat:hyhlp5255fav5mghp5fuf4pnqi

On some claims in Ramanujan's `unpublished' manuscript on the partition and tau functions [article]

Pieter Moree
2002 arXiv   pre-print
In it Ramanujan considers congruences for τ(n) modulo some special primes q. He proves for example that τ(n)≡∑_d|nd^11( mod691). He defines t_n=1 if τ(n) is not divisible by q and t_n=0 otherwise.  ...  In this paper it is shown that Ramanujan's claim for every r>1+δ and each of the special primes q is false.  ...  Also the formula for a 1 /A given at p. 237 shows that this factor was in the original formula for h(s).  ... 
arXiv:math/0201265v2 fatcat:ynvxfxkzyzdi5bgdlne2uby5me

Visualizing the Olympic Didactical Situation. (ODS): Teaching Mathematics with support of GeoGebra software

Francisco Regis Vieira Alves, Federal Institute of Science and Technology, Fortaleza, Brazil, fregis@ifce.edu.br
2019 Acta Didactica Napocensia  
On the other hand, it is important to implement didactic resources that allow other forms of didactic transposition to the mathematical knowledge addressed for the Olympic Problems (OP).  ...  In this way, the present work presents and introduces the notion of Olympic Didactical Situation (ODS), from a perspective of didactic transposition necessary for the teacher, who must transmit the mathematical  ...  Finally, we can see that the following explicit formula for the terms 1 ( 1) (3( 1) 1) 2       n nn P , for every positive integer n .  ... 
doi:10.24193/adn.12.2.8 fatcat:obyisfrr6jdmfjgo62nqlb6j7y

An effective rasterization architecture for mobile vector graphics processors

Jinhong Park, Jinwoo Kim, Woo-Chan Park, Youngsik Kim, Chelho Jeong, Tack-Don Han
2011 IEICE Electronics Express  
This paper proposed a novel index board rasterization architecture which reduces mathematical calculations and memory traffic for vector graphics.  ...  In the point of the compuation requirement, the proposed method to generate cells is the same as [4] , whereas there is no calculation for cell sorting in the proposed method.  ...  The memory access formula of [3] was used in order to calculate extenal memory traffic of [2] and [3] .  ... 
doi:10.1587/elex.8.835 fatcat:cnrexwilmbdotjxtbax7kwbdpa

Deductive Databases with Universally Quantified Conditions

Weiling Li, Rajshekhar Sunderraman
2011 Brazilian Symposium on Databases  
Syntax We now introduce the syntax of quantified deductive databases through a series of definitions. Definition 2.1.  ...  In particular, if the predicates in the rule have variables as arguments, then for some values for these variables, if L1, ..., Ln are true when the variables are replaced by their values, then one can  ...  A bottom up compuation of the fixed-point is guaranteed to stop. The Fitting model of the original program can easily be extracted from the fixed-point of the transformed program.  ... 
dblp:conf/sbbd/LiS11 fatcat:ud2tesnbfvekhnxr6lr7f25mga

Fairness as a Program Property [article]

Aws Albarghouthi and Loris D'Antoni and Samuel Drews and Aditya Nori
2016 arXiv   pre-print
We explore the following question: Is a decision-making program fair, for some useful definition of fairness?  ...  Second, we discuss an automated verification technique for proving or disproving fairness of decision-making programs with respect to a probabilistic model of the population.  ...  Leveraging the great developments in satisfiabiltiy modulo theories (SMT) solvers [4] , we developed a procedure that reduces the volume compuation problem to a series of colRank ethnicity yExp Underapproximation  ... 
arXiv:1610.06067v1 fatcat:zgyo2xmzzvgnvgjsi4h72qekaa

Theta lifts for Lorentzian lattices and coefficients of mock theta functions [article]

Jan Hendrik Bruinier, Markus Schwagenscheidt
2020 arXiv   pre-print
In particular, we obtain formulas for their values at special points involving coefficients of mock theta functions.  ...  We evaluate regularized theta lifts for Lorentzian lattices in three different ways.  ...  For k = 0 the Maass Poincaré series is also called a Niebur Poincaré series [32] .  ... 
arXiv:1912.08126v2 fatcat:ngfj3nhybnfqtfgs4jyqinabeq

Invariants and rigidity of projective hypersurfaces [article]

Gabriel Sticlaru
2013 arXiv   pre-print
This paper continues our researches DS1, DS2, DS3 by computing some invariants based on Hilbert-Poincaré series associated to Milnor algebras.  ...  Our computations are for some of the classical surfaces and 3-folds with different configurations of isolated singularities. As a by-product of a recent result of E.  ...  ; print("F(t)=Hilbert Poincare series for any non singular hypersurface "); print(F); print("S(t)=Hilbert Poincare series for singular hypersurface"); print(S); number def1=leadcoef(D); string stau1, sct1  ... 
arXiv:1309.7356v1 fatcat:imrvptdgb5hsppb2iiul2udg3u

The 〈A2〉 asymmetry and longitudinal propagator in lattice SU(2) gluodynamics at T ≃ Tc

V. G. Bornyakov, V. V. Bryzgalov, V. K. Mitrjushkin, R. N. Rogalyov
2018 International Journal of Modern Physics A  
The work was supported by the Russian Foundation for Basic Research, grant no.16-02-01146 A.  ...  Acknowledgments Compuations were performed using IHEP (Protvino) Central Linux Cluster and ITEP (Moscow) Linux Cluster.  ...  In a series of studies [15] [16] [17] it was concluded that, in a large, however finite, volume, D L (0) has a smooth behavior at the criticality: it approaches a maximum value at some temperature T  ... 
doi:10.1142/s0217751x18501518 fatcat:ypcglojusvbsnfv22vv6pm7j2a

Counting the Number of Solutions to Constraints [article]

Jian Zhang, Cunjing Ge, Feifei Ma
2020 arXiv   pre-print
The constraints may take various forms, including, formulas in the propositional logic, linear inequalities over the reals or integers, Boolean combination of linear constraints.  ...  We describe some techniques and tools for solving the counting problems, as well as some applications (e.g., applications to automated reasoning, program analysis, formal verification and information security  ...  For LCs over integers, the SMT(LA) formula is also called an SMT(LIA) formula. Similarly, for LCs over reals, the formula is called an SMT(LRA) formula.  ... 
arXiv:2012.14366v1 fatcat:fzhrfpfkanbvth6kwzrwpxioa4

On computation of basis of p-adic logarithm [article]

Mabud Ali Sarkar, Absos Ali Shaikh
2021 arXiv   pre-print
In this work we have computed the basis of 2-adic logarithm as ℤ_p-module for the 7 quadratic extensions of ℚ_2.  ...  Acknowledgement: The authors are deeply grateful to Professor Jonathan Lubin, Brown University, USA for helpful correspondences and suggestions.  ...  This p-adic logarithmic series converges on the maximal ideal m K . For, we note that Cauchy-Hadamard convergence formula holds in p-adic field as well. Let f (x) = n≥0 a n x n , where a n ∈ K.  ... 
arXiv:1907.06437v4 fatcat:hrmwifl2dfd3jo3lmlvzjdsfb4

Revealing nuclear pions using electron scattering

Gerald A. Miller
2001 Physical Review C  
But the pion effects are large enough to predict substantial nuclear enhancement of the cross section for longitudinally polarized virtual photons for the kinematics accessible at Jefferson Laboratory.  ...  A model for the pionic components of nuclear wave functions is obtained from light front dynamical calculations of binding energies and densities.  ...  The compuations are made using the experimental acceptance [8] .  ... 
doi:10.1103/physrevc.64.022201 fatcat:fzbxgd6pffas5in63pusgujm54
« Previous Showing results 1 — 15 out of 334 results