summation

• n.

• 合計、総和、相加、加重

関

addition、additional、sum、weighted

　 　 　 　

WordNet

1. (physiology) the process whereby multiple stimuli can produce a response (in a muscle or nerve or other part) that one stimulus alone does not produce
2. the arithmetic operation of summing; calculating the sum of two or more numbers; "the summation of four and three gives seven"; "four plus three equals seven" (同)addition, plus
3. a concluding summary (as in presenting a case before a law court) (同)summing up, rundown
4. a component that is added to something to improve it; "the addition of a bathroom was a major improvement"; "the addition of cinnamon improved the flavor" (同)add-on, improver
5. the act of adding one thing to another; "the addition of flowers created a pleasing effect"; "the addition of a leap day every four years"
6. a suburban area laid out in streets and lots for a future residential area
7. a quantity that is added; "there was an addition to property taxes this year"; "they recorded the cattles gain in weight over a period of weeks" (同)increase, gain
8. a quantity of money; "he borrowed a large sum"; "the amount he had in cash was insufficient" (同)sum of money, amount, amount of money
9. the whole amount (同)total, totality, aggregate
10. a quantity obtained by the addition of a group of numbers (同)amount, total
11. the final aggregate; "the sum of all our troubles did not equal the misery they suffered" (同)summation, sum total
12. adjusted to reflect value or proportion; "votes weighted according to the size of constituencies"; "a law weighted in favor of landlords"; "a weighted average"
13. the act of bringing to completion or fruition
14. the completion of marriage by sexual intercourse
15. of or relating to a summation or produced by summation (同)summative

PrepTutorEJDIC

1. 〈C〉(弁護人の)最終弁論 / 〈U〉足し算 / 〈C〉合計
2. 〈U〉(…を…に)『付け加えること』,追加《+『of』+『名』+『to』+『名』》 / 〈U〉加法,足し算 / 〈C〉(…に)加えられた物,足した物,《米》(家の)建て増し部分《+『to』+『名』》
3. 〈C〉《the sum》(数・量の)『合形』,総計(sum total)《+of+名》 / 〈U〉《時に a sum》(抽象的なことの)全体《+of+名》 / 〈C〉《形容詞をつけて》(…の)『額』《+of+名》 / 〈C〉《話》算数,算数の問題 / 〈U〉《the sum》(…の)要約,要旨《+of+名》 / …‘を'『合計する』《+up+名,+名+up》 / 合計して…になる《+up to+名》
4. 《補語にのみ用いて》(…に)有利な《+toward+名》
5. 『付け加えた』,追加の;特別の
6. 〈C〉《通例単数形で》達成,完成,成就 / 〈U〉(床入りによる)結婚の完了

Wikipedia preview

出典(authority):フリー百科事典『ウィキペディア（Wikipedia）』「2017/07/19 10:13:57」(JST)

wiki en

[Wiki en表示]

This article is about the mathematics of finite summation. For the more elementary aspects of the topic, see Addition. For infinite summation, see Series (mathematics). For other uses, see Summation (disambiguation).

