| 释义 |
simplex, a. and n.|ˈsɪmplɛks|
Also pl. simplicia.
[a. L. simplex single: see simple a.]
A. adj.
1. Consisting or composed of, characterized by, a single part, structure, etc.
1594Blundevil Exerc. i. xx. (1636) 43 Simplex [proportion], is when the Antecedent..contayneth the Consequent. 1866Cayley Math. Papers (1892) V. 402 The cone may consist of a single sheet; it is then of the simplex kind. 1895Funk's Standard Dict., Simplex telegraph, a single-needle dial telegraph. 1897Westm. Gaz. 10 Apr. 7/2 The new form of traction called the ‘simplex traction’... The conduit is laid, not between the two rails but beneath one of the rails.
2. Telegr., Teleph., and Computing. Designating a system in which signals can be sent along a line in only one direction at a time; also applied to a circuit along which commands can flow in only one direction, usu. from the central processor to a peripheral. Also absol.
1891C. Langdon-Davies Explanation of Phonopore vii. 28/1 The ordinary simplex telegraph is the one most in general use (except, possibly, in Great Britain). 1929Amer. Speech IV. 290 One type of printer, which records the message on tape after the manner of a stock ticker, is known as the ‘simplex’. 1967Davidson & Koenig Computers xv. 525 These data communication lines are generally simplex, that is, they carry data in one direction only. 1975Sci. Amer. Jan. 55 (Advt.), We have a range of modems, from 50 to 2400 bits per second, both for simplex and duplex traffic. 1977J. R. L. Anderson Death in City xi. 170 The Radio Officer handed me a telephone... ‘It's simplex, remember..you have to take it in turns to speak and listen.’
3. Biol. Of an eye: having pigment on the posterior surface of the iris only, not on the anterior surface, and so appearing blue.
1908C. C. Hurst in Proc. R. Soc. B. LXXX. 86 The eyes in which the posterior pigment alone is present in the iris, the anterior pigment being absent. Such eyes may be called simplex. 1946[see duplex a. 1 d].
4. Genetics. Of a polyploid individual: having the dominant allele at any particular locus represented once.
1921[see nulliplex a.]. 1931Genetics XVI. 178 When R is simplex (Rrr) the expected gametic ratio is 1R:2Rr:1rr:2r. Ibid. 183 A simplex plant (Rrr). 1932,1963[see quadruplex a.].
B. n.
1. a. A simple uncompounded word.
1892Classical Rev. Feb. 58/2 When..a complex was formed from any two of the above simplicia. 1904Expositor Nov. 361 In the New Testament..the simplex ἰδεῖν is exceedingly common.
b. Linguistics. In transformational grammar, a sentence analysed as having a single kernel structure. Cf. kernel n.1 8 b (ii).
1960R. B. Lees Gram. Eng. Nominalizations iii. 101 Within the matrix-sentence, or any other simplex, the subject governs -self. 1963Language XXXIX. 20 Since the second occurrence of the noun John repeats a noun within the same simplex, it is pronominalized to the corresponding -self pronoun. 1965Ibid. XLI. 269 These differences in the treatment of repeated and nonrepeated material are evident in both simplexes (single-kernel sentences) and complexes (multikernel sentences).
2. Geom. The figure, in any given number of dimensions, that is bounded by the least possible number of hyperplanes: the two-dimensional simplex is the triangle, the three-dimensional simplex is the tetrahedron, and the four-dimensional simplex is bounded by five tetrahedra.
1914H. P. Manning Geom. Four Dimensions viii. 317 In the space of five dimensions there are only three possible types of regular (convex) figures: the simplex, corresponding to the tetrahedron and pentahedroid, the orthogonal, corresponding to the cube and hypercube, and the figure reciprocal to the latter, constructed on a set of mutually perpendicular diagonals and corresponding to the octahedron and the 16-hedroid. 1929D. M. Y. Sommerville Introd. Geom. Four Dimensions vii. 96 The simplest polytope in Sn is the simplex S(n + 1), which is bounded by n + 1 hyperplanes. 1975Sci. Amer. May 102/2 The graph is isomorphic with the skeleton of a six-dimensional simplex, the 6-space analogue of the tetrahedron.
3. Comb., as simplex method, a method of maximizing a linear function of several variables under several constraints on other linear functions; simplex tableau, a table displaying the constraints in problems of the type soluble by the simplex method.
[1951G. B. Dantzig in T. C. Koopmans Activity Analysis of Production & Allocation xxi. 339 The general nature of the ‘simplex’ approach (as the method discussed here is known).] 1951R. Dorfman in Ibid. xxii. 351 The simplex method makes use of the fact that any point in an n-dimensional space can be expressed as a sum of n linearly independent points. 1966S. Beer Decision & Control viii. 149 There are also variants of the original set of rules for finding the answer (to which the name algorithm is applied); Dantzig's own algorithm is called the Simplex Method. 1980A. J. Jones Game Theory iii. 155 The relationship with our earlier notation is simply that we have replaced Aτ by A because this is the natural and universally accepted thing to do in setting up the simplex method.
1953A. Charnes in W. W. Cooper et al. Introd. Linear Programming ii. vi. 66 As far as computations are concerned it is most convenient to arrange the data at each stage in a ‘simplex tableau’ as shown in Table I. 1966A. Battersby Math. in Management v. 125 A more usual form of presentation is the Simplex tableau in which all the variables have columns allocated to them. |