/dports/textproc/groff/groff-1.22.4/src/preproc/eqn/ |
H A D | eqn.am | 42 src/preproc/eqn/eqn.ypp \ 43 src/preproc/eqn/box.h \ 44 src/preproc/eqn/pbox.h \ 45 src/preproc/eqn/eqn.h 47 PREFIXMAN1 += src/preproc/eqn/eqn.1 src/preproc/eqn/neqn.1 49 src/preproc/eqn/TODO \ 51 src/preproc/eqn/eqn.1.man \ 54 src/preproc/eqn/eqn-lex.$(OBJEXT): src/preproc/eqn/eqn.hpp 56 src/preproc/eqn/eqn.hpp \ 57 src/preproc/eqn/eqn.cpp \ [all …]
|
/dports/print/rtf2latex2e/rtf2latex2e-2-2-2/src/ |
H A D | eqn.c | 1475 eqn->indent[strlen(eqn->indent) - 2] = 0; in Eqn_TranslateRULER() 1516 eqn->indent[strlen(eqn->indent) - 2] = 0; in Eqn_TranslateLINE() 1710 eqn->indent[strlen(eqn->indent) - 2] = 0; in Eqn_TranslateCHAR() 1939 eqn->indent[strlen(eqn->indent) - 2] = 0; in Eqn_TranslateMATRIX() 2075 eqn->indent[strlen(eqn->indent) - 2] = 0; in Eqn_TranslateEQNARRAY() 2160 eqn->indent[strlen(eqn->indent) - 2] = 0; in Eqn_TranslateTABULAR() 2269 eqn->indent[strlen(eqn->indent) - 2] = 0; in Eqn_TranslatePILEtoTARGET() 2300 eqn->indent[strlen(eqn->indent) - 2] = 0; in Eqn_TranslateSIZE() 2324 eqn->indent[strlen(eqn->indent) - 2] = 0; in Eqn_TranslateFONT() 2474 eqn->indent[strlen(eqn->indent) - 2] = 0; in Eqn_TranslateTMPL() [all …]
|
/dports/math/eprover/eprover-E-2.0/CLAUSES/ |
H A D | ccl_eqn.h | 139 #define EqnGCMarkTerms(eqn) TBGCMarkTerm((eqn)->bank,(eqn)->lterm);\ argument 140 TBGCMarkTerm((eqn)->bank,(eqn)->rterm) 142 #define EqnSetProp(eqn, prop) SetProp((eqn), (prop)) argument 143 #define EqnDelProp(eqn, prop) DelProp((eqn), (prop)) argument 144 #define EqnFlipProp(eqn, prop) FlipProp((eqn), (prop)) argument 147 #define EqnQueryProp(eqn, prop) QueryProp((eqn), (prop)) argument 150 #define EqnIsAnyPropSet(eqn, prop) IsAnyPropSet((eqn), (prop)) argument 205 EqnTermsTBTermEncode((eqn)->bank, (eqn)->lterm,\ 206 (eqn)->rterm, EqnIsPositive(eqn), (dir)) 286 SigGetSpecialWeight(eqn->bank->sig, eqn->lterm->f_code):\ [all …]
|
/dports/science/R-cran-bayesm/bayesm/man/ |
H A D | rbayesBLP.Rd | 78 \eqn{\theta_i} \eqn{\sim}{~} \eqn{N(\theta_bar, \Sigma)}\cr 79 \eqn{\eta_jt} \eqn{\sim}{~} \eqn{N(0, \tau_sq)}\cr 85 \eqn{r} \eqn{\sim}{~} \eqn{N(0, diag(sigmasqR))}\cr 86 \eqn{\theta_bar} \eqn{\sim}{~} \eqn{N(\theta_hat, A^-1)}\cr 87 \eqn{\tau_sq} \eqn{\sim}{~} \eqn{nu0*s0_sq / \chi^2 (nu0)}\cr 97 \eqn{\theta_i} \eqn{\sim}{~} \eqn{N(\theta_bar, \Sigma)}\cr 103 \eqn{r} \eqn{\sim}{~} \eqn{N(0, diag(sigmasqR))}\cr 104 \eqn{\theta_bar} \eqn{\sim}{~} \eqn{N(\theta_hat, A^-1)}\cr 105 \eqn{\delta} \eqn{\sim}{~} \eqn{N(deltabar, Ad^-1)}\cr 106 \eqn{\Omega} \eqn{\sim}{~} \eqn{IW(nu0, VOmega)}\cr [all …]
|
H A D | rhierLinearModel.Rd | 25 \code{nreg} regression equations with \eqn{nvar} \eqn{X} variables in each equation \cr 26 \eqn{y_i = X_i\beta_i + e_i} with \eqn{e_i} \eqn{\sim}{~} \eqn{N(0, \tau_i)} 28 …\eqn{\tau_i} \eqn{\sim}{~} nu.e*\eqn{ssq_i/\chi^2_{nu.e}} where \eqn{\tau_i} is the variance of \e… 29 \eqn{\beta_i} \eqn{\sim}{~} N(Z\eqn{\Delta}[i,], \eqn{V_{\beta}}) \cr 30 …Note: Z\eqn{\Delta} is the matrix \eqn{Z * \Delta} and [i,] refers to \eqn{i}th row of this produ… 32 …\eqn{vec(\Delta)} given \eqn{V_{\beta}} \eqn{\sim}{~} \eqn{N(vec(Deltabar), V_{\beta}(x) A^{-1})}\… 33 \eqn{V_{\beta}} \eqn{\sim}{~} \eqn{IW(nu,V)} \cr 34 …\eqn{Delta, Deltabar} are \eqn{nz x nvar}; \eqn{A} is \eqn{nz x nz}; \eqn{V_{\beta}} is \eqn{nvar … 36 Note: if you don't have any \eqn{Z} variables, omit \eqn{Z} in the \code{Data} argument and 37 a vector of ones will be inserted; the matrix \eqn{\Delta} will be \eqn{1 x nvar} and should [all …]
|
H A D | rivDP.Rd | 29 …\eqn{e1,e2} \eqn{\sim}{~} \eqn{N(\theta_{i})} where \eqn{\theta_{i}} represents \eqn{\mu_{i}, \Sig… 32 DO NOT include intercepts in the \eqn{z} or \eqn{w} matrices. 35 \eqn{\delta} \eqn{\sim}{~} \eqn{N(md, Ad^{-1})} \cr 36 \eqn{vec(\beta, \gamma)} \eqn{\sim}{~} \eqn{N(mbg, Abg^{-1})} \cr 37 \eqn{\theta_{i}} \eqn{\sim}{~} \eqn{G} \cr 38 \eqn{G} \eqn{\sim}{~} \eqn{DP(alpha, G_0)} 40 \eqn{alpha} \eqn{\sim}{~} \eqn{(1-(alpha-alpha_{min})/(alpha_{max}-alpha{min}))^{power}} \cr 45 …\eqn{\Sigma} \eqn{\sim}{~} \eqn{IW(nu, vI)} and \eqn{\mu|\Sigma} \eqn{\sim}{~} \eqn{N(0, \Sigma(x… 50 \eqn{a} \eqn{\sim}{~} uniform[alim[1], alimb[2]]\cr 51 \eqn{nu} \eqn{\sim}{~} dim(data)-1 + exp(z) \cr [all …]
|
H A D | rscaleUsage.Rd | 25 \eqn{n} = \code{nrow(x)} individuals respond to \eqn{p} = \code{ncol(x)} questions; 26 all questions are on a scale \eqn{1, \ldots, k} for respondent \eqn{i} and question \eqn{j}, \cr 28 …\eqn{x_{ij} = d} if \eqn{c_{d-1} \le y_{ij} \le c_d} where \eqn{d = 1, \ldots, k} and \eqn{c_d = a… 30 \eqn{y_i = mu + tau_i*iota + sigma_i*z_i} with \eqn{z_i} \eqn{\sim}{~} \eqn{N(0, Sigma)} 32 \eqn{(tau_i, ln(sigma_i))} \eqn{\sim}{~} \eqn{N(\phi, Lamda)}\cr 33 \eqn{\phi = (0, lambda_{22})} \cr 34 \eqn{mu} \eqn{\sim}{~} \eqn{N(mubar, Am^{-1})}\cr 35 \eqn{Sigma} \eqn{\sim}{~} \eqn{IW(nu, V)} \cr 36 \eqn{Lambda} \eqn{\sim}{~} \eqn{IW(Lambdanu, LambdaV)} \cr 37 \eqn{e} \eqn{\sim}{~} unif on a grid [all …]
|
H A D | llmnp.Rd | 24 …\eqn{X} is \eqn{(p-1)*n x k} matrix. Use \code{\link{createX}} with \code{DIFF=TRUE} to create \e… 26 Model for each obs: \eqn{w = Xbeta + e} with \eqn{e} \eqn{\sim}{~} \eqn{N(0,Sigma)}. 29 if \eqn{y=j (j<p), w_j > max(w_{-j})} and \eqn{w_j >0} \cr 30 if \eqn{y=p, w < 0} \cr 33 e.g. if \eqn{y=1, w_1 > 0} and \eqn{w_1 - w_{-1} > 0}. 35 …eqn{A_j} such that if \eqn{j=1,\ldots,p-1} then \eqn{A_jw = A_jmu + A_je > 0} is equivalent to \eq…
|
/dports/textproc/heirloom-doctools/heirloom-doctools-160308/test/eqn/ |
H A D | makefile | 4 mv eqn.more eqn.more.orig 5 make eqn.more 6 diff eqn.more eqn.more.orig 7 rm eqn.more 8 mv eqn.more.orig eqn.more 9 mv eqn.ps eqn.ps.orig 10 make eqn.ps 11 sed '/CreationDate/d' eqn.ps > eqn.ps.sed 12 diff eqn.ps.sed eqn.ps.orig 13 rm eqn.ps eqn.ps.sed [all …]
|
/dports/math/R-cran-sets/sets/man/ |
H A D | fuzzy.Rd | 36 for a t-norm \eqn{T}, let \eqn{S(x, y) = 1 - T(1 - x, 1 - y)} be the 47 \eqn{T(x, y) = y} if \eqn{x = 1}, \eqn{x} if \eqn{y = 1}, and 0 49 \eqn{x = 0}, \eqn{x} if \eqn{y = 0}, and 1 otherwise. Note that 60 \eqn{S(x, y) = \max(x, y)} if \eqn{x + y < 1}, and 1 otherwise.} 72 where \eqn{\alpha \ge 0} and \eqn{\beta, \gamma \ge -1}. This 89 \eqn{p = -\infty}{p = -Inf}, \eqn{0}, and \eqn{\infty}{Inf}, 92 \item{\code{"Yager"}}{the Yager family \eqn{T_p}, \eqn{p \ge 0}, 96 \item{\code{"Dombi"}}{the Dombi family \eqn{T_p}, \eqn{p \ge 0}, 99 \eqn{T_p(x, y) = 0} if \eqn{x = 0} or \eqn{y = 0}, and 101 both \eqn{x > 0} and \eqn{y > 0}.} [all …]
|
/dports/math/jacop/jacop-4.8.0/src/main/java/org/jacop/constraints/netflow/ |
H A D | Arithmetic.java | 98 int[] eqn = new int[max]; in addEquation() local 101 eqn[id] = coeffs[i]; in addEquation() 103 eqn[0] = constant; in addEquation() 104 eqns.add(eqn); in addEquation() 184 for (int[] eqn : eqns) { in optimize() 191 flip(eqn); in optimize() 215 eqn[i] = -eqn[i]; in flip() 229 eqns[i] = Arrays.copyOf(eqn, eqn.length); in ArithmeticBuilder() 255 if (eqn[var] > 0 && eqn[var] <= -eqn2[var]) { in ArithmeticBuilder() 259 if (eqn[var] < 0 && -eqn[var] <= eqn2[var]) { in ArithmeticBuilder() [all …]
|
/dports/math/maxima/maxima-5.43.2/share/contrib/diffequations/tests/ |
H A D | rtestode_murphy_2_2.mac | 61 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2]),ode_check(eqn,ans[3])]; 104 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2]),ode_check(eqn,ans[3])]; 110 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2]),ode_check(eqn,ans[3])]; 116 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2]),ode_check(eqn,ans[3])]; 128 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2]),ode_check(eqn,ans[3])]; 218 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2]),ode_check(eqn,ans[3])]; 224 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2]),ode_check(eqn,ans[3])]; 239 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2]),ode_check(eqn,ans[3])]; 430 [method,ode_check(eqn,ans[1]),ode_check(eqn,%[1]),ode_check(eqn,%[2])]; 485 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2]),ode_check(eqn,ans[3]),ode_check(eqn,ans[4])]; [all …]
|
H A D | rtestode_kamke_1_3.mac | 25 [method,ode_check(eqn,ans[1])]; 57 [method,ode_check(eqn,ans[1])]; 63 [method,ode_check(eqn,ans[1])]; 69 [method,ode_check(eqn,ans[1])]; 75 [method,ode_check(eqn,ans[1])]; 91 [method,ode_check(eqn,ans[1])]; 96 [method,ode_check(eqn,ans[1])]; 104 [method,ode_check(eqn,ans[1])]; 112 [method,ode_check(eqn,ans[1])]; 377 [method,ode_check(eqn,%)]; [all …]
|
H A D | rtestode_murphy_1_1.mac | 22 [method,ode_check(eqn,ans[1])]; 28 [method,ode_check(eqn,ans[1])]; 36 [method,ode_check(eqn,ans)]; 42 [method,ode_check(eqn,ans[1])]; 48 [method,ode_check(eqn,ans[1])]; 54 [method,ode_check(eqn,ans[1])]; 105 [method,ode_check(eqn,ans)]; 143 [method,ode_check(eqn,ans)]; 287 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2])]; 313 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2])]; [all …]
|
H A D | rtestode_murphy_2_1.mac | 97 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2])]; 113 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2])]; 154 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2])]; 160 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2])]; 197 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2])]; 203 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2])]; 233 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2])]; 239 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2])]; 245 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2])]; 251 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2])]; [all …]
|
H A D | rtestode_kamke_2_1.mac | 18 ode_check(eqn,ans[1]); 26 ode_check(eqn,ans[1]); 34 ode_check(eqn,ans[1]); 42 ode_check(eqn,ans[1]); 56 ode_check(eqn,ans[1]); 64 ode_check(eqn,ans[1]); 85 ode_check(eqn,ans[1]); 200 ode_check(eqn,ans[1]); 208 ode_check(eqn,ans[1]); 218 ode_check(eqn,ans[1]); [all …]
|
H A D | rtestode_kamke_1_6.mac | 40 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2])]; 58 [method,ode_check(eqn,ans[1])]; 100 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2]),ode_check(eqn,ans[3])]; 116 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2]),ode_check(eqn,ans[3])]; 122 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2]),ode_check(eqn,ans[3])]; 142 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2]),ode_check(eqn,ans[3])]; 165 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2])]; 171 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2]),ode_check(eqn,ans[3])]; 183 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2]),ode_check(eqn,ans[3]),ode_check(eqn,ans[4])]; 217 [method,ode_check(eqn,%)]; [all …]
|
H A D | rtestode_kamke_1_4.mac | 49 [method,ode_check(eqn,ans[1])]; 55 [method,ode_check(eqn,ans[1])]; 404 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2])]; 444 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2])]; 450 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2])]; 456 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2])]; 488 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2])]; 513 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[1])]; 523 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2])]; 547 [method,ode_check(eqn,ans[1]),ode_check(eqn,ans[2])]; [all …]
|
H A D | rtestode_kamke_2_2.mac | 76 ode_check(eqn,ans[1]); 198 ode_check(eqn,ans[1]); 243 ode_check(eqn,ans[1]); 284 ode_check(eqn,ans[1]); 392 ode_check(eqn,ans[1]); 404 ode_check(eqn,ans[1]); 416 ode_check(eqn,ans[1]); 494 ode_check(eqn,ans[1]); 504 ode_check(eqn,ans[1]); 552 ode_check(eqn,ans[1]); [all …]
|
H A D | rtestode_kamke_2_3.mac | 180 ode_check(eqn,ans[1]); 190 ode_check(eqn,ans[1]); 200 ode_check(eqn,ans[1]); 254 ode_check(eqn,ans[1]); 262 ode_check(eqn,ans[1]); 288 ode_check(eqn,ans[1]); 296 ode_check(eqn,ans[1]); 308 ode_check(eqn,ans[1]); 316 ode_check(eqn,ans[1]); 403 ode_check(eqn,ans[1]); [all …]
|
/dports/science/R-cran-eco/eco/man/ |
H A D | ecoBD.Rd | 50 \eqn{n_{i11}} \tab \eqn{n_{i12}} \tab \dots \tab \eqn{n_{i1C}} \tab \eqn{n_{i1.}} \cr 51 \eqn{n_{i21}} \tab \eqn{n_{i22}} \tab \dots \tab \eqn{n_{i2C}} \tab \eqn{n_{i2.}} \cr 53 \eqn{n_{iR1}} \tab \eqn{n_{iR2}} \tab \dots \tab \eqn{n_{iRC}} \tab \eqn{n_{iR.}} \cr 54 \eqn{n_{i.1}} \tab \eqn{n_{i.2}} \tab \dots \tab \eqn{n_{i.C}} \tab \eqn{N_i} 56 where \eqn{n_{nr.}} and \eqn{n_{i.c}} represent the observed margins, 57 \eqn{N_i} represents the size of the table, and \eqn{n_{irc}} are 68 \eqn{W_{i11}} \tab \eqn{W_{i12}} \tab \dots \tab \eqn{W_{i1C}} \tab \eqn{Y_{i1}} \cr 69 \eqn{W_{i21}} \tab \eqn{W_{i22}} \tab \dots \tab \eqn{W_{i2C}} \tab \eqn{Y_{i2}} \cr 71 \eqn{W_{iR1}} \tab \eqn{W_{iR2}} \tab \dots \tab \eqn{W_{iRC}} \tab \eqn{Y_{iR}} \cr 72 \eqn{X_{i1}} \tab \eqn{X_{i2}} \tab \dots \tab \eqn{X_{iC}} \tab [all …]
|
/dports/math/py-jax/jax-0.2.9/jax/ |
H A D | jaxpr_util.py | 30 yield (jaxpr, eqn) 37 d[key(eqn)].append(eqn) 46 return histogram(jaxpr, lambda eqn: eqn.primitive.name) 49 def key(eqn): argument 57 def key(eqn): argument 58 return (eqn.primitive.name, ' '.join(map(shape_fmt, eqn.outvars))) 62 def key(eqn): argument 83 defs[v] = eqn 93 read(a, eqn) 95 write(v, eqn) [all …]
|
/dports/math/R-cran-VGAM/VGAM/man/ |
H A D | freund61.Rd | 20 parameters \eqn{\alpha}{alpha}, \eqn{\alpha'}{alpha'}, 21 \eqn{\beta}{beta} and \eqn{\beta'}{beta'}, respectively 57 Suppose \eqn{y_1}{y1} and \eqn{y_2}{y2} are random variables 60 The dependence between \eqn{y_1}{y1} and \eqn{y_2}{y2} 63 of the \eqn{A} component from \eqn{\alpha}{alpha} to 66 of the \eqn{B} component from \eqn{\beta}{beta} to 82 \eqn{y_1}{y1} and \eqn{y_2}{y2}. 108 \eqn{y_1}{y1} and \eqn{y_2}{y2} are independent, and 110 \eqn{1 / \alpha}{1/alpha} and \eqn{1 / \beta}{1/beta} 144 \eqn{y_1}{y1} and \eqn{y_2}{y2}. [all …]
|
/dports/cad/xcircuit/xcircuit-3.10.30/spiceparser/ |
H A D | eqn.c | 692 if(0)fprintf(dbg," %s=[%p %p]",str,eqn,eqn->eqn); in debug_eqn() 694 if(eqn->eqn!=NULL) in debug_eqn() 747 eqn.eqn->op=OPeol_const; in eqn_const() 748 eqn.eqn->z.val.x=val; in eqn_const() 806 e.eqn=eqntok_copy(e.eqn); in eqn_copy_m() 820 eqn.eqn=eqntok_parse(val); in eqn_parse() 842 assert(eqn->eqn!=NULL); in eqn_getval_() 846 eqntok_eval(&f,eqn->eqn); in eqn_getval_() 868 if(eqn->eqn==NULL) in eqn_setval() 872 eqn->eqn->z.val.x=val; in eqn_setval() [all …]
|
/dports/math/R-cran-geometry/geometry/man/ |
H A D | cart2bary.Rd | 11 \eqn{N+1}-by-\eqn{N} matrix} 13 \item{P}{\eqn{M}-by-\eqn{N} matrix in which each row is the Cartesian 17 \eqn{M}-by-\eqn{N+1} matrix in which each row is the 29 \eqn{N+1}-by-\eqn{N} matrix an arbitrary point \eqn{P} in 33 where \eqn{\beta} is an \eqn{N+1} vector of the barycentric coordinates. 36 Now partition the simplex into its first \eqn{N} rows \eqn{X_N} and 37 its \eqn{N+1}th row \eqn{X_{N+1}}. Partition the barycentric 38 coordinates into the first \eqn{N} columns \eqn{\beta_N} and the 39 \eqn{N+1}th column \eqn{\beta_{N+1}}. This allows us to write 43 where \eqn{1_N} is an \eqn{N}-by-1 matrix of ones. We can then solve [all …]
|