Calculation results
Addition (+)
$$ summand + summand addend (broad sense) + addend (broad sense) augend + addend (strict sense) } = {\displaystyle \scriptstyle \left.{\begin{matrix}\scriptstyle {\text{summand}}\,+\,{\text{summand}}\\\scriptstyle {\text{addend (broad sense)}}\,+\,{\text{addend (broad sense)}}\\\scriptstyle {\text{augend}}\,+\,{\text{addend (strict sense)}}\end{matrix}}\right\}\,=\,}	$$ sum {\displaystyle \scriptstyle {\text{sum}}}
Subtraction (−)
$$ minuend − subtrahend = {\displaystyle \scriptstyle {\text{minuend}}\,-\,{\text{subtrahend}}\,=\,}	$$ difference {\displaystyle \scriptstyle {\text{difference}}}
Multiplication (×)
$$ factor × factor multiplicand × multiplier } = {\displaystyle \scriptstyle \left.{\begin{matrix}\scriptstyle {\text{factor}}\,\times \,{\text{factor}}\\\scriptstyle {\text{multiplicand}}\,\times \,{\text{multiplier}}\end{matrix}}\right\}\,=\,}	$$ product {\displaystyle \scriptstyle {\text{product}}}
Division (÷)
$$ dividend divisor   numerator denominator } = {\displaystyle \scriptstyle \left.{\begin{matrix}\scriptstyle {\frac {\scriptstyle {\text{dividend}}}{\scriptstyle {\text{divisor}}}}\\\scriptstyle {\text{ }}\\\scriptstyle {\frac {\scriptstyle {\text{numerator}}}{\scriptstyle {\text{denominator}}}}\end{matrix}}\right\}\,=\,}	$$ fraction quotient ratio {\displaystyle {\begin{matrix}\scriptstyle {\text{fraction}}\\\scriptstyle {\text{quotient}}\\\scriptstyle {\text{ratio}}\end{matrix}}}
Modulo (mod)
$$ dividend mod divisor = {\displaystyle \scriptstyle {\text{dividend}}{\bmod {\text{divisor}}}\,=\,}	$$ remainder {\displaystyle \scriptstyle {\text{remainder}}}
Exponentiation
$$ base exponent = {\displaystyle \scriptstyle {\text{base}}^{\text{exponent}}\,=\,}	$$ power {\displaystyle \scriptstyle {\text{power}}}
nth root (√)
$$ radicand degree = {\displaystyle \scriptstyle {\sqrt[{\text{degree}}]{\scriptstyle {\text{radicand}}}}\,=\,}	$$ root {\displaystyle \scriptstyle {\text{root}}}
Logarithm (log)
$$ log base ⁡ ( antilogarithm ) = {\displaystyle \scriptstyle \log _{\text{base}}({\text{antilogarithm}})\,=\,}	$$ logarithm {\displaystyle \scriptstyle {\text{logarithm}}}

In mathematics, summation (capital Greek sigma symbol: ∑) is the addition of a sequence of numbers; the result is their sum or total. If numbers are added sequentially from left to right, any intermediate result is a partial sum, prefix sum, or running total of the summation.

The numbers to be summed (called addends, or sometimes summands) may be integers, rational numbers, real numbers, or complex numbers. Besides numbers, other types of values can be added as well: vectors, matrices, polynomials and, in general, elements of any additive group (or even monoid).

For finite sequences of such elements, summation always produces a well-defined sum. The summation of an infinite sequence of values is called a series. A value of such a series may often be defined by means of a limit (although sometimes the value may be infinite, and often no value results at all). Another notion involving limits of finite sums is integration.

The summation of the sequence [1, 2, 4, 2] is an expression whose value is the sum of each of the members of the sequence. In the example, 1 + 2 + 4 + 2 = 9. Because addition is associative, the sum does not depend on how the additions are grouped, for instance (1 + 2) + (4 + 2) and 1 + ((2 + 4) + 2) both have the value 9; therefore, parentheses are usually omitted in repeated additions. Addition is also commutative, so permuting the terms of a finite sequence does not change its sum (for infinite summations this property may fail; see Absolute convergence for conditions under which it still holds).

There is no special notation for the summation of such explicit sequences, as the corresponding repeated addition expression will do. There is only a slight difficulty if the sequence has fewer than two elements: the summation of a sequence of one term involves no plus sign (it is indistinguishable from the term itself) and the summation of the empty sequence cannot even be written down (but one can write its value "0" in its place). If, however, the terms of the sequence are given by a regular pattern, possibly of variable length, then a summation operator may be useful or even essential.

For the summation of the sequence of consecutive integers from 1 to 100, one could use an addition expression involving an ellipsis to indicate the missing terms: 1 + 2 + 3 + 4 + ... + 99 + 100. In this case, the reader can easily guess the pattern. However, for more complicated patterns, one needs to be precise about the rule used to find successive terms, which can be achieved by using the summation operator "Σ". Using this sigma notation the above summation is written as:

$\sum _{i{\mathop {=}}1}^{100}i.$

The value of this summation is 5050. It can be found without performing 99 additions, since it can be shown (for instance by mathematical induction) that

