Institution
SRI International
Nonprofit•Menlo Park, California, United States•
About: SRI International is a nonprofit organization based out in Menlo Park, California, United States. It is known for research contribution in the topics: Ionosphere & Laser. The organization has 7222 authors who have published 13102 publications receiving 660724 citations. The organization is also known as: Stanford Research Institute & SRI.
Topics: Ionosphere, Laser, Catalysis, Incoherent scatter, Radar
Papers published on a yearly basis
Papers
More filters
••
TL;DR: It was concluded that focal brain stimulation in this region can induce analgesia in the absence of diffusely applied "whole brain" stimulation.
Abstract: Chronic monopolar electrodes were implanted in the region of the midbrain central gray in eight rats. In three rats, continuous 60 cycle-per-second sine-wave stimulation resulted in an electrical analgesia defined by the elimination of responses to aversive stimulation while general motor responsiveness was retained. Exploratory laparotomy was carried out in these animals during continuous brain stimulation without the use of chemical anesthetics. Following surgery, brain stimulation was terminated, and responses to aversive stimuli returned. Electrodes effective in inducing electrical analgesia at the lowest currents were located at the dorsolateral perimeter of the midbrain central gray. It was concluded that focal brain stimulation in this region can induce analgesia in the absence of diffusely applied "whole brain" stimulation.
1,315 citations
•
TL;DR: In this article, the authors show how to construct a variety of "trapdoor" cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the shortest nonzero vector to within certain polynomial factors).
Abstract: We show how to construct a variety of "trapdoor" cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the shortest nonzero vector to within certain polynomial factors). Our contributions include a new notion of trapdoor function with preimage sampling, simple and efficient "hash-and-sign" digital signature schemes, and identity-based encryption. A core technical component of our constructions is an efficient algorithm that, given a basis of an arbitrary lattice, samples lattice points from a discrete Gaussian probability distribution whose standard deviation is essentially the length of the longest Gram-Schmidt vector of the basis. A crucial security property is that the output distribution of the algorithm is oblivious to the particular geometry of the given basis.
1,312 citations
••
21 Feb 2007TL;DR: This work constructs public-key systems that support comparison queries on encrypted data as well as more general queries such as subset queries (x∈ S) and supports arbitrary conjunctive queries without leaking information on individual conjuncts.
Abstract: We construct public-key systems that support comparison queries (x ≥ a) on encrypted data as well as more general queries such as subset queries (x∈ S). Furthermore, these systems support arbitrary conjunctive queries (P1 ∧ ... ∧ Pl) without leaking information on individual conjuncts. We present a general framework for constructing and analyzing public-key systems supporting queries on encrypted data.
1,310 citations
••
TL;DR: In this paper, the tensile and bending stiffness constants of ideal multi-walled and single-wall carbon nano-tubes are derived in terms of the known elastic properties of graphite.
1,275 citations
••
TL;DR: Taylor-series estimation as mentioned in this paper gives a least-sum-squared-error solution to a set of simultaneous linearized algebraic equations and provides the statistical spread of the solution errors.
Abstract: Taylor-series estimation gives a least-sum-squared-error solution to a set of simultaneous linearized algebraic equations. This method is useful in solving multimeasurement mixed-mode position-location problems typical of many navigational applications. While convergence is not proved, examples show that most problems do converge to the correct solution from reasonable initial guesses. The method also provides the statistical spread of the solution errors.
1,273 citations
Authors
Showing all 7245 results
Name | H-index | Papers | Citations |
---|---|---|---|
Rodney S. Ruoff | 164 | 666 | 194902 |
Alex Pentland | 131 | 809 | 98390 |
Robert L. Byer | 130 | 1036 | 96272 |
Howard I. Maibach | 116 | 1821 | 60765 |
Alexander G. G. M. Tielens | 115 | 722 | 51058 |
Adolf Pfefferbaum | 109 | 530 | 40358 |
Amato J. Giaccia | 108 | 419 | 49876 |
Bernard Wood | 108 | 630 | 38272 |
Paul Workman | 102 | 547 | 38095 |
Thomas Kailath | 102 | 661 | 58069 |
Pascal Fua | 102 | 614 | 49751 |
Edith V. Sullivan | 101 | 455 | 34502 |
Margaret A. Chesney | 101 | 326 | 33509 |
Thomas C. Merigan | 98 | 514 | 33941 |
Carlos A. Zarate | 97 | 417 | 32921 |