Institution
Hewlett-Packard
Company•Palo Alto, California, United States•
About: Hewlett-Packard is a company organization based out in Palo Alto, California, United States. It is known for research contribution in the topics: Signal & Substrate (printing). The organization has 34663 authors who have published 59808 publications receiving 1467218 citations. The organization is also known as: Hewlett Packard & Hewlett-Packard Company.
Papers published on a yearly basis
Papers
More filters
••
15 May 2011TL;DR: A SPICE model for the titanium dioxide memristor device is presented from its modeling equations as described in [1] and the SPICE simulations to the experimental data are compared.
Abstract: In this paper we present a SPICE model for the titanium dioxide memristor device from its modeling equations as described in [1] and compare the SPICE simulations to the experimental data.
211 citations
••
TL;DR: A summary of some of the more salient features of progress being made in the understanding of the signal-to-noise limitations of medical imaging systems and to place this progress within a historical context is attempted.
Abstract: Over recent decades a quiet revolution has taken place in the application of modern imaging theory to many fields of applied imaging. Nowhere has this movement been more dramatic than within the field of diagnostic medical x-ray imaging, to the extent that there is now a growing consensus around a universal imaging language for the description and inter-comparison of the increasingly diverse range of technologies. This common language owes much to the basic quantum-limited approach pioneered by Rose and his contemporaries. It embodies the fundamentally statistical nature of image signals, and enables scientists and engineers to develop new system designs optimized for the detection of small signals while constraining patient x-ray exposures to tolerable levels. In this paper we attempt to provide a summary of some of the more salient features of progress being made in the understanding of the signal-to-noise limitations of medical imaging systems, and to place this progress within historical context. Reflecting the experiences of both authors, emphasis will be given to medical diagnostics based on x-ray imaging techniques.
211 citations
•
02 Jun 1998TL;DR: In this article, an acoustical resonator is constructed by creating a cavity in the substrate and filling the same with a sacrificial material that can be rapidly removed from the cavity after the deposition of the various layers making up the resonator.
Abstract: An acoustical resonator and a method for making the same. A resonator according to the present invention includes a layer of piezoelectric material sandwiched between first and second electrodes. The first electrode includes a conducting sheet having a RMS variation in height of less than 2 μm. The resonator bridges a cavity in a substrate on which the resonator is constructed. The resonator is constructed by creating a cavity in the substrate and filling the same with a sacrificial material that can be rapidly removed from the cavity after the deposition of the various layers making up the resonator. The surface of the filled cavity is polished to provide a RMS variation in height of less than 0.5 μm. The first electrode is deposited on the polished surface to a thickness that assures that the RMS variation in height of the metallic layer is less than 2 μm. The piezoelectric layer is deposited on the first electrode and the second electrode is then deposited on the piezoelectric layer. The sacrificial material is then removed from the cavity by opening vias into the cavity and removing the material through the vias. The preferred sacrificial material is phophor-silica-glass.
211 citations
••
TL;DR: Three polygon decomposition problems are shown to be NP-hard and thus unlikely to admit efficient algorithms, and the polygonal region is permitted to contain holes.
Abstract: The inherent computational complexity of polygon decomposition problems is of theoretical interest to researchers in the field of computational geometry and of practical interest to those working in syntactic pattern recognition. Three polygon decomposition problems are shown to be NP-hard and thus unlikely to admit efficient algorithms. The problems are to find minimum decompositions of a polygonal region into (perhaps overlapping) convex, star-shaped, or spiral subsets. We permit the polygonal region to contain holes. The proofs are by transformation from Boolean three-satisfiability, a known NP-complete problem. Several open problems are discussed.
211 citations
•
17 Nov 2006TL;DR: In this paper, a web application is analyzed to determine filtering and acceptance characteristics of the web site and a vocabulary of allowed symbols is created to be used in the building of attack strings.
Abstract: A web application is more efficiently analyzed by intelligently generating attack sequences to be used in the assessment. Rather than simply sending a canned list of static strings at a web application, the operation of the web application is analyzed to determine the filtering and acceptance characteristics of the web site. As this information is ascertained, a vocabulary of allowed symbols is created. This vocabulary is used in the building of attack strings and as such, the number of attack strings fired at the web application is greatly reduced, as well as the number of false positives.
211 citations
Authors
Showing all 34676 results
Name | H-index | Papers | Citations |
---|---|---|---|
Andrew White | 149 | 1494 | 113874 |
Stephen R. Forrest | 148 | 1041 | 111816 |
Rafi Ahmed | 146 | 633 | 93190 |
Leonidas J. Guibas | 124 | 691 | 79200 |
Chenming Hu | 119 | 1296 | 57264 |
Robert E. Tarjan | 114 | 400 | 67305 |
Hong-Jiang Zhang | 112 | 461 | 49068 |
Ching-Ping Wong | 106 | 1128 | 42835 |
Guillermo Sapiro | 104 | 667 | 70128 |
James R. Heath | 103 | 425 | 58548 |
Arun Majumdar | 102 | 459 | 52464 |
Luca Benini | 101 | 1453 | 47862 |
R. Stanley Williams | 100 | 605 | 46448 |
David M. Blei | 98 | 378 | 111547 |
Wei-Ying Ma | 97 | 464 | 40914 |