Home
last modified time | relevance | path

Searched refs:M_i (Results 1 – 25 of 101) sorted by relevance

12345

/dports/science/py-GPy/GPy-1.10.0/GPy/core/parameterization/
H A Dpriors.py583 return M_i
628 W = (xk - M_i[i])
689 M_i = self.compute_Mi(cls)
703 M_i = self.compute_Mi(cls)
808 return M_i
853 W = (xk - M_i[i])
921 M_i = self.compute_Mi(cls)
938 M_i = self.compute_Mi(cls)
1052 return M_i
1097 W = (xk - M_i[i])
[all …]
/dports/math/polymake/polymake-4.5/external/permlib/include/permlib/search/
H A Dorbit_lex_min_search.h103 …<CandidatePtr>& candidates, std::list<CandidatePtr>& candidatesNext, dset& M_i, std::list<unsigned…
136 dset M_i(element.size()); in lexMin()
142 if (lexMin(i, element.count(), element, stabilizer, *cand0, *cand1, M_i, base, S_i)) in lexMin()
149 return M_i; in lexMin()
153 …<CandidatePtr>& candidates, std::list<CandidatePtr>& candidatesNext, dset& M_i, std::list<unsigned… in lexMin() argument
166 M_i = candidates.front()->D; in lexMin()
168 if (isLexSmaller(R->D, M_i)) { in lexMin()
169 M_i = R->D; in lexMin()
187 M_i = R->D; in lexMin()
213 M_i.set(m, 1); in lexMin()
/dports/math/permlib/PermLib-0.2.9/include/permlib/search/
H A Dorbit_lex_min_search.h103 …<CandidatePtr>& candidates, std::list<CandidatePtr>& candidatesNext, dset& M_i, std::list<unsigned…
136 dset M_i(element.size()); in lexMin()
142 if (lexMin(i, element.count(), element, stabilizer, *cand0, *cand1, M_i, base, S_i)) in lexMin()
149 return M_i; in lexMin()
153 …<CandidatePtr>& candidates, std::list<CandidatePtr>& candidatesNext, dset& M_i, std::list<unsigned… in lexMin() argument
166 M_i = candidates.front()->D; in lexMin()
168 if (isLexSmaller(R->D, M_i)) { in lexMin()
169 M_i = R->D; in lexMin()
187 M_i = R->D; in lexMin()
213 M_i.set(m, 1); in lexMin()
/dports/math/scalapack/scalapack-2.1.0/SRC/
H A Dtools.h32 #define Mmalloc(M_ptr, M_type, M_elt, M_i, M_ctxt) \ argument
40 (M_i) = 1; \
43 pberror_(&(M_ctxt), __FILE__, &(M_i)); \
/dports/lang/spidermonkey60/firefox-60.9.0/third_party/python/rsa/rsa/
H A Dcommon.py175 M_i = m // m_i
176 inv = inverse(M_i, m_i)
178 x = (x + a_i * M_i * inv) % m
/dports/security/py-rsa/rsa-3.4.2/rsa/
H A Dcommon.py177 M_i = m // m_i
178 inv = inverse(M_i, m_i)
180 x = (x + a_i * M_i * inv) % m
/dports/www/chromium-legacy/chromium-88.0.4324.182/tools/swarming_client/third_party/rsa/rsa/
H A Dcommon.py175 M_i = m // m_i
176 inv = inverse(M_i, m_i)
178 x = (x + a_i * M_i * inv) % m
/dports/www/firefox/firefox-99.0/third_party/python/rsa/rsa/
H A Dcommon.py175 M_i = m // m_i
176 inv = inverse(M_i, m_i)
178 x = (x + a_i * M_i * inv) % m
/dports/mail/thunderbird/thunderbird-91.8.0/third_party/python/rsa/rsa/
H A Dcommon.py175 M_i = m // m_i
176 inv = inverse(M_i, m_i)
178 x = (x + a_i * M_i * inv) % m
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/catapult/third_party/gsutil/third_party/rsa/rsa/
H A Dcommon.py177 M_i = m // m_i
178 inv = inverse(M_i, m_i)
180 x = (x + a_i * M_i * inv) % m
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/depot_tools/external_bin/gsutil/gsutil_4.28/gsutil/third_party/rsa/rsa/
H A Dcommon.py175 M_i = m // m_i
176 inv = inverse(M_i, m_i)
178 x = (x + a_i * M_i * inv) % m
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/catapult/third_party/google-endpoints/rsa/
H A Dcommon.py177 M_i = m // m_i
178 inv = inverse(M_i, m_i)
180 x = (x + a_i * M_i * inv) % m
/dports/www/firefox-legacy/firefox-52.8.0esr/python/rsa/rsa/
H A Dcommon.py175 M_i = m // m_i
176 inv = inverse(M_i, m_i)
178 x = (x + a_i * M_i * inv) % m
/dports/www/firefox-esr/firefox-91.8.0/third_party/python/rsa/rsa/
H A Dcommon.py175 M_i = m // m_i
176 inv = inverse(M_i, m_i)
178 x = (x + a_i * M_i * inv) % m
/dports/lang/spidermonkey78/firefox-78.9.0/third_party/python/rsa/rsa/
H A Dcommon.py175 M_i = m // m_i
176 inv = inverse(M_i, m_i)
178 x = (x + a_i * M_i * inv) % m
/dports/net/google-cloud-sdk/google-cloud-sdk/platform/bq/third_party/rsa/
H A Dcommon.py178 M_i = m // m_i
179 inv = inverse(M_i, m_i)
181 x = (x + a_i * M_i * inv) % m
/dports/net/google-cloud-sdk/google-cloud-sdk/lib/third_party/rsa/
H A Dcommon.py177 M_i = m // m_i
178 inv = inverse(M_i, m_i)
180 x = (x + a_i * M_i * inv) % m
/dports/net/google-cloud-sdk/google-cloud-sdk/platform/gsutil/third_party/rsa/rsa/
H A Dcommon.py177 M_i = m // m_i
178 inv = inverse(M_i, m_i)
180 x = (x + a_i * M_i * inv) % m
/dports/misc/vifm/vifm-0.11/src/menus/
H A Dgrep_menu.c40 enum { M_i, M_a, M_s, M_A, M_u, M_U, }; in show_grep_menu() enumerator
48 [M_i] = { .letter = 'i', .value = NULL, .uses_left = 1, .group = -1 }, in show_grep_menu()
73 macros[M_i].value = invert ? "-v" : ""; in show_grep_menu()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/catapult/third_party/rsa/rsa/
H A Dcommon.py177 M_i = m // m_i
178 inv = inverse(M_i, m_i)
180 x = (x + a_i * M_i * inv) % m
/dports/math/singular/Singular-Release-4-2-1/kernel/GBEngine/
H A Dsyz4.cc418 ideal M_i = NULL; in syzM_i_unsorted() local
427 M_i = idInit(ncols, G->ncols); in syzM_i_unsorted()
433 M_i->m[k] = syzHead(G, i, j); in syzM_i_unsorted()
437 id_DelDiv_no_test(M_i); in syzM_i_unsorted()
438 idSkipZeroes(M_i); in syzM_i_unsorted()
440 return M_i; in syzM_i_unsorted()
452 ideal M_i = NULL; in syzM_i_sorted() local
460 M_i = idInit(ncols, G->ncols); in syzM_i_sorted()
465 id_DelDiv_no_test(M_i); in syzM_i_sorted()
466 idSkipZeroes(M_i); in syzM_i_sorted()
[all …]
/dports/comms/liquid-dsp/liquid-dsp-1.3.2/src/modem/src/
H A Dmodem_qam.c51 q->data.qam.M_i = 1 << (q->data.qam.m_i); in MODEM()
55 assert(q->data.qam.M_i * q->data.qam.M_q == q->M); in MODEM()
117 *_y = (2*(int)s_i - (int)(_q->data.qam.M_i) + 1) * _q->data.qam.alpha + in MODEM()
/dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/tests/QS/regtest-cdft-2/
H A Dbecke_qs_twoconstraints.inc16 ! For magnetization density constraints, the sum_i coeff_i * M_i
17 ! where M_i = N_i(alpha)-N_i(beta)
/dports/science/cp2k-data/cp2k-7.1.0/tests/QS/regtest-cdft-2/
H A Dbecke_qs_twoconstraints.inc17 ! For magnetization density constraints, the sum_i coeff_i * M_i
18 ! where M_i = N_i(alpha)-N_i(beta)
/dports/science/py-OpenMC/openmc-0.12.2/docs/source/methods/
H A Dparallelization.rst460 M_i = \frac{1}{\hat{k}} \int \hat{S}_i(\mathbf{r}) \: d\mathbf{r} =
473 \Lambda_j = \left | \sum_{i=1}^j M_i - \frac{jN}{p} \right |.
482 E \left [ \Lambda_j \right ] = E \left [ \left | \sum_{i=1}^j M_i -
499 Next, we need to know what the distribution of :math:`M_i` in equation
528 :math:`M_i` solely in terms of :math:`\hat{k}_1, \dots, \hat{k}_p`:
533 M_i = \frac{N \hat{k}_i}{\sum\limits_{j=1}^p \hat{k}_j}.
536 propagation law to determine the variance of :math:`M_i`:
541 \text{Var} \left [ M_i \right ] = \sum_{j=1}^p \left ( \frac{\partial
544 M_i}{\partial \hat{k}_j} \right ) \left ( \frac{\partial M_i}{\partial
560 :math:`\sum_{i=1}^j M_i` is
[all …]

12345