Home
last modified time | relevance | path

Searched refs:quasi (Results 1 – 25 of 3484) sorted by relevance

12345678910>>...140

/dports/lang/mosh/mosh-0.2.7/boot/runtimes/srfi-mosh/lib.rnrs/core/
H A Dquasiquote.ss15 (define (quasi p lev)
20 (quasicons (syntax ("quote" unquote)) (quasi (syntax (p)) (- lev 1)))))
26 (quasilist* (syntax (("value" p) ...)) (quasi (syntax q) lev))
28 (quasicons (syntax ("quote" unquote)) (quasi (syntax (p ...)) (- lev 1)))
29 (quasi (syntax q) lev))))
32 (quasiappend (syntax (("value" p) ...)) (quasi (syntax q) lev))
35 (quasi (syntax q) lev))))
36 (_ (quasicons (quasi (syntax p) lev) (quasi (syntax q) lev)))))
55 (quasi (syntax (p ...)) (- lev 1)))
57 (_ (quasicons (quasi (syntax p) lev) (vquasi (syntax q) lev)))))
[all …]
/dports/math/gsl/gsl-2.7/doc/
H A Dqrng.rst2 single: quasi-random sequences
13 This chapter describes functions for generating quasi-random sequences
14 in arbitrary dimensions. A quasi-random sequence progressively covers a
17 sequences. The quasi-random sequence generators use an interface that
29 This is a workspace for computing quasi-random sequences.
47 Note that quasi-random sequences do not use a seed and always produce
50 Sampling from a quasi-random number generator
60 Auxiliary quasi-random number generator functions
79 Saving and restoring quasi-random number generator state
96 The following quasi-random sequence algorithms are available,
[all …]
/dports/math/R-cran-geepack/geepack/R/
H A Dqic.R81 quasi <- switch(type, functionVar
103 QIC <- -2*(quasi - trace)
104 QICu <- -2*(quasi - params)
106 output <- c(QIC, QICu, quasi, trace, params, QICC)
167 quasi <- switch(type, functionVar
189 QIC <- -2*(quasi - trace)
190 QICu <- -2*(quasi - params)
192 output <- c(QIC, QICu, quasi, trace, params, QICC)
/dports/math/R-cran-VGAM/VGAM/man/
H A Dqvar.Rd11 returns either the quasi-variances or quasi-standard errors.
30 Logical. If \code{FALSE} then the quasi-variances are returned,
31 else the square root of them, called quasi-standard errors.
45 computing the quasi-variances
48 Serious users of quasi-variances ought to understand why and how this
54 A vector of quasi-variances or quasi-standard errors.
/dports/math/scilab/scilab-6.1.1/scilab/modules/string/tests/nonreg_tests/
H A Dbug_3810.dia.ref25 //check for quasi linear evolution of T(n)
33 //check for quasi linear evolution of T(n)
41 //check for quasi linear evolution of T(n)
50 //check for quasi linear evolution of T(n)
58 //check for quasi linear evolution of T(n)
66 //check for quasi linear evolution of T(n)
H A Dbug_3810.tst25 //check for quasi linear evolution of T(n)
34 //check for quasi linear evolution of T(n)
43 //check for quasi linear evolution of T(n)
53 //check for quasi linear evolution of T(n)
62 //check for quasi linear evolution of T(n)
71 //check for quasi linear evolution of T(n)
/dports/math/scilab/scilab-6.1.1/scilab/modules/polynomials/tests/nonreg_tests/
H A Dbug_3810.dia.ref25 //check for quasi linear evolution of T(n)
33 //check for quasi linear evolution of T(n)
41 //check for quasi linear evolution of T(n)
50 //check for quasi linear evolution of T(n)
58 //check for quasi linear evolution of T(n)
66 //check for quasi linear evolution of T(n)
H A Dbug_3810.tst25 //check for quasi linear evolution of T(n)
34 //check for quasi linear evolution of T(n)
43 //check for quasi linear evolution of T(n)
53 //check for quasi linear evolution of T(n)
62 //check for quasi linear evolution of T(n)
71 //check for quasi linear evolution of T(n)
/dports/math/alberta/alberta3-920315ae1bbfd1b1fb6672d916619ac37a411e95/demo/src/2d/
H A DMakefile.in10 stokes quasi-stokes quasi-stokes-slip \
126 QUASI_STOKES_OFILES = quasi-stokes.o libdemo.a
136 quasi-stokes: $(QUASI_STOKES_OFILES) $(ALBERTA_INCLUDE_PATH)/alberta.h
151 QUASI_STOKES_SLIP_OFILES = quasi-stokes-slip.o libdemo.a
153 quasi-stokes-slip: $(QUASI_STOKES_SLIP_OFILES) $(ALBERTA_INCLUDE_PATH)/alberta.h
/dports/math/alberta/alberta3-920315ae1bbfd1b1fb6672d916619ac37a411e95/demo/src/3d/
H A DMakefile.in10 stokes quasi-stokes quasi-stokes-slip \
140 QUASI_STOKES_OFILES = quasi-stokes.o libdemo.a
142 quasi-stokes: $(QUASI_STOKES_OFILES) $(ALBERTA_INCLUDE_PATH)/alberta.h
157 QUASI_STOKES_SLIP_OFILES = quasi-stokes-slip.o libdemo.a
159 quasi-stokes-slip: $(QUASI_STOKES_SLIP_OFILES) $(ALBERTA_INCLUDE_PATH)/alberta.h
/dports/biology/migrate/migrate-3.6.11/src/
H A Drandom.c223 double e, quasi[100]; variable
251 int inhalt(int dimen, int atmost, double tiny, double *quasi);
266 gohalt(quasi,dq,wq); in get_halton()
270 int inhalt(int dimen, int atmost, double tiny, double *quasi) in inhalt() argument
295 quasi[i]=iprime[i]; in inhalt()
299 printf("largest prime=%d, %f \n",prime[s-1], quasi[1]); in inhalt()
306 int gohalt(double *quasi, double *dq, double *wq) in gohalt() argument
319 f=1.0-quasi[i]; in gohalt()
328 quasi[i]=g+h-f; in gohalt()
361 dq[i] += quasi[i]; in gohalt()
[all …]
/dports/math/latte-integrale/latte-version_1_7_6/code/maple/
H A DREADME9 Ehrhart quasi-polynomials, using the algorithm of this paper:
13 coefficients of weighted Ehrhart quasi-polynomials of rational
21 quasi-polynomial defined in the paper:
30 Ehrhart quasi-polynomials of knapsack polytopes, using the algorithm
54 intermediate Ehrhart quasi-polynomials, using the algorithms in:
62 patched generating function and quasi-polynomial for a simplex,
/dports/math/R-cran-robustbase/robustbase/man/
H A Danova.glmrob.Rd5 Compute an analysis of robust quasi-deviance table for one or more
20 quasi-deviance table for that fit. That is, the reductions in the
21 robust residual quasi-deviance as each term of the formula is added in
26 residual quasi-degrees of freedom (However, this information is never used in
28 change in degrees of freedom and robust quasi-deviance is also
34 comparing the reduction in robust quasi-deviance for the model on the
41 additional test methods. One is the robust quasi-deviance test
45 quadratic approximation of the robust quasi-deviance test
/dports/math/pari/pari-2.13.3/src/functions/elliptic_curves/
H A Delleta5 Help: elleta(w): w=[w1,w2], returns the vector [eta1,eta2] of quasi-periods
7 Doc: returns the quasi-periods $[\eta_1,\eta_2]$
10 \kbd{ellinit}, in which case, the quasi periods attached to the period
/dports/lang/swi-pl/swipl-8.2.3/packages/http/
H A Dhtml_quasiquotations.pl42 /** <module> HTML quasi quotations
44 This module implements quasi quotations for HTML. Together with
51 @see library(http/js_write) provides quasi quotation for JavaScript.
56 % The predicate html/4 implements HTML quasi quotations. These
59 % quasi quoter only accepts valid, but possibly partial HTML
/dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/ghc-exactprint-0.6.4/tests/examples/ghc710/
H A DTemplateHaskell.hs12 bar = [e| quasi |]
14 bar = [| quasi |]
16 baz = [quoter| quasi |]
/dports/devel/tcllib/tcllib-1.20/modules/math/
H A Dquasirandom.tcllib.man3 [keywords {quasi-random}]
24 much faster, when such quasi-random numbers are well-chosen.
28 quasi-random points in 1, 2 or more dimensions. The command can either generate
38 A quasi-random point generator is created using the [term qrpoint] class:
68 Return the coordinates of the next quasi-random point
72 Reset the index for the next quasi-random point. This is useful to control which list of points is …
89 map the quasi-random coordinates to the desired hyper-block.
115 Various algorithms exist for generating quasi-random numbers. The generators created in this packag…
/dports/devel/tcllibc/tcllib-1.20/modules/math/
H A Dquasirandom.tcllib.man3 [keywords {quasi-random}]
24 much faster, when such quasi-random numbers are well-chosen.
28 quasi-random points in 1, 2 or more dimensions. The command can either generate
38 A quasi-random point generator is created using the [term qrpoint] class:
68 Return the coordinates of the next quasi-random point
72 Reset the index for the next quasi-random point. This is useful to control which list of points is …
89 map the quasi-random coordinates to the desired hyper-block.
115 Various algorithms exist for generating quasi-random numbers. The generators created in this packag…
/dports/devel/tcllib/tcllib-1.20/embedded/md/tcllib/files/modules/math/
H A Dquasirandom.md59 to the limit can be much faster, when such quasi\-random numbers are well\-chosen\.
62 creates a command to generate quasi\-random points in 1, 2 or more dimensions\.
73 A quasi\-random point generator is created using the *qrpoint* class:
106 Return the coordinates of the next quasi\-random point
110 Reset the index for the next quasi\-random point\. This is useful to control
132 map the quasi\-random coordinates to the desired hyper\-block\.
156 Various algorithms exist for generating quasi\-random numbers\. The generators
163 [quasi\-random](\.\./\.\./\.\./\.\./index\.md\#quasi\_random)
/dports/devel/tcllibc/tcllib-1.20/embedded/md/tcllib/files/modules/math/
H A Dquasirandom.md59 to the limit can be much faster, when such quasi\-random numbers are well\-chosen\.
62 creates a command to generate quasi\-random points in 1, 2 or more dimensions\.
73 A quasi\-random point generator is created using the *qrpoint* class:
106 Return the coordinates of the next quasi\-random point
110 Reset the index for the next quasi\-random point\. This is useful to control
132 map the quasi\-random coordinates to the desired hyper\-block\.
156 Various algorithms exist for generating quasi\-random numbers\. The generators
163 [quasi\-random](\.\./\.\./\.\./\.\./index\.md\#quasi\_random)
/dports/science/lammps/lammps-stable_29Sep2021/doc/src/
H A Dfix_pimd.rst53 integral simulation is represented by a ring-polymer of P quasi-beads,
54 labeled from 1 to P. During the simulation, each quasi-bead interacts
57 quasi-beads also interact with the two neighboring quasi-beads through
62 degree of freedom for each quasi-bead. The keyword *temp* sets the
117 quasi-particle system is stored and simulated on a separate partition
120 has 4 quasi-beads (imaginary time slices), there are 4 replicas of the
122 replica (shown in green) owns one quasi-bead in each ring.
127 To run a PIMD simulation with M quasi-beads in each ring polymer using
142 where M is the number of quasi-beads (partitions) used in the
161 quasi-beads in a ring polymer will have identical positions and
[all …]
/dports/biology/cufflinks/cufflinks-2.2.1-89-gdc3b0cb/src/locfit/
H A Dlfstr.c37 { INT quasi, robu, f; local
38 quasi = robu = 0;
40 { quasi |= (z[0]=='q');
50 if (quasi) f += 64;
/dports/math/py-chaospy/chaospy-4.3.3/chaospy/distributions/sampler/sequences/
H A Dsobol.py126 quasi = numpy.empty((dim, order))
129 quasi[:, idx] = lastq * recipd
132 return quasi
/dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/doc/
H A Dquadratic_number_power_product.tex331 \SSTITLE{Operations on quasi-units, i.e., numbers of $\bbfQ^* \cdot \Or^*$}
343 \bbfQ^*$, assuming that $u$ is a quasi unit of its order $\Or$. Calls
344 \code{$u$.compact_representation($\Or$)}. If $u$ is not a quasi unit, the result is
352 $u$ is not a quasi-unit of its order, the result is undefined.
380 generated by the embeddings of the quasi-units in $q$.
390 embeddings of the quasi-units $q_0,\dots,q_n-1$.
397 determine the generating quasi-unit $u$.
429 \SSTITLE{Tests for units and quasi units}
435 be applied for quasi units and vice versa. This is because a unit is a quasi unit too and if $v
436 = q u$ is a quasi unit, $q \in \bbfQ^*$, $u\in \Or^*$, then $v / \sigma(v) = u / \sigma(u) =
[all …]
/dports/math/alberta/alberta3-920315ae1bbfd1b1fb6672d916619ac37a411e95/add_ons/static_condensation/demo/3d/
H A DMakefile.am11 $(srcdir)/INIT/mini-quasi-stokes.dat $(srcdir)/Macro/macro.amc
44 noinst_PROGRAMS = mini-stokes mini-quasi-stokes
46 noinst_PROGRAMS += mini-stokes-debug mini-quasi-stokes-debug
104 mini_quasi_stokes_SOURCES = $(COMMON)/mini-quasi-stokes.c
124 mini_quasi_stokes_debug_SOURCES = $(COMMON)/mini-quasi-stokes.c

12345678910>>...140