$\sum _{i{\mathop {=}}1}^{n}i={\frac {n(n+1)}{2}}$

for all natural numbers n. More generally, formulae exist for many summations of terms following a regular pattern.

The term "indefinite summation" refers to the search for an inverse image of a given infinite sequence s of values for the forward difference operator, in other words for a sequence, called antidifference of s, whose finite differences are given by s. By contrast, summation as discussed in this article is called "definite summation".

When it is necessary to clarify that numbers are added with their signs, the term algebraic sum is used. For example, in electric circuit theory Kirchhoff's circuit laws consider the algebraic sum of currents in a network of conductors meeting at a point, assigning opposite signs to currents flowing in and out of the node.

Notation

Capital-sigma notation

The capital sigma

Mathematical notation uses a symbol that compactly represents summation of many similar terms: the summation symbol, ∑, an enlarged form of the upright capital Greek letter Sigma. This is defined as:

$\sum _{i{\mathop {=}}m}^{n}a_{i}=a_{m}+a_{m+1}+a_{m+2}+\cdots +a_{n-1}+a_{n}$

where i represents the index of summation; a_i is an indexed variable representing each successive term in the series; m is the lower bound of summation, and n is the upper bound of summation. The "i = m" under the summation symbol means that the index i starts out equal to m. The index, i, is incremented by 1 for each successive term, stopping when i = n.

Here is an example showing the summation of squares:

$\sum _{i=3}^{6}i^{2}=3^{2}+4^{2}+5^{2}+6^{2}=86.$

Informal writing sometimes omits the definition of the index and bounds of summation when these are clear from context, as in:

$\sum a_{i}^{2}=\sum _{i{\mathop {=}}1}^{n}a_{i}^{2}.$

One often sees generalizations of this notation in which an arbitrary logical condition is supplied, and the sum is intended to be taken over all values satisfying the condition. For example:

$\sum _{0\leq k<100}f(k)$

is the sum of $f(k)$ over all (integers) $k$ in the specified range,

$\sum _{x{\mathop {\in }}S}f(x)$

is the sum of $f(x)$ over all elements $x$ in the set $S$, and

$\sum _{d|n}\;\mu (d)$

is the sum of $\mu (d)$ over all positive integers $d$ dividing $n$.

There are also ways to generalize the use of many sigma signs. For example,

