Institution
Naval Postgraduate School
Education•Monterey, California, United States•
About: Naval Postgraduate School is a education organization based out in Monterey, California, United States. It is known for research contribution in the topics: Tropical cyclone & Nonlinear system. The organization has 5246 authors who have published 11614 publications receiving 298300 citations. The organization is also known as: NPS & U.S. Naval Postgraduate School.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: The physical, chemical and biological perturbations in central California waters associated with the strong 1997-1998 El Nino are described and explained on the basis of time series collected from ships, moorings, tide gauges and satellites as mentioned in this paper.
262 citations
••
TL;DR: In this paper, a global eddy resolving simulation using the Parallel Ocean Program (POP) general circulation model is presented, and the simulation represents a major step forward in high resolution ocean modeling, with applications to prediction, climate, and general ocean science.
261 citations
••
30 Mar 1998TL;DR: The author studies the performance of four mapping algorithms and concludes that the use of intelligent mapping algorithms is beneficial, even when the expected time for completion of a job is not deterministic.
Abstract: The author studies the performance of four mapping algorithms. The four algorithms include two naive ones: opportunistic load balancing (OLB), and limited best assignment (LBA), and two intelligent greedy algorithms: an O(nm) greedy algorithm, and an O(n/sup 2/m) greedy algorithm. All of these algorithms, except OLB, use expected run-times to assign jobs to machines. As expected run-times are rarely deterministic in modern networked and server based systems, he first uses experimentation to determine some plausible run-time distributions. Using these distributions, he next executes simulations to determine how the mapping algorithms perform. Performance comparisons show that the greedy algorithms produce schedules that, when executed, perform better than naive algorithms, even though the exact run-times are not available to the schedulers. He concludes that the use of intelligent mapping algorithms is beneficial, even when the expected time for completion of a job is not deterministic.
260 citations
••
12 Apr 1999TL;DR: A collection of eleven heuristics from the literature has been selected, implemented, and analyzed under one set of common assumptions and provides one even basis for comparison and insights into circumstances where one technique will outperform another.
Abstract: Heterogeneous computing (HC) environments are well suited to meet the computational demands of large, diverse groups of tasks (i.e., a meta-task). The problem of mapping (defined as matching and scheduling) these tasks onto the machines of an HC environment has been shown, in general, to be NP-complete, requiring the development of heuristic techniques. Selecting the best heuristic to use in a given environment, however, remains a difficult problem, because comparisons are often clouded by different underlying assumptions in the original studies of each heuristic. Therefore, a collection of eleven heuristics from the literature has been selected, implemented, and analyzed under one set of common assumptions. The eleven heuristics examined are opportunistic load balancing, user-directed assignment, fast greedy, min-min, max-min, greedy, genetic algorithm, simulated annealing, genetic simulated annealing, tabu, and A*. This study provides one even basis for comparison and insights into circumstances where one technique will outperform another. The evaluation procedure is specified, the heuristics are defined, and then selected results are compared.
259 citations
••
14 Apr 1997TL;DR: A type system which guarantees that well-typed programs in a procedural programming language satisfy a noninterference security property, which basically states that a program output can never change as a result of modifying only inputs classified at higher levels.
Abstract: This paper presents a type system which guarantees that well-typed programs in a procedural programming language satisfy a noninterference security property. With all program inputs and outputs classified at various security levels, the property basically states that a program output, classified at some level, can never change as a result of modifying only inputs classified at higher levels. Intuitively, this means the program does not “leak” sensitive data. The property is similar to a notion introduced years ago by Goguen and Meseguer to model security in multi-level computer systems [7]. We also give an algorithm for inferring and simplifying principal types, which document the security requirements of programs.
258 citations
Authors
Showing all 5313 results
Name | H-index | Papers | Citations |
---|---|---|---|
Mingwei Chen | 108 | 536 | 51351 |
O. C. Zienkiewicz | 107 | 455 | 71204 |
Richard P. Bagozzi | 104 | 347 | 103667 |
Denise M. Rousseau | 84 | 218 | 50176 |
John Walsh | 81 | 756 | 25364 |
Ming C. Lin | 76 | 370 | 23466 |
Steven J. Ghan | 75 | 207 | 25650 |
Hui Zhang | 75 | 200 | 27206 |
Clare E. Collins | 71 | 560 | 21443 |
Christopher W. Fairall | 71 | 293 | 19756 |
Michael T. Montgomery | 68 | 258 | 14231 |
Tim Li | 67 | 383 | 16370 |
Thomas M. Antonsen | 65 | 888 | 17583 |
Nadia Magnenat-Thalmann | 65 | 521 | 14850 |
Johnny C. L. Chan | 61 | 261 | 14886 |