Results 1  10
of
2,984,989
The Unix TimeSharing System
 Communications of the ACM
, 1974
"... Unix is a generalpurpose, multiuser, interactive operating system for the larger Digital Equipment Corporation PDP11 and the Interdata 8/32 computers. It offers a number of features seldom found even in larger operating systems, including i A hierarchical file system incorporating demountable vol ..."
Abstract

Cited by 536 (14 self)
 Add to MetaCart
volumes, ii Compatible file, device, and interprocess I/O, iii The ability to initiate asynchronous processes, iv System command language selectable on a peruser basis, v Over 100 subsystems including a dozen languages, vi High degree of portability. This paper discusses the nature and implementation
Statistics for Experimenters
, 2005
"... R factor = 0.052; wR factor = 0.114; datatoparameter ratio = 18.4. The title compound, [Zn(C8H10F3O2)2(CH4O)2], is a dimethanol coordinated zinc complex with the acetyl acetonate derivative 1,1,1trifluoro5,5dimethylhexane2,4dionate. The bisdiketonate complex, which is isostructural with its ..."
Abstract

Cited by 645 (1 self)
 Add to MetaCart
R factor = 0.052; wR factor = 0.114; datatoparameter ratio = 18.4. The title compound, [Zn(C8H10F3O2)2(CH4O)2], is a dimethanol coordinated zinc complex with the acetyl acetonate derivative 1,1,1trifluoro5,5dimethylhexane2,4dionate. The bisdiketonate complex, which is isostructural with its
Suffix arrays: A new method for online string searches
, 1991
"... A new and conceptually simple data structure, called a suffix array, for online string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to a sort and search paradigm that employs novel algorithms. The main advantage of suffix arrays over suffix trees is that ..."
Abstract

Cited by 827 (0 self)
 Add to MetaCart
is that, in practice, they use three to five times less space. From a complexity standpoint, suffix arrays permit online string searches of the type, "Is W a substring of A?" to be answered in time O(P + log N), where P is the length of W and N is the length of A, which is competitive with (and
Mtree: An Efficient Access Method for Similarity Search in Metric Spaces
, 1997
"... A new access meth d, called Mtree, is proposed to organize and search large data sets from a generic "metric space", i.e. whE4 object proximity is only defined by a distance function satisfyingth positivity, symmetry, and triangle inequality postulates. We detail algorith[ for insertion o ..."
Abstract

Cited by 652 (38 self)
 Add to MetaCart
are reported, considering as th performance criteria th number of page I/O's and th number of distance computations. Th results demonstratethm th Mtree indeed extendsth domain of applicability beyond th traditional vector spaces, performs reasonably well inhE[94Kv#E44V[vh data spaces, and scales well
An inventory for measuring depression
 Archives of General Psychiatry
, 1961
"... The difficulties inherent in obtaining consistent and adequate diagnoses for the purposes of research and therapy have been pointed out by a number of authors. Pasamanick12 in a recent article viewed the low interclinician agreement on diagnosis as an indictment of the present state of psychiatry ..."
Abstract

Cited by 1098 (0 self)
 Add to MetaCart
to objective measurement have resulted in a wide variety of psychiatric rating ~ c a l e s. ~ J ~ These have been well summarized in a review article by Lorr l1 on "Rating Scales and Check Lists for the E v a 1 u a t i o n of Psychopathology. " In the area of psychological testing, a
Qualitative Researching
, 1996
"... ltaic (PV) electricity production from an intermittent Since 1978, compressed air energy storage (CAES) compressed air can then be released on demand to the CAES plant’s turbogenerator set to generate premium value electricity. The first CAES plant was built in broadened in the ittency of wind g wi ..."
Abstract

Cited by 591 (0 self)
 Add to MetaCart
with Cavallo,2 nomic feasibility as turbine (GT) oduction.3–8 The ate underground o the wind farms and shape the
The Viterbi algorithm
 Proceedings of the IEEE
, 1973
"... vol. 6, no. 8, pp. 211220, 1951. [7] J. L. Anderson and J. W..Ryon, “Electromagnetic radiation in accelerated systems, ” Phys. Rev., vol. 181, pp. 17651775, 1969. [8] C. V. Heer, “Resonant frequencies of an electromagnetic cavity in an accelerated system of reference, ” Phys. Reu., vol. 134, pp. A ..."
Abstract

Cited by 985 (3 self)
 Add to MetaCart
vol. 6, no. 8, pp. 211220, 1951. [7] J. L. Anderson and J. W..Ryon, “Electromagnetic radiation in accelerated systems, ” Phys. Rev., vol. 181, pp. 17651775, 1969. [8] C. V. Heer, “Resonant frequencies of an electromagnetic cavity in an accelerated system of reference, ” Phys. Reu., vol. 134, pp
Homological Algebra of Mirror Symmetry
 in Proceedings of the International Congress of Mathematicians
, 1994
"... Mirror Symmetry was discovered several years ago in string theory as a duality between families of 3dimensional CalabiYau manifolds (more precisely, complex algebraic manifolds possessing holomorphic volume elements without zeroes). The name comes from the symmetry among Hodge numbers. For dual Ca ..."
Abstract

Cited by 529 (3 self)
 Add to MetaCart
CalabiYau manifolds V, W of dimension n (not necessarily equal to 3) one has dim H p (V, Ω q) = dim H n−p (W, Ω q). Physicists conjectured that conformal field theories associated with mirror varieties are equivalent. Mathematically, MS is considered now as a relation between numbers of rational curves
A learning algorithm for Boltzmann machines
 Cognitive Science
, 1985
"... The computotionol power of massively parallel networks of simple processing elements resides in the communication bandwidth provided by the hardware connections between elements. These connections con allow a significant fraction of the knowledge of the system to be applied to an instance of a probl ..."
Abstract

Cited by 586 (13 self)
 Add to MetaCart
problem in o very short time. One kind of computation for which massively porollel networks appear to be well suited is large constraint satisfaction searches, but to use the connections efficiently two conditions must be met: First, a search technique that is suitable for parallel networks must be found
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
 ACM Tmns. Graph
, 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract

Cited by 543 (11 self)
 Add to MetaCart
are given, one that constructs the Voronoi diagram in O(n log n) time, and another that inserts a new site in O(n) time. Both are based on the use of the Voronoi dual, or Delaunay triangulation, and are simple enough to be of practical value. The simplicity of both algorithms can be attributed
Results 1  10
of
2,984,989