$\sum _{\ell ,\ell '}$

is the same as

$\sum _{\ell }\sum _{\ell '}.$

A similar notation is applied when it comes to denoting the product of a sequence, which is similar to its summation, but which uses the multiplication operation instead of addition (and gives 1 for an empty sequence instead of 0). The same basic structure is used, with $\prod$, an enlarged form of the Greek capital letter Pi, replacing the $\sum$.

Special cases

It is possible to sum fewer than 2 numbers:

• If the summation has one summand $x$, then the evaluated sum is $x$.
• If the summation has no summands, then the evaluated sum is zero, because zero is the identity for addition. This is known as the empty sum.

These degenerate cases are usually only used when the summation notation gives a degenerate result in a special case. For example, if $n=m$ in the definition above, then there is only one term in the sum; if $n=m-1$, then there is none.

Formal definition

Summation may be defined recursively as follows

$\sum _{i=a}^{b}g(i)=0$ , for b < a.

$\sum _{i=a}^{b}g(i)=g(b)+\sum _{i=a}^{b-1}g(i)$, for b ≥ a.

Measure theory notation

In the notation of measure and integration theory, a sum can be expressed as a definite integral,

$\sum _{k{\mathop {=}}a}^{b}f(k)=\int _{[a,b]}f\,d\mu$

where $[a,b]$ is the subset of the integers from $a$ to $b$, and where $\mu$ is the counting measure.

Fundamental theorem of discrete calculus

Indefinite sums can be used to calculate definite sums with the formula:

$\sum _{k=a}^{b}f(k)=\Delta ^{-1}f(b+1)-\Delta ^{-1}f(a)$

where $\Delta ^{-1}$ is the antidifference operator, the inverse of the forward difference operator $\Delta$.

Approximation by definite integrals

Many such approximations can be obtained by the following connection between sums and integrals, which holds for any:

increasing function f:

$\int _{s=a-1}^{b}f(s)\ ds\leq \sum _{i=a}^{b}f(i)\leq \int _{s=a}^{b+1}f(s)\ ds.$

decreasing function f:

$\int _{s=a}^{b+1}f(s)\ ds\leq \sum _{i=a}^{b}f(i)\leq \int _{s=a-1}^{b}f(s)\ ds.$

For more general approximations, see the Euler–Maclaurin formula.

For summations in which the summand is given (or can be interpolated) by an integrable function of the index, the summation can be interpreted as a Riemann sum occurring in the definition of the corresponding definite integral. One can therefore expect that for instance

${\frac {b-a}{n}}\sum _{i=0}^{n-1}f\left(a+i{\frac {b-a}{n}}\right)\approx \int _{a}^{b}f(x)\ dx,$

since the right hand side is by definition the limit for $n\to \infty$ of the left hand side. However, for a given summation n is fixed, and little can be said about the error in the above approximation without additional assumptions about f: it is clear that for wildly oscillating functions the Riemann sum can be arbitrarily far from the Riemann integral.

Identities

The formulae below involve finite sums; for infinite summations or finite summations of expressions involving trigonometric functions or other transcendental functions, see list of mathematical series.

General manipulations

$\sum _{n=s}^{t}C\cdot f(n)=C\cdot \sum _{n=s}^{t}f(n)$, where C is a constant

$\sum _{n=s}^{t}f(n)+\sum _{n=s}^{t}g(n)=\sum _{n=s}^{t}\left[f(n)+g(n)\right]$

$\sum _{n=s}^{t}f(n)-\sum _{n=s}^{t}g(n)=\sum _{n=s}^{t}\left[f(n)-g(n)\right]$

$\sum _{n=s}^{t}f(n)=\sum _{n=s+p}^{t+p}f(n-p)$

$\sum _{n\in B}f(n)=\sum _{m\in A}f(\sigma (m))$, for a bijection σ from a finite set A onto a finite set B; this generalizes the preceding formula.

$\sum _{n=s}^{j}f(n)+\sum _{n=j+1}^{t}f(n)=\sum _{n=s}^{t}f(n)$

$\sum _{i=k_{0}}^{k_{1}}\sum _{j=l_{0}}^{l_{1}}a_{i,j}=\sum _{j=l_{0}}^{l_{1}}\sum _{i=k_{0}}^{k_{1}}a_{i,j}$

$\sum _{k\leq j\leq i\leq n}a_{i,j}=\sum _{i=k}^{n}\sum _{j=k}^{i}a_{i,j}=\sum _{j=k}^{n}\sum _{i=j}^{n}a_{i,j}=\sum _{j=0}^{n-k}\sum _{i=k}^{n-j}a_{i+j,i}$

$\sum _{n=0}^{t}f(2n)+\sum _{n=0}^{t}f(2n+1)=\sum _{n=0}^{2t+1}f(n)$

$\sum _{n=0}^{t}\sum _{i=0}^{z-1}f(z\cdot n+i)=\sum _{n=0}^{z\cdot t+z-1}f(n)$

$\sum _{i=s}^{m}\sum _{j=t}^{n}{a_{i}}{c_{j}}=\left(\sum _{i=s}^{m}a_{i}\right)\cdot \sum _{j=t}^{n}c_{j}$

$\sum _{n=s}^{t}\ln f(n)=\ln \prod _{n=s}^{t}f(n)$

$c^{\left[\sum _{n=s}^{t}f(n)\right]}=\prod _{n=s}^{t}c^{f(n)}$

$\left(\sum _{k=0}^{n}a_{k}\right)\cdot \left(\sum _{k=0}^{n}b_{k}\right)=\sum _{k=0}^{2n}\sum _{i=0}^{k}a_{i}b_{k-i}-\sum _{k=0}^{n-1}\left(a_{k}\sum _{i=n+1}^{2n-k}b_{i}+b_{k}\sum _{i=n+1}^{2n-k}a_{i}\right)$

Polynomial expressions

$\sum _{i=m}^{n}1=n+1-m$

$\sum _{i=m}^{n}i={\frac {n(n+1)}{2}}-{\frac {m(m-1)}{2}}={\frac {(n+1-m)(n+m)}{2}}$ (See arithmetic series)

$\sum _{i=0}^{n}i=\sum _{i=1}^{n}i={\frac {n(n+1)}{2}}$ (Special case of the arithmetic series)

$\sum _{i=0}^{n}i^{2}={\frac {n(n+1)(2n+1)}{6}}={\frac {n^{3}}{3}}+{\frac {n^{2}}{2}}+{\frac {n}{6}}$ (See square pyramidal number)

$\sum _{i=0}^{n}i^{3}=\left[\ \!\sum _{i=0}^{n}i\,\right]^{2}=\left[\,\!{\frac {n\!\,(n+1)}{2}}\,\!\right]^{2}={\frac {n^{4}}{4}}+{\frac {n^{3}}{2}}+{\frac {n^{2}}{4}}$ (See Nicomachus's theorem)

$\sum _{i=0}^{n}i^{4}={\frac {n(n+1)(2n+1)(3n^{2}+3n-1)}{30}}={\frac {n^{5}}{5}}+{\frac {n^{4}}{2}}+{\frac {n^{3}}{3}}-{\frac {n}{30}}$

$\sum _{i=0}^{n}i^{p}={\frac {(n+1)^{p+1}}{p+1}}+\sum _{k=1}^{p}{\frac {B_{k}}{p-k+1}}{p \choose k}(n+1)^{p-k+1},$

where $B_{k}$ denotes a Bernoulli number (see Faulhaber's formula).

The following formulae are manipulations of

$\sum _{i=0}^{n}i^{3}=\left(\sum _{i=0}^{n}i\right)^{2}$

generalized to begin a series at any natural number value (i.e., $m\in \mathbb {N}$ ):

$\left(\sum _{i=m}^{n}i\right)^{2}=\sum _{i=m}^{n}(i^{3}-im(m-1))$

$\sum _{i=m}^{n}i^{3}=\left(\sum _{i=m}^{n}i\right)^{2}+m(m-1)\sum _{i=m}^{n}i$

Exponential terms

In the summations below a is a constant not equal to 1

$\sum _{i=m}^{n-1}a^{i}={\frac {a^{m}-a^{n}}{1-a}}$ (m < n; see geometric series)

$\sum _{i=0}^{n-1}a^{i}={\frac {1-a^{n}}{1-a}}$ (geometric series with starting index $i=0$)

$\sum _{i=0}^{n-1}ia^{i}={\frac {a-na^{n}+(n-1)a^{n+1}}{(1-a)^{2}}}$

$\sum _{i=0}^{n-1}i2^{i}=2+(n-2)2^{n}$ (special case when a = 2)

$\sum _{i=0}^{n-1}{\frac {i}{2^{i}}}=2-{\frac {n+1}{2^{n-1}}}$ (special case when a = 1/2)

$\sum _{i=1}^{n}\left[b+(i-1)d\right]a^{i-1}=b+[b+d]a+[b+2d]a^{2}+\cdots +[b+(n-1)d]a^{n-1}={\frac {b-[b+(n-1)d]a^{n}}{1-a}}+{\frac {da(1-a^{n-1})}{(1-a)^{2}}}$

(arithmetico-geometric series)

Binomial coefficients and factorials

Main article: Binomial coefficient § Sums of the binomial coefficients

There exist very many summation identities involving binomial coefficients (a whole chapter of Concrete Mathematics is devoted to just the basic techniques). Some of the most basic ones are the following.

$\sum _{i=0}^{n}{n \choose i}=2^{n}$

$\sum _{i=1}^{n}i{n \choose i}=n2^{n-1}$

$\sum _{i=0}^{n}i!\cdot {n \choose i}=\sum _{i=0}^{n}{}_{n}P_{i}=\lfloor n!\cdot e\rfloor ,\quad n\in \mathbb {Z} ^{+}$ , where ${}_{n}P_{i}$ is the number of k-permutations of n and $\lfloor x\rfloor$ denotes the floor function.

$\sum _{i=0}^{n}{i \choose k}={n+1 \choose k+1}$

$\sum _{i=0}^{n}{n \choose i}a^{(n-i)}b^{i}=(a+b)^{n}$, the binomial theorem

$\sum _{i=0}^{n}i\cdot i!=(n+1)!-1$

$\sum _{i=1}^{n}{}_{i+k}P_{k+1}=\sum _{i=1}^{n}\prod _{j=0}^{k}(i+j)={\frac {(n+k+1)!}{(n-1)!(k+2)}}$

$\sum _{i=0}^{n}{m+i-1 \choose i}={m+n \choose n}$

$\sum _{i=0}^{n}{n \choose i}^{2}={2n \choose n}$

Growth rates

The following are useful approximations (using theta notation):

$\sum _{i=1}^{n}i^{c}\in \Theta (n^{c+1})$ for real c greater than −1

$\sum _{i=1}^{n}{\frac {1}{i}}\in \Theta (\log _{e}n)$ (See Harmonic number)

$\sum _{i=1}^{n}c^{i}\in \Theta (c^{n})$ for real c greater than 1

$\sum _{i=1}^{n}\log(i)^{c}\in \Theta (n\cdot \log(n)^{c})$ for non-negative real c

$\sum _{i=1}^{n}\log(i)^{c}\cdot i^{d}\in \Theta (n^{d+1}\cdot \log(n)^{c})$ for non-negative real c, d

$\sum _{i=1}^{n}\log(i)^{c}\cdot i^{d}\cdot b^{i}\in \Theta (n^{d}\cdot \log(n)^{c}\cdot b^{n})$ for non-negative real b > 1, c, d

Miscellaneous

$\sum _{i=1}^{n}{\frac {1}{i}}=H_{n}$ (See Harmonic number)

$\sum _{i=1}^{n}{\frac {1}{i^{k}}}=H_{n}^{k}$ (See Generalized harmonic number)

See also

• Einstein notation
• Iverson bracket
• Iterated binary operation
• Kahan summation algorithm
• Products of sequences
• Product (mathematics)

Further reading

• Nicholas J. Higham, "The accuracy of floating point summation", SIAM J. Scientific Computing 14 (4), 783–799 (1993).

External links

• Media related to Summation at Wikimedia Commons
• "Summation". PlanetMath. 
• Moriarty, Philip; Bowley, Roger (2009). "∑ – Summation (and Fourier Analysis)". Sixty Symbols. Brady Haran for the University of Nottingham. 

UpToDate Contents

全文を閲覧するには購読必要です。 To read the full text you will need to subscribe.

• 1. 急性非代償性心不全の評価 evaluation of acute decompensated heart failure
• 2. 心音の聴診 auscultation of heart sounds
• 3. 線維筋痛症の病因 pathogenesis of fibromyalgia
• 4. 加算平均心電図の技術的側面 technical aspects of the signal averaged electrocardiogram
• 5. 関節リウマチにおける疾患転帰および機能的能力 disease outcome and functional capacity in rheumatoid arthritis

English Journal

• Composition, distribution and risk of total fluorine, extractable organofluorine and perfluorinated compounds in Chinese teas.

• Zhang R1, Zhang H2, Chen Q3, Luo J4, Chai Z5, Shen J6.
• Food chemistry.Food Chem.2017 Mar 15;219:496-502. doi: 10.1016/j.foodchem.2016.09.136. Epub 2016 Sep 21.
• To explore the residual characteristics of fluorine and perfluorinated compounds (PFCs) in tea, the total fluorine (TF), extractable organofluorine (EOF) and PFCs in 19 Chinese commercial teas of five categories were measured using cyclic neutron activation analysis combined with HPLC-MS/MS. The res
• PMID 27765257

• Determination of oligomeric proanthocyanidins and their antioxidant capacity from different chocolate manufacturing stages using the NP-HPLC-online-DPPH methodology.

• Pedan V1, Fischer N2, Bernath K2, Hühn T2, Rohn S3.
• Food chemistry.Food Chem.2017 Jan 1;214:523-32. doi: 10.1016/j.foodchem.2016.07.094. Epub 2016 Jul 14.
• Cocoa beans are a well-known source of antioxidant polyphenols. Especially individual oligomeric proanthocyanidins demonstrated a significant contribution to the total antioxidant activity of cocoa compared to monomeric compounds. An NP-HPLC-online-DPPH assay was developed for separating the homolog
• PMID 27507506

• The dendritic tree: a mathematical integrator.

• Bachatene L1, Bharmauria V2.
• Frontiers in bioscience (Scholar edition).Front Biosci (Schol Ed).2017 Jan 1;9:55-61.
• Neurons in the primary visual cortex (V1) are sensitive to simple features of the visual scene such as contrast, spatial frequency or orientations. In higher mammals, they are organized into columns of orientation-preference, whereas such organization is absent in rodents. However, in both types of
• PMID 27814574

• An electrical bio-chip to transfer and detect electromagnetic stimulation on the cells based on vertically aligned carbon nanotubes.

• Rafizadeh-Tafti S1, Haqiqatkhah MH2, Saviz M3, Janmaleki M4, Faraji Dana R2, Zanganeh S1, Abdolahad M5.
• Materials science & engineering. C, Materials for biological applications.Mater Sci Eng C Mater Biol Appl.2017 Jan 1;70(Pt 1):681-688. doi: 10.1016/j.msec.2016.09.050. Epub 2016 Sep 25.
• A highly sensitive impedimetric bio-chip based on vertically aligned multiwall carbon nanotubes (VAMWCNTs), was applied in direct interaction with lung cancer cells. Our tool provided both inducing and monitoring the bioelectrical changes in the cells initiated by electromagnetic (EM) wave stimulati
• PMID 27770942

Japanese Journal

• Experimental low-level jaw clenching inhibits temporal summation evoked by electrical stimulation in healthy human volunteers

• Archives of Oral Biology 60(5), 681-689, 2015-05
• NAID 120005600831

• 準同型暗号を用いたプライバシ保護型条件付き集計プロトコル

• 法政大学大学院紀要（情報科学研究科編） (10), 2015-03-24
• NAID 120005622187

• 農業クラウドサービスの展開と農業ナレッジの課題と可能性(<特集>人工知能と農業)

• 人工知能:人工知能学会誌 30(2), 188-192, 2015-03-01
• NAID 110009913052

• 総括 : 「病と祓 : 病気治療をめぐる東アジアの比較文化史」に寄せて (シンポジウム 病と祓 : 病気治療をめぐる東アジアの比較文化史)

• アジア民族文化研究 (14), 247-254, 2015-03
• NAID 40020467830

Related Links

• Summation | Define Summation at Dictionary.com

Summation definition, the act or process of summing. See more. Dictionary.com Word of the Day Translate Games Blog Thesaurus.com Apps Favorites Log Out Log In follow Dictionary.com Dictionary.com Thesaurus.com Log In ...

• Summation - definition of summation by The Free Dictionary

CaseVantage -- CT Summation 's comprehensive, Web-based litigation support application and eDiscovery hosting platform -- is available through the Summation Hosted Provider (SHP) channel as a hosted-review platform for ...

• Summation | Definition of Summation by Merriam-Webster

:a brief description of the most important information about something law: a final speech made by a lawyer in a court of law to give a summary of the main ... A summation can be found at the end of the report. We gave a summation of our discovery.

---

★リンクテーブル★

リンク元	「sum」「相加」「additional」「合計」「weighted」

「sum」

　　[★]

• n.

• 和

• v.

• 合計する、要約する

関

abstract、brief、outline、recapitulate、recapitulation、summarize、summary、summation、synopses、synopsis

　 　 　 　 　

「相加」

　　[★]

英

addition、summation、additional

関

追加、添加、加えること、付加、付加的、さらなる、余分、加重、加算、合計、総和

「additional」

　　[★]

• adj.

• 付加的な、追加の、さらなる、余分な、相加の

関

add、addition、extra、margin、summation、supplement、supplemental

　

「合計」

　　[★]

英

summation、sum

関

相加、要約、和、加重、総和

「weighted」

　　[★]

• adj.

• 重みつきの、加重した

関

summation