Also found in: Thesaurus, Medical, Legal, Acronyms, Encyclopedia, Wikipedia.


 (to͞o′pəl, tŭp′əl)
A generalization of ordered pairs, such as (-3, 4), and ordered triples, such as (0, -3, 5), in any dimension. An n-tuple is an ordered list of n numbers and can represent a point in n-dimensional space.

[From -tuple, as in quintuple or sextuple.]
American Heritage® Dictionary of the English Language, Fifth Edition. Copyright © 2016 by Houghton Mifflin Harcourt Publishing Company. Published by Houghton Mifflin Harcourt Publishing Company. All rights reserved.


(ˈtjʊpəl; ˈtʌpəl)
(Computer Science) computing a row of values in a relational database
Collins English Dictionary – Complete and Unabridged, 12th Edition 2014 © HarperCollins Publishers 1991, 1994, 1998, 2000, 2003, 2006, 2007, 2009, 2011, 2014
Mentioned in ?
References in periodicals archive ?
The challenger C adds the tuple < [ID.sub.i], [Q.sub.i], [b.sub.i], coin > to [H.sub.1.sup.LIST] and respond to A with [H.sub.1]([ID.sub.i]) = [Q.sub.i].
Its main task consists in detecting events and in running the algorithm that elects the cluster leader node by exchanging messages in the tuple spaces of its neighbours.
To begin with, a respiratory signal tuple ([x.sub.0],..., [x.sub.N-1]) [member of] [R.sup.N] is smoothed using the finite Fourier transform [9].
When [A.sub.1] executes the query with [MS.sub.pub], C checks if a tuple ([MS.sub.pub], [??], U) exists in [mathematical expression not reproducible]; if it exists, it returns U to [A.sub.1]; otherwise, C randomly selects [??] [member of] [Z.sup.*.sub.q] and computes U = [??]P.
As per our knowledge, no work has been done to propose and implement the tuple time stamped [9-11] multiple historical relation model using open source database system.
From mathematics, the projection of same tuple s = [[[s.sub.1],..., [s.sub.n] ].sup.T] (the input sample) is obtained by multiplying some rotation axis with the sample.
Second condition controls the number of watermarked tuple and distortion on the watermarked tuple.
We can represent a state of the LTS by the tuple <n; v; ch> , where v assigns a nonnegative real number to each clock, and ch is a tuple whose ith entry denotes the number of messages held in the asynchronous internal [channelch.sub.i].
Let F be the set of (d - 2)-flats that have at least one Type 3 tuple assigned to them.
The basic idea of MSB method [16] is: (1) assign each tuple to a bucket based on each sensitive attribute values of the tuple, each bucket has the same values on all sensitive attributes and the priority is assigned to each bucket according to the MMDCF (Maximal Multi Dimensional Capacity First) method (2) tuple is chosen randomly in the highest priority bucket (3) based on satisfying l-diversity the tuples are grouped into the bucket.
Either the sets A and B or the sets C and D have limit points in D, then the tuple [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] is supercyclic